140
Views
33
CrossRef citations to date
0
Altmetric
Theoretical Paper

A heuristic for vehicle fleet mix problem using tabu search and set partitioning

, , &
Pages 833-841 | Received 01 Aug 2005, Accepted 01 Mar 2007, Published online: 21 Dec 2017

References

  • BalinskiMLQuandtREOn an integer program for a delivery problemOpns Res19641230030410.1287/opre.12.2.300
  • BolducMCRenaudJMontreuilBSynchronized routing of seasonal products through a production/distribution networkCentral Eur J Opl Res20061420922810.1007/s10100-006-0169-2
  • BrandãoJMercerAA tabu search algorithm for the multi-trip vehicle routing and scheduling problemEur J Opl Res199710018019110.1016/S0377-2217(97)00010-6
  • CalveteHIGaléCOliverosMJSánchez-ValverdeBA goal programming approach to vehicle routing problems with soft time windowsEur J Opl Res20051771720173310.1016/j.ejor.2005.10.010
  • ChoiETchaDWA column generation approach to the heterogeneous fleet vehicle routing problemComput Opns Res2005342080209510.1016/j.cor.2005.08.002
  • DantzigGRamserJThe truck dispatching problemMngt Sci19596809110.1287/mnsc.6.1.80
  • DondoRCerdáJA cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windowsEur J Opl Res20061761478150710.1016/j.ejor.2004.07.077
  • DullaertWJanssensGKSorensenKVernimmenBNew heuristics for the fleet size and mix vehicle routing problem with time windowsJ Opl Res Soc2002531232123810.1057/palgrave.jors.2601422
  • GendreauMLaporteGMusaraganyiCTaillardEDA tabu search heuristic for the heterogeneous fleet vehicle routing problemComput Opns Res1999261153117310.1016/S0305-0548(98)00100-2
  • GheysensFGoldenBAssadAA comparison of techniques for solving the fleet size and mix vehicle routing problemOpns Res Spectrum1984620721610.1007/BF01720070
  • GheysensFGGoldenBAssadAA new heuristic for determining fleet size and compositionMath Programm Studies19862623323610.1007/BFb0121103
  • GillettBMillerLA heuristic algorithm for the vehicle dispatch problemOpns Res19742234034910.1287/opre.22.2.340
  • GoldenBAssadALevyLGheysensFGThe fleet size and mix vehicle routing problemComput Opns Res198411496610.1016/0305-0548(84)90007-8
  • GrabowskiJPemperaJSome local search algorithms for no-wait flow-shop problem with makespan criterionComput Opns Res2005322197221210.1016/j.cor.2004.02.009
  • IrnichSA multi-depot pickup and delivery problem with a single hub and heterogeneous vehiclesEur J Opl Res200012231032810.1016/S0377-2217(99)00235-0
  • LimaCMRRGoldbargMCGoldbargEFGA memetic algorithm for the heterogeneous fleet vehicle routing problemElectronic Notes Discrete Math20041817117610.1016/j.endm.2004.06.027
  • LiuFHShenSYThe fleet size and mix vehicle routing problem with time windowsJ Opl Res Soc19995072173210.1057/palgrave.jors.2600763
  • PrinsCEfficient heuristics for the heterogeneous fleet multitrip VRP with application to a large-scale real caseJ Math Modell Algorithms2002113515010.1023/A:1016516326823
  • PrivéJRenaudJBoctorFLaporteGSolving a vehicle routing problem arising in soft drink distributionJ Opl Res Soc2006571045105210.1057/palgrave.jors.2602087
  • TaillardEDA heuristic column generation method for the heterogeneous fleet VRPRAIRO-Opns Res19993311410.1051/ro:1999101
  • TarantilisCDKiranoudisCTA meta-heuristic algorithm for the efficient distribution of perishable foodsJ Food Eng2001501910.1016/S0260-8774(00)00187-4
  • Tarantilis CD and Kiranoudis CT (2005). A flexible adaptive memory-based algorithm for real-life transportation operations: two case studies from dairy and construction sector. Eur J Opl Res 179: 806–822.
  • Tavakkoli-MoghaddamRSafaeiNGholipourYA hybrid simulated annealing for capacitated vehicle routing problems with the independent route lengthAppl Math Comput2006176445454
  • WassanNAOsmanIHTabu search variants for the mix fleet vehicle routing problemJ Opl Res Soc20025376878210.1057/palgrave.jors.2601344

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.