IDEAS home Printed from https://ideas.repec.org/a/eee/jomega/v103y2021ics0305048321000517.html
   My bibliography  Save this article

A Heuristic Algorithm for solving a large-scale real-world territory design problem

Author

Listed:
  • Zhou, Lin
  • Zhen, Lu
  • Baldacci, Roberto
  • Boschetti, Marco
  • Dai, Ying
  • Lim, Andrew

Abstract

In this work, we present and evaluate heuristic techniques for a real-world territory design problem of a major dairy company which produces and distributes perishable products. The problem calls for grouping customers into geographic districts, with the objective of minimising the total operational cost, computed as a function of the fixed costs of the districts and the routing costs. Two inter-connected decision levels have to be tackled: partitioning customers into districts and routing vehicles according to complex operational constraints. To solve the problem, a hybrid multi-population genetic algorithm is designed, enhanced with several evolution and search techniques. The proposed design is extensively tested on instances derived from the literature and on real-world large-scale instances, involving more than 1000 customers. The results show the effectiveness of the different components of the algorithm and the feedback from the company’s planners confirms that it produces high-quality, operational solutions. Additionally, we explore some managerial findings with respect to the adoption of alternative objectives and service requirements.

Suggested Citation

  • Zhou, Lin & Zhen, Lu & Baldacci, Roberto & Boschetti, Marco & Dai, Ying & Lim, Andrew, 2021. "A Heuristic Algorithm for solving a large-scale real-world territory design problem," Omega, Elsevier, vol. 103(C).
    • Handle: RePEc:eee:jomega:v:103:y:2021:i:c:s0305048321000517
    DOI: 10.1016/j.omega.2021.102442
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0305048321000517
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.omega.2021.102442?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. Yanfeng Ouyang & Carlos F. Daganzo, 2006. "Discretization and Validation of the Continuum Approximation Scheme for Terminal System Design," Transportation Science, INFORMS, vol. 40(1), pages 89-98, February.
    2. Sudtachat, Kanchala & Mayorga, Maria E. & Mclay, Laura A., 2016. "A nested-compliance table policy for emergency medical service systems under relocation," Omega, Elsevier, vol. 58(C), pages 154-168.
    3. Sebastián Moreno & Jordi Pereira & Wilfredo Yushimito, 2020. "A hybrid K-means and integer programming method for commercial territory design: a case study in meat distribution," Annals of Operations Research, Springer, vol. 286(1), pages 87-117, March.
    4. Thibaut Vidal & Teodor Gabriel Crainic & Michel Gendreau & Nadia Lahrichi & Walter Rei, 2012. "A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems," Operations Research, INFORMS, vol. 60(3), pages 611-624, June.
    5. Ilgaz Sungur & Yingtao Ren & Fernando Ordóñez & Maged Dessouky & Hongsheng Zhong, 2010. "A Model and Algorithm for the Courier Delivery Problem with Uncertainty," Transportation Science, INFORMS, vol. 44(2), pages 193-205, May.
    6. Dominik Goeke & Roberto Roberti & Michael Schneider, 2019. "Exact and Heuristic Solution of the Consistent Vehicle-Routing Problem," Transportation Science, INFORMS, vol. 53(4), pages 1023-1042, July.
    7. 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.
    8. María Salazar-Aguilar & Roger Ríos-Mercado & Mauricio Cabrera-Ríos, 2011. "New Models for Commercial Territory Design," Networks and Spatial Economics, Springer, vol. 11(3), pages 487-507, September.
    9. John Gunnar Carlsson, 2012. "Dividing a Territory Among Several Vehicles," INFORMS Journal on Computing, INFORMS, vol. 24(4), pages 565-577, November.
    10. Rodríguez-Martín, Inmaculada & Salazar-González, Juan-José & Yaman, Hande, 2019. "The periodic vehicle routing problem with driver consistency," European Journal of Operational Research, Elsevier, vol. 273(2), pages 575-584.
    11. Michel Gendreau & Alain Hertz & Gilbert Laporte & Mihnea Stan, 1998. "A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows," Operations Research, INFORMS, vol. 46(3), pages 330-335, June.
    12. M. Gaudioso & G. Paletta, 1992. "A Heuristic for the Periodic Vehicle Routing Problem," Transportation Science, INFORMS, vol. 26(2), pages 86-92, May.
    13. Irnich, S. & Schneider, M. & Vigo, D., 2014. "Four Variants of the Vehicle Routing Problem," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 63514, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    14. Anirudh Subramanyam & Chrysanthos E. Gounaris, 2018. "A Decomposition Algorithm for the Consistent Traveling Salesman Problem with Vehicle Idling," Transportation Science, INFORMS, vol. 52(2), pages 386-401, March.
    15. Tan, C.C.R. & Beasley, J.E., 1984. "A heuristic algorithm for the period vehicle routing problem," Omega, Elsevier, vol. 12(5), pages 497-504.
    16. John Gunnar Carlsson & Erick Delage, 2013. "Robust Partitioning for Stochastic Multivehicle Routing," Operations Research, INFORMS, vol. 61(3), pages 727-744, June.
    17. S. Lin & B. W. Kernighan, 1973. "An Effective Heuristic Algorithm for the Traveling-Salesman Problem," Operations Research, INFORMS, vol. 21(2), pages 498-516, April.
    18. Attila A. Kovacs & Bruce L. Golden & Richard F. Hartl & Sophie N. Parragh, 2015. "The Generalized Consistent Vehicle Routing Problem," Transportation Science, INFORMS, vol. 49(4), pages 796-816, November.
    19. Chris Groër & Bruce Golden & Edward Wasil, 2009. "The Consistent Vehicle Routing Problem," Manufacturing & Service Operations Management, INFORMS, vol. 11(4), pages 630-643, February.
    20. Marius M. Solomon, 1987. "Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints," Operations Research, INFORMS, vol. 35(2), pages 254-265, April.
    21. Karen Smilowitz & Maciek Nowak & Tingting Jiang, 2013. "Workforce Management in Periodic Delivery Operations," Transportation Science, INFORMS, vol. 47(2), pages 214-230, May.
    22. Jörg Kalcsics, 2015. "Districting Problems," Springer Books, in: Gilbert Laporte & Stefan Nickel & Francisco Saldanha da Gama (ed.), Location Science, edition 127, chapter 0, pages 595-622, Springer.
    23. Zhou, Lin & Baldacci, Roberto & Vigo, Daniele & Wang, Xu, 2018. "A Multi-Depot Two-Echelon Vehicle Routing Problem with Delivery Options Arising in the Last Mile Distribution," European Journal of Operational Research, Elsevier, vol. 265(2), pages 765-778.
    24. Enayati, Shakiba & Mayorga, Maria E. & Rajagopalan, Hari K. & Saydam, Cem, 2018. "Real-time ambulance redeployment approach to improve service coverage with fair and restricted workload for EMS providers," Omega, Elsevier, vol. 79(C), pages 67-80.
    25. Daniel Delahaye & Supatcha Chaimatanan & Marcel Mongeau, 2019. "Simulated Annealing: From Basics to Applications," International Series in Operations Research & Management Science, in: Michel Gendreau & Jean-Yves Potvin (ed.), Handbook of Metaheuristics, edition 3, chapter 0, pages 1-35, Springer.
    26. Steiner, Maria Teresinha Arns & Datta, Dilip & Steiner Neto, Pedro José & Scarpin, Cassius Tadeu & Rui Figueira, José, 2015. "Multi-objective optimization in partitioning the healthcare system of Parana State in Brazil," Omega, Elsevier, vol. 52(C), pages 53-64.
    27. Bender, Matthias & Meyer, Anne & Kalcsics, Jörg & Nickel, Stefan, 2016. "The multi-period service territory design problem – An introduction, a model and a heuristic approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 96(C), pages 135-157.
    28. Mulvey, John M. & Beck, Michael P., 1984. "Solving capacitated clustering problems," European Journal of Operational Research, Elsevier, vol. 18(3), pages 339-348, December.
    29. Matthias Bender & Jörg Kalcsics, 2020. "Multi-Period Service Territory Design," International Series in Operations Research & Management Science, in: Roger Z. Ríos-Mercado (ed.), Optimal Districting and Territory Design, chapter 0, pages 129-152, Springer.
    30. Carlos F. Daganzo, 1984. "The Distance Traveled to Visit N Points with a Maximum of C Stops per Vehicle: An Analytic Model and an Application," Transportation Science, INFORMS, vol. 18(4), pages 331-350, November.
    31. Hongsheng Zhong & Randolph W. Hall & Maged Dessouky, 2007. "Territory Planning and Vehicle Dispatching with Driver Learning," Transportation Science, INFORMS, vol. 41(1), pages 74-89, 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. Zhen, Lu & Gao, Jiajing & Tan, Zheyi & Laporte, Gilbert & Baldacci, Roberto, 2023. "Territorial design for customers with demand frequency," European Journal of Operational Research, Elsevier, vol. 309(1), pages 82-101.
    2. Ouyang, Zhiyuan & Leung, Eric Ka Ho & Huang, George Q., 2022. "Community logistics for dynamic vehicle dispatching: The effects of community departure “time” and “space”," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 165(C).
    3. Akbari, Leilanaz & Kazemi, Ahmad & Salari, Majid, 2023. "Operational planning of vehicles for rescue and relief operations considering the unavailability of the relocated vehicles," Socio-Economic Planning Sciences, Elsevier, vol. 88(C).
    4. Meyer, Anne & Glock, Katharina & Radaschewski, Frank, 2021. "Planning profitable tours for field sales forces: A unified view on sales analytics and mathematical optimization," Omega, Elsevier, vol. 105(C).
    5. Ouyang, Zhiyuan & Leung, Eric K.H. & Huang, George Q., 2023. "Community logistics and dynamic community partitioning: A new approach for solving e-commerce last mile delivery," European Journal of Operational Research, Elsevier, vol. 307(1), pages 140-156.
    6. Sandoval, M. Gabriela & Álvarez-Miranda, Eduardo & Pereira, Jordi & Ríos-Mercado, Roger Z. & Díaz, Juan A., 2022. "A novel districting design approach for on-time last-mile delivery: An application on an express postal company," Omega, Elsevier, vol. 113(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. Zhen, Lu & Gao, Jiajing & Tan, Zheyi & Laporte, Gilbert & Baldacci, Roberto, 2023. "Territorial design for customers with demand frequency," European Journal of Operational Research, Elsevier, vol. 309(1), pages 82-101.
    2. Vidal, Thibaut & Laporte, Gilbert & Matl, Piotr, 2020. "A concise guide to existing and emerging vehicle routing problem variants," European Journal of Operational Research, Elsevier, vol. 286(2), pages 401-416.
    3. Rodríguez-Martín, Inmaculada & Yaman, Hande, 2022. "Periodic Vehicle Routing Problem with Driver Consistency and service time optimization," Transportation Research Part B: Methodological, Elsevier, vol. 166(C), pages 468-484.
    4. Bender, Matthias & Kalcsics, Jörg & Meyer, Anne, 2020. "Districting for parcel delivery services – A two-Stage solution approach and a real-World case study," Omega, Elsevier, vol. 96(C).
    5. Li, Yifu & Zhou, Chenhao & Yuan, Peixue & Ngo, Thi Tu Anh, 2023. "Experience-based territory planning and driver assignment with predicted demand and driver present condition," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 171(C).
    6. Yao, Yu & Van Woensel, Tom & Veelenturf, Lucas P. & Mo, Pengli, 2021. "The consistent vehicle routing problem considering path consistency in a road network," Transportation Research Part B: Methodological, Elsevier, vol. 153(C), pages 21-44.
    7. Yang, Meng & Ni, Yaodong & Song, Qinyu, 2022. "Optimizing driver consistency in the vehicle routing problem under uncertain environment," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 164(C).
    8. Mancini, Simona & Gansterer, Margaretha & Hartl, Richard F., 2021. "The collaborative consistent vehicle routing problem with workload balance," European Journal of Operational Research, Elsevier, vol. 293(3), pages 955-965.
    9. Jost, Christian & Jungwirth, Alexander & Kolisch, Rainer & Schiffels, Sebastian, 2022. "Consistent vehicle routing with pickup decisions - Insights from sport academy training transfers," European Journal of Operational Research, Elsevier, vol. 298(1), pages 337-350.
    10. Soriano, Adria & Vidal, Thibaut & Gansterer, Margaretha & Doerner, Karl, 2020. "The vehicle routing problem with arrival time diversification on a multigraph," European Journal of Operational Research, Elsevier, vol. 286(2), pages 564-575.
    11. Michael Schneider & Andreas Stenger & Fabian Schwahn & Daniele Vigo, 2015. "Territory-Based Vehicle Routing in the Presence of Time-Window Constraints," Transportation Science, INFORMS, vol. 49(4), pages 732-751, November.
    12. Campelo, Pedro & Neves-Moreira, Fábio & Amorim, Pedro & Almada-Lobo, Bernardo, 2019. "Consistent vehicle routing problem with service level agreements: A case study in the pharmaceutical distribution sector," European Journal of Operational Research, Elsevier, vol. 273(1), pages 131-145.
    13. Schneider, Michael, 2016. "The vehicle-routing problem with time windows and driver-specific times," European Journal of Operational Research, Elsevier, vol. 250(1), pages 101-119.
    14. Ulmer, Marlin & Nowak, Maciek & Mattfeld, Dirk & Kaminski, Bogumił, 2020. "Binary driver-customer familiarity in service routing," European Journal of Operational Research, Elsevier, vol. 286(2), pages 477-493.
    15. Wu, Haotian & Savelsbergh, Martin & Huang, Yixiao, 2022. "Planning the city operations of a parcel express company," Omega, Elsevier, vol. 107(C).
    16. Jorge Oyola & Halvard Arntzen & David L. Woodruff, 2017. "The stochastic vehicle routing problem, a literature review, Part II: solution methods," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 6(4), pages 349-388, December.
    17. Rodríguez-Martín, Inmaculada & Salazar-González, Juan-José & Yaman, Hande, 2019. "The periodic vehicle routing problem with driver consistency," European Journal of Operational Research, Elsevier, vol. 273(2), pages 575-584.
    18. Huang, Yixiao & Savelsbergh, Martin & Zhao, Lei, 2018. "Designing logistics systems for home delivery in densely populated urban areas," Transportation Research Part B: Methodological, Elsevier, vol. 115(C), pages 95-125.
    19. 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.
    20. Nolz, Pamela C. & Absi, Nabil & Feillet, Dominique & Seragiotto, Clóvis, 2022. "The consistent electric-Vehicle routing problem with backhauls and charging management," European Journal of Operational Research, Elsevier, vol. 302(2), pages 700-716.

    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:jomega:v:103:y:2021:i:c:s0305048321000517. 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/wps/find/journaldescription.cws_home/375/description#description .

    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.