A general variable neighborhood search variants for the travelling salesman problem with draft limits
- 3 September 2014
- journal article
- research article
- Published by Springer Nature in Optimization Letters
- Vol. 11 (6) , 1047-1056
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Two level General variable neighborhood search for Attractive traveling salesman problemComputers & Operations Research, 2014
- Exact algorithms for the traveling salesman problem with draft limitsEuropean Journal of Operational Research, 2014
- The hierarchical traveling salesman problemOptimization Letters, 2012
- Variable neighborhood search for the travelling deliveryman problem4OR, 2012
- A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problemEuropean Journal of Operational Research, 2012
- 3-Approximation algorithm for a two depot, heterogeneous traveling salesman problemOptimization Letters, 2010
- Variable neighbourhood search: methods and applicationsAnnals of Operations Research, 2009
- Variable neighbourhood search: methods and applications4OR, 2008
- Variable neighborhood searchComputers & Operations Research, 1997
- TSPLIB—A Traveling Salesman Problem LibraryINFORMS Journal on Computing, 1991