返回
Multi-objective shipment consolidation and dispatching problem
DOI:10.1016/j.cor.2024.106728.png)
摘要
En 中文
In recent years, with the increase in global production and demand, transportation problems have become a widely studied area, and studies focus on providing high -quality service at the lowest cost. This study considers a bi-objective shipment consolidation and dispatching problem with the objectives of minimizing the total cost and the total distance. To the best of our knowledge, this is the first study to include both objectives in this problem. Additionally, different from the literature, where usually predefined routes are assumed, we incorporate the routing decisions in our model. In order to create a non -dominated solution set, a multi -objective mixed integer linear programming model is developed and augmented epsilon-constraint method is used to generate the non -dominated frontier. However, this approach is not capable of finding the non -dominated solution set in a reasonable time, even for small -sized instances, and therefore, we propose a multi -objective variable neighborhood search heuristic. To measure the performance of the proposed approach, a computational experiment is conducted on randomly generated instances available in the literature. The experimental results indicate that the multi -objective variable neighborhood search heuristic performs efficiently in reasonable time.
Keyword:
Shipment consolidation
Augmented epsilon-constraint method
Variable neighborhood search
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
Fuzzy multi-objective linear programming approach for optimising a closed-loop supply chain network闭环供应链网络优化的模糊多目标线性规划方法
Induction and elimination of bulky benzo[a]pyrene-related DNA adducts and 8-oxodGuo in mussels Mytilus galloprovincialis exposed in vivo to B[a]P-contaminated feed体内暴露于B[a]P污染的饲料中的贻贝Mytilus galloprovincialis中庞大的苯并 [a] re相关DNA加合物和8-氧代果的诱导和消除

