IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v265y2018i1p316-327.html
   My bibliography  Save this article

The open vehicle routing problem with decoupling points

Author

Listed:
  • Atefi, Reza
  • Salari, Majid
  • C. Coelho, Leandro
  • Renaud, Jacques

Abstract

In this paper we introduce the open vehicle routing problem with decoupling points (OVRP-DP). This practical problem is faced by companies dealing with carriers to ship their goods over large territories. In this case it may be profitable to use more than one carrier to perform a specific expedition: the first one leaves the depot and performs part of the deliveries, drops off all remaining load, and the second carrier continues from that point onwards. This drop off location is called the decoupling point of the route. This problem generalizes the classical OVRP in which each route must be performed by only one carrier. We model this problem using a realistic multi-drop less-than-truckload cost function composed of a non-linear transportation cost, a detour cost and a drop cost. We have developed a tailored Iterated Local Search (ILS) algorithm which handles the special features of the problem. The efficiency of the ILS was demonstrated by obtaining all best known solutions on a set of classical OVRP instances and improving it for one instance. Then, using real orders and transportation costs obtained from industrial partners, we clearly show the benefit of using decoupling points to optimize transportation costs. The performance of the ILS is analyzed and shown to be very robust and superior to what can be obtained with a commercial solver.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:265:y:2018:i:1:p:316-327
    DOI: 10.1016/j.ejor.2017.07.033
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221717306604
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2017.07.033?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. Marshall L. Fisher, 1994. "Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees," Operations Research, INFORMS, vol. 42(4), pages 626-642, August.
    2. Sophie D. Lapierre & Angel B. Ruiz & Patrick Soriano, 2004. "Designing Distribution Networks: Formulations and Solution Heuristic," Transportation Science, INFORMS, vol. 38(2), pages 174-187, May.
    3. 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.
    4. 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.
    5. 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.
    6. 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.
    7. Michel Gendreau & Alain Hertz & Gilbert Laporte, 1992. "New Insertion and Postoptimization Procedures for the Traveling Salesman Problem," Operations Research, INFORMS, vol. 40(6), pages 1086-1094, December.
    8. 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.
    9. 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.
    10. 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.
    11. 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.
    12. Gilbert Laporte, 2009. "Fifty Years of Vehicle Routing," Transportation Science, INFORMS, vol. 43(4), pages 408-416, November.
    13. López-Sánchez, A.D. & Hernández-Díaz, A.G. & Vigo, D. & Caballero, R. & Molina, J., 2014. "A multi-start algorithm for a balanced real-world Open Vehicle Routing Problem," European Journal of Operational Research, Elsevier, vol. 238(1), pages 104-113.
    14. Ali, Tarab H. & Radhakrishnan, Sridhar & Pulat, Simin & Gaddipati, Nagaiah C., 2002. "Relay network design in freight transportation systems," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 38(6), pages 405-422, November.
    15. Halit Üster & Panitan Kewcharoenwong, 2011. "Strategic Design and Analysis of a Relay Network in Truckload Transportation," Transportation Science, INFORMS, vol. 45(4), pages 505-523, November.
    16. 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.
    17. Fleszar, Krzysztof & Osman, Ibrahim H. & Hindi, Khalil S., 2009. "A variable neighbourhood search algorithm for the open vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 195(3), pages 803-809, June.
    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. Ling Shen & Fengming Tao & Songyi Wang, 2018. "Multi-Depot Open Vehicle Routing Problem with Time Windows Based on Carbon Trading," IJERPH, MDPI, vol. 15(9), pages 1-20, September.
    2. Babagolzadeh, Mahla & Zhang, Yahua & Abbasi, Babak & Shrestha, Anup & Zhang, Anming, 2022. "Promoting Australian regional airports with subsidy schemes: Optimised downstream logistics using vehicle routing problem," Transport Policy, Elsevier, vol. 128(C), pages 38-51.
    3. Alcaraz, Juan J. & Caballero-Arnaldos, Luis & Vales-Alonso, Javier, 2019. "Rich vehicle routing problem with last-mile outsourcing decisions," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 129(C), pages 263-286.
    4. Brandão, José, 2020. "A memory-based iterated local search algorithm for the multi-depot open vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 284(2), pages 559-571.
    5. Yunyun Niu & Zehua Yang & Ping Chen & Jianhua Xiao, 2018. "A Hybrid Tabu Search Algorithm for a Real-World Open Vehicle Routing Problem Involving Fuel Consumption Constraints," Complexity, Hindawi, vol. 2018, pages 1-12, February.
    6. Ali Heidari & Din Mohammad Imani & Mohammad Khalilzadeh & Mahdieh Sarbazvatan, 2023. "Green two-echelon closed and open location-routing problem: application of NSGA-II and MOGWO metaheuristic approaches," Environment, Development and Sustainability: A Multidisciplinary Approach to the Theory and Practice of Sustainable Development, Springer, vol. 25(9), pages 9163-9199, September.
    7. Zhen, Lu & Tan, Zheyi & Wang, Shuaian & Yi, Wen & Lyu, Junyan, 2021. "Shared mobility oriented open vehicle routing with order radius decision," Transportation Research Part A: Policy and Practice, Elsevier, vol. 144(C), pages 19-33.

    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. Dasdemir, Erdi & Testik, Murat Caner & Öztürk, Diclehan Tezcaner & Şakar, Ceren Tuncer & Güleryüz, Güldal & Testik, Özlem Müge, 2022. "A multi-objective open vehicle routing problem with overbooking: Exact and heuristic solution approaches for an employee transportation problem," Omega, Elsevier, vol. 108(C).
    2. Brandão, José, 2020. "A memory-based iterated local search algorithm for the multi-depot open vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 284(2), pages 559-571.
    3. 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.
    4. 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.
    5. Yunyun Niu & Zehua Yang & Rong Wen & Jianhua Xiao & Shuai Zhang, 2022. "Solving the Green Open Vehicle Routing Problem Using a Membrane-Inspired Hybrid Algorithm," Sustainability, MDPI, vol. 14(14), pages 1-22, July.
    6. 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.
    7. 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.
    8. 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.
    9. X-Y Li & P Tian & S C H Leung, 2009. "An ant colony optimization metaheuristic hybridized with tabu search for open vehicle routing problems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(7), pages 1012-1025, July.
    10. Fleszar, Krzysztof & Osman, Ibrahim H. & Hindi, Khalil S., 2009. "A variable neighbourhood search algorithm for the open vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 195(3), pages 803-809, June.
    11. Liu, Ran & Jiang, Zhibin, 2012. "The close–open mixed vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 220(2), pages 349-360.
    12. Ling Shen & Fengming Tao & Songyi Wang, 2018. "Multi-Depot Open Vehicle Routing Problem with Time Windows Based on Carbon Trading," IJERPH, MDPI, vol. 15(9), pages 1-20, September.
    13. 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.
    14. 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.
    15. 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.
    16. 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.
    17. Aderemi Oluyinka Adewumi & Olawale Joshua Adeleke, 2018. "A survey of recent advances in vehicle routing problems," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 9(1), pages 155-172, February.
    18. Jesús Sánchez-Oro & Ana D. López-Sánchez & J. Manuel Colmenar, 2020. "A general variable neighborhood search for solving the multi-objective open vehicle routing problem," Journal of Heuristics, Springer, vol. 26(3), pages 423-452, June.
    19. N. Norouzi & R. Tavakkoli-Moghaddam & M. Ghazanfari & M. Alinaghian & A. Salamatbakhsh, 2012. "A New Multi-objective Competitive Open Vehicle Routing Problem Solved by Particle Swarm Optimization," Networks and Spatial Economics, Springer, vol. 12(4), pages 609-633, December.
    20. Zhen, Lu & Tan, Zheyi & Wang, Shuaian & Yi, Wen & Lyu, Junyan, 2021. "Shared mobility oriented open vehicle routing with order radius decision," Transportation Research Part A: Policy and Practice, Elsevier, vol. 144(C), pages 19-33.

    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:eee:ejores:v:265:y:2018:i:1:p:316-327. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.