IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v53y2012i3p711-728.html
   My bibliography  Save this article

Computing the variance of tour costs over the solution space of the TSP in polynomial time

Author

Listed:
  • Paul Sutcliffe
  • Andrew Solomon
  • Jenny Edwards

Abstract

We give an O(n 2 ) time algorithm to find the population variance of tour costs over the solution space of the n city symmetric Traveling Salesman Problem (TSP). The algorithm has application in both the stochastic case, where the problem is specified in terms of edge costs which are pairwise independently distributed random variables with known mean and variance, and the numeric edge cost case. We apply this result to provide empirical evidence that, in a range of real world problem sets, the optimal tour cost correlates with a simple function of the mean and variance of tour costs. Copyright Springer Science+Business Media, LLC 2012

Suggested Citation

  • Paul Sutcliffe & Andrew Solomon & Jenny Edwards, 2012. "Computing the variance of tour costs over the solution space of the TSP in polynomial time," Computational Optimization and Applications, Springer, vol. 53(3), pages 711-728, December.
  • Handle: RePEc:spr:coopap:v:53:y:2012:i:3:p:711-728
    DOI: 10.1007/s10589-012-9472-0
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10589-012-9472-0
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1007/s10589-012-9472-0?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. Richard M. Karp, 1977. "Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane," Mathematics of Operations Research, INFORMS, vol. 2(3), pages 209-224, August.
    2. Alan Frieze, 2004. "On Random Symmetric Travelling Salesman Problems," Mathematics of Operations Research, INFORMS, vol. 29(4), pages 878-890, November.
    Full references (including those not matched with items on IDEAS)

    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. Kusum Deep & Hadush Mebrahtu & Atulya K. Nagar, 2018. "Novel GA for metropolitan stations of Indian railways when modelled as a TSP," 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(3), pages 639-645, June.
    2. Lenstra, J. K. & Rinnooy Kan, A. H. G., 1979. "Complexity Of Vehicle Routing And Scheduling Problems," Econometric Institute Archives 272191, Erasmus University Rotterdam.
    3. E A Silver, 2004. "An overview of heuristic solution methods," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(9), pages 936-956, September.
    4. Shoshana Anily, 1996. "The vehicle‐routing problem with delivery and back‐haul options," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(3), pages 415-434, April.
    5. 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.
    6. Hirofumi Matsuo, 1990. "Cyclic sequencing problems in the two‐machine permutation flow shop: Complexity, worst‐case, and average‐case analysis," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(5), pages 679-694, October.
    7. 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.
    8. Awi Federgruen & Michal Tzur, 1999. "Time‐partitioning heuristics: Application to one warehouse, multiitem, multiretailer lot‐sizing problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(5), pages 463-486, August.
    9. Zachariasen, Martin, 1999. "Local search for the Steiner tree problem in the Euclidean plane," European Journal of Operational Research, Elsevier, vol. 119(2), pages 282-300, December.
    10. Daganzo, Carlos F. & Smilowitz, Karen R., 2000. "Asymptotic Approximations for the Transportation LP and Other Scalable Network Problems," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt3dn2j66w, Institute of Transportation Studies, UC Berkeley.
    11. Tzur, Michal & Drezner, Ehud, 2011. "A lookahead partitioning heuristic for a new assignment and scheduling problem in a distribution system," European Journal of Operational Research, Elsevier, vol. 215(2), pages 325-336, December.
    12. Thomas L. Magnanti, 2021. "Optimization: From Its Inception," Management Science, INFORMS, vol. 67(9), pages 5349-5363, September.
    13. Jamal Ouenniche & Prasanna K. Ramaswamy & Michel Gendreau, 2017. "A dual local search framework for combinatorial optimization problems with TSP application," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(11), pages 1377-1398, November.
    14. Orlin, James B., 1953-. & Ahuja, Ravindra K., 1956-., 1988. "New scaling algorithms for the assignment and minimum cycle mean problems," Working papers 2019-88., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    15. Shoshana Anily & Julien Bramel, 2004. "A probabilistic analysis of a fixed partition policy for the inventory‐routing problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 51(7), pages 925-948, October.
    16. 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.
    17. Carlos Daganzo & Karen Smilowitz, 2006. "A note on asymptotic formulae for one-dimensional network flow problems," Annals of Operations Research, Springer, vol. 144(1), pages 153-160, April.
    18. Daganzo, Carlos F & Smilowitz, Karen R, 2000. "Asymptotic Approximations for the Transportation LP and Other Scalable Network Problems," University of California Transportation Center, Working Papers qt7wb1g4z7, University of California Transportation Center.
    19. El-Ghazali Talbi, 2016. "Combining metaheuristics with mathematical programming, constraint programming and machine learning," Annals of Operations Research, Springer, vol. 240(1), pages 171-215, May.
    20. David Simchi-Levi, 2014. "OM Forum —OM Research: From Problem-Driven to Data-Driven Research," Manufacturing & Service Operations Management, INFORMS, vol. 16(1), pages 2-10, February.

    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:spr:coopap:v:53:y:2012:i:3:p:711-728. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.