IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v59y2008i6d10.1057_palgrave.jors.2602390.html
   My bibliography  Save this article

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

Author

Listed:
  • M-C Bolduc

    (Interuniversity Research Center on Enterprise Networks, Logistics and Transportation (CIRRELT)
    Université Laval)

  • J Renaud

    (Interuniversity Research Center on Enterprise Networks, Logistics and Transportation (CIRRELT)
    Université Laval)

  • F Boctor

    (Interuniversity Research Center on Enterprise Networks, Logistics and Transportation (CIRRELT)
    Université Laval)

  • G Laporte

    (Interuniversity Research Center on Enterprise Networks, Logistics and Transportation (CIRRELT)
    Canada Research Chair in Distribution Management, HEC Montréal)

Abstract

The purpose of this article is to propose a perturbation metaheuristic for the vehicle routing problem with private fleet and common carrier (VRPPC). This problem consists of serving all customers in such a way that (1) each customer is served exactly once either by a private fleet vehicle or by a common carrier vehicle, (2) all routes associated with the private fleet start and end at the depot, (3) each private fleet vehicle performs only one route, (4) the total demand of any route does not exceed the capacity of the vehicle assigned to it, and (5) the total cost is minimized. This article describes a new metaheuristic for the VRPPC, which uses a perturbation procedure in the construction and improvement phases and also performs exchanges between the sets of customers served by the private fleet and the common carrier. Extensive computational results show the superiority of the proposed metaheuristic over previous methods.

Suggested Citation

  • M-C Bolduc & J Renaud & F Boctor & G Laporte, 2008. "A perturbation metaheuristic for the vehicle routing problem with private fleet and common carriers," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(6), pages 776-787, June.
    • Handle: RePEc:pal:jorsoc:v:59:y:2008:i:6:d:10.1057_palgrave.jors.2602390
    DOI: 10.1057/palgrave.jors.2602390
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2602390
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/palgrave.jors.2602390?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. John G. Klincewicz & Hanan Luss & Martha G. Pilcher, 1990. "Fleet Size Planning when Outside Carrier Services Are Available," Transportation Science, INFORMS, vol. 24(3), pages 169-182, August.
    2. Jacques Renaud & Fayez F. Boctor & Gilbert Laporte, 1996. "A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem," INFORMS Journal on Computing, INFORMS, vol. 8(2), pages 134-143, May.
    3. Chu, Ching-Wu, 2005. "A heuristic algorithm for the truckload and less-than-truckload problem," European Journal of Operational Research, Elsevier, vol. 165(3), pages 657-667, September.
    4. G. Clarke & J. W. Wright, 1964. "Scheduling of Vehicles from a Central Depot to a Number of Delivery Points," Operations Research, INFORMS, vol. 12(4), pages 568-581, August.
    5. Kulkarni, R. V. & Bhave, P. R., 1985. "Integer programming formulations of vehicle routing problems," European Journal of Operational Research, Elsevier, vol. 20(1), pages 58-67, April.
    6. Moustapha Diaby & R. Ramesh, 1995. "The Distribution Problem with Carrier Service: A Dual Based Penalty Approach," INFORMS Journal on Computing, INFORMS, vol. 7(1), pages 24-35, February.
    7. Kara, Imdat & Laporte, Gilbert & Bektas, Tolga, 2004. "A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 158(3), pages 793-795, November.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Andreas Stenger & Daniele Vigo & Steffen Enz & Michael Schwind, 2013. "An Adaptive Variable Neighborhood Search Algorithm for a Vehicle Routing Problem Arising in Small Package Shipping," Transportation Science, INFORMS, vol. 47(1), pages 64-80, February.
    2. Liu, Ran & Jiang, Zhibin, 2012. "The close–open mixed vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 220(2), pages 349-360.
    3. Bertazzi, Luca & Maggioni, Francesca, 2018. "A stochastic multi-stage fixed charge transportation problem: Worst-case analysis of the rolling horizon approach," European Journal of Operational Research, Elsevier, vol. 267(2), pages 555-569.
    4. Ziebuhr, Mario & Kopfer, Herbert, 2016. "Solving an integrated operational transportation planning problem with forwarding limitations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 87(C), pages 149-166.
    5. Koç, Çağrı & Bektaş, Tolga & Jabali, Ola & Laporte, Gilbert, 2016. "Thirty years of heterogeneous vehicle routing," European Journal of Operational Research, Elsevier, vol. 249(1), pages 1-21.
    6. Zhenzhen Zhang & Zhixing Luo & Hu Qin & Andrew Lim, 2019. "Exact Algorithms for the Vehicle Routing Problem with Time Windows and Combinatorial Auction," Transportation Science, INFORMS, vol. 53(2), pages 427-441, March.
    7. Wang, Xin & Kopfer, Herbert & Gendreau, Michel, 2014. "Operational transportation planning of freight forwarding companies in horizontal coalitions," European Journal of Operational Research, Elsevier, vol. 237(3), pages 1133-1141.
    8. Margaretha Gansterer & Murat Küçüktepe & Richard F. Hartl, 2017. "The multi-vehicle profitable pickup and delivery problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(1), pages 303-319, January.
    9. Krajewska, Marta Anna & Kopfer, Herbert, 2009. "Transportation planning in freight forwarding companies: Tabu search algorithm for the integrated operational transportation planning problem," European Journal of Operational Research, Elsevier, vol. 197(2), pages 741-751, September.
    10. Annelieke C. Baller & Said Dabia & Wout E. H. Dullaert & Daniele Vigo, 2020. "The Vehicle Routing Problem with Partial Outsourcing," Transportation Science, INFORMS, vol. 54(4), pages 1034-1052, July.
    11. Paul, Joydeep & Agatz, Niels & Spliet, Remy & Koster, René De, 2019. "Shared Capacity Routing Problem − An omni-channel retail study," European Journal of Operational Research, Elsevier, vol. 273(2), pages 731-739.
    12. Thibaut Vidal & Nelson Maculan & Luiz Satoru Ochi & Puca Huachi Vaz Penna, 2016. "Large Neighborhoods with Implicit Customer Selection for Vehicle Routing Problems with Profits," Transportation Science, INFORMS, vol. 50(2), pages 720-734, May.
    13. Côté, Jean-François & Potvin, Jean-Yves, 2009. "A tabu search heuristic for the vehicle routing problem with private fleet and common carrier," European Journal of Operational Research, Elsevier, vol. 198(2), pages 464-469, October.
    14. Bertazzi, Luca & Bosco, Adamo & Laganà, Demetrio, 2015. "Managing stochastic demand in an Inventory Routing Problem with transportation procurement," Omega, Elsevier, vol. 56(C), pages 112-121.
    15. Bulhões, Teobaldo & Hà, Minh Hoàng & Martinelli, Rafael & Vidal, Thibaut, 2018. "The vehicle routing problem with service level constraints," European Journal of Operational Research, Elsevier, vol. 265(2), pages 544-558.
    16. Joaquín Pacheco & Rafael Caballero & Manuel Laguna & Julián Molina, 2013. "Bi-Objective Bus Routing: An Application to School Buses in Rural Areas," Transportation Science, INFORMS, vol. 47(3), pages 397-411, August.
    17. J-Y Potvin & M-A Naud, 2011. "Tabu search with ejection chains for the vehicle routing problem with private fleet and common carrier," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(2), pages 326-336, February.
    18. Bolduc, Marie-Claude & Laporte, Gilbert & Renaud, Jacques & Boctor, Fayez F., 2010. "A tabu search heuristic for the split delivery vehicle routing problem with production and demand calendars," European Journal of Operational Research, Elsevier, vol. 202(1), pages 122-130, April.
    19. Paul, J. & Agatz, N.A.H. & Spliet, R. & de Koster, M.B.M., 2017. "Shared Capacity Routing Problem – An Omni-channel Retail Study," ERIM Report Series Research in Management ERS-2017-012-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    20. Li, Junsong & Rong, Gang & Feng, Yiping, 2015. "Request selection and exchange approach for carrier collaboration based on auction of a single request," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 84(C), pages 23-39.
    21. Margaretha Gansterer & Richard F. Hartl, 2016. "Request evaluation strategies for carriers in auction-based collaborations," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 38(1), pages 3-23, January.
    22. Said Dabia & David Lai & Daniele Vigo, 2019. "An Exact Algorithm for a Rich Vehicle Routing Problem with Private Fleet and Common Carrier," Transportation Science, INFORMS, vol. 53(4), pages 986-1000, July.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Bolduc, Marie-Claude & Renaud, Jacques & Boctor, Fayez, 2007. "A heuristic for the routing and carrier selection problem," European Journal of Operational Research, Elsevier, vol. 183(2), pages 926-932, December.
    2. J-Y Potvin & M-A Naud, 2011. "Tabu search with ejection chains for the vehicle routing problem with private fleet and common carrier," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(2), pages 326-336, February.
    3. Gahm, Christian & Brabänder, Christian & Tuma, Axel, 2017. "Vehicle routing with private fleet, multiple common carriers offering volume discounts, and rental options," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 97(C), pages 192-216.
    4. Côté, Jean-François & Potvin, Jean-Yves, 2009. "A tabu search heuristic for the vehicle routing problem with private fleet and common carrier," European Journal of Operational Research, Elsevier, vol. 198(2), pages 464-469, October.
    5. Karaoglan, Ismail & Altiparmak, Fulya & Kara, Imdat & Dengiz, Berna, 2012. "The location-routing problem with simultaneous pickup and delivery: Formulations and a heuristic approach," Omega, Elsevier, vol. 40(4), pages 465-477.
    6. Ziebuhr, Mario & Kopfer, Herbert, 2016. "Solving an integrated operational transportation planning problem with forwarding limitations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 87(C), pages 149-166.
    7. Liu, Ran & Jiang, Zhibin, 2012. "The close–open mixed vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 220(2), pages 349-360.
    8. Andreas Stenger & Daniele Vigo & Steffen Enz & Michael Schwind, 2013. "An Adaptive Variable Neighborhood Search Algorithm for a Vehicle Routing Problem Arising in Small Package Shipping," Transportation Science, INFORMS, vol. 47(1), pages 64-80, February.
    9. Bertazzi, Luca & Bosco, Adamo & Laganà, Demetrio, 2015. "Managing stochastic demand in an Inventory Routing Problem with transportation procurement," Omega, Elsevier, vol. 56(C), pages 112-121.
    10. Gläser, Sina, 2022. "A waste collection problem with service type option," European Journal of Operational Research, Elsevier, vol. 303(3), pages 1216-1230.
    11. Christian Billing & Florian Jaehn & Thomas Wensing, 2018. "A multiperiod auto-carrier transportation problem with probabilistic future demands," Journal of Business Economics, Springer, vol. 88(7), pages 1009-1028, September.
    12. Joaquín Pacheco & Rafael Caballero & Manuel Laguna & Julián Molina, 2013. "Bi-Objective Bus Routing: An Application to School Buses in Rural Areas," Transportation Science, INFORMS, vol. 47(3), pages 397-411, August.
    13. Dominique Feillet & Pierre Dejax & Michel Gendreau, 2005. "Traveling Salesman Problems with Profits," Transportation Science, INFORMS, vol. 39(2), pages 188-205, May.
    14. Renaud, Jacques & Boctor, Fayez F., 2002. "A sweep-based algorithm for the fleet size and mix vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 140(3), pages 618-628, August.
    15. Furkan Uzar, M. & Çatay, Bülent, 2012. "Distribution planning of bulk lubricants at BP Turkey," Omega, Elsevier, vol. 40(6), pages 870-881.
    16. Zhenzhen Zhang & Zhixing Luo & Hu Qin & Andrew Lim, 2019. "Exact Algorithms for the Vehicle Routing Problem with Time Windows and Combinatorial Auction," Transportation Science, INFORMS, vol. 53(2), pages 427-441, March.
    17. Jan Pelikán & Petr Štourač & Ondřej Sokol, 2022. "Vehicle routing problem with uniform private fleet and common carrier: a node subset heuristic," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 30(2), pages 683-697, June.
    18. Li, Hongqi & Chang, Xinyu & Zhao, Wencong & Lu, Yingrong, 2017. "The vehicle flow formulation and savings-based algorithm for the rollon-rolloff vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 257(3), pages 859-869.
    19. Wang, Yong & Peng, Shouguo & Zhou, Xuesong & Mahmoudi, Monirehalsadat & Zhen, Lu, 2020. "Green logistics location-routing problem with eco-packages," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 143(C).
    20. Chu, Ching-Wu, 2005. "A heuristic algorithm for the truckload and less-than-truckload problem," European Journal of Operational Research, Elsevier, vol. 165(3), pages 657-667, September.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:pal:jorsoc:v:59:y:2008:i:6:d:10.1057_palgrave.jors.2602390. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.com/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.