A simple and effective evolutionary algorithm for the capacitated location-routing problem

被引：69

作者：

Lopes, Rui Borges ^{[1
]}

Ferreira, Carlos ^{[2
]}

Santos, Beatriz Sousa ^{[3
]}

机构：

[1] Univ Aveiro, Dept Econ Management & Ind Engn, CIDMA, Campus Univ Santiago, P-3810193 Aveiro, Portugal

[2] Univ Aveiro, Dept Econ Management & Ind Engn, IEETA, Campus Univ Santiago, P-3810193 Aveiro, Portugal

[3] Univ Aveiro, Dept Elect Telecommun & Informat, IEETA, Campus Univ Santiago, P-3810193 Aveiro, Portugal

来源：

COMPUTERS & OPERATIONS RESEARCH | 2016年 / 70卷

关键词：

Location; Location-routing; Genetic algorithm; GRANULAR TABU SEARCH; NEIGHBORHOOD SEARCH;

D O I：

10.1016/j.cor.2016.01.006

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

This paper proposes a hybrid genetic algorithm (GA) to solve the capacitated location-routing problem. The proposed algorithm follows the standard GA framework using local search procedures in the mutation phase. Computational evaluation was carried out on three sets of benchmark instances from the literature. Results show that, although relatively simple, the proposed algorithm is effective, providing competitive results for benchmark instances within reasonable computing time. (C) 2016 Elsevier Ltd. All rights reserved.

引用

页码：155 / 162

页数：8

共 32 条

[1] An Exact Method for the Capacitated Location-Routing Problem
Baldacci, Roberto
Mingozzi, Aristide
Calvo, Roberto Wolfler
[J]. OPERATIONS RESEARCH, 2011, 59 (05) : 1284 - 1296
[2] Using clustering analysis location-routing in a capacitated problem
Barreto, Sergio
Ferreira, Carlos
Paixao, Jose
Sousa Santos, Beatriz
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 179 (03) : 968 - 977
[3] A Branch-and-Cut method for the Capacitated Location-Routing Problem
Belenguer, Jose-Manuel
Benavent, Enrique
Prins, Christian
Prodhon, Caroline
Calvo, Roberto Wolfler
[J]. COMPUTERS & OPERATIONS RESEARCH, 2011, 38 (06) : 931 - 941
[4] THE HAMILTONIAN RHO-MEDIAN PROBLEM
BRANCO, IM
COELHO, JD
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1990, 47 (01) : 86 - 95
[5] An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem
Contardo, Claudio
Cordeau, Jean-Francois
Gendron, Bernard
[J]. INFORMS JOURNAL ON COMPUTING, 2014, 26 (01) : 88 - 102
[6] A GRASP + ILP-based metaheuristic for the capacitated location-routing problem
Contardo, Claudio
Cordeau, Jean-Francois
Gendron, Bernard
[J]. JOURNAL OF HEURISTICS, 2014, 20 (01) : 1 - 38
[7] A computational comparison of flow formulations for the capacitated location-routing problem
Contardo, Claudio
Cordeau, Jean-Francois
Gendron, Bernard
[J]. DISCRETE OPTIMIZATION, 2013, 10 (04) : 263 - 295
[8] A survey of variants and extensions of the location-routing problem
Drexl, Michael
Schneider, Michael
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2015, 241 (02) : 283 - 308
[9] A GRASPxELS approach for the capacitated location-routing problem
Duhamel, Christophe
Lacomme, Philippe
Prins, Christian
Prodhon, Caroline
[J]. COMPUTERS & OPERATIONS RESEARCH, 2010, 37 (11) : 1912 - 1923
[10] A Granular Variable Tabu Neighborhood Search for the capacitated location-routing problem
Escobar, John Willmer
Linfati, Rodrigo
Baldoquin, Maria G.
Toth, Paolo
[J]. TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2014, 67 : 344 - 356

← 1 2 3 4 →