Multi-objective vehicle routing problems

被引:294
作者
Jozefowiez, Nicolas [1 ,2 ]
Semet, Frederic [1 ]
Talbi, El-Ghazali [2 ]
机构
[1] Univ Valenciennes & Hainaut Cambresis, Lab Automat Mecan & Informat Ind & Humaines, Valenciennes, France
[2] Univ Sci & Technol Lille, Lab Informat Fondamentale Lille, Villeneuve Dascq, France
关键词
combinatorial optimization; routing; multi-objective programming;
D O I
10.1016/j.ejor.2007.05.055
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
Routing problems, such as the traveling salesman problem and the vehicle routing problem, are widely studied both because of their classic academic appeal and their numerous real-life applications. Similarly, the field of multi-objective optimization is attracting more and more attention, notably because it offers new opportunities for defining problems. This article surveys the existing research related to multi-objective optimization in routing problems. It examines routing problems in terms of their definitions, their objectives, and the multi-objective algorithms proposed for solving them. (C) 2007 Elsevier B.V. All rights reserved.
引用
收藏
页码:293 / 309
页数:17
相关论文
共 70 条
  • [1] Approximating the Pareto curve with local search for the bicriteria TSP(1,2) problem
    Angel, E
    Bampis, E
    Gourvés, L
    [J]. THEORETICAL COMPUTER SCIENCE, 2004, 310 (1-3) : 135 - 146
  • [2] [Anonymous], 2002, COMB OPT (SER)
  • [3] [Anonymous], J MULTICRITERIA DECI, DOI DOI 10.1002/(SICI)1099-1360(199907)8:4{
  • [4] New approximation guarantees for minimum-weight k-trees and prize-collecting salesmen
    Awerbuch, B
    Azar, Y
    Blum, A
    Vempala, S
    [J]. SIAM JOURNAL ON COMPUTING, 1998, 28 (01) : 254 - 262
  • [5] THE PRIZE COLLECTING TRAVELING SALESMAN PROBLEM
    BALAS, E
    [J]. NETWORKS, 1989, 19 (06) : 621 - 636
  • [6] Baran B, 2003, Proceedings of 21st IASTED International Conference on Applied Informatics, P97
  • [7] Boffey B, 1995, TOP, V3, P167, DOI [10.1007/BF02568585, DOI 10.1007/BF02568585]
  • [8] BORGES PC, 2002, STUDY GLOBAL CONVEXI, P129
  • [9] Bowerman R., 1995, TRANSPORT RES A-POL, V29, P123
  • [10] CHAO IM, 2002, COMPUTERS OPERATIONS, V29, P22