IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v44y2022i3d10.1007_s10878-020-00565-5.html
   My bibliography  Save this article

Capacitated vehicle routing problem on line with unsplittable demands

Author

Listed:
  • Yuanxiao Wu

    (School of Science, East China University of Science and Technology)

  • Xiwen Lu

    (School of Science, East China University of Science and Technology)

Abstract

In this paper we study the capacitated vehicle routing problem. An instance of capacitated vehicle routing problem consists of a set of vertices with demands in a metric space, a specified depot, and a capacity bound C. The objective is to find a set of tours originating at the depot that cover all the demands, such that the capacity of each tour does not exceed C and the sum of the tour lengths is minimized. For the case that the metric space is a line and the demands are unsplittable, we provide a $$\frac{5}{3}$$ 5 3 -approximation algorithm. An instance is given to show that the bound is tight.

Suggested Citation

  • 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.
  • Handle: RePEc:spr:jcomop:v:44:y:2022:i:3:d:10.1007_s10878-020-00565-5
    DOI: 10.1007/s10878-020-00565-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-020-00565-5
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10878-020-00565-5?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. Guochuan Zhang & Xiaoqiang Cai & C.‐Y Lee & C.K Wong, 2001. "Minimizing makespan on a single batch processing machine with nonidentical job sizes," Naval Research Logistics (NRL), John Wiley & Sons, vol. 48(3), pages 226-240, April.
    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. Gyorgy Dosa & Zhiyi Tan & Zsolt Tuza & Yujie Yan & Cecília Sik Lányi, 2014. "Improved bounds for batch scheduling with nonidentical job sizes," Naval Research Logistics (NRL), John Wiley & Sons, vol. 61(5), pages 351-358, August.
    5. Martine Labbé & Gilbert Laporte & Hélène Mercure, 1991. "Capacitated Vehicle Routing on Trees," Operations Research, INFORMS, vol. 39(4), pages 616-622, August.
    6. 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.
    Full references (including those not matched with items on IDEAS)

    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, 0. "Capacitated vehicle routing problem on line with unsplittable demands," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-11.
    2. 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.
    3. 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.
    4. 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.
    5. 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.
    6. 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.
    7. 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.
    8. Jing Fan & Hui Shi, 2022. "Non-resumable scheduling on a single bounded parallel-batch machine with periodic maintenance," Journal of Combinatorial Optimization, Springer, vol. 43(5), pages 1645-1654, July.
    9. 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).
    10. Cheng, Bayi & Leung, Joseph Y.-T. & Li, Kai & Yang, Shanlin, 2019. "Integrated optimization of material supplying, manufacturing, and product distribution: Models and fast algorithms," European Journal of Operational Research, Elsevier, vol. 277(1), pages 100-111.
    11. 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.
    12. 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.
    13. 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.
    14. Walter, Rico & Schulze, Philipp & Scholl, Armin, 2021. "SALSA: Combining branch-and-bound with dynamic programming to smoothen workloads in simple assembly line balancing," European Journal of Operational Research, Elsevier, vol. 295(3), pages 857-873.
    15. 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.
    16. 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.
    17. Chengbin Chu & Julien Antonio, 1999. "Approximation Algorithms to Solve Real-Life Multicriteria Cutting Stock Problems," Operations Research, INFORMS, vol. 47(4), pages 495-508, August.
    18. Bassem Jarboui & Saber Ibrahim & Abdelwaheb Rebai, 2010. "A new destructive bounding scheme for the bin packing problem," Annals of Operations Research, Springer, vol. 179(1), pages 187-202, September.
    19. Miaomiao Jin & Xiaoxia Liu & Wenchang Luo, 2020. "Single-Machine Parallel-Batch Scheduling with Nonidentical Job Sizes and Rejection," Mathematics, MDPI, vol. 8(2), pages 1-8, February.
    20. Herer, Yale T., 1999. "Submodularity and the traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 114(3), pages 489-508, May.

    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:44:y:2022:i:3:d:10.1007_s10878-020-00565-5. 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.