A deterministic tabu search algorithm for the fleet size and mix vehicle routing problem

被引:71
|
作者
Brandao, Jose [1 ,2 ]
机构
[1] Univ Minho, Dept Gestao, Escola Econ & Gestao, P-4704553 Braga, Portugal
[2] Univ Tecn Lisboa, ISEG, CEMAPRE, P-1100 Lisbon, Portugal
关键词
Tabu search; Heuristics; Vehicle routing; Heterogeneous fleet; Fleet mix; Logistics; TIME WINDOWS;
D O I
10.1016/j.ejor.2007.05.059
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
The fleet size and mix vehicle routing problem consists of defining the type, the number of vehicles of each type, as well as the order in which to serve the customers with each vehicle when a company has to distribute goods to a set of customers geographically spread, with the objective of minimizing the total costs. In this paper, a heuristic algorithm based on tabu search is proposed and tested on several benchmark instances. The computational results show that the proposed algorithm produces high quality results within a reasonable computing time. Some new best solutions are reported for a set of test problems used in the literature. (C) 2007 Elsevier B.V. All rights reserved.
引用
收藏
页码:716 / 728
页数:13
相关论文
共 50 条
  • [41] An effective multirestart deterministic annealing metaheuristic for the fleet size and mix vehicle-routing problem with time windows
    Braysy, Olli
    Dullaert, Wout
    Hasle, Geir
    Mester, David
    Gendreau, Michel
    [J]. TRANSPORTATION SCIENCE, 2008, 42 (03) : 371 - 386
  • [42] An improved tabu search algorithm for solving heterogeneous fixed fleet open vehicle routing problem with time windows
    Ahmed, Zakir Hussain
    Yousefikhoshbakht, Majid
    [J]. ALEXANDRIA ENGINEERING JOURNAL, 2023, 64 : 349 - 363
  • [43] Tabu search with ejection chains for the vehicle routing problem with private fleet and common carrier
    Potvin, J-Y
    Naud, M-A
    [J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2011, 62 (02) : 326 - 336
  • [44] Heuristic approaches for the fleet size and mix vehicle routing problem with time windows
    Dell'Amico, Mauro
    Monaci, Michele
    Pagani, Corrado
    Vigo, Daniele
    [J]. TRANSPORTATION SCIENCE, 2007, 41 (04) : 516 - 526
  • [45] New heuristics for the fleet size and mix vehicle routing problem with time windows
    Dullaert, W
    Janssens, GK
    Sörensen, K
    Vernimmen, B
    [J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2002, 53 (11) : 1232 - 1238
  • [46] A Hybrid Tabu Search Algorithm for the Variable Periodic Vehicle Routing Problem
    Liao, Ching-Jong
    Lee, Cheng-Hsiung
    Chen, Wan-Yin
    [J]. ARABIAN JOURNAL FOR SCIENCE AND ENGINEERING, 2017, 42 (02) : 513 - 535
  • [47] Tabu search algorithm for the discrete split delivery vehicle routing problem
    Qiu M.
    Fu Z.
    [J]. Harbin Gongcheng Daxue Xuebao/Journal of Harbin Engineering University, 2019, 40 (03): : 525 - 533
  • [48] Valid Inequalities for the Fleet Size and Mix Vehicle Routing Problem with Fixed Costs
    Baldacci, Roberto
    Battarra, Maria
    Vigo, Daniele
    [J]. NETWORKS, 2009, 54 (04) : 178 - 189
  • [49] Tabu search algorithm for vehicle routing problem with simultaneous deliveries and pickups
    College of Economics and Management, Southeast University, Nanjing 210096, China
    不详
    不详
    [J]. Xitong Gongcheng Lilum yu Shijian, 2007, 6 (117-123):
  • [50] Hybrid Tabu Search Algorithm for Vehicle Routing Problem with Time Window
    Chen Jiu-mei
    Zhang Xu-mei
    Qiu Han-guang
    [J]. 2008 4TH INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS, NETWORKING AND MOBILE COMPUTING, VOLS 1-31, 2008, : 6960 - +