Advanced search
Publication Cover
Journal of the Operational Research Society Volume 59, 2008 - Issue 6
Submit an article Journal homepage
167
Views
54
CrossRef citations to date
0
Altmetric
Theoretical Paper

A perturbation metaheuristic for the vehicle routing problem with private fleet and common carriers

M-C BolducInteruniversity Research Center on Enterprise Networks, Logistics and Transportation (CIRRELT);Université LavalQuébecCanada
,
J RenaudInteruniversity Research Center on Enterprise Networks, Logistics and Transportation (CIRRELT);Université LavalQuébecCanadaCorrespondence[email protected]
,
F BoctorInteruniversity Research Center on Enterprise Networks, Logistics and Transportation (CIRRELT);Université LavalQuébecCanadaCorrespondence[email protected]
&
G LaporteInteruniversity Research Center on Enterprise Networks, Logistics and Transportation (CIRRELT);Canada Research Chair in Distribution Management, HEC MontréalMontréalCanada
Pages 776-787 | Received 01 Mar 2006, Accepted 01 Dec 2006, Published online: 21 Dec 2017

References

  • BallMOGoldenBLAssadAABodinLDPlanning for truck fleet size in the presence of a common-carrier optionDecis Sci19831410312010.1111/j.1540-5915.1983.tb00172.x
  • Bolduc M-C, Renaud J and Boctor FF (2005). A heuristic for the routing and carrier selection problem. Working paper, Network Organization Technology Research Center (CENTOR), Faculté des sciences de l'administration, Université Laval, Québec.
  • ChristofidesNEilonSAn algorithm for the vehicle-dispatching problemOpns Res196920309318
  • ChuC-WA heuristic algorithm for the truckload and less-than-truckload problemEur J Opl Res200516565766710.1016/j.ejor.2003.08.067
  • ClarkeGWrightJWScheduling of vehicles from a central depot to a number of delivery pointsOpns Res19641256858110.1287/opre.12.4.568
  • CordeauJ-FGendreauMHertzALaporteGSormanyJ-SNew heuristics for vehicle routing problemLogistics Systems: Design and Optimization2005279297
  • DiabyMRameshRThe distribution problem with carrier service: A dual based penalty approachORSA J Comput19957243510.1287/ijoc.7.1.24
  • GendreauMLaporteGMusaraganyiCTaillardÉDA tabu search heuristic for the heterogeneous fleet vehicle routing problemComput Opns Res1999261153117310.1016/S0305-0548(98)00100-2
  • GoldenBLMagnantiTLNguyenHQImplementing Vehicle Routing AlgorithmsNetworks1977711314810.1002/net.3230070203
  • GoldenBLWasilEAKellyJPChaoI-MThe impact of metaheuristics on solving the vehicle routing problem: Algorithms, problem sets, and computational resultsFleet Management and Logistics19983356
  • KaraILaporteGBektasTA note on the lifted Miller–Tucker–Zemlin subtour elimination constraints for the capacitated vehicle routing problemEur J Opl Res200415879379510.1016/S0377-2217(03)00377-1
  • KlincewicsJGLussHPilcherMGFleet size plannnig when outside carrier services are availableTransportation Science19902416918210.1287/trsc.24.3.169
  • KulkarniRVBhavePRInteger programming formulations of vehicle routing problemsEur J Opl Res198520586710.1016/0377-2217(85)90284-X
  • LiFGoldenBLWasilEAVery large-scale vehicle routing: New problems, algorithms, and resultsComput Opns Res2005321165117910.1016/j.cor.2003.10.002
  • Li F, Golden BL and Wasil EA (2006). A record-to-record travel algorithm for solving the heterogeneous fleet vehicle routing problem. Comput Opns Res, doi: 10.1016/j.cor.2005.10.015.
  • LinSComputer solutions of the traveling salesman problemBell Syst Tech J1965442245226910.1002/j.1538-7305.1965.tb04146.x
  • MillerCETuckerAWZemlinRAInteger programming formulation of traveling salesman problemsJ ACM1960732632910.1145/321043.321046
  • OsmanIHMetastrategy simulated annealing and tabu search algorithms for the vehicle routing problemAnn Opns Res19934142145110.1007/BF02023004
  • ReimannMDoernerKHartlRFD-Ants: Savings based ants divide and conquer the vehicle routing problemComput Opns Res20043156359110.1016/S0305-0548(03)00014-5
  • RenaudJBoctorFFLaporteGA fast composite heuristic for the symmetric traveling salesman problemINFORMS J Comput1996813414310.1287/ijoc.8.2.134
  • RenaudJBoctorFFLaporteGPerturbation heuristics for the pickup and delivery traveling salesman problemComput Opns Res2002291129114110.1016/S0305-0548(00)00109-X
  • ShiLOlafssonSSunNNew parallel randomized algorithms for the traveling salesman problemComput Opns Res19992637139410.1016/S0305-0548(98)00068-9
  • VolgenantTJonkerROn some generalizations of the travelling-salesman problemJ Opl Res Soc1987381073107910.1057/jors.1987.177
  • YellowPCA computational modification to the saving method of vehicle schedulingOpl Res Quart19702128128310.1057/jors.1970.52

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:

Order Reprints Request Corporate Permissions

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:

Request Academic Permissions

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.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.