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

Transformations of node‐balanced routing problems

Author

Listed:
  • Antonio Martinez‐Sykora
  • Tolga Bektaş

Abstract

This article describes a polynomial transformation for a class of unit‐demand vehicle routing problems, named node‐balanced routing problems (BRP), where the number of nodes on each route is restricted to be in an interval such that the workload across the routes is balanced. The transformation is general in that it can be applied to single or multiple depot, homogeneous or heterogeneous fleet BRPs, and any combination thereof. At the heart of the procedure lies transforming the BRP into a generalized traveling salesman problem (TSP), which can then be transformed into a TSP. The transformed graph exhibits special properties which can be exploited to significantly reduce the number of arcs, and used to construct a formulation for the resulting TSP that amounts to no more than that of a constrained assignment problem. Computational results on a number of instances are presented. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 370–387, 2015

Suggested Citation

  • Antonio Martinez‐Sykora & Tolga Bektaş, 2015. "Transformations of node‐balanced routing problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 62(5), pages 370-387, August.
    • Handle: RePEc:wly:navres:v:62:y:2015:i:5:p:370-387
    DOI: 10.1002/nav.21634
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.21634
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.21634?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. Yang GuoXing, 1995. "Transformation of multidepot multisalesmen problem to the standard travelling salesman problem," European Journal of Operational Research, Elsevier, vol. 81(3), pages 557-560, March.
    2. Laporte, Gilbert, 1992. "The traveling salesman problem: An overview of exact and approximate algorithms," European Journal of Operational Research, Elsevier, vol. 59(2), pages 231-247, June.
    3. M. R. Rao, 1980. "Technical Note—A Note on the Multiple Traveling Salesmen Problem," Operations Research, INFORMS, vol. 28(3-part-i), pages 628-632, June.
    4. Bektaş, Tolga, 2012. "Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing," European Journal of Operational Research, Elsevier, vol. 216(1), pages 83-93.
    5. Gilbert Laporte, 2007. "What you should know about the vehicle routing problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(8), pages 811-819, December.
    6. Kritikos, Manolis N. & Ioannou, George, 2010. "The balanced cargo vehicle routing problem with time windows," International Journal of Production Economics, Elsevier, vol. 123(1), pages 42-51, January.
    7. Hu, Chao-Fang & Teng, Chang-Jun & Li, Shao-Yuan, 2007. "A fuzzy goal programming approach to multi-objective optimization problem with priorities," European Journal of Operational Research, Elsevier, vol. 176(3), pages 1319-1333, February.
    8. Calvete, Herminia I. & Gale, Carmen & Oliveros, Maria-Jose & Sanchez-Valverde, Belen, 2007. "A goal programming approach to vehicle routing problems with soft time windows," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1720-1733, March.
    9. Roy Jonker & Ton Volgenant, 1988. "Technical Note—An Improved Transformation of the Symmetric Multiple Traveling Salesman Problem," Operations Research, INFORMS, vol. 36(1), pages 163-167, February.
    10. Saman Hong & Manfred W. Padberg, 1977. "Technical Note—A Note on the Symmetric Multiple Traveling Salesman Problem with Fixed Charges," Operations Research, INFORMS, vol. 25(5), pages 871-874, October.
    11. Laporte, Gilbert, 1992. "The vehicle routing problem: An overview of exact and approximate algorithms," European Journal of Operational Research, Elsevier, vol. 59(3), pages 345-358, 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. Dong, Xiaoyang & Zhang, Bin & Wang, Zhaohua, 2023. "Impact of land use on bike-sharing travel patterns: Evidence from large scale data analysis in China," Land Use Policy, Elsevier, vol. 133(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. José Alejandro Cornejo-Acosta & Jesús García-Díaz & Julio César Pérez-Sansalvador & Carlos Segura, 2023. "Compact Integer Programs for Depot-Free Multiple Traveling Salesperson Problems," Mathematics, MDPI, vol. 11(13), pages 1-25, July.
    2. Castellano, Davide & Gallo, Mosè & Grassi, Andrea & Santillo, Liberatina C., 2019. "The effect of GHG emissions on production, inventory replenishment and routing decisions in a single vendor-multiple buyers supply chain," International Journal of Production Economics, Elsevier, vol. 218(C), pages 30-42.
    3. del Castillo, Jose M., 1998. "A heuristic for the traveling salesman problem based on a continuous approximation," Transportation Research Part B: Methodological, Elsevier, vol. 33(2), pages 123-152, April.
    4. Said Dabia & Stefan Ropke & Tom van Woensel, 2019. "Cover Inequalities for a Vehicle Routing Problem with Time Windows and Shifts," Transportation Science, INFORMS, vol. 53(5), pages 1354-1371, September.
    5. 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.
    6. Crainic, Teodor Gabriel & Laporte, Gilbert, 1997. "Planning models for freight transportation," European Journal of Operational Research, Elsevier, vol. 97(3), pages 409-438, March.
    7. Baker, Barrie M. & Sheasby, Janice, 1999. "Extensions to the generalised assignment heuristic for vehicle routing," European Journal of Operational Research, Elsevier, vol. 119(1), pages 147-157, November.
    8. Burger, M. & Su, Z. & De Schutter, B., 2018. "A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem," European Journal of Operational Research, Elsevier, vol. 265(2), pages 463-477.
    9. Sébastien Mouthuy & Florence Massen & Yves Deville & Pascal Van Hentenryck, 2015. "A Multistage Very Large-Scale Neighborhood Search for the Vehicle Routing Problem with Soft Time Windows," Transportation Science, INFORMS, vol. 49(2), pages 223-238, May.
    10. Renaud, Jacques & Boctor, Fayez F., 2002. "A sweep-based algorithm for the fleet size and mix vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 140(3), pages 618-628, August.
    11. C E Cortés & M Gendreau & D Leng & A Weintraub, 2011. "A simulation-based approach for fleet design in a technician dispatch problem with stochastic demand," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(8), pages 1510-1523, August.
    12. Teodor Gabriel Crainic & Federico Malucelli & Maddalena Nonato & François Guertin, 2005. "Meta-Heuristics for a Class of Demand-Responsive Transit Systems," INFORMS Journal on Computing, INFORMS, vol. 17(1), pages 10-24, February.
    13. Said Dabia & David Lai & Daniele Vigo, 2019. "An Exact Algorithm for a Rich Vehicle Routing Problem with Private Fleet and Common Carrier," Transportation Science, INFORMS, vol. 53(4), pages 986-1000, July.
    14. Guodong Yu & Yu Yang, 2019. "Dynamic routing with real-time traffic information," Operational Research, Springer, vol. 19(4), pages 1033-1058, December.
    15. Berkoune, Djamel & Renaud, Jacques & Rekik, Monia & Ruiz, Angel, 2012. "Transportation in disaster response operations," Socio-Economic Planning Sciences, Elsevier, vol. 46(1), pages 23-32.
    16. Said Dabia & Stefan Ropke & Tom van Woensel & Ton De Kok, 2013. "Branch and Price for the Time-Dependent Vehicle Routing Problem with Time Windows," Transportation Science, INFORMS, vol. 47(3), pages 380-396, August.
    17. Sam Thangiah & Adel Fergany & Salman Awan, 2007. "Real-time split-delivery pickup and delivery time window problems with transfers," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 15(4), pages 329-349, November.
    18. Marie-Claude Bolduc & Jacques Renaud & Benoit Montreuil, 2006. "Synchronized routing of seasonal products through a production/distribution network," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 14(2), pages 209-228, June.
    19. Masoumeh Mahdieh & Alistair Clark & Mehdi Bijari, 2018. "A novel flexible model for lot sizing and scheduling with non-triangular, period overlapping and carryover setups in different machine configurations," Flexible Services and Manufacturing Journal, Springer, vol. 30(4), pages 884-923, December.
    20. He, Pengfei & Hao, Jin-Kao, 2023. "Memetic search for the minmax multiple traveling salesman problem with single and multiple depots," European Journal of Operational Research, Elsevier, vol. 307(3), pages 1055-1070.

    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:62:y:2015:i:5:p:370-387. 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.