A CONSTRAINT PROGRAMMING HEURISTIC FOR A HETEROGENEOUS VEHICLE ROUTING PROBLEM WITH SPLIT DELIVERIES

被引：8
|
作者：
Ozfirat, Pinar Mizrak [1 ]
Ozkarahan, Irem [2 ]
机构：
[1] Celal Bayar Univ, Dept Ind Engn, TR-45140 Muradiye, Manisa, Turkey
[2] Troy Univ, Montgomery, AL USA
来源：
APPLIED ARTIFICIAL INTELLIGENCE | 2010年 / 24卷 / 04期
关键词：
FLEET SIZE; TIME WINDOWS; ALGORITHM;
D O I：
10.1080/08839511003715196
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
This article considers fresh goods distribution of a retail chain store in Turkey. The problem is formulated as a vehicle routing problem with a heterogeneous fleet for which no exact algorithm has ever been designed to solve it. A fast and effective algorithm based on constraint programming is proposed for the solution. The procedure is tested on some of the benchmark problems in literature. The real-life case is first solved assuming that delivery of a customer cannot be split between vehicles. Then it is resolved considering split deliveries. Solutions of both strategies are compared with the current performance of the firm to determine a distribution strategy. Results indicate considerable improvement in the performance of the firm.
引用
收藏
页码：277 / 294
页数：18
相关论文
共 50 条
  • [1] A tabu search heuristic for the vehicle routing problem with time windows and split deliveries
    Ho, SC
    Haugland, D
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2004, 31 (12) : 1947 - 1964
  • [2] Heuristic approaches for a vehicle routing problem with an incompatible loading constraint and splitting deliveries by order
    Guo, Fang
    Huang, Zhihong
    Huang, Weilai
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2021, 134
  • [3] A two-stage heuristic method for vehicle routing problem with split deliveries and pickups
    Wang, Yong
    Ma, Xiao-lei
    Lao, Yun-teng
    Yu, Hai-yan
    Liu, Yong
    [J]. JOURNAL OF ZHEJIANG UNIVERSITY-SCIENCE C-COMPUTERS & ELECTRONICS, 2014, 15 (03): : 200 - 210
  • [4] A two-stage heuristic method for vehicle routing problem with split deliveries and pickups
    Yong WANG
    Xiao-lei MA
    Yun-teng LAO
    Hai-yan YU
    Yong LIU
    [J]. Frontiers of Information Technology & Electronic Engineering, 2014, (03) : 200 - 210
  • [5] A two-stage heuristic method for vehicle routing problem with split deliveries and pickups
    Yong WANG
    Xiaolei MA
    Yunteng LAO
    Haiyan YU
    Yong LIU
    [J]. JournalofZhejiangUniversity-ScienceC(Computers&Electronics)., 2014, 15 (03) - 210
  • [6] A two-stage heuristic method for vehicle routing problem with split deliveries and pickups
    Yong Wang
    Xiao-lei Ma
    Yun-teng Lao
    Hai-yan Yu
    Yong Liu
    [J]. Journal of Zhejiang University SCIENCE C, 2014, 15 : 200 - 210
  • [7] The Vehicle Routing Problem with Stochastic Demands and Split Deliveries
    Lei, Hongtao
    Laporte, Gilbert
    Guo, Bo
    [J]. INFOR, 2012, 50 (02) : 59 - 71
  • [8] Heuristic methods for the fleet size and mix vehicle routing problem with time windows and split deliveries
    Belfiore, Patricia
    Yoshizaki, Hugo T. Y.
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2013, 64 (02) : 589 - 601
  • [9] A heuristic method for the vehicle routing problem with mixed deliveries and pickups
    Niaz A. Wassan
    Gábor Nagy
    Samad Ahmadi
    [J]. Journal of Scheduling, 2008, 11 : 149 - 161
  • [10] A heuristic method for the vehicle routing problem with mixed deliveries and pickups
    Wassan, Niaz A.
    Nagy, Gabor
    Ahmadi, Samad
    [J]. JOURNAL OF SCHEDULING, 2008, 11 (02) : 149 - 161
12345