Multiobjective Multiple Neighborhood Search Algorithms for Multiobjective Fleet Size and Mix Location-Routing Problem With Time Windows

Jiahai Wang, Liangsheng Yuan, Zizhen Zhang, Shangce Gao, Yuyan Sun, Yalan ZhouIEEE Trans. SMC: Systems 2021 · OpenReview

Abstract

This paper introduces a multiobjective fleet size and mix location-routing problem with time windows and designs a set of real-world benchmark instances. Then, two versions of multiobjective multiple neighborhood search algorithms based on decomposition and vector angle are developed for solving the problem. In the proposed algorithms, three different kinds of neighborhood search operators, including general local search, objective-specific local search, and large neighborhood search, are carefully designed and combined in a synergistic manner. The experimental results show the effectiveness of the proposed algorithms. Relationships between different objectives in this multiobjective problem are also discussed.
BibTeX
@article{wang2021multiobjective,
  author = {Jiahai Wang and Liangsheng Yuan and Zizhen Zhang and Shangce Gao and Yuyan Sun and Yalan Zhou},
  title = {{Multiobjective Multiple Neighborhood Search Algorithms for Multiobjective Fleet Size and Mix Location-Routing Problem With Time Windows}},
  journal = {IEEE Trans. Syst. Man Cybern. Syst.},
  year = {2021},
  url = {https://openreview.net/forum?id=WDFvlLDWF4T},
}

Loading related content...

Figure