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

Tolerance-based Branch and Bound algorithms for the ATSP

Author

Listed:
  • Turkensteen, Marcel
  • Ghosh, Diptesh
  • Goldengorin, Boris
  • Sierksma, Gerard

Abstract

The selection of entries to be included/excluded in Branch and Bound algorithms is usually done on the basis of cost values. We consider the class of Depth First Search algorithms, and we propose to use upper tolerances to guide the search for optimal solutions. In spite of the fact that it needs time to calculate tolerances, our computational experiments for Asymmetric Traveling Salesman Problems show that in most situations tolerance-based algorithms outperform cost-based algorithms. The solution time reductions are mainly caused by the fact that the branching process becomes much more effective, so that optimal solutions are found in an earlier stage of the branching process. The use of tolerances also reveals why the widely used choice for branching on a smallest cycle in assignment solutions is on average the most effective one. Moreover, it turns out that tolerance-based DFS algorithms are better in solving difficult instances than the Best First Search algorithm from Carpaneto et al. [Carpaneto, G., Dell'Amico, M., Toth, P., 1995. Exact solution of large-scale asymmetric traveling salesman problems. ACM Transactions on Mathematical Software 21 (4), 394-409].

Suggested Citation

  • Turkensteen, Marcel & Ghosh, Diptesh & Goldengorin, Boris & Sierksma, Gerard, 2008. "Tolerance-based Branch and Bound algorithms for the ATSP," European Journal of Operational Research, Elsevier, vol. 189(3), pages 775-788, September.
    • Handle: RePEc:eee:ejores:v:189:y:2008:i:3:p:775-788
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(06)01184-2
    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. Gessner, Guy & Malhotra, Naresh K. & Kamakura, Wagner A. & Zmijewski, Mark E., 1988. "Estimating models with binary dependent variables: Some theoretical and empirical observations," Journal of Business Research, Elsevier, vol. 16(1), pages 49-65, January.
    2. Lin, Chi-Jen & Wen, Ue-Pyng, 2003. "Sensitivity analysis of the optimal assignment," European Journal of Operational Research, Elsevier, vol. 149(1), pages 35-46, August.
    3. Giorgio Carpaneto & Paolo Toth, 1980. "Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem," Management Science, INFORMS, vol. 26(7), pages 736-743, July.
    4. 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.
    5. Unknown, 1986. "Letters," Choices: The Magazine of Food, Farm, and Resource Issues, Agricultural and Applied Economics Association, vol. 1(4), pages 1-9.
    6. Lawrence Hubert & Phipps Arabie, 1985. "Comparing partitions," Journal of Classification, Springer;The Classification Society, vol. 2(1), pages 193-218, December.
    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. Vyacheslav V. Chistyakov & Panos M. Pardalos, 2015. "Stability Analysis in Discrete Optimization Involving Generalized Addition Operations," Journal of Optimization Theory and Applications, Springer, vol. 167(2), pages 585-616, November.
    2. Castro de Andrade, Rafael, 2016. "New formulations for the elementary shortest-path problem visiting a given set of nodes," European Journal of Operational Research, Elsevier, vol. 254(3), pages 755-768.
    3. Almoustafa, Samira & Hanafi, Said & Mladenović, Nenad, 2013. "New exact method for large asymmetric distance-constrained vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 226(3), pages 386-394.
    4. 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.

    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. Almoustafa, Samira & Hanafi, Said & Mladenović, Nenad, 2013. "New exact method for large asymmetric distance-constrained vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 226(3), pages 386-394.
    2. Marcel Turkensteen & Dmitry Malyshev & Boris Goldengorin & Panos M. Pardalos, 2017. "The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems," Journal of Global Optimization, Springer, vol. 68(3), pages 601-622, July.
    3. 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.
    4. Król, Michał, 2012. "Product differentiation decisions under ambiguous consumer demand and pessimistic expectations," International Journal of Industrial Organization, Elsevier, vol. 30(6), pages 593-604.
    5. G. Sujatha, 2018. "‘Is It Family or Politics?’ Reflections on Gender and the Modern Tamil Subjectivity Constitution in the Discourse of C. N. Annadurai," Studies in Indian Politics, , vol. 6(2), pages 267-281, December.
    6. repec:dgr:rugsom:04a27 is not listed on IDEAS
    7. Sergio Sousa, 2010. "Small-scale changes in wealth and attitudes toward risk," Discussion Papers 2010-11, The Centre for Decision Research and Experimental Economics, School of Economics, University of Nottingham.
    8. Laczó, Sarolta & Rossi, Raffaele, 2020. "Time-consistent consumption taxation," Journal of Monetary Economics, Elsevier, vol. 114(C), pages 194-220.
    9. Pratap, Sangeeta & Urrutia, Carlos, 2004. "Firm dynamics, investment and debt portfolio: balance sheet effects of the Mexican crisis of 1994," Journal of Development Economics, Elsevier, vol. 75(2), pages 535-563, December.
    10. D’Erasmo, P. & Mendoza, E.G. & Zhang, J., 2016. "What is a Sustainable Public Debt?," Handbook of Macroeconomics, in: J. B. Taylor & Harald Uhlig (ed.), Handbook of Macroeconomics, edition 1, volume 2, chapter 0, pages 2493-2597, Elsevier.
    11. Alain Egli, 2005. "Hotelling's Beach with Linear and Quadratic Transportation Costs: Existence of Pure Strategy Equilibria," Diskussionsschriften dp0509, Universitaet Bern, Departement Volkswirtschaft.
    12. Matteo Iacoviello, 2008. "Household Debt and Income Inequality, 1963–2003," Journal of Money, Credit and Banking, Blackwell Publishing, vol. 40(5), pages 929-965, August.
    13. Goh, Kim-Leng & King, Maxwell L., 1996. "Modified Wald tests for non-linear restrictions: A cautionary tale," Economics Letters, Elsevier, vol. 53(2), pages 133-138, November.
    14. Ken Miyajima, 2013. "Foreign exchange intervention and expectation in emerging economies," BIS Working Papers 414, Bank for International Settlements.
    15. Wu, Han-Ming & Tien, Yin-Jing & Chen, Chun-houh, 2010. "GAP: A graphical environment for matrix visualization and cluster analysis," Computational Statistics & Data Analysis, Elsevier, vol. 54(3), pages 767-778, March.
    16. Alisdair McKay, 2011. "Household Saving Behavior and Social Security Privatization," Boston University - Department of Economics - Working Papers Series WP2011-027, Boston University - Department of Economics.
    17. José E. Chacón, 2021. "Explicit Agreement Extremes for a 2 × 2 Table with Given Marginals," Journal of Classification, Springer;The Classification Society, vol. 38(2), pages 257-263, July.
    18. Massimo A. De Francesco, 2003. "On a property of mixed strategy equilibria of the pricing game," Economics Bulletin, AccessEcon, vol. 4(30), pages 1-8.
    19. Neely, Christopher J. & Weller, Paul, 2000. "Predictability in International Asset Returns: A Reexamination," Journal of Financial and Quantitative Analysis, Cambridge University Press, vol. 35(4), pages 601-620, December.
    20. Mika Meitz & Pentti Saikkonen, 2008. "Stability of nonlinear AR‐GARCH models," Journal of Time Series Analysis, Wiley Blackwell, vol. 29(3), pages 453-475, May.
    21. De Bonis, Valeria, 1997. "Regional integration and factor income taxation," Policy Research Working Paper Series 1849, The World Bank.

    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:ejores:v:189:y:2008:i:3:p:775-788. 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.