A differential evolution algorithm for pickups and deliveries problem with fuzzy time windows

被引:5
作者
Chen, Dong [1 ,2 ]
Cao, Erbao [1 ,2 ]
Lai, Wentian [3 ]
机构
[1] Hunan Univ, Coll Econ & Trade, Changsha 410082, Hunan, Peoples R China
[2] Hunan Prov Key Lab Logist Informat & Simulat Tech, Changsha, Hunan, Peoples R China
[3] Yali High Sch Changsha City, Changsha, Hunan, Peoples R China
基金
中国国家自然科学基金;
关键词
Differential evolution algorithm; vehicle routing problem; pickups and deliveries; fuzzy; time window; VEHICLE-ROUTING PROBLEM;
D O I
10.3233/IFS-151752
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper, a pickups and deliveries problem with fuzzy time windows (PDPFTW) is presented and solved. The customer service level associated with time window is characterized by fuzzy membership functions based on fuzzy set theory. A novel multi-objective fuzzy programming model of PDPFTW is proposed. The proposed model aims at minimizing the vehicle numbers and the overall travel costs and maximizing the total customer service level. A novel differential evolution algorithm (DE) for PDPFTW is also proposed. In DE, we first adopted the novel decimal coding to construct an initial population, and then used some improved differential evolution operators unlike existing algorithm, in mutation operation, we used an integer order criterion based on natural number coding method and introduced a penalty technical to publish the infeasible solution. In addition, in the crossover operation, we designed a self-adapting crossover probability that varied with iteration. Our experimental results demonstrate the efficiency of the proposed DE, which saved some running time compare with GA in 100,200,400 and 1000 cases. At the same time, DE can get better solutions compare with GA in total distance of vehicles, total services level of customers and vehicle numbers. Moreover, we found that total service level would increase with wider time window.
引用
收藏
页码:267 / 277
页数:11
相关论文
共 19 条
[1]  
[Anonymous], 2001, EUR J OPER RES, V131, P559
[2]   Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints [J].
Baldacci, Roberto ;
Mingozzi, Aristide ;
Roberti, Roberto .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2012, 218 (01) :1-6
[3]   A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows [J].
Bent, R ;
Van Hentenryck, P .
COMPUTERS & OPERATIONS RESEARCH, 2006, 33 (04) :875-893
[4]  
De Maio Maria Luisa, 2014, J INTELL FUZZY SYST, P1064
[5]   A branch-and-price algorithm for the Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows [J].
Gutierrez-Jarpa, Gabriel ;
Desaulniers, Guy ;
Laporte, Gilbert ;
Marianov, Vladimir .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 206 (02) :341-349
[6]   Constructing initial solutions for the multiple vehicle pickup and delivery problem with time windows [J].
Hosny, Manar I. ;
Mumford, Christine L. .
JOURNAL OF KING SAUD UNIVERSITY-COMPUTER AND INFORMATION SCIENCES, 2012, 24 (01) :59-69
[7]  
Kilic S, 2014, J MULT-VALUED LOG S, V22, P443
[8]   An improved differential evolution algorithm for vehicle routing problem with simultaneous pickups and deliveries and time windows [J].
Lai Mingyong ;
Cao Erbao .
ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2010, 23 (02) :188-195
[9]  
Lampinen J., 1999, NEW IDEAS OPTIMIZATI, P127
[10]   A metaheuristic for the pickup and delivery problem with time windows [J].
Li, HB ;
Lim, A .
ICTAI 2001: 13TH IEEE INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2001, :160-167