IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v43y1997i7p908-921.html
   My bibliography  Save this article

Tabu Search and Ejection Chains---Application to a Node Weighted Version of the Cardinality-Constrained TSP

Author

Listed:
  • Buyang Cao

    (Department of Transportation/Logistics Service, ESRI, Inc., 380 New York Street, Redlands, California 92373)

  • Fred Glover

    (Graduate School of Business and Administration, Campus Box 419, University of Colorado at Boulder, Boulder, Colorado 80309-0419)

Abstract

A cardinality-constrained TSP (CC-TSP) problem requires the salesman to visit at least L and at most U cities, represented by nodes of a graph. The objective of this problem is to maximize the sum of weights of nodes visited. In this paper we propose a tabu search method based on ejection chain procedures, which have proved effective for many kinds of combinatorial optimization problems. Computational results on a set of randomly generated test problems with various implementations of the algorithm are reported.

Suggested Citation

  • Buyang Cao & Fred Glover, 1997. "Tabu Search and Ejection Chains---Application to a Node Weighted Version of the Cardinality-Constrained TSP," Management Science, INFORMS, vol. 43(7), pages 908-921, July.
    • Handle: RePEc:inm:ormnsc:v:43:y:1997:i:7:p:908-921
    DOI: 10.1287/mnsc.43.7.908
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.43.7.908
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.43.7.908?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
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Vicky Mak-Hau, 2017. "On the kidney exchange problem: cardinality constrained cycle and chain problems on directed graphs: a survey of integer programming approaches," Journal of Combinatorial Optimization, Springer, vol. 33(1), pages 35-59, January.
    2. Colin Osterman & César Rego, 2016. "A k-level data structure for large-scale traveling salesman problems," Annals of Operations Research, Springer, vol. 244(2), pages 583-601, September.
    3. César Rego & Fred Glover, 2010. "Ejection chain and filter-and-fan methods in combinatorial optimization," Annals of Operations Research, Springer, vol. 175(1), pages 77-105, March.
    4. repec:jss:jstsof:23:c02 is not listed on IDEAS
    5. Darko Pongrac & Kristina Soric & Visnja Vojvodic Rosenzweig, 2007. "A Mathematical Model and Programme Support for Determination of the Values of the Marginal Reserve Requirement as Instrument of Monetary Policy," Financial Theory and Practice, Institute of Public Finance, vol. 31(3), pages 249-278.

    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:inm:ormnsc:v:43:y:1997:i:7:p:908-921. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.