POPMUSIC for a real-world large-scale vehicle routing problem with time windows

被引：23

作者：

Ostertag, A.

Doerner, K. F. ^{[1
]}

Hartl, R. F.

Taillard, E. D. ^{[2
]}

Waelti, P. ^{[2
]}

机构：

[1] Univ Vienna, Dept Business Adm, A-1210 Vienna, Austria

[2] Univ Appl Sci, Yverdon, Switzerland

来源：

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY | 2009年 / 60卷 / 07期

基金：

奥地利科学基金会;

关键词：

vehicle routing; heuristics; problem decomposition; VARIABLE NEIGHBORHOOD SEARCH; GUIDED EVOLUTION STRATEGIES; ALGORITHM;

D O I：

10.1057/palgrave.jors.2602633

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

This paper presents a heuristic approach based on the POPMUSIC framework for a large-scale Multi Depot Vehicle Routing Problem with Time Windows derived from real-world data. POPMUSIC is a very powerful tool for tackling large problem instances. A Memetic Algorithm is used as an optimizer in the POPMUSIC framework. It is shown that a population-based search combined with decomposition strategies is a very efficient and flexible tool to tackle real-world problems with regards to solution quality as well as runtime. Journal of the Operational Research Society ( 2009) 60, 934-943. doi:10.1057/palgrave.jors.2602633

引用

页码：934 / 943

页数：10

共 27 条

[11] A two-phase hybrid metaheuristic for the vehicle routing problem with time windows
Homberger, J
Gehring, H
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2005, 162 (01) : 220 - 238
[12] An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
Kytojoki, Jari
Nuortio, Teemu
Braysy, Olli
Gendreau, Michel
[J]. COMPUTERS & OPERATIONS RESEARCH, 2007, 34 (09) : 2743 - 2757
[13] Active guided evolution strategies for large-scale vehicle routing problems with time windows
Mester, D
Bräysy, O
[J]. COMPUTERS & OPERATIONS RESEARCH, 2005, 32 (06) : 1593 - 1614
[14] Active-guided evolution strategies for large-scale capacitated vehicle routing problems
Mester, David
Braysy, Olli
[J]. COMPUTERS & OPERATIONS RESEARCH, 2007, 34 (10) : 2964 - 2975
[15] A variable neighborhood search for the multi depot vehicle routing problem with time windows
Polacek, M
Hartl, RF
Doerner, K
[J]. JOURNAL OF HEURISTICS, 2004, 10 (06) : 613 - 627
[16] A simple and effective evolutionary algorithm for the vehicle routing problem
Prins, C
[J]. COMPUTERS & OPERATIONS RESEARCH, 2004, 31 (12) : 1985 - 2002
[17] REEVES C, 2003, HDB METAHEURISTICS, P55, DOI DOI 10.1007/B101874
[18] D-Ants: Savings Based Ants divide and conquer the vehicle routing problem
Reimann, M
Doerner, K
Hartl, RF
[J]. COMPUTERS & OPERATIONS RESEARCH, 2004, 31 (04) : 563 - 591
[19] A multi-level composite heuristic for the multi-depot vehicle fleet mix problem
Salhi, S
Sari, M
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1997, 103 (01) : 95 - 112
[20] SEMET F, 1994, J OPL RES SOC, V45, P1233

← 1 2 3 →