A learning-based variable assignment weighting scheme for heuristic and exact searching in Euclidean traveling salesman problems
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
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 12 (2011)
Issue (Month): 3 (October)
|Contact details of provider:|| Web page: http://www.springerlink.com/link.asp?id=102537|
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- 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.
- 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.
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: (Guenther Eichhorn)or (Christopher F. Baum)
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 references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link 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 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.