Heuristic methods for the fleet size and mix vehicle routing problem with time windows and split deliveries

被引:30
|
作者
Belfiore, Patricia [1 ]
Yoshizaki, Hugo T. Y. [2 ]
机构
[1] Fed Univ ABC, Dept Engn Management, Sao Paulo, Brazil
[2] Univ Sao Paulo, Dept Prod Engn, Sao Paulo, Brazil
关键词
Heuristics; Scatter search; Vehicle routing and scheduling; GRID NETWORK DISTANCES; TABU SEARCH ALGORITHM; SCATTER SEARCH; SCHEDULING PROBLEMS;
D O I
10.1016/j.cie.2012.11.007
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
This paper proposes a scatter-search (SS) approach to solve the Fleet Size and Mixed Vehicle Routing Problem with Time Windows and Split Deliveries (FSMVRPTWSD). In the Vehicle Routing Problem with Split Deliveries (VRPSD), each customer can be served by more than one vehicle, as opposed to the classical VRP in which each customer is served only once. In the FSMVRPTW, the customers must be serviced within their time windows with minimal costs using a heterogeneous fleet. Experimental testing and benchmark examples are used to assess the merit of our proposed procedure. The results show that the proposed heuristics are competitive with the best results found in the literature. (c) 2012 Elsevier Ltd. All rights reserved.
引用
收藏
页码:589 / 601
页数:13
相关论文
共 50 条
  • [31] Heuristic algorithm to solve vehicle routing problem with split pickups and deliveries
    Yang, Ya-Zao
    Jin, Wen-Zhou
    Hao, Xiao-Ni
    Tian, Sheng
    [J]. Huanan Ligong Daxue Xuebao/Journal of South China University of Technology (Natural Science), 2010, 38 (03): : 58 - 63
  • [32] Vehicle routing problem with a heterogeneous fleet and time windows
    Jiang, Jun
    Ng, Kien Ming
    Poh, Kim Leng
    Teo, Kwong Meng
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2014, 41 (08) : 3748 - 3760
  • [33] The fleet size and mix vehicle routing problem with synchronized visits
    Masmoudi, Mohamed Amine
    Hosny, Manar
    Koc, Cagri
    [J]. TRANSPORTATION LETTERS-THE INTERNATIONAL JOURNAL OF TRANSPORTATION RESEARCH, 2022, 14 (04): : 427 - 445
  • [34] Partial linear recharging strategy for the electric fleet size and mix vehicle routing problem with time windows and recharging stations
    Wang, Weiquan
    Zhao, Jingyi
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2023, 308 (02) : 929 - 948
  • [35] A Hybrid Algorithm for the Fleet Size and Mix Vehicle Routing Problem
    Subramanian, Anand
    Vaz Penna, Puca Huachi
    Uchoa, Eduardo
    Ochi, Luiz Satoru
    [J]. PROCEEDINGS OF INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND SYSTEMS MANAGEMENT (IESM'2011): INNOVATIVE APPROACHES AND TECHNOLOGIES FOR NETWORKED MANUFACTURING ENTERPRISES MANAGEMENT, 2011, : 1214 - 1223
  • [36] Testing local search move operators on the vehicle routing problem with split deliveries and time windows
    McNabb, Marcus E.
    Weir, Jeffery D.
    Hill, Raymond R.
    Hall, Shane N.
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2015, 56 : 93 - 109
  • [37] An iterative biased-randomized heuristic for the fleet size and mix vehicle-routing problem with backhauls
    Belloso, Javier
    Juan, Angel A.
    Faulin, Javier
    [J]. INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2019, 26 (01) : 289 - 301
  • [38] A Novel Constructive Routing Algorithm for Fleet Size and Mix Vehicle Routing Problem
    Karagul, Kenan
    [J]. INTERNATIONAL JOURNAL OF COMBINATORIAL OPTIMIZATION PROBLEMS AND INFORMATICS, 2014, 5 (02): : 58 - 73
  • [39] Overview of a heuristic for vehicle routing problem with time windows
    Fuh-hwa, Franklin Liu
    Shen, Sheng-yuan
    [J]. Computers and Industrial Engineering, 1999, 37 (01): : 331 - 334
  • [40] An overview of a heuristic for vehicle routing problem with time windows
    Liu, FHF
    Shen, SY
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 1999, 37 (1-2) : 331 - 334