The fixed charge transportation problem (FCTP) is a deployment of the classical transportation problem in which a fixed cost is incurred, independent of the amount transported, along with a variable cost that is proportional to the amount shipped. Since the problem is considered as an NP-hard, the computational time grows exponentially as the size of the problem increases. In this pape...

Like most multiobjective combinatorial optimization problems, biobjective problems on matroids are in general intractable and their corresponding decision NP-hard. In this paper, we consider where one of the objective functions is restricted to binary cost coefficients. We show that case problem has a connected efficient set with respect natural definition neighborhood structure hence, can be s...

Fixed charge solid transportation problem (FCSTP) is one of the main and most important problems in transportation and network research areas. To tackle such an NP-hard problem, An Electromagnetism-like algorithm (EM) is employed. To the best of our knowledge, EM has been considered for any kind of transportation problems. Due to the significant role of parameters on the algorithm’s performance...

In this paper, a green transportation location problem is considered with uncertain demand parameter. Increasing robustness influences the number of trucks for sending goods and products, caused consequently, increase the air pollution. In this paper, two green approaches are introduced which demand is the main uncertain parameter in both. These approaches are addressed to provide a trade-off b...

For the multiple automated guided vehicle (multi-AGV) routing problems in warehousing link of logistics, where optimization objective is to minimize both number AGVs used and maximum pickup time simultaneously, a nondominant sorting differential evolution (NSDE) algorithm proposed. In encoding decoding stages, point area divided. are allocated each region according proposed rule based on avoidi...

A novel method is proposed for solving the two-sided matching problem under incomplete score environment. The two-sided matching problem with incomplete scores is firstly described. Then the formula of satisfaction degree is given. To maximize the satisfaction degree of each agent, a multi-objective optimization model is set up. Considering equal priority of each agent of one side, the multi-ob...

The design of a supply chain network (SCN) should address two conflicting objectives, i.e. inexpensive yet reliable operation. This paper presents models to choose facilities and determine distribution options while considering the expected risk not serving customers attributed shortages. goal is with lower cost under traditional objectives. We formulate stochastic mixed-integer biobjective pro...

This paper presents a K-means clustering technique that satisfies the biobjective function to minimize the information loss and maintain k-anonymity. The proposed technique starts with one cluster and subsequently partitions the dataset into two or more clusters such that the total information loss across all clusters is the least, while satisfying the k-anonymity requirement. The structure of ...