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

A distribution-free TSP tour length estimation model for random graphs

Author

Listed:
  • Çavdar, Bahar
  • Sokol, Joel

Abstract

Traveling Salesman Problem (TSP) tour length estimations can be used when it is not necessary to know an exact tour, e.g., when using certain heuristics to solve location-routing problems. The best estimation models in the TSP literature focus on random instances where the node dispersion is known; those that do not require knowledge of node dispersion are either less accurate or slower. In this paper, we develop a new regression-based tour length estimation model that is distribution-free, accurate, and fast, with a small standard deviation of the estimation errors. When the distribution of the node coordinates is known, it provides a close estimate of the well-known asymptotic tour length estimation formula of Beardwood et al. (1959); more importantly, when the distribution is unknown or non-integrable so Beardwood et al.’s estimation cannot be used, our model still provides good, fast tour length estimates.

Suggested Citation

  • Çavdar, Bahar & Sokol, Joel, 2015. "A distribution-free TSP tour length estimation model for random graphs," European Journal of Operational Research, Elsevier, vol. 243(2), pages 588-598.
    • Handle: RePEc:eee:ejores:v:243:y:2015:i:2:p:588-598
    DOI: 10.1016/j.ejor.2014.12.020
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221714010212
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2014.12.020?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. Helsgaun, Keld, 2000. "An effective implementation of the Lin-Kernighan traveling salesman heuristic," European Journal of Operational Research, Elsevier, vol. 126(1), pages 106-130, October.
    2. Nagy, Gabor & Salhi, Said, 2007. "Location-routing: Issues, models and methods," European Journal of Operational Research, Elsevier, vol. 177(2), pages 649-672, March.
    3. Daganzo, Carlos F., 1984. "The length of tours in zones of different shapes," Transportation Research Part B: Methodological, Elsevier, vol. 18(2), pages 135-145, April.
    4. Robuste, Francesc & Daganzo, Carlos F. & Souleyrette, Reginald R., 1990. "Implementing vehicle routing models," Transportation Research Part B: Methodological, Elsevier, vol. 24(4), pages 263-286, August.
    5. 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.
    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. Sheng Liu & Long He & Zuo-Jun Max Shen, 2021. "On-Time Last-Mile Delivery: Order Assignment with Travel-Time Predictors," Management Science, INFORMS, vol. 67(7), pages 4095-4119, July.
    2. Wang, Tao & Guo, Jia & Zhang, Wei & Wang, Kai & Qu, Xiaobo, 2024. "On the planning of zone-based electric on-demand minibus," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 186(C).
    3. 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.
    4. Ansari, Sina & Başdere, Mehmet & Li, Xiaopeng & Ouyang, Yanfeng & Smilowitz, Karen, 2018. "Advancements in continuous approximation models for logistics and transportation systems: 1996–2016," Transportation Research Part B: Methodological, Elsevier, vol. 107(C), pages 229-252.
    5. Baller, Annelieke C. & Dabia, Said & Dullaert, Wout E.H. & Vigo, Daniele, 2019. "The Dynamic-Demand Joint Replenishment Problem with Approximated Transportation Costs," European Journal of Operational Research, Elsevier, vol. 276(3), pages 1013-1033.
    6. 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.
    7. Atieh Madani & Rajan Batta & Mark Karwan, 2021. "The balancing traveling salesman problem: application to warehouse order picking," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 29(2), pages 442-469, July.
    8. Anna Franceschetti & Ola Jabali & Gilbert Laporte, 2017. "Continuous approximation models in freight distribution management," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 25(3), pages 413-433, October.
    9. Ye, Anke & Zhang, Kenan & Chen, Xiqun (Michael) & Bell, Michael G.H. & Lee, Der-Horng & Hu, Simon, 2024. "Modeling and managing an on-demand meal delivery system with order bundling," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 187(C).
    10. Wang, Li & Xu, Min & Qin, Hu, 2023. "Joint optimization of parcel allocation and crowd routing for crowdsourced last-mile delivery," Transportation Research Part B: Methodological, Elsevier, vol. 171(C), pages 111-135.
    11. Pahwa, Anmol & Jaller, Miguel, 2022. "A cost-based comparative analysis of different last-mile strategies for e-commerce delivery," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 164(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. Lei, Chao & Ouyang, Yanfeng, 2018. "Continuous approximation for demand balancing in solving large-scale one-commodity pickup and delivery problems," Transportation Research Part B: Methodological, Elsevier, vol. 109(C), pages 90-109.
    2. Ouyang, Yanfeng, 2007. "Design of vehicle routing zones for large-scale distribution systems," Transportation Research Part B: Methodological, Elsevier, vol. 41(10), pages 1079-1093, December.
    3. Estrada, Miquel & Roca-Riu, Mireia, 2017. "Stakeholder’s profitability of carrier-led consolidation strategies in urban goods distribution," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 104(C), pages 165-188.
    4. Schaumann, Sarah K. & Bergmann, Felix M. & Wagner, Stephan M. & Winkenbach, Matthias, 2023. "Route efficiency implications of time windows and vehicle capacities in first- and last-mile logistics," European Journal of Operational Research, Elsevier, vol. 311(1), pages 88-111.
    5. Tobias Harks & Felix G König & Jannik Matuschke, 2013. "Approximation Algorithms for Capacitated Location Routing," Transportation Science, INFORMS, vol. 47(1), pages 3-22, February.
    6. Diana, Marco & Dessouky, Maged M. & Xia, Nan, 2006. "A model for the fleet sizing of demand responsive transportation services with time windows," Transportation Research Part B: Methodological, Elsevier, vol. 40(8), pages 651-666, September.
    7. Haughton, Michael A., 1998. "The performance of route modification and demand stabilization strategies in stochastic vehicle routing," Transportation Research Part B: Methodological, Elsevier, vol. 32(8), pages 551-566, November.
    8. Drexl, M. & Schneider, M., 2014. "A Survey of the Standard Location-Routing Problem," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 65940, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    9. Silva, Allyson & Coelho, Leandro C. & Darvish, Maryam & Renaud, Jacques, 2020. "Integrating storage location and order picking problems in warehouse planning," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 140(C).
    10. Jabali, Ola & Gendreau, Michel & Laporte, Gilbert, 2012. "A continuous approximation model for the fleet composition problem," Transportation Research Part B: Methodological, Elsevier, vol. 46(10), pages 1591-1606.
    11. Bergmann, Felix M. & Wagner, Stephan M. & Winkenbach, Matthias, 2020. "Integrating first-mile pickup and last-mile delivery on shared vehicle routes for efficient urban e-commerce distribution," Transportation Research Part B: Methodological, Elsevier, vol. 131(C), pages 26-62.
    12. Janjevic, Milena & Merchán, Daniel & Winkenbach, Matthias, 2021. "Designing multi-tier, multi-service-level, and multi-modal last-mile distribution networks for omni-channel operations," European Journal of Operational Research, Elsevier, vol. 294(3), pages 1059-1077.
    13. Michael Schneider & Michael Drexl, 2017. "A survey of the standard location-routing problem," Annals of Operations Research, Springer, vol. 259(1), pages 389-414, December.
    14. Arslan, Okan, 2021. "The location-or-routing problem," Transportation Research Part B: Methodological, Elsevier, vol. 147(C), pages 1-21.
    15. G Laporte, 2010. "A concise guide to the Traveling Salesman Problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(1), pages 35-40, January.
    16. Turkensteen, Marcel & Klose, Andreas, 2012. "Demand dispersion and logistics costs in one-to-many distribution systems," European Journal of Operational Research, Elsevier, vol. 223(2), pages 499-507.
    17. Langevin, André & Mbaraga, Pontien & Campbell, James F., 1996. "Continuous approximation models in freight distribution: An overview," Transportation Research Part B: Methodological, Elsevier, vol. 30(3), pages 163-188, June.
    18. John Gunnar Carlsson & Fan Jia, 2015. "Continuous Facility Location with Backbone Network Costs," Transportation Science, INFORMS, vol. 49(3), pages 433-451, August.
    19. Weijun Xie & Yanfeng Ouyang & Sze Chun Wong, 2016. "Reliable Location-Routing Design Under Probabilistic Facility Disruptions," Transportation Science, INFORMS, vol. 50(3), pages 1128-1138, August.
    20. Liwei Zeng & Sunil Chopra & Karen Smilowitz, 2019. "The Covering Path Problem on a Grid," Transportation Science, INFORMS, vol. 53(6), pages 1656-1672, November.

    More about this item

    Keywords

    TSP; Tour length estimation;

    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:eee:ejores:v:243:y:2015:i:2:p:588-598. 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.