IDEAS home Printed from https://ideas.repec.org/a/eee/transb/v33y1998i2p123-152.html
   My bibliography  Save this article

A heuristic for the traveling salesman problem based on a continuous approximation

Author

Listed:
  • del Castillo, Jose M.

Abstract

A procedure for solving, suboptimally, the traveling salesman problem is presented. The set of points on the traveling salesman tour is distributed over a region having the shape of a circular or ring sector. The procedure is based on an optimal partition of the sector and reduces the tour construction to a sorting problem. Namely, the tour is constructed by visiting the points in radial or angular order depending on the part of the sector on which they are located. The optimal partition is derived by a continuous approximation of the set of points. It is defined by a single parameter and simple analytical expressions for it are obtained. A great number of numerical tests were carried out to evaluate the performance of the procedure. These tests allowed a measure of the difference from the optimum solution that could be obtained for problems up to a few hundred points. The results show that the euclidean length of the tours produced by the partition procedure grows, on average, like , where A is the region area and N the number of points. The initial tours are improved by means of the Or's algorithm and the final tours obtained are nearly as good as those given by more intrincate improvement heuristics. The whole procedure, that is, the tour construction and improvement heuristics, is rather simple to implement on a computer, which makes it very appealing to use in routing software.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:transb:v:33:y:1998:i:2:p:123-152
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0191-2615(98)00034-4
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Ong, H. L. & Huang, H. C., 1989. "Asymptotic expected performance of some TSP heuristics: An empirical evaluation," European Journal of Operational Research, Elsevier, vol. 43(2), pages 231-238, November.
    2. Newell, Gordon F. & Daganzo, Carlos F., 1986. "Design of multiple-vehicle delivery tours--I a ring-radial network," Transportation Research Part B: Methodological, Elsevier, vol. 20(5), pages 345-363, October.
    3. Langevin, André & Soumis, François, 1989. "Design of multiple-vehicle delivery tours satisfying time constraints," Transportation Research Part B: Methodological, Elsevier, vol. 23(2), pages 123-138, April.
    4. 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.
    5. 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.
    6. 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.
    7. 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. Ç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.
    2. Melih Çelik & Özlem Ergun & Pınar Keskinocak, 2015. "The Post-Disaster Debris Clearance Problem Under Incomplete Information," Operations Research, INFORMS, vol. 63(1), pages 65-85, February.

    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. 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.
    2. 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.
    3. Novaes, Antonio G. N. & Graciolli, Odacir D., 1999. "Designing multi-vehicle delivery tours in a grid-cell format," European Journal of Operational Research, Elsevier, vol. 119(3), pages 613-634, December.
    4. 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.
    5. 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.
    6. 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.
    7. Franceschetti, Anna & Honhon, Dorothée & Laporte, Gilbert & Woensel, Tom Van & Fransoo, Jan C., 2017. "Strategic fleet planning for city logistics," Transportation Research Part B: Methodological, Elsevier, vol. 95(C), pages 19-40.
    8. Mehdi Nourinejad & Matthew J. Roorda, 2017. "A continuous approximation model for the fleet composition problem on the rectangular grid," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(2), pages 373-401, March.
    9. 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.
    10. 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.
    11. John Gunnar Carlsson & Fan Jia, 2015. "Continuous Facility Location with Backbone Network Costs," Transportation Science, INFORMS, vol. 49(3), pages 433-451, August.
    12. Qi, Mingyao & Lin, Wei-Hua & Li, Nan & Miao, Lixin, 2012. "A spatiotemporal partitioning approach for large-scale vehicle routing problems with time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(1), pages 248-257.
    13. 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.
    14. Edward Kim, M. & Schonfeld, Paul & Roche, Austin & Raleigh, Chelsie, 2022. "Optimal service zones and frequencies for flexible-route freight deliveries," Transportation Research Part A: Policy and Practice, Elsevier, vol. 159(C), pages 182-199.
    15. Ellegood, William A. & Campbell, James F. & North, Jeremy, 2015. "Continuous approximation models for mixed load school bus routing," Transportation Research Part B: Methodological, Elsevier, vol. 77(C), pages 182-198.
    16. 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.
    17. 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.
    18. Carlos F. Daganzo & Karen R. Smilowitz, 2004. "Bounds and Approximations for the Transportation Problem of Linear Programming and Other Scalable Network Problems," Transportation Science, INFORMS, vol. 38(3), pages 343-356, August.
    19. 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.
    20. Ouyang, Yanfeng & Wang, Zhaodong & Yang, Hai, 2015. "Facility location design under continuous traffic equilibrium," Transportation Research Part B: Methodological, Elsevier, vol. 81(P1), pages 18-33.

    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:eee:transb:v:33:y:1998:i:2:p:123-152. 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/548/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.