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

Open vehicle routing problem with driver nodes and time deadlines

Author

Listed:
  • D Aksen

    (Koç University)

  • Z Özyurt

    (Koç University)

  • N Aras

    (Boğaziçi University)

Abstract

In this paper, we consider a variant of the open vehicle routing problem in which vehicles depart from the depot, visit a set of customers, and end their routes at special nodes called driver nodes. A driver node can be the home of the driver or a parking lot where the vehicle will stay overnight. The resulting problem is referred to as the open vehicle routing problem with driver nodes (OVRP-d). We consider three classes of OVRP-d: with no time constraints, with a maximum route duration, and with both a maximum route duration as well as time deadlines for visiting customers. For the solution of these problems, which are not addressed previously in the literature, we develop a new tabu search heuristic. Computational results on randomly generated instances indicate that the new heuristic exhibits a good performance both in terms of the solution quality and computation time.

Suggested Citation

  • D Aksen & Z Özyurt & N Aras, 2007. "Open vehicle routing problem with driver nodes and time deadlines," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(9), pages 1223-1234, September.
    • Handle: RePEc:pal:jorsoc:v:58:y:2007:i:9:d:10.1057_palgrave.jors.2602249
    DOI: 10.1057/palgrave.jors.2602249
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2602249
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/palgrave.jors.2602249?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. L Y O Li & Z Fu, 2002. "The school bus routing problem: a case study," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 53(5), pages 552-558, May.
    2. Letchford, Adam N. & Lysgaard, Jens & Eglese, Richard W., 2006. "A Branch-and-Cut Algorithm for the Capacitated Open Vehicle Routing Problem," CORAL Working Papers L-2006-06, University of Aarhus, Aarhus School of Business, Department of Business Studies.
    3. D Sariklis & S Powell, 2000. "A heuristic method for the open vehicle routing problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 51(5), pages 564-573, May.
    4. Kara, Imdat & Laporte, Gilbert & Bektas, Tolga, 2004. "A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 158(3), pages 793-795, November.
    5. Tarantilis, C. D. & Diakoulaki, D. & Kiranoudis, C. T., 2004. "Combination of geographical information system and efficient routing algorithms for real life distribution operations," European Journal of Operational Research, Elsevier, vol. 152(2), pages 437-453, January.
    6. Z Fu & R Eglese & L Y O Li, 2005. "A new tabu search heuristic for the open vehicle routing problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(3), pages 267-274, March.
    7. G. Clarke & J. W. Wright, 1964. "Scheduling of Vehicles from a Central Depot to a Number of Delivery Points," Operations Research, INFORMS, vol. 12(4), pages 568-581, 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. Atefi, Reza & Salari, Majid & C. Coelho, Leandro & Renaud, Jacques, 2018. "The open vehicle routing problem with decoupling points," European Journal of Operational Research, Elsevier, vol. 265(1), pages 316-327.
    2. Perugia, Alessandro & Moccia, Luigi & Cordeau, Jean-François & Laporte, Gilbert, 2011. "Designing a home-to-work bus service in a metropolitan area," Transportation Research Part B: Methodological, Elsevier, vol. 45(10), pages 1710-1726.

    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. T Bektaş & Seda Elmastaş, 2007. "Solving school bus routing problems through integer programming," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(12), pages 1599-1604, December.
    2. Fung, Richard Y.K. & Liu, Ran & Jiang, Zhibin, 2013. "A memetic algorithm for the open capacitated arc routing problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 50(C), pages 53-67.
    3. Atefi, Reza & Salari, Majid & C. Coelho, Leandro & Renaud, Jacques, 2018. "The open vehicle routing problem with decoupling points," European Journal of Operational Research, Elsevier, vol. 265(1), pages 316-327.
    4. Liu, Ran & Jiang, Zhibin, 2012. "The close–open mixed vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 220(2), pages 349-360.
    5. U Derigs & K Reuter, 2009. "A simple and efficient tabu search heuristic for solving the open vehicle routing problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(12), pages 1658-1669, December.
    6. A N Letchford & J Lysgaard & R W Eglese, 2007. "A branch-and-cut algorithm for the capacitated open vehicle routing problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(12), pages 1642-1651, December.
    7. P P Repoussis & C D Tarantilis & G Ioannou, 2007. "The open vehicle routing problem with time windows," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(3), pages 355-367, March.
    8. Chiang, Wen-Chyuan & Russell, Robert & Xu, Xiaojing & Zepeda, David, 2009. "A simulation/metaheuristic approach to newspaper production and distribution supply chain problems," International Journal of Production Economics, Elsevier, vol. 121(2), pages 752-767, October.
    9. C D Tarantilis & G Ioannou & C T Kiranoudis & G P Prastacos, 2005. "Solving the open vehicle routeing problem via a single parameter metaheuristic algorithm," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(5), pages 588-596, May.
    10. Park, Junhyuk & Kim, Byung-In, 2010. "The school bus routing problem: A review," European Journal of Operational Research, Elsevier, vol. 202(2), pages 311-319, April.
    11. Hernan Caceres & Rajan Batta & Qing He, 2017. "School Bus Routing with Stochastic Demand and Duration Constraints," Transportation Science, INFORMS, vol. 51(4), pages 1349-1364, November.
    12. Eduardo Lalla-Ruiz & Christopher Expósito-Izquierdo & Shervin Taheripour & Stefan Voß, 2016. "An improved formulation for the multi-depot open vehicle routing problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 38(1), pages 175-187, January.
    13. Furkan Uzar, M. & Çatay, Bülent, 2012. "Distribution planning of bulk lubricants at BP Turkey," Omega, Elsevier, vol. 40(6), pages 870-881.
    14. Ellegood, William A. & Solomon, Stanislaus & North, Jeremy & Campbell, James F., 2020. "School bus routing problem: Contemporary trends and research directions," Omega, Elsevier, vol. 95(C).
    15. Vidal, Thibaut & Crainic, Teodor Gabriel & Gendreau, Michel & Prins, Christian, 2013. "Heuristics for multi-attribute vehicle routing problems: A survey and synthesis," European Journal of Operational Research, Elsevier, vol. 231(1), pages 1-21.
    16. Petr Kučera, 2012. "Different versions of the savings method for the time limited vehicle routing problem," Acta Universitatis Agriculturae et Silviculturae Mendelianae Brunensis, Mendel University Press, vol. 60(7), pages 171-178.
    17. Ansari, Azadeh & Farrokhvar, Leily & Kamali, Behrooz, 2021. "Integrated student to school assignment and school bus routing problem for special needs students," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 152(C).
    18. Z Fu & R Eglese & L Y O Li, 2005. "A new tabu search heuristic for the open vehicle routing problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(3), pages 267-274, March.
    19. J Mar-Ortiz & B Adenso-Diaz & J L González-Velarde, 2011. "Design of a recovery network for WEEE collection: the case of Galicia, Spain," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(8), pages 1471-1484, August.
    20. Schittekat, Patrick & Kinable, Joris & Sörensen, Kenneth & Sevaux, Marc & Spieksma, Frits & Springael, Johan, 2013. "A metaheuristic for the school bus routing problem with bus stop selection," European Journal of Operational Research, Elsevier, vol. 229(2), pages 518-528.

    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:58:y:2007:i:9:d:10.1057_palgrave.jors.2602249. 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.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.