IDEAS home Printed from https://ideas.repec.org/a/spr/cejnor/v14y2006i2p125-140.html
   My bibliography  Save this article

Creating lasso-solutions for the traveling salesman problem with pickup and delivery by Tabu search

Author

Listed:
  • Arild Hoff
  • Arne Løkketangen

Abstract

We consider the Traveling Salesman Problem with Pickup and Delivery (TSPPD) where the same costumers might require both deloverie of goods and pickup of other goods. All the goods should be transported from/to the same depot. A vehicle on a TSPPD-tour could often get some practical problems when arranging the load. Even if the vehicle has enough space for all the pickups, one has to consider that they are stored in a way that doesn't block the delivery for the next customer. In real life problems this occurs for instance for breweries when they deliver bottles of beer or mineral water and collects empty bottles from the same customers on the same tour. In these situations we could relax the constraints of only checking Hamiltonian tours, and also try solutions that can visit customers in a way giving rise to a ‘alsso’ model. A solution which first only delivers bottles until the vehicle is partly unloaded, then do both delivery and pickup at the remaining customers and at last picks up the empty bottle from the first visited customers, could in these situations be better than a pure Hamiltonian tour, at least in a practical setting. To find such solutions, we will use the metaheuristic Tabu Search on some well known TSPPD-problems, and compare them to other kinds of solutions on the same problems. Copyright Springer-Verlag 2006

Suggested Citation

  • Arild Hoff & Arne Løkketangen, 2006. "Creating lasso-solutions for the traveling salesman problem with pickup and delivery by Tabu search," 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. 14(2), pages 125-140, June.
  • Handle: RePEc:spr:cejnor:v:14:y:2006:i:2:p:125-140
    DOI: 10.1007/s10100-006-0164-7
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10100-006-0164-7
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1007/s10100-006-0164-7?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. Mosheiov, Gur, 1994. "The Travelling Salesman Problem with pick-up and delivery," European Journal of Operational Research, Elsevier, vol. 79(2), pages 299-310, December.
    2. Wade, A. C. & Salhi, S., 2002. "An investigation into a new class of vehicle routing problem with backhauls," Omega, Elsevier, vol. 30(6), pages 479-487, December.
    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. 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.
    2. Maria Battarra & Güneş Erdoğan & Gilbert Laporte & Daniele Vigo, 2010. "The Traveling Salesman Problem with Pickups, Deliveries, and Handling Costs," Transportation Science, INFORMS, vol. 44(3), pages 383-399, August.

    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. 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.
    2. Ganesh, K. & Narendran, T.T., 2007. "CLOVES: A cluster-and-search heuristic to solve the vehicle routing problem with delivery and pick-up," European Journal of Operational Research, Elsevier, vol. 178(3), pages 699-717, May.
    3. 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.
    4. Salazar-González, Juan-José & Santos-Hernández, Beatriz, 2015. "The split-demand one-commodity pickup-and-delivery travelling salesman problem," Transportation Research Part B: Methodological, Elsevier, vol. 75(C), pages 58-73.
    5. Sayarshad, Hamid R. & Gao, H. Oliver, 2020. "Optimizing dynamic switching between fixed and flexible transit services with an idle-vehicle relocation strategy and reductions in emissions," Transportation Research Part A: Policy and Practice, Elsevier, vol. 135(C), pages 198-214.
    6. Shoshana Anily, 1996. "The vehicle‐routing problem with delivery and back‐haul options," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(3), pages 415-434, April.
    7. İ K Altınel & T Öncan, 2005. "A new enhancement of the Clarke and Wright savings heuristic for the capacitated vehicle routing problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(8), pages 954-961, August.
    8. Marques, Alexandra & Soares, Ricardo & Santos, Maria João & Amorim, Pedro, 2020. "Integrated planning of inbound and outbound logistics with a Rich Vehicle Routing Problem with backhauls," Omega, Elsevier, vol. 92(C).
    9. Li, Chongshou & Gong, Lijun & Luo, Zhixing & Lim, Andrew, 2019. "A branch-and-price-and-cut algorithm for a pickup and delivery problem in retailing," Omega, Elsevier, vol. 89(C), pages 71-91.
    10. 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.
    11. Day, Jamison M. & Daniel Wright, P. & Schoenherr, Tobias & Venkataramanan, Munirpallam & Gaudette, Kevin, 2009. "Improving routing and scheduling decisions at a distributor of industrial gasses," Omega, Elsevier, vol. 37(1), pages 227-237, February.
    12. C. Y. Lam, 2021. "Optimizing logistics routings in a network perspective of supply and demand nodes," 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. 29(1), pages 357-377, March.
    13. 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.
    14. 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.
    15. T-S Chang & Y-F Liao, 2011. "Routing strategies for integrating forward distribution and reverse collection," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(6), pages 971-981, June.
    16. Mladenović, Nenad & Urošević, Dragan & Hanafi, Saı¨d & Ilić, Aleksandar, 2012. "A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem," European Journal of Operational Research, Elsevier, vol. 220(1), pages 270-285.
    17. Kuo, Tsai Chi & Chen, Gary Yu-Hsin & Wang, Miao Ling & Ho, Ming Way, 2014. "Carbon footprint inventory route planning and selection of hot spot suppliers," International Journal of Production Economics, Elsevier, vol. 150(C), pages 125-139.
    18. Wang, Hsiao-Fan & Chen, Ying-Yen, 2013. "A coevolutionary algorithm for the flexible delivery and pickup problem with time windows," International Journal of Production Economics, Elsevier, vol. 141(1), pages 4-13.
    19. 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.
    20. Hernández-Pérez, Hipólito & Salazar-González, Juan-José, 2009. "The multi-commodity one-to-one pickup-and-delivery traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 196(3), pages 987-995, August.

    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:spr:cejnor:v:14:y:2006:i:2:p:125-140. 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.springer.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.