.png){kind=icon}
Return
Multi-objective shipment consolidation and dispatching problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2024.106728.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Shipment consolidation
Augmented epsilon-constraint method
Variable neighborhood search
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W
Organization
Cited Papers
.png){kind=icon}
ShareSave
ShareSaveShareSaveFlexible and Efficient Instruction-Grained Run-Time Monitoring Using On-Chip Reconfigurable Fabric
PREAI
ShareSaveFuzzy multi-objective linear programming approach for optimising a closed-loop supply chain network
PREAI
ShareSave
View more