BoneRoute: An adaptive memory-based method for effective fleet management

被引:88
作者
Tarantilis, CD [1 ]
Kiranoudis, CT [1 ]
机构
[1] Natl Tech Univ Athens, Dept Chem Engn, Sect Proc & Syst Anal Design & Dev 2, GR-15780 Athens, Greece
关键词
metaheuristics; distribution management; combinatorial optimization;
D O I
10.1023/A:1021157406318
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
This paper presents an adaptive memory-based method for solving the Capacitated Vehicle Routing Problem (CVRP), called BoneRoute. The CVRP deals with the problem of finding the optimal sequence of deliveries conducted by a fleet of homogeneous vehicles, based at one depot, to serve a set of customers. The computational performance of the BoneRoute was found to be very efficient, producing high quality solutions over two sets of well known case studies examined.
引用
收藏
页码:227 / 241
页数:15
相关论文
共 11 条
[1]  
Christofides N., 1979, Combinatorial optimization, P315
[2]   SCHEDULING OF VEHICLES FROM CENTRAL DEPOT TO NUMBER OF DELIVERY POINTS [J].
CLARKE, G ;
WRIGHT, JW .
OPERATIONS RESEARCH, 1964, 12 (04) :568-&
[3]   Using experimental design to find effective parameter settings for heuristics [J].
Coy, SP ;
Golden, BL ;
Runger, GC ;
Wasil, EA .
JOURNAL OF HEURISTICS, 2001, 7 (01) :77-97
[4]   A METHOD FOR SOLVING TRAVELING-SALESMAN PROBLEMS [J].
CROES, GA .
OPERATIONS RESEARCH, 1958, 6 (06) :791-812
[5]  
Golden BL, 1998, FLEET MANAGEMENT AND LOGISTICS, P33
[6]  
Laporte G., 2000, International Transactions in Operational Research, V7, P285, DOI 10.1111/j.1475-3995.2000.tb00200.x
[7]   THE SAVINGS ALGORITHM FOR THE VEHICLE-ROUTING PROBLEM [J].
PAESSENS, H .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1988, 34 (03) :336-344
[8]  
Rochat Y., 1995, Journal of Heuristics, V1, P147, DOI 10.1007/BF02430370
[9]  
TOTH P, 1998, IN PRESS INFORMS J C