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

被引:27
作者
Wang, Jiahai [1 ,2 ,3 ]
Yuan, Liangsheng [1 ]
Zhang, Zizhen [1 ]
Gao, Shangce [4 ]
Sun, Yuyan [1 ]
Zhou, Yalan [5 ]
机构
[1] Sun Yat Sen Univ, Dept Comp Sci, Guangzhou 510275, Peoples R China
[2] Sun Yat Sen Univ, Key Lab Machine Intelligence & Adv Comp, Minist Educ, Guangzhou 510275, Peoples R China
[3] Sun Yat Sen Univ, Guangdong Key Lab Big Data Anal & Proc, Guangzhou 510275, Peoples R China
[4] Univ Toyama, Fac Engn, Toyama 9308555, Japan
[5] Guangdong Univ Finance & Econ, Coll Informat, Guangzhou 510320, Peoples R China
来源
IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS | 2021年 / 51卷 / 04期
基金
中国国家自然科学基金;
关键词
Search problems; Delays; Benchmark testing; Manganese; Optimization; Microsoft Windows; Time factors; Heterogeneous fleet; location-routing problem (LRP) with time windows; multiobjective optimization; multiple neighborhood search (MNS); DATA MINING METHODS; EVOLUTIONARY ALGORITHM; KNOWLEDGE DISCOVERY; OPTIMIZATION PART; LOCAL SEARCH; DECOMPOSITION; SELECTION;
D O I
10.1109/TSMC.2019.2912194
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页码:2284 / 2298
页数:15
相关论文
共 72 条
[1]   KEEL: a software tool to assess evolutionary algorithms for data mining problems [J].
Alcala-Fdez, J. ;
Sanchez, L. ;
Garcia, S. ;
del Jesus, M. J. ;
Ventura, S. ;
Garrell, J. M. ;
Otero, J. ;
Romero, C. ;
Bacardit, J. ;
Rivas, V. M. ;
Fernandez, J. C. ;
Herrera, F. .
SOFT COMPUTING, 2009, 13 (03) :307-318
[2]   HypE: An Algorithm for Fast Hypervolume-Based Many-Objective Optimization [J].
Bader, Johannes ;
Zitzler, Eckart .
EVOLUTIONARY COMPUTATION, 2011, 19 (01) :45-76
[3]   Data mining methods for knowledge discovery in multi-objective optimization: Part B - New developments and applications [J].
Bandaru, Sunith ;
Ng, Amos H. C. ;
Deb, Kalyanmoy .
EXPERT SYSTEMS WITH APPLICATIONS, 2017, 70 :119-138
[4]   Data mining methods for knowledge discovery in multi-objective optimization: Part A - Survey [J].
Bandaru, Sunith ;
Ng, Amos H. C. ;
Deb, Kalyanmoy .
EXPERT SYSTEMS WITH APPLICATIONS, 2017, 70 :139-159
[5]   The efficiency of indicator-based local search for multi-objective combinatorial optimisation problems [J].
Basseur, M. ;
Liefooghe, A. ;
Le, K. ;
Burke, E. K. .
JOURNAL OF HEURISTICS, 2012, 18 (02) :263-296
[6]   SMS-EMOA: Multiobjective selection based on dominated hypervolume [J].
Beume, Nicola ;
Naujoks, Boris ;
Emmerich, Michael .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 181 (03) :1653-1669
[7]   Survey and unification of local search techniques in metaheuristics for multi-objective combinatorial optimisation [J].
Blot, Aymeric ;
Kessaci, Marie-Eleonore ;
Jourdan, Laetitia .
JOURNAL OF HEURISTICS, 2018, 24 (06) :853-877
[8]   The balance between proximity and diversity in multiobjective evolutionary algorithms [J].
Bosman, PAN ;
Thierens, D .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2003, 7 (02) :174-188
[9]   Vehicle routing problem with time windows, part 1:: Route construction and local search algorithms [J].
Bräysy, I ;
Gendreau, M .
TRANSPORTATION SCIENCE, 2005, 39 (01) :104-118
[10]   The influence of the fitness evaluation method on the performance of multiobjective search algorithms [J].
Burke, EK ;
Silva, JDL .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2006, 169 (03) :875-897