IDEAS home Printed from https://ideas.repec.org/a/kap/netnom/v12y2011i3p183-207.html
   My bibliography  Save this article

A learning-based variable assignment weighting scheme for heuristic and exact searching in Euclidean traveling salesman problems

Author

Listed:
  • Fan Xue
  • C. Chan

    ()

  • W. Ip
  • C. Cheung

Abstract

Many search algorithms have been successfully employed in combinatorial optimization in logistics practice. This paper presents an attempt to weight the variable assignments through supervised learning in subproblems. Heuristic and exact search methods can therefore test promising solutions first. The Euclidean Traveling Salesman Problem (ETSP) is employed as an example to demonstrate the presented method. Analysis shows that the rules can be approximately learned from the training samples from the subproblems and the near optimal tours. Experimental results on large-scale local search tests and small-scale branch-and-bound tests validate the effectiveness of the approach, especially when it is applied to industrial problems. Copyright Springer Science+Business Media, LLC. 2011

Suggested Citation

  • Fan Xue & C. Chan & W. Ip & C. Cheung, 2011. "A learning-based variable assignment weighting scheme for heuristic and exact searching in Euclidean traveling salesman problems," Netnomics, Springer, vol. 12(3), pages 183-207, October.
  • Handle: RePEc:kap:netnom:v:12:y:2011:i:3:p:183-207 DOI: 10.1007/s11066-011-9064-7
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s11066-011-9064-7
    Download Restriction: Access to full text is restricted to subscribers.

    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. Olafsson, Sigurdur & Li, Xiaonan, 2010. "Learning effective new single machine dispatching rules from optimal scheduling data," International Journal of Production Economics, Elsevier, vol. 128(1), pages 118-126, November.
    2. 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.
    Full references (including those not matched with items on IDEAS)

    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:kap:netnom:v:12:y:2011:i:3:p:183-207. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla) or (Rebekah McClure). General contact details of provider: http://www.springer.com .

    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 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.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.