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

Relation between vehicle routing problems: an insertion heuristic for the vehicle routing problem with simultaneous delivery and pick-up applied to the vehicle routing problem with backhauls

Author

Listed:
  • J Dethloff

    (University of Hamburg)

Abstract

Recently, an increasing number of papers on vehicle routing problems with backhauling has been published. Different types of backhauling problems are discussed. Two of them—the vehicle routing problem with backhauls and so-called ‘mixed loads’ (VRPBM) and the vehicle routing problem with simultaneous delivery and pick-up (VRPSDP)—are closely related. In this paper, we discuss that relationship. Our findings are that previously published results for VRPSDP instances obtained by using a heuristic suggested for the VRPBM do not take into account specific properties of the VRPSDP. As a result of the analysis of the relation between both problem types the possibility of solving the VRPBM by applying an insertion heuristic based on the concept of ‘residual capacities’ originally designed for the VRPSDP is investigated. Numerical results indicate that, for certain instances, this approach is more favourable than the application of a heuristic suggested for the VRPBM in the literature.

Suggested Citation

  • J Dethloff, 2002. "Relation between vehicle routing problems: an insertion heuristic for the vehicle routing problem with simultaneous delivery and pick-up applied to the vehicle routing problem with backhauls," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 53(1), pages 115-118, January.
    • Handle: RePEc:pal:jorsoc:v:53:y:2002:i:1:d:10.1057_palgrave.jors.2601263
    DOI: 10.1057/palgrave.jors.2601263
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2601263
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/palgrave.jors.2601263?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.

    Citations

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


    Cited by:

    1. Ropke, Stefan & Pisinger, David, 2006. "A unified heuristic for a large class of Vehicle Routing Problems with Backhauls," European Journal of Operational Research, Elsevier, vol. 171(3), pages 750-775, June.
    2. Xiaofan Lai & Liang Xu & Zhou Xu & Yang Du, 2023. "An Approximation Algorithm for k -Depot Split Delivery Vehicle Routing Problem," INFORMS Journal on Computing, INFORMS, vol. 35(5), pages 1179-1194, September.
    3. González-Torre, Pilar L. & Adenso-Díaz, Belarmino, 2006. "Reverse logistics practices in the glass sector in Spain and Belgium," International Business Review, Elsevier, vol. 15(5), pages 527-546, October.
    4. Hoff, Arild & Gribkovskaia, Irina & Laporte, Gilbert & Løkketangen, Arne, 2009. "Lasso solution strategies for the vehicle routing problem with pickups and deliveries," European Journal of Operational Research, Elsevier, vol. 192(3), pages 755-766, February.
    5. Niaz A. Wassan & A. Hameed Wassan & Gábor Nagy, 2008. "A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries," Journal of Combinatorial Optimization, Springer, vol. 15(4), pages 368-386, May.
    6. Gribkovskaia, Irina & Halskau, Oyvind sr. & Laporte, Gilbert & Vlcek, Martin, 2007. "General solutions to the single vehicle routing problem with pickups and deliveries," European Journal of Operational Research, Elsevier, vol. 180(2), pages 568-584, July.
    7. Yu, Junfang & Dong, Yuanyuan, 2013. "Maximizing profit for vehicle routing under time and weight constraints," International Journal of Production Economics, Elsevier, vol. 145(2), pages 573-583.
    8. J Crispim & J Brandão, 2005. "Metaheuristics applied to mixed and simultaneous extensions of vehicle routing problems with backhauls," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(11), pages 1296-1302, November.
    9. Phuong Khanh Nguyen & Teodor Gabriel Crainic & Michel Toulouse, 2017. "Multi-trip pickup and delivery problem with time windows and synchronization," Annals of Operations Research, Springer, vol. 253(2), pages 899-934, June.
    10. Liu, Ran & Xie, Xiaolan & Augusto, Vincent & Rodriguez, Carlos, 2013. "Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care," European Journal of Operational Research, Elsevier, vol. 230(3), pages 475-486.
    11. S Mitra, 2008. "A parallel clustering technique for the vehicle routing problem with split deliveries and pickups," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(11), pages 1532-1546, November.
    12. Maria João Santos & Pedro Amorim & Alexandra Marques & Ana Carvalho & Ana Póvoa, 2020. "The vehicle routing problem with backhauls towards a sustainability perspective: a review," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 28(2), pages 358-401, July.
    13. Tao Zhang & W. Art Chaovalitwongse & Yuejie Zhang, 2014. "Integrated Ant Colony and Tabu Search approach for time dependent vehicle routing problems with simultaneous pickup and delivery," Journal of Combinatorial Optimization, Springer, vol. 28(1), pages 288-309, July.

    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:53:y:2002:i:1:d:10.1057_palgrave.jors.2601263. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.