IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v61y2014i1p34-43.html
   My bibliography  Save this article

Vehicle routing problems with regular objective functions on a path

Author

Listed:
  • Wei Yu
  • Zhaohui Liu

Abstract

We investigate the problem of scheduling a fleet of vehicles to visit the customers located on a path to minimize some regular function of the visiting times of the customers. For the single‐vehicle problem, we prove that it is pseudopolynomially solvable for any minsum objective and polynomially solvable for any minmax objective. Also, we establish the NP‐hardness of minimizing the weighted number of tardy customers and the total weighted tardiness, and present polynomial algorithms for their special cases with a common due date. For the multivehicle problem involving n customers, we show that an optimal solution can be found by solving O ( n 2 ) or O(n) single‐vehicle problems. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 61: 34–43, 2014

Suggested Citation

  • Wei Yu & Zhaohui Liu, 2014. "Vehicle routing problems with regular objective functions on a path," Naval Research Logistics (NRL), John Wiley & Sons, vol. 61(1), pages 34-43, February.
    • Handle: RePEc:wly:navres:v:61:y:2014:i:1:p:34-43
    DOI: 10.1002/nav.21564
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.21564
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.21564?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
    ---><---

    References listed on IDEAS

    as
    1. Harilaos N. Psaraftis & Marius M. Solomon & Thomas L. Magnanti & Tai-Up Kim, 1990. "Routing and Scheduling on a Shoreline with Release Times," Management Science, INFORMS, vol. 36(2), pages 212-223, February.
    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. Seung Hyun Kim & Sang Hoon Bae, 2016. "Optimal solution to the vehicle routing problem by adopting a meta-heuristic algorithm," Transportation Planning and Technology, Taylor & Francis Journals, vol. 39(6), pages 574-585, August.
    2. 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).

    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. "Improved algorithms for single vehicle scheduling on tree/cycle networks," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-16.
    2. Patrick Jaillet & Michael R. Wagner, 2006. "Online Routing Problems: Value of Advanced Information as Improved Competitive Ratios," Transportation Science, INFORMS, vol. 40(2), pages 200-210, May.
    3. Hao Yan & Peihai Liu & Xiwen Lu, 2023. "Vehicle scheduling problems with two agents on a line," Journal of Combinatorial Optimization, Springer, vol. 45(1), pages 1-18, January.
    4. Bock, Stefan, 2015. "Solving the traveling repairman problem on a line with general processing times and deadlines," European Journal of Operational Research, Elsevier, vol. 244(3), pages 690-703.
    5. Nils Boysen & Dirk Briskorn & Stefan Schwerdfeger, 2023. "How to charge while driving: scheduling point-to-point deliveries of an electric vehicle under overhead wiring," Journal of Scheduling, Springer, vol. 26(1), pages 19-41, February.
    6. Yuanxiao Wu & Xiwen Lu, 2021. "Improved algorithms for single vehicle scheduling on tree/cycle networks," Journal of Combinatorial Optimization, Springer, vol. 42(3), pages 565-580, October.
    7. Michael Hassoun & Shraga Shoval & Eran Simchon & Liron Yedidsion, 2020. "The single line moving target traveling salesman problem with release times," Annals of Operations Research, Springer, vol. 289(2), pages 449-458, June.
    8. Bock, Stefan, 2020. "Optimally solving a versatile Traveling Salesman Problem on tree networks with soft due dates and multiple congestion scenarios," European Journal of Operational Research, Elsevier, vol. 283(3), pages 863-882.
    9. Nils Boysen & Dirk Briskorn & Simon Emde, 2018. "Scheduling electric vehicles and locating charging stations on a path," Journal of Scheduling, Springer, vol. 21(1), pages 111-126, February.
    10. Kim, Kap Hwan & Lee, Keung Mo & Hwang, Hark, 2003. "Sequencing delivery and receiving operations for yard cranes in port container terminals," International Journal of Production Economics, Elsevier, vol. 84(3), pages 283-292, June.
    11. Stefan Bock, 2016. "Finding optimal tour schedules on transportation paths under extended time window constraints," Journal of Scheduling, Springer, vol. 19(5), pages 527-546, October.
    12. Zenker, Michael & Emde, Simon & Boysen, Nils, 2016. "Cyclic inventory routing in a line-shaped network," European Journal of Operational Research, Elsevier, vol. 250(1), pages 164-178.
    13. Srour, F.J. & Zuidwijk, R.A., 2008. "How Much is Location Information Worth? A Competitive Analysis of the Online Traveling Salesman Problem with Two Disclosure Dates," ERIM Report Series Research in Management ERS-2008-075-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.

    More about this item

    Statistics

    Access and download statistics

    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:wly:navres:v:61:y:2014:i:1:p:34-43. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    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.