IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v5y2001i2d10.1023_a1011461300596.html
   My bibliography  Save this article

A New Approximation Algorithm for the Capacitated Vehicle Routing Problem on a Tree

Author

Listed:
  • Tetsuo Asano

    (JAIST)

  • Naoki Katoh

    (Kyoto University)

  • Kazuhiro Kawashima

    (JAIST)

Abstract

This paper presents a new approximation algorithm for a vehicle routing problem on a tree-shaped network with a single depot. Customers are located on vertices of the tree, and each customer has a positive demand. Demands of customers are served by a fleet of identical vehicles with limited capacity. It is assumed that the demand of a customer is splittable, i.e., it can be served by more than one vehicle. The problem we are concerned with in this paper asks to find a set of tours of the vehicles with minimum total lengths. Each tour begins at the depot, visits a subset of the customers and returns to the depot without violating the capacity constraint. We propose a 1.35078-approximation algorithm for the problem (exactly, $$\left( {\sqrt {41} - 1} \right)/4$$ ), which is an improvement over the existing 1.5-approximation.

Suggested Citation

  • Tetsuo Asano & Naoki Katoh & Kazuhiro Kawashima, 2001. "A New Approximation Algorithm for the Capacitated Vehicle Routing Problem on a Tree," Journal of Combinatorial Optimization, Springer, vol. 5(2), pages 213-231, June.
    • Handle: RePEc:spr:jcomop:v:5:y:2001:i:2:d:10.1023_a:1011461300596
    DOI: 10.1023/A:1011461300596
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1011461300596
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1023/A:1011461300596?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. Kemal Altinkemer & Bezalel Gavish, 1990. "Technical Note—Heuristics for Delivery Problems with Constant Error Guarantees," Transportation Science, INFORMS, vol. 24(4), pages 294-297, November.
    2. Desrochers, M. & Lenstra, J. K. & Savelsbergh, M. W. P., 1990. "A classification scheme for vehicle routing and scheduling problems," European Journal of Operational Research, Elsevier, vol. 46(3), pages 322-332, June.
    3. M. Haimovich & A. H. G. Rinnooy Kan, 1985. "Bounds and Heuristics for Capacitated Routing Problems," Mathematics of Operations Research, INFORMS, vol. 10(4), pages 527-542, November.
    4. Martine Labbé & Gilbert Laporte & Hélène Mercure, 1991. "Capacitated Vehicle Routing on Trees," Operations Research, INFORMS, vol. 39(4), pages 616-622, August.
    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. Lai, Xiaofan & Xu, Zhou, 2016. "Improved algorithms for joint optimization of facility locations and network connections," European Journal of Operational Research, Elsevier, vol. 250(3), pages 745-753.
    2. Xu, Liang & Xu, Zhou & Xu, Dongsheng, 2013. "Exact and approximation algorithms for the min–max k-traveling salesmen problem on a tree," European Journal of Operational Research, Elsevier, vol. 227(2), pages 284-292.
    3. Yuanxiao Wu & Xiwen Lu, 0. "Capacitated vehicle routing problem on line with unsplittable demands," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-11.
    4. Yuanxiao Wu & Xiwen Lu, 2022. "Capacitated vehicle routing problem on line with unsplittable demands," Journal of Combinatorial Optimization, Springer, vol. 44(3), pages 1953-1963, October.

    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. Yuanxiao Wu & Xiwen Lu, 2022. "Capacitated vehicle routing problem on line with unsplittable demands," Journal of Combinatorial Optimization, Springer, vol. 44(3), pages 1953-1963, October.
    2. Yuanxiao Wu & Xiwen Lu, 0. "Capacitated vehicle routing problem on line with unsplittable demands," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-11.
    3. Qiuping Ni & Yuanxiang Tang, 2023. "A Bibliometric Visualized Analysis and Classification of Vehicle Routing Problem Research," Sustainability, MDPI, vol. 15(9), pages 1-37, April.
    4. Zhang, Meng & Wang, Nengmin & He, Zhengwen & Jiang, Bin, 2021. "Vehicle routing optimization for hazmat shipments considering catastrophe avoidance and failed edges," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 150(C).
    5. Inge Li Gørtz & Marco Molinaro & Viswanath Nagarajan & R. Ravi, 2016. "Capacitated Vehicle Routing with Nonuniform Speeds," Mathematics of Operations Research, INFORMS, vol. 41(1), pages 318-331, February.
    6. Patrick Jaillet & Michael R. Wagner, 2008. "Generalized Online Routing: New Competitive Ratios, Resource Augmentation, and Asymptotic Analyses," Operations Research, INFORMS, vol. 56(3), pages 745-757, June.
    7. Anupam Gupta & Viswanath Nagarajan & R. Ravi, 2012. "Technical Note---Approximation Algorithms for VRP with Stochastic Demands," Operations Research, INFORMS, vol. 60(1), pages 123-127, February.
    8. Shoshana Anily & Julien Bramel, 1999. "Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(6), pages 654-670, September.
    9. Zhou Xu & Liang Xu & Chung‐Lun Li, 2010. "Approximation results for min‐max path cover problems in vehicle routing," Naval Research Logistics (NRL), John Wiley & Sons, vol. 57(8), pages 728-748, December.
    10. Gregory S. Taylor & Yupo Chan & Ghulam Rasool, 2017. "A three-dimensional bin-packing model: exact multicriteria solution and computational complexity," Annals of Operations Research, Springer, vol. 251(1), pages 397-427, April.
    11. Willem E. de Paepe & Jan Karel Lenstra & Jiri Sgall & René A. Sitters & Leen Stougie, 2004. "Computer-Aided Complexity Classification of Dial-a-Ride Problems," INFORMS Journal on Computing, INFORMS, vol. 16(2), pages 120-132, May.
    12. Park, Hyeongjun & Park, Dongjoo & Jeong, In-Jae, 2016. "An effects analysis of logistics collaboration in last-mile networks for CEP delivery services," Transport Policy, Elsevier, vol. 50(C), pages 115-125.
    13. Ullrich, Christian A., 2013. "Integrated machine scheduling and vehicle routing with time windows," European Journal of Operational Research, Elsevier, vol. 227(1), pages 152-165.
    14. Scholl, Armin & Becker, Christian, 2006. "State-of-the-art exact and heuristic solution procedures for simple assembly line balancing," European Journal of Operational Research, Elsevier, vol. 168(3), pages 666-693, February.
    15. Crainic, Teodor Gabriel & Perboli, Guido & Pezzuto, Miriam & Tadei, Roberto, 2007. "Computing the asymptotic worst-case of bin packing lower bounds," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1295-1303, December.
    16. 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.
    17. Anton J. Kleywegt & Vijay S. Nori & Martin W. P. Savelsbergh, 2002. "The Stochastic Inventory Routing Problem with Direct Deliveries," Transportation Science, INFORMS, vol. 36(1), pages 94-118, February.
    18. Frey, Christian M.M. & Jungwirth, Alexander & Frey, Markus & Kolisch, Rainer, 2023. "The vehicle routing problem with time windows and flexible delivery locations," European Journal of Operational Research, Elsevier, vol. 308(3), pages 1142-1159.
    19. John Gunnar Carlsson & Mehdi Behroozi & Raghuveer Devulapalli & Xiangfei Meng, 2016. "Household-Level Economies of Scale in Transportation," Operations Research, INFORMS, vol. 64(6), pages 1372-1387, December.
    20. Braune, Roland, 2019. "Lower bounds for a bin packing problem with linear usage cost," European Journal of Operational Research, Elsevier, vol. 274(1), pages 49-64.

    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:jcomop:v:5:y:2001:i:2:d:10.1023_a:1011461300596. 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.