A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem

被引：127
|
作者：
El Fallahi, Abdellah [1 ]
Prins, Christian [1 ]
Calvo, Roberto Wolfler [1 ]
机构：
[1] Univ Technol Troyes, FRE CNRS 2848, Inst Charles Delaunay, F-10010 Troyes, France
来源：
COMPUTERS & OPERATIONS RESEARCH | 2008年 / 35卷 / 05期
关键词：
vehicle routing problem; memetic algorithm; path relinking; tabu search;
D O I：
10.1016/j.cor.2006.10.006
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
A generalization of the traditional vehicle routing problem (VRP) is studied in this paper. Each customer may order several products, the vehicles are identical and have several compartments, each compartment being dedicated to one product. The demand of each customer for a product must be entirely delivered by one single vehicle. However, the different products required by a customer may be brought by several vehicles. Two algorithms to solve this problem are proposed: a memetic algorithm with a post-optimization phase based on path relinking, and a tabu search method. These algorithms are evaluated by adding compartments to classical VRP instances. (c) 2006 Elsevier Ltd. All rights reserved.
引用
收藏
页码：1725 / 1741
页数：17
相关论文
共 50 条
  • [1] An iterated tabu search for the multi-compartment vehicle routing problem
    Silvestrin, Paulo Vitor
    Ritt, Marcus
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2017, 81 : 192 - 202
  • [2] A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands
    Mendoza, Jorge E.
    Castanier, Bruno
    Gueret, Christelle
    Medaglia, Andres L.
    Velasco, Nubia
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2010, 37 (11) : 1886 - 1898
  • [3] A hybrid iterated local search algorithm for the multi-compartment vehicle routing problem
    Hou, Yan-e
    Wang, Chunxiao
    Wang, Congran
    Fan, Gaojuan
    [J]. JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 2023, 45 (01) : 257 - 268
  • [4] Improved variable neighborhood search algorithm for multi-compartment vehicle routing problem
    Yao, Guanxinu
    Fan, Xueru
    Zhang, Dongmei
    [J]. Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS, 2022, 28 (09): : 2981 - 2997
  • [5] An ant colony algorithm for the multi-compartment vehicle routing problem
    Reed, Martin
    Yiannakou, Aliki
    Evering, Roxanne
    [J]. APPLIED SOFT COMPUTING, 2014, 15 : 169 - 176
  • [6] Vehicle selection for a multi-compartment vehicle routing problem
    Ostermeier, Manuel
    Huebner, Alexander
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2018, 269 (02) : 682 - 694
  • [7] Evolutionary Local Search Algorithm to Solve the Multi-Compartment Vehicle Routing Problem with Time Windows
    Melechovsky, Jan
    [J]. PROCEEDINGS OF 30TH INTERNATIONAL CONFERENCE MATHEMATICAL METHODS IN ECONOMICS, PTS I AND II, 2012, : 564 - 568
  • [8] The multi-compartment vehicle routing problem with flexible compartment sizes
    Henke, Tino
    Speranza, M. Grazia
    Waescher, Gerhard
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2015, 246 (03) : 730 - 743
  • [9] A tabu search algorithm for the vehicle routing problem
    Barbarosoglu, G
    Ozgur, D
    [J]. COMPUTERS & OPERATIONS RESEARCH, 1999, 26 (03) : 255 - 270
  • [10] Loading constraints for a multi-compartment vehicle routing problem
    Manuel Ostermeier
    Sara Martins
    Pedro Amorim
    Alexander Hübner
    [J]. OR Spectrum, 2018, 40 : 997 - 1027
12345