Skip to main content
SpringerLink
Log in

Scatter search for the fleet size and mix vehicle routing problem with time windows

  • Original Paper
  • Published:
Central European Journal of Operations Research Aims and scope Submit manuscript

Abstract

This work proposes a scatter search (SS) approach to solve the fleet size and mix vehicle routing problem with time windows (FSMVRPTW). In the FSMVRPTW the customers need to be serviced in their time windows at minimal costs by a heterogeneous fleet. Computational results on 168 benchmark problems are reported. Computational testing revealed that our algorithm presented better results compared to other methods published in the literature.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Brandão J and Mercer A (1997). A tabu search algorithm for the multi-trip vehicle routing and scheduling problem. Eur J Oper Res 100(1): 180–191

    Article  Google Scholar 

  • Clarke G and Wright JW (1964). Scheduling of vehicles from a central depot to a number of delivery points. Oper Res 12(4): 568–581

    Google Scholar 

  • Corberán A, Fernández E, Laguna M and Martí R (2002). Heuristic solutions to the problem of routing school buses with multiple objectives. J Oper Res Soc 53(4): 427–435

    Article  Google Scholar 

  • Desrochers M and Verhoog TW (1991). A new heuristic for the fleet size and mix vehicle routing problem. Comput Oper Res 18(3): 263–274

    Article  Google Scholar 

  • Dullaert W, Janssens GK, Sorensen K and Vernimmen B (2002). New heuristics for the fleet size and mix vehicle routing problem with time windows. J Oper Res Soc 53: 1232–1238

    Article  Google Scholar 

  • Gendreau M, Laporte G, Musaraganyi C and Taillard ED (1999). A tabu search heuristic for the heterogeneous fleet vehicle routing problem. Comput Oper Res 26(12): 1153–1173

    Article  Google Scholar 

  • Gheysens F, Golden B and Assad A (1984). A comparison of techniques for solving the fleet size and mix vehicle routing problem. Oper Res Spektrum 6(4): 207–216

    Article  Google Scholar 

  • Gheysens F, Golden B and Assad A (1986). A new heuristic for determining fleet size and composition. Math Program Study 26: 233–236

    Google Scholar 

  • Glover F (1977). Heuristics for integer programming using surrogate constraints. Decision Sci 8(1): 156–166

    Article  Google Scholar 

  • Glover F (1998). A Template for scatter search and path relinking. In: Hao, J-K, Lutton, E, Ronald, E, Schoenauer, M and Snyers, D (eds) Artificial evolution, lecture notes in computer science, vol 1363, pp 13–54. Springer, Heidelberg

    Google Scholar 

  • Golden BL, Assad A, Levy L and Gheysens F (1984). The fleet size and mix vehicle routing problem. Comput Oper Res 11(1): 49–65

    Article  Google Scholar 

  • Lenstra JK and Rinnooy Kan AHG (1981). Complexity of vehicle and scheduling problems. Networks 11(2): 221–227

    Article  Google Scholar 

  • Liu FH and Shen SY (1999). The fleet size and mix vehicle routing problem with time windows. J Oper Res Soc 50(7): 721–732

    Article  Google Scholar 

  • Rego C and Leão P (2000). A scatter search tutorial for graph-based permutation problems. In: HearinCenter for, Enterprise, University of, Mississippi, USA. Rego, C and Alidaee, B (eds) Metaheuristic optimization via memory and evolution: Tabu search and scatter search, pp 1–24. Kluwer, Dordrecht

    Google Scholar 

  • Rochat Y and Semet F (1994). A tabu search approach for delivering pet food and flour in Switzerland. J Oper Res Soc 45(11): 1233–1246

    Article  Google Scholar 

  • Rochat Y and Taillard ED (1995). Probabilistic diversification and intensification in local search for vehicle routing. J Heuristics 1(1): 147–167

    Article  Google Scholar 

  • Salhi S and Rand GK (1993). Incorporating vehicle routing into the vehicle fleet composition problem. Eur J Oper Res 66(3): 313–330

    Article  Google Scholar 

  • Solomon MM (1987). Algorithms for the vehicle routing and scheduling problems with time windows constraints. Oper Res 35(2): 254–265

    Article  Google Scholar 

  • Taillard ÉD (1999). A heuristic column generation method for the heterogeneous fleet vehicle routing problem. Rairo Oper Res 33(1): 1–14

    Article  Google Scholar 

  • Tarantilis CD, Kiranoudis CT and Vassiliadis VS (2004). A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem. Eur J Oper Res 152(1): 148–158

    Article  Google Scholar 

  • Wassan NA and Osman IH (2002). Tabu search variants for the mix fleet vehicle routing problem. J Oper Res Soc 53: 768–782

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Production Engineering, FEI University Center, Av. Humberto de Alencar Castelo Branco, 3972, Assunção, São Bernardo do Campo, 09850-901, Brazil

    Patrícia Prado Belfiore

  2. Department of Accountancy, School of Economics, Business and Accounting, University of São Paulo, Av. Prof. Luciano Gualberto, 908, FEA 3 - Sala 237, Cidade Universitária, São Paulo, 05508-900, Brazil

    Luiz Paulo Lopes Fávero

Authors
  1. Patrícia Prado Belfiore
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Luiz Paulo Lopes Fávero
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Patrícia Prado Belfiore.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Belfiore, P.P., Fávero, L.P.L. Scatter search for the fleet size and mix vehicle routing problem with time windows. cent.eur.j.oper.res. 15, 351–368 (2007). https://doi.org/10.1007/s10100-007-0036-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10100-007-0036-9

Keywords

Search

Navigation