Scientific applications of LKH

N. Absi and C. Archetti and S. Dauzère-Pérès and D. Feillet, and B. Ahrens,
A two-phase iterative heuristic approach for the Production Routing Problem.
Working Papers, University of Brescia, WPDEM 2013/8, 2013.

B. Ahrens,
A tour construction framework for the travelling salesman problem.
Ph.D. thesis, Nova Southeastern University, 2012.

R. K. Ahuja, O. Ergun, J. B. Orlin, and A. P. Punnen,
A survey of very large scale neighborhood search techniques.
Discrete Applied Mathematics 123, pp. 75-102, 2002.

K. Akbudak, E. Kayaaslan, and C. Aykanat,
Hypergraph-Partitioning-Based Models and Methods for Exploiting Cache Locality in
Sparse-Matrix Vector Multiplication
.
Technical Report, BU-CE-1201, Bilkent University, 2012.

F. M. al-Rifaie and M. M. al-Rifaie,
Maximising overlap score in DNA sequence assembly problem by Stochastic
Diffusion Search
.
SAI Inteligent Systems Conference, pp. 301-322, 2015.

K. Alexis, G. Darivianakis, M. Burri, and Roland Siegwart,
Aerial robotic contact-based inspection: planning and control.
Autonomous Robots, Voume 40, Issue 4, pp. 631-655, 2016.

K. Alexis, C. Papachristos, R. Siegwart, and A. Tzes,
Distributed Infrastructure Inspection Path Planning subject to Time Constraints.
arXiv:1612.08245 [cs.RO], 2016.

Z. A. Allen,
Use of traveling salesman problem solvers in the construction of genetic linkage maps.
M.Sc. thesis, Colorado State University, 2015.

R. Almadhoun, T. Taha, L. Seneviratne, J. Dias, G. Cai,
A survey on inspecting structures using robotic systems.
International Journal of Advanced Robotic Systems, November-Dember 2016.

B. Alper, N. H. Riche, G. Ramos, and M. Czerwinski,
Design Study of LineSets, a Novel Set Visualization Technique.
IEEE Transactions on Visualization and Computer Graphics, pp. 2259-2267, 2011.

M. E. J. Amarel et al.,
A first generation whole genome RH map of the river buffalo with comparison to
domestic cattle
.
BMC Genomics 9, No. 1, 2008.

R. P. Anderson and D. Milutinovic,
The Dubins Traveling Salesperson Problem with Stochastic Dynamics.
6th Annual Dynamic Systems and Control Conference, 2013.

C. E. Andrade, F. K. Miyazawa, and M. G. C. Resende,
Evolutionary algorithm for the k-interconnected multi-depot multi-traveling salesmen
problem
.
GECCO 2013: 463-470.

D. Apiletti, E. Baralis, and T. Cerquitelli,
Energy-saving models for wireless sensor networks.
Knowledge and Information Systems, pp. 1-30, 2010.

D. L. Applegate, R. E. Bixby, V. Chvatal, W. Cook, D. G. Espinoza,
M. Goycoolea, and K. Helsgaun,
Certification of an optimal TSP tour through 85,900 cities.
Operations Research Letters, 37, pp. 11-15, 2009.

D. L. Applegate, R. E. Bixby, V. Chvátal, and W. J. Cook,
The Traveling Salesman Problem: A Computational Study.
Princeton University Press, 2006.

A. Arbelaez, C. Truchet, B. O'Sullivan,
Learning Sequential and Parallel Runtime Distributions for Randomized Algorithms.
International Conference on Tools with Artificial Intelligence, 2016.

Al. Arbelaez and Barry O’Sullivan,
Learning a Stopping Criterion for Local Search.
LION 2016, LNCS 10079, pp. 3-16, 2016.

S Arshad,
Sequence Based Memetic Algorithms for Static and Dynamic Travelling Salesman
Problems
.
Ph.D. thesis, University of Leicester, 2012.

F. Bachmann, H. Schaeben, and R. Hielscher,
Optimizing the experimental design of texture goniometry.
Journal of Applied Crystallography. Vol. 45, pp. 1173-1181, 2012.

J. Bae and S. Rathinam,
Approximation Algorithm for a Heterogeneous Vehicle Routing Problem.
International Journal of Advanced Robotic Systems, 12:113, DOI: 10.5772/60086, 2015.

J. Bae and W. Chung,
A Heuristic for a Heterogeneous Automated Guided Vehicle Routing Problem.
International Journal of Precision Engineering and Manufacturing, Vol. 18, No. 6,
pp. 795-801, 2017.

M. L. Baker, M. R. Baker, C. F. Hryc, T. Ju, and W. Chiu,
Gorgon and pathwalking: Macromolecular modeling tools for subnanometer resolution
density maps
.
Biopolymers, 97(9), pp. 655-668, 2012.

M. L. Baker, C. F. Hryc, Q. Zhang, W. Wu, J. Jakana, C. Haase-Pettingell, P. V. Afonine,
P. D. Adams, J. A. King, W. Jiang, and W. Chiu,
Validated near-atomic resolution structure of bacteriophage epsilon15 derived from
cryo-EM and modeling
.
Proc. Natl. Acad. Sci. U S A., 110(30), pp.12301- 12306, 2013.

M. R. Baker, I. Rees, S. J. Ludtke, W. Chiu.,and M. L. Baker,
Constructing and validating initial Cα models from subnanometer resolution density
maps with pathwalking
.
Structure, 20(3), pp. 450-463, 2012.

D. H. Baik and K. K. Saluja,
Progressive random access scan: a simultaneous solution to test power, test data volume
and test time
.
Proceedings of IEEE International Test Conference, pp. 272-277, 2005.

P. Baniasadi, V. Ejov, J. A. Filar, M. Haythorpe, and S. Rossomakhine,
Deterministic “Snakes and Ladders” Heuristic for the Hamiltonian cycle problem.
Mathematical Programming Computation, September 2013.

D. Barbucha, I. Czarnowski, P. Jȩdrzejowicz, E. Ratajczak-Ropel, and I. Wierzbowska,
e-JABAT - An Implementation of the Web-Based A-Team.
Intelligent Agents in the Evolution of Web and Applications, pp. 57-86, 2009.

E. N. Beresneva and S. M. Avdoshin,
Pareto-optimal Algorithms for Metric TSP: Experimental Research.
International Journal of Open Information Technologies, vol. 5, no.5, pp. 16-24, 2017.

S. Basu and M. Sharma,
Preprocessing Schemes for Tabu search on Asymmetric Traveling Salesman Problem.
Working paper, Indian Institute of Management Calcutta, WPS-735, 2013.

S. Basu, M. Sharma, and P. S. Ghosh,
Efficient preprocessing methods for tabu search: an application on asymmetric travelling
salesman problem
.
INFOR: Information Systems And Operational Research, 2017.

R. Bazylevych, B. Prasad, R. Kutelmakh, R. Dupas, and L. Bazylevych,
A Decomposition Algorithm for Uniform Traveling Salesman Problem.
Proceedings of IICAI-09, pp. 47-56, 2009.

R. Bazylevych, R. Dupas, B. Prasad, B. Kuz, R. Kutelmakh, and L. Bazylevych,
A Parallel Approach for Solving a Large-Scale Traveling Salesman Problem.
Proceedings of IICAI-11 pp. 566-579, 2011.

R. Bazylevych, B. Kuz, R. Kutelmakh, R. Dupas, B. Prasad, Y. Haxhimusa, and L, Bazylevych,
A Parallel Ring Method for Solving a Large-scale Traveling Salesman Problem.
International Journal of Information Technology and Computer Science, Vol. 8, No. 5, 2016.

M. J. Beimers,
Tour merging via tree decomposition.
M.Sc. thesis, Utrecht University, 2015.

I. Bello, H. Pham, Q. V. Le, M. Norouzi, S. Bengio,
Neural Combinatorial Optimization with Reinforcement Learning.
arXiv:1611.09940, 2016.

P. Benchimol, W-J. Hoeve, J-C. Régin, L-M. Rousseau, and M.l Rueher,
Improved filtering for weighted circuit constraints.
Constraints, Vol. 17, Number 3, pp. 1-29, 2012.

P. Beraldi and M. E. Bruni,
A stochastic programming approach for the traveling purchaser problem,
IMA Journal of Management Mathematics, pp. 1-23, 2015.

E. N. Beresneva and S. M. Avdoshin,
Pareto-optimal Algorithms for Metric TSP: Experimental Research.
International Journal of Open Information Technologiesm vol. 5, no.5, 2017.

J. Bernal, J. W. Escobar, C. Marín, R. Linfati, and G. Gatica,
A Computational Comparision of Heuristic Algorithmsfor the Location-Routing Problem
with Heterogenous Fleet (LRPH)
.
Accepted manuscript. DOI: 10.13140/RG.2.1.4840.6889, 2015.

A. Bircher, K. Alexis, M. Burri, P. Oettershagen, S. Omari, T. Mantel, and R. Siegwart,
Structural Inspection Path Planning via Iterative Viewpoint Resampling with Application
to Aerial Robotics
.
IEEE International Conference on Robotics & Automation, 2015.

A. Bircher, M. Kamel, K. Alexis, M. Burri1, P. Oettershage, S. Omari, T. Mantel , and R. Siegwart,
Three-dimensional coverage path planning via viewpoint resampling and tour optimization
for aerial robots
.
Autonomous Robots, pp. 1-20, 2015.

A. Blazinskas and A. Misevicius,
Generating High Quality Candidate Sets by Tour Merging for the Traveling Salesman Problem.
Communications in Computer and Information Science, Volume 319, Part 1, pp. 62-73, 2012.

A. Blazinskas, A. Misevicius, and A. Lenkevicius,
Modified Local Search Heuristics for the Symmetric Traveling Salesman Problem.
Information Technology and Control, Vol.42, No.3, pp. 218-230, 2013.

S. Bochkarev and S. L. Smith,
On Minimizing Turns in Robot Coverage Path Planning.
IEEE Conference on Automation Science and Engineering, 2016.

S. Bochkarev,
Minimizing Turns in Single and Multi Robot Coverage Path Planning.
Ph.D. thesis, University of Waterloo, 2017.

F. Bohnen, M. Buhl, and J, Deuse,
Systematic procedure for leveling of low volume and high mix production.
CIRP Journal of Manufacturing Science and Technology, Volume 6, Issue 1, pp. 53-58, 2013.

P. Bollweg, D. Hasanbegovic, H. Müller, and M. Stöneberg,
Surface-adaptive and Collision-avoiding Path Planning for Five-axis Milling.
Universität Dortmund, Forshungsberict Nr. 808, 2006.

T. Bonny and J. Henkel,
Using Lin-Kernighan algorithm for look-up table compression to improve code density.
Proceedings of the 16th ACM Great Lakes symposium on VLSI, pp. 259-265, 2006.

T. Bonny and J. Henkel,
Efficient code density through look-up table compression.
Proceedings of the conference on Design, automation and test in Europe, pp. 809-814, 2007.

T. Bonny and J. Henkel,
Instruction Re-encoding Facilitating Dense Embedded Code.
IEEE/ACM Proc. of Design, Automation and Test in Europe Conference, pp. 770-775, 2008.

T. Bonny and J. Henkel,
Huffman-based code compression techniques for embedded processors.
ACM Transactions on Design Automation of Electronic Systems, 15(4), Article 31, 2010.

S. I. Brown, R. G. McGarvey, and J. A. Ventura,
Total flowtime and makespan for a no-wait m-machine flowshop with set-up times separated.
Journal of the Operational Research Society, Volume 55, Number 6, pp. 614-621, 2004.

R. I. Bolaños,
Un algoritmo metaheurístico para la solución del problema de ruteo de vehículos con
múltiples depósitos y flota heterogénea
.
Thesis, Universidad Tecnológica de Pereira, 2014.

U. Boryczka and Ł. Strąk,
Efficient DPSO Neighbourhood for Dynamic Traveling Salesman Problem.
Proceedings of the 5th International Conference on Computational Collective Intelligence,
pp. 721-730, 2016.

J. Bossek and H. Trautmann,
Understanding Characteristics of Evolved Instances for State-of-the-Art Inexact TSP
Solvers with Maximum Performance Difference
.
Conference of the Italian Association for Artificial Intelligence, pp. 3-12, 2016.

J. Bossek and H. Trautmann,
Evolving Instances for Maximizing Performance Differences of State-of-the-Art
Inexact TSP Solvers
.
International Conference on Learning and Intelligent Optimization, pp. 48-59, 2016.

L. P. Buriol, França, and P. Moscato,
A New Memetic Algorithm for the Asymmetric Traveling Salesman Problem.
Journal of Heuristics, 10, pp. 483-506, 2004.

L. P. Cáceres, F. Pagnozzi, A. Franzin, and T. Stützle,
Automatic configuration of GCC using irace.
IRIDIA - Technical Report Series, TR/IRIDIA/2017-008, 2017

H. I. Calvete, C. Galé, and J. A. Iranzo,.
An efficient evolutionary algorithm for the ring star problem.
European Journal of Operational Research, Volume 231, Issue 1, pp. 22-33, 2013.

H. I. Calvete, C. Galé, and J. A. Iranzo,
MEALS: A Multiobjective Evolutionary Algorithm with Local Search for solving the
bi-objective ring star problem
.

European Journal of Operational Research, Vol. 250, Issue 2, pp. 377-388, 2016.

K. Castelino, R. D’Souza, and P. K. Wright,
Tool-path Optimization for Minimizing Airtime during Machining.
Journal of Manufacturing Systems, Volume 22, part 3, pp 173-180, 2003.

K. Chakrabarty and J. E. Chen,
A cocktail approach on random access scan toward low power and high efficiency test.
Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design,
pp. 94-99, 2005.

M. Chen, P. R. Baldwin, S. J. Ludtke, and M. L. Baker,
De Novo Modeling in Cryo-EM Density Maps with Pathwalking.
Journal of Structural Biology, Accepted manuscript, 2016.

T. Chin, P. Ramanathan, and K. K. Saluja,
Collaborative patrolling for target detection using mobile sensor networks.
Proceedings of the IEEE Internatioanl Conference on Wireless Communications
and Signal Processing (WCSP), 2010.

Minsik Cho,
Physical Synthesis for Nanometer VLSI and Emerging Technologies.
Ph.D. thesis, University of Texas at Austin, 2008.

M. Cho, H. Xiang, R. Puri, and D. Z. Pan,
Track Routing and Optimization for Yield.
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems,
27(5), pp. 872-882, 2008.

S. Choudhary,
M-Crawler: Crawling Rich Internet Applications Using Menu Meta-Model.
Thesis, University of Ottawa, 2012.

Chung-Cheng, Shih-Wei Lin, and Kuo-Ching Ying,
Minimizing worst-case regret of makespan on a single machine with uncertain
processing and setup times
.
Applied Soft Computing, Volume 23, pp. 144-151, 2014.

Li Chunli and Mu Ke,
The Disk Covering Tour Problem in the Wireless Sensor Network.
The Open Automation and Control Systems Journal, 6, pp. 1169-1175, 2014.

W. Cook and P. Seymour,
Tour Merging via Branch-Decomposition.
INFORMS Journal on Computing 15(3), pp. 233-248, 2003.

W. Cook,
In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation.
Princeton University Press, 2012.

J.-F. Cordeau, D. Laganà, D., R. Musmanno, and F. Vocaturo,
A Decomposition-Based Heuristic for a Multiple-Product Inventory Routing Problem.
Computers & Operations Research, November 2013.

A. Devari,
Crowdsourced last mile delivery using social network.
M.Sc. thesis, State University of New York, 2016.

A. Devari, G. A, G. Nikolaev, and Q. He,
Crowdsourcing the last mile delivery of online orders by exploiting the social networks
of retail store customers
.
Transportation Research Part E: Logistics and Transportation,
Volume 105, pp.105-122, 2017.

R. Dewil, P. Vansteenwegen, and D. Cattrysse,
Construction heuristics for generating tool paths for laser cutters.
Submtted to International Journal of Production Research, 2014.

R. Dewil, P. Vansteenwegen, D. Cattrysse, M. Laguna, and T. Vossen,
An improvement heuristic framework for the laser cutting tool path problem.
International Journal of Production Research, pp. 1-18, 2014.

H. Ding and D. Castañón,
Fast Algorithms for UAV Tasking and Routing.
IEEE Multi-Conference on Systems and Control, 2016.

H. Ding, E. Cristofalo, J. Wang, D. Castañón, E. Montijano, V. Saligrama,
and M. Schwager,
A multi-resolution approach for discovery and 3-D modeling of archaeological
sites using satellite imagery and a UAV-borne camera
.
Proceedings of the American Control Conference, 2016.

R. Dobai and M. Balaz,
SAT-based generation of compressed skewed-load tests for transition delay faults.
Microprocessors and Microsystems, article in press, 2012.

C. Dong, G. Jäger, D. Richter, and P. Molitor,
Effective Tour Searching for TSP by Contraction of Pseudo Backbone Edges,
University Halle-Wittenberg, Institute of Computer Science, Technical Report 2008/4.

C. Dornhege, A. Kleiner, and A. Kolling,
Coverage Search in 3D.
11th IEEE International Symposium on Safety, Security, and Rescue Robotics, 2013.

C. Dornhege, A. Kleiner, A. Hertie, and A. Kolling,
Multirobot Coverage Search in Three Dimensions.
Journal of Field Robotics, Online ISSN: 1556-4967, 2015.

R. Doshi, S. Yadlapalli, S. Rathinam, and S. Darbha,
Approximation algorithms and heuristics for a 2-depot, heterogeneous Hamiltonian
path problem
.
International Journal of Robust and Nonlinear Control, DOI 10.1002/rnc.1701, 2011.

X. Du, B. Servin, J. E. Womack, J. Cao, M. Yu, Y. Dong, W. Wang, and S. Zhao,
An update of the goat genome assembly using dense radiation hybrid maps allows
detailed analysis of evolutionary rearrangements in Bovidae
.
BMC Genomics, pp.15-625, 2014.

J. Dubois-Lacoste, H. H. Hoos, and T. Stützle,
On the Empirical Scaling Behaviour of State-of-the-art Local Search Algorithms for
the Euclidean TSP
.
Proceedings of GECCO '15, pp. 377-384, 2015.

E. Duchenne, G. Laporte and F. Semet,
Heuristiques pour le problème du vendeur m-péripatétique.
RAIRO-Operations Research, Vol. 43, pp. 13-26, 2009.

J. G. Eisele, C. Yolanda, C. Roldán,
Mauricio Osorio Galindo, and Ma. del Pilar Gómez Gil,
Usefulness of Solution Algorithms of the Traveling Salesman Problem in the
Typing of Biological Sequences in a Clinical Laboratory Setting
.
14th International Conference on Electronics, Communications and Computers, p. 264, 2004.

V. Ejov, J. A. Filar, M. Haythorpe, J. F. Roddick, and S. Rossomakhine,
A note on using the resistance-distance matrix to solve Hamiltonian cycle problem.
Annals of Operations Research, doi:10.1007/s10479-017-2571-7, 2017.

B. Englot, T. Sahai, and I. Cohen,
Efficient Tracking and Pursuit of Moving Targets by Heuristic Solution of the
Traveling Salesman Problem.

52nd IEEE Conference on Decision and Control, pp. 3433-3438, 2013.

C. Ernst, C. Dong, D. Richter, G. Jäger, and P. Molitor,
Finding Good Tours for Huge Euclidean TSP Instances by Iterative Backbone Contraction:
First Results
.
University Halle-Wittenberg, Institute of Computer Science, Technical Report 2009/05.

J. W. Escobar, R. Linfati, and P. Toth,
A two-phase hybrid heuristic algorithm for the capacitated location-routing problem.
Computers & Operations Research, Volume 40, Issue1, pp. 70-79, 2013.

J. W. Escobar, R. Linfati, P. Toth, and M. G. Baldoquin,
A hybrid Granular Tabu Search algorithm for the Multi-Depot Vehicle Routing Problem.
Journal of Heuristics, pp. 1-27, 2014.

J. W. Escobar, R. Linfati, M. G. Baldoquin, and P. Toth,
A Granular Variable Tabu Neighborhood Search for the capacitated location-routing problem.
Transportation Research Part B: Methodological., Vol,. 67, pp. 344-256, 2014.

J. W. Escobar,
A computational comparison of heuristic algorithms for the Location-Routing Problem
with Heterogeneous Fleet (LRPH)
.
RESEARCH , 2015.

C. Expósito-Izquierdo, ,A. Rossi, and M. Sevaux,
A Two-Level solution approach to solve the Clustered Capacitated Vehicle Routing Problem.
Computers & Industrial Engineering, Vol. 91, pp. 274-289, 2016.

A. B. Ezzeddine, S. Kasala, and Pavol Navrat,
Applying the firefly approach to the DNA fragments assembly problem.
Annales Univ. Sci. Budapest., Sect. Comp. 42, pp. 69-81, 2014.

J-G. Fages, X. Lorca, and L-M Rousseau,
The Salesman and the Tree: the importance of search in CP.
Constraints, 21, 2, pp. 145-162, 2016.

T. Faraut, S. de Givry, P. Chabrier, T. Derrien, F. Galibert,
Christophe Hitte, and Thomas Schiex,
A comparative genome approach to marker ordering.
In Proc. of ECCB-06, Eilat, Israel, 2006.

T. S. Fernandes,
Planeamento de Trajetoria para Operac~oes de Busca e Salvamento com UAVs.
Thesis, Instituto Superior de Engenharia do Porto, 2016.

C. Filippi and E. Stevanato,
A two-phase method for bi-objective combinatorial optimization and its application to the
TSP with profits
.
Algorithmic Operations Research, Vol. 7, No. 2, 2012.

T. Fischer and P. Merz,
Embedding a Chained Lin-Kernighan Algorithm into a Distributed Algorithm.
MIC'2005 - 6th Metaheuristics International Conference, 2005.

T. Fischer, T. Stützle, H. H. Hoos, and P. Merz,
An Analysis of the Hardness of TSP Instances for Two High-performance Algorithms.
MIC2005. The 6th Metaheuristics International Conference, pp. 361-317,
Vienna, Austria, August 22-26, 2005.

T. Fischer and P. Merz,
A Distributed Chained Lin-Kernighan Algorithm for TSP Problems.
Proceedings of the 19th IEEE International Parallel and Distributed Processing
Symposium, 2005.

T. Fischer and P. Merz,
Reducing the Size of Traveling Salesman Problem Instances by Fixing Edges.
Lecture Notes In Computer Science, volume 4446, pp. 7283, 2007.

K. Florios and G. Mavrotas,
Generation of the exact Pareto set in Multi-Objective Traveling Salesman and Set
Covering Problems
.
Applied Mathematics and Computation, Volume 237, pp. 1-19, 2014.

C. Gahm, C. Brabänderb, and A. Tuma,
Vehicle routing with private fleet, multiple common carriers offering volume discounts,
and rental options
.
Transportation Research Part E: Logistics and Transportation Review,
Volume 97, pp. 192-216, 2017.

D. Gamboa, C. Osterman, C. Rego, and F. Glover,
An Experimental Evaluation of Ejection Chain Algorithms for the Traveling Salesman
Problem
.
School of Business Administration, University of Mississippi, 2006.

T. Gellert, W. Höhn, and R. H. Möhring,
Sequencing and scheduling for filling lines in dairy production.
Optimization Letters, pp. 1-14, 2011.

M. Gendreau, D. Manerba, and R, Mansini,
The multi-vehicle traveling purchaser problem with pairwise incompatibility
constraints and unitary demands: A branch-and-price approach
.
European Journal of Operational Research, Vol. 248, Issue 1, pp. 59-71, 2016.

A. R. Gerlach and D. B. Doman,
Precision airdrop transition altitude optimization via the one-in-a-set traveling
salesman problem
.
American Control Conference, pp. 3498-3502, 2016.

T. van Gils, K. Braekers, K. Ramaekers, B. Depaire, and A. Caris,
Improving Order Picking Efficiency by Analyzing Combinations of Storage,
Batching, Zoning, and Routing Policies
.
Computational Logistics, ICCL, pp. 427-442, 2016.

A. H. Gholamipour, F. Kurdahi, A. Eltawil, and M. A. R. Saghir,
Exploiting Architectural Similarities and Mode Sequencing in Joint Cost Optimization
of Multi-mode FIR Filters
.
International Conference on Field Programmable Logic and Applications, pp. 175-178, 2010.

S. de Givry, M. Bouchez, P. Chabrier, D. Milan, and T. Schiex,
CARHTA GENE: multipopulation integrated genetic and radiation hybrid mapping.
Bioinformatics, Volume 21, Issue 8, pp. 1703-1704, 2005.

E. F. G. Goldbarg, M. C. Goldbarg, and J. P. F. Farias,
GRASP with Path-Relinking for the TSP.
Metaheuristics: Progress in Complex Systems Optimization, Chapter 7, Springer, 2007.

E. F. G. Goldbarg, M. C. Goldbarg, and G. R. de Souza,
Particle Swarm Optimization Algorithm for the Traveling Salesman Problem.
Chapter 4 of "Traveling Salesman Problem", Book edited by F. Greco, 2008.

B. Golden, Z. Naji-Azimi, S. Raghavan, M. Salari, and P. Toth,
The Generalized Covering Salesman Problem.
INFORMS Journal on Computing, Vol. 24, No. 4, pp. 534-553, 2012.

M. K. Gordenko and S. M. Avdoshin,
Transformation of the Mixed Chinese Postman Problem in multigraph into the
Asymmetric Travelling Salesman Problem
.
International Journal of Open Information Technologies, vol. 5, no.6, 2017.

A. Gruler, C. Fikar, A. Juan, P. Hirsch, and C. Contreras,
A Simheuristic for the Waste Collection Problem with Stochastic Demands in Smart Cities.
Proceedings of the 2015 Int. Conf. of the Forum for Interdisciplinary Mathematics, 2015.

O. Guemri, B. Beldjilali; A. Bekrar, and Ghalem Belalem,
Two-stage heuristic algorithm for the large-scale capacitated location routing problem.
Int. J. of Mathematical Modelling and Numerical Optimisation, Vol.7, No.1, pp. 97, 2016.

L. Gueta, R. Chiba, J. Ota, T. Arai, and T. Ueyama,
A practical and integrated method to optimize a manipulator-based inspection system.
IEEE International Conference on Robotics and Biomimetics, pp. 1911-1918, 2007.

L. Gueta, R. Chiba, J. Ota, T. Arai, and T. Ueyama,
Design and Optimization of a Manipulator-based Automated Inspection System.
The Society of Instrument and Control Engineers Transaction on Industrial Application, 6,
pp. 41-51, 2007.

L. Gueta, R. Chiba, J. Ota, T. Arai, and T. Ueyama,
Coordinated motion control of a robot arm and a positioning table with arrangement of
multiple goals
.
EEE International Conference on Robotics and Automation, pp. 2252-2258, 2008.

L. Gueta, R. Chiba, T. Arai, T. Ueyama, and J. Ota,
Practical Point-to-Point Multiple-Goal Task Realization in a Robot Arm with a Rotating
Table
.
Advanced Robotics, Volume 25, Numbers 6-7, pp. 717-738, 2011.

L. Gueta, R. Chiba, T. Arai, T. Ueyama, J. Rubrico, and J. Ota,
Compact design of a redundant manipulator system and application to multiple-goal
tasks with temporal constraint
.
Journal of Advanced Mechanical Design, Systems, and Manufacturing, Vol. 2, No. 2, 2017.

B. C. Gupta and V. P. Prakash,
Greedy heuristics for the Travelling Thief Problem.
39th National Systems Conference, 2015.

P. Gupta, A. B. Kahng, and S. Mantik,
Routing-Aware Scan Chain Ordering.
ACM Transactions on Design Automation of Electronic Systems (TODAES),
Volume 10, Issue 3, pp. 546-560, July 2005.

D. Gyulai, B. Kádár, A. Kovács, L. Monostori,
Capacity management for assembly systems with dedicated and reconfigurable resources.
CIRP Annals - Manufacturing Technology, 01, 2014.

N. Habib,Y. Li, M. Heidenreich, L. Swiech, I. Avraham-Davidi, J. J. Trombetta, C. Hession,
F. Zhang, and Regev,
Div-Seq: Single-nucleus RNA-Seq reveals dynamics of rare adult newborn neurons.
Science, 353(6302), pp. 925-928, 2016.

S. Hahn, and A. Scholz,
Order Picking in Narrow-Aisle Warehouses: A Fast Approach to Minimize Waiting Times.
Working paper 17006, Otto-von-Guericke University Magdeburg, 2017.

D. Hains, D. Whitley, and A. Howe,
Improving Lin-Kernighan-Helsgaun with Crossover on Clustered Instances of the TSP.
Lecture Notes in Computer Science, Volume 7492, pp. 388-397, 2012.

H. Hamidreza, S. Luca, and L. Fabrizio,
Evaluation, analysis, and enhancement of error resilience for reliable compression of
VLSI test data
.
IEEE transactions on instrumentation and measurement, 54(5), pp. 1761-1769, 2005.

L. Han, B. T. Luong, and S. Ukkusuri,
An Algorithm for the One Commodity Pickup and Delivery Traveling Salesman Problem
with Restricted Depot
.
Networks and Spatial Economics, DOI 10.1007/s11067-015-9297-3, 2015.

Y. Handa, H. Ono, K. Sadakane, and M. Yamashita,
Neighborhood Composition: A Parallelization of Local Search Algorithms.
Lecture Notes in Computer Science, Volume 3241, pp. 155-163, 2004.

T. Harks, F. G. König, and J. Matuschke,
Approximation Algorithms for Capacitated Location Routing.
Technische Universität Berlin, Preprint, 2010.

H. Hashempour, L. Schiano, and F. Lombardi,
Enhancing Error Resilience for Reliable Compression of VLSI Test Data.
Proceedings of the 15th ACM Great Lakes symposium on VLSI, pp. 371-376, 2005.

K. Helsgaun,
Solving the Equality Generalized Traveling Salesman Problem Using the
Lin-Kernighan-Helsgaun Algorithm
.
Computer Science Report #141, Roskilde University, 2014.

K. Helsgaun,
Solving the Clustered Traveling Salesman Problem Using
the Lin-Kernighan-Helsgaun Algorithm
.
Computer Science Report #142, Roskilde University, 2014.

K. Helsgaun,
Solving the Bottleneck Traveling Salesman Problem Using the
Lin-Kernighan-Helsgaun Algorithm
.

Computer Science Report #143, Roskilde University, 2014.

K. Helsgaun,
Solving Arc Routing Problems Using the Lin-Kernighan-Helsgaun Algorithm.
Computer Science Report #143, Roskilde University, 2014.

T. Henke, M. G Speranza, and G. Wäscher,
The Multi-Compartment Vehicle Routing Problem with Flexible Compartment Sizes.
Working Paper, Otto-von-Guericke University Magdeburg, No. 6, 2014.

T. Henke, M. G. Speranza, and G. Wäscher,
The Multi-Compartment Vehicle Routing Problem with Flexible Compartment Sizes.
European Journal of Operational Research, Vol. 246, pp. 730-743, 2015.

N. Henry and J-D. Fekete,
MatrixExplorer: a Dual-Representation System to Explore Social Networks.
IEEE Trans. Visual Comput. Graphics, 12(5),pp. 677-684, 2006.

B. Herrera,
Combinação de Enxame de Partículas com Inspiração Quântica e Método
Lin-Kernighan-Helsgaun aplicado ao Problema do Caixeiro Viajante
.
M.Sc. thesis, Pontificia Universidade Católica do Paraná, 2007.

B. Herrera, L. Coelho, and M. Steiner,
Quantum Inspired Particle Svarm Combined with Lin-Kernighan-Helsgaun Method
to the Travling Salesman Problem
.
Pesquisa Operacional, vol. 35, no. 3, Rio de Janeiro, Sept./Dec. 2015.

A. Hertel,
Hamiltonian Cycles in Sparse Graphs.
M.Sc. thesis, University of Toronte, 2004.

J. Hess, G. D. Tipaldi, and W. Burgard,
Null Space Optimization for Effective Coverage of 3D Surfaces using Redundant
Manipulators
.
Proceedings IROS, 2012.

J. Hess, M. Beinhofer, D. Kuhner, P. Ruchti, and W. Burgard,
Poisson-Driven Dirt Maps for Efficient Robot Cleaning.
Proc. of the IEEE Int. Conf. on Robotics and Automation, 2013.

J. Hess, M. Beinhofer, and W. Burgard,
A Probabilistic Approach to High-Confidence Cleaning Guarantees for
Low-Cost Cleaning Robots
.
Proc. of the IEEE Int. Conf. on Robotics and Automation, 2014.

J. Hess,
Efficient Approaches to Cleaning with Mobile Robots.
Dissertation, Albert-Ludwigs-Universität Freiburg im Breisgau, 2015.

N. Holden and G. Hasle,
Extending the Lin-Kernighan algorithm to improve solutions to VRPs with Time Windows.
SINTEF report A13822, 2009.

K. Holmberg,
The (Over) Zealous Snow Remover Problem.
Report, Linöping University, 2016.

M. Horvat,
A Graph-Based Approach to String Regeneration.
MPhil Thesis, University of Cambridge, 2013.

M. Horvat and W. Byrne,
A Graph-Based Approach to String Regeneration.
EACL Student Research Workshop, 2014.

M. Hosseinabady, S. Sharifi, F. Lombardi, and Z. Navabi,
A Selective Trigger Scan Architecture for VLSI Testing.
IEEE Trans. Computers, 57(3), pp. 316-328, 2008.

S. Hougardy and R. T. Schroeder,
Edge Elimination in TSP Instances.
University of Bonn, Report No: 131066, 2014.

R. Houston,
Tackling the Minimal Superpermutation Problem.
arXiv:1408.5108, 2014.

A. Howe and L. D. Whitley,
Landscape Analysis and Algorithm Development for Plateau Plagued Search Spaces.
Air Force Office of Scientific Research, 8/08-11/10, 2011.

C. Hu and Y. Wang,
Minimizing the Number of Mobile Chargers to Keep Large-Scale WRSNs
Working Perpetually.
International Journal of Distributed Sensor Networks, Article ID 782952, Volume 2015.

J. A. Hughes.
A Study of Ordered Gene Problems Featuring DNA Error Correction and
DNA Fragment Assembly with a Variety of Heuristics, Genetic Algorithm
Variations, and Dynamic Representations
.
M.Sc. thesis, Brock University St. Catharines, 2014.

J. A. Hughes, S. Houghten, and D. Ashlock,
Restarting and Recentering Genetic Algorithm Variations for DNA Fragment Assembly:
The Necessity of a Multi-Strategy Approach
.
BioSystems, doi:10.1016/j.biosystems.2016.08.001, 2016.

F. Hutter, L. Xu, H. H. Hoos, and K. Leyton-Brown,
Algorithm Runtime Prediction: The State of the Art.
Artificial Intelligence Journal, submitted, 2012.

F. Hutter, H. H. Hoos, and K. Leyton-Brown,
Identifying Key Algorithm Parameters and Instance Features using Forward Selection.
Learning and Intelligent Optimization (LION 7). 2013.

V. A. Huynh, J. Enright, and E. Frazzoli,
Persistent Patrol with Limited-range On-Board Sensors.
49th IEEE Conference on Decision and Control, pp. 7661-7668, 2010.

W. Höhn, F. G. König, M. E. Lübbecke, and R. H. Möhring,
Sequencing and Scheduling in Coil Coating with Shuttles.
Technische Universität Berlin. Tech-Report 001-2009, 2009.

W. Höhn, F. G. König, R. H. Möhring, and M. E. Lübbecke,
Integrated Sequencing and Scheduling in Coil Coating.
Management Science, Vol. 57, No. 4, pp. 647-666, 2011.

W. Höhn and R. H. Möhring,
Integrating Sequencing and Scheduling:
A Generic Approach with Two Exemplary Industrial Applications
.

In L. Kliemann and P. Sanders (Eds.): Algorithm Engineering,
LNCS 9220, pp. 330-351, 2016.

F. Imeson and S. L. Smith,
A Language For Robot Path Planning in Discrete Environments:
The TSP with Boolean Satisfiability Constraints
.
Conf. on Robotics and Automation, Hong Kong, China, May 2014.

M. A. Ismail,
Design Of A Parallel Multi Threaded Programming Model For Multi Core Processor.
Ph.D. thesis, NED University of Engineering & Technology, Karachi. 2011.

M. A. Ismail, S. H. Mirza, and T. Altaf,
A Parallel and Concurrent Implementation of Lin- Kernighan Heuristic (LKH-2)
for Solving Traveling Salesman Problem for Multi-Core Processors using
SPC3 Programming Model
.
International Journal of Advanced Computer Science and Applications, Vol. 2, No. 7,
pp. 34-43, 2011.

H. Ismkhan,
Effective Three-Phase Evolutionary Algorithm to Handle the Large-Scale Colorful
Traveling Salesman Problem.

Expert Systems with Applications 67. pp148-162, 2017.

H. Ismkhan and K. Zamanifar,
Developing programming tools to handle traveling salesman problem by the three
object-oriented languages
.
Applied Computational Intelligence and Soft Computing, Article 18, 2014.

C. E. Izquierdo, A. Rossi, and M. Sevaux,
Modeling and solving the clustered capacitated vehicle routing problem.
Proceedings of the 14th EU/ME workshop, pp. 110-115, 2013.

S. H. Jacobson,
Finite-Time Performance of Local Search Algorithms: Theory and Application.
Research report, University of Illinois, 2009.

J. P. Jackson,
Constrained Task Assignment and Scheduling On Networks of Arbitrary Topology.
Ph.D. thesis, University of Michigan, 2012.

Dae-Sung Jang, Hyeok-Joo Chae, and Han-Lim Choi,
Optimal Control-Based UAV Path Planning with Dynamically-Constrained TSP with
Neighborhoods
.

eprint arXiv:1612.06008, 2016.

S. S. J. Jaheruddin,
Friendly Interchange Heuristic for Vehicle Routing Problems with Time Windows.
BSc Thesis, Tilburg University, 2010.

F. R. Jensen,
Using the Traveling Salesman Problem in Bioinformatic Algorithms.
M.Sc. thesis, Department of Computer Science, Aarhus University, 2010.

M. A. F. Jensen, C. G. Sørensen, and D. Bochtis,
Assessment of Track Sequence Optimization based on Recorded Field Operations.
Proceedings of EFITA / WCCA / CIGR, 203.

H. Jiang, Y. Hu, Q. Li and, H. Yu,
Fat Computational Complexity and Heuristic Design for the TSP.
Journal of Software, Vol.20, No.9, pp. 2344−2351, 2009.

Z. Jiang, J. Liu,and S. Wang,
Traveling salesman problems with PageRank Distance on complex networks reveal
community structure
.
Physica A: Statistical Mechanics and its Applications, available online, 2016.

D. S. Johnson and L. A. McGeoch,
Experimental Analysis of Heuristics for the STSP.
The Traveling Salesman Problem and its Variations, G. Gutin and A. Punnen, Editors,
pp. 369-443, 2002.

D. S. Johnson and L. A. McGeoch,
Experimental Analysis of Heuristics for the ATSP.
The Traveling Salesman Problem and its Variations, G. Gutin and A. Punnen, Editors,
pp. 445-487, 2002.

G. Jäger,
The Theory of Tolerances with Applications to the Traveling Salesman Problem.
Habilitation Thesis, Christian Albrechts University of Kiel, 2010.

G. Jäger, C. Dong, B. Goldengorin, P. Molitor, D. Richter,
A backbone based TSP heuristic for large instances.
Journal of Heuristics, December 2013.

K. Jörnsten and J. Kaclsics,
A New Lagrangean Approach for the Travelling Salesman Problem.
NHH Dept. of Business and Management Science Discussion Paper
No. 2015/4, 2015.

A. B. Kahng and S. Reda,
Match twice and stitch: a new TSP tour construction heuristic.
Operations Research Letters, Volume 32, pp. 499-509, 2004.

B. Klocker, H. Fleischner, and G. R. Raidl,
Finding Uniquely Hamiltonian Graphs of Minimum Degree Three
with Small Crossing Numbers
.
Hybrid Metaheuristics, 10th International Workshop, 2016.

L. T. Kóczy, P. Földesi, B. Tüü-Szabó,
An effective Discrete Bacterial Memetic Evolutionary Algorithm for
the Traveling Salesman Problem
.
International Journal of Intelligent Systems, 10.1002/int.21893, 2017.

O. Koenig and M. Jouaneh,
Minimization of Airtime in Cutting and Welding Applications.
Proceedings of the 2005 IEEE International Conference on
Robotics and Automation, pp. 3300-3305, 2005.

F. G. König,
Sorting with Objectives - Graph Theoretic Concepts in Industrial Optimization.
Doctoral Thesis, Technische Universität Berlin, November 2009.

C. Konstantopoulos, B. Mamalis, G. Pantziou, V. Thanasias,
Watershed-Based Clustering for Energy Efficient Data Gathering in Wireless Sensor
Networks with Mobile Collector.

Lecture Notes in Computer Science Volume 7484, pp. 754-766, 2012.

C. Konstantopoulos, B. Mamalis, G. Pantziou, V. Thanasias,
An image processing inspired mobile sink solution for energy efficient data gathering
in wireless sensor networks
.
Wireless Networks, 21, DOI 10.1007/s11276-014-0779-x, pp. 227-249, 2015.

O. Korb,
Das Traveling Salesman Problem im GAILS-Framework: Integration und Analyse.
Student's thesis, Fachgebiet Intellektik, Fachbereich Informatik,
Technische Universität Darmstadt, Darmstadt, Germany, 2004.

L. Kotthoff, P. Kerschke, H. H. Hoos, and H. Trautmann,
Improving the State of the Art in Inexact TSP Solving using Per-Instance
Algorithm Selection
.
Learning and Intelligent Optimization 9, 2015.

A. Kovács,
Integrated task sequencing and path planning for robotic remote laser welding.
International Journal of Production Research, DOI: 10.1080/00207543.2015.1057626, 2015.

V. S. Kumar, B. Rutt, T. Kurc, U. Catalyurek, J. Saltz, S. Chow, S. Lamont,
and M. Martone,
Large Image Correction and Warping in a Cluster Environment.
SC06, International Conference for High Performance Computing, Networking,
Storage and Analysis, 2006.

V. S. Kumar,
Specification, Configuration and Execution of Data-Intensive Scientific Applications.
Ph.D. thesis, The Ohio State University, 2010.

S. Kumar and S. Chakravorty,
Multi-agent Generalized ProbabIlistic RoadMaps : MAGPRM.
Parasol Seminar, Texas A&M University, 2012.

S. Kumar,
Generalized Sampling-Based Feedback Motion Planners.
Ph.D. thesis, Texas A&M University, 2012.

M. Lam, J. Mittenthal, and B. Gray,
The impact of stopping rules on hierarchical capacitated clustering in location
routing problems
.
Academy of Information and Management Scineces Journal, Vol. 12, No. 1, pp. 13-28, 2009.

M. Lam and J. Mittenthal,
Capacitated hierarchical clustering heuristic for multi depot location-routing problems.
International Journal of Logistics: Research and Applications, 2013.

J. C. Lang,
MIP-Based Heuristics for Capacitated Lot-Sizing with Sequence-Dependent Setups and
Substitutions
.
Lecture Notes in Economics and Mathematical Systems, Vol. 636, pp. 151-183, 2010.

J. C. Lang and Z.-J. M. Shen,
Fix-and-optimize heuristics for capacitated lot-sizing with sequence-dependent setups
and substitutions
.
European Journal of Operational Research, 214(3), pp. 595-605, 2011.

J. Lee, S. Onn, and R. Weismantel,
Nonlinear Optimization over a Weighted Independence System.
Lecture Notes in Computer Science, Volume 5564, pp. 251-264, 2009.

D. R. Levy,
Multiple Vehicle Routing Problem with Fuel Constraints.
M.Sc. thesis, Texas A&M University, 2013.

K. T. Le Dong, H. B. Kewal, and K. Saluja,
Test Time Reduction to Test for Path-Delay Faults using Enhanced Random-Access Scan.
20th International Conference on VLSI Design, pp. 769-774, 2007.

C. Li,
Rational swarm for global optimization.
Ph.D. thesis, University of Virginia, 2010.

K. Li, H. Luan, and C-C. Shen,
Qi-ferry: Energy-constrained wireless charging in wireless sensor networks.
WCNC, pp. 2515-2520, 2012.

Y. Liang, L. Ju, S. Chakraborty, T. Mitra, and A. Roychoudhury,
Cache-aware Optimization of BAN Applications.
ACM International Conference on Hardware/Software Codesign and System Synthesis,
pp. 149-154, 2008.

S. Lin, C. L. Lee, and J. E. Chen,
A cocktail approach on random access scan toward low power and high efficiency test.
Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design,
pp. 94-99, 2005.

S.-W. Lin and K.-C. Ying,
Optimization of makespan for no-wait flowshop scheduling problems using efficient
matheuristics

Omega, Volume 64, pp. 115-125, 2016.

Z. Lin, J. Fu, H. Shen, W. Gan, S. Yue,
Tool path generation for multi-axis freeform surface finishing with the LKH TSP solver.
Computer-Aided Design, Vol. 69, pp. 51-61, 2015.

Z. Lin, J. Fu, Y. Sun, Q. Gao, and G. Xu,
Non-retraction toolpath generation for irregular compound freeform surfaces with the
LKH TSP solver
.
The International Journal of Advanced Manufacturing Technology, pp. 1-15, 2017.

R. Linfati, J. W. Escobar, and G. Gatica,
Un algoritmo metaheurístico para el problema de localización y ruteo con flota heterogénea.
Ingeniería y Ciencia-ing. cienc. 10 (19), pp. 55-76, 2014.

R. Linfati, J. W. Escobar and G. Gatica,
Un algoritmo metaheurístico para el problema de localizaciòn y ruteo con flota
heterogénea
.
Ingeniería y Ciencia - ing.cienc., Vol. 10 (19), pp. 55-76, 2014.

F. Liu and G. Zeng,
Study of genetic algorithm with reinforcement learning to solve the TSP.
Expert Systems with Applications, 36, pp. 6995-7001, 2009.

L. Lozano, J. C. Smith, and M. E. Kurz,
Solving the traveling salesman problem with interdiction and fortification.
Operations Research Letters, In Press, 2017.

T. Lust and J. Teghem,
Two Phase Stochastic Local Search Algorithms for the Biobjective Traveling
Salesman problem
.
IRIDIA, Technical Report No.TR/IRIDIA/2007-014, pp. 21-25, 2007.

T. Lust and J. Teghem,
Two-phase Pareto local search for the biobjective traveling salesman problem.
Journal of Heuristics, 2009, DOI:10.1007/s10732-009-9103-9.

T. Lust and J. Teghem,
Multiobjective Decomposition of Positive Integer Matrix: Application to Radiotherapy.
EMO 2009, pp. 335-349.

E. Lutton, H. Gilbert, W. Cancino, B. Bach, J. Pallamidessi, P. Parrend, and P. Collet,
Visual and Audio Monitoring of Island Based Parallel Evolutionary Algorithms.
Journal of Grid Computing, pp. 1-19, 2014, DOI 10.1007/s10723-014-9321-8.

D. Luxen,
Lokale Suche in variabler Tiefe.
Diploma Thesis, Goethe Universität, Frankfurt, 2007.

N. Löhndorf, M. Riel, and S, Minner,
Simulation Optimization for the Stochastic Economic Lot Scheduling Problem with
Sequence-Dependent Setup Times
.
Optimization Online, 2012.

G. M. Mallén-Fullerton and G. Fernández-Anaya,
DNA fragment assembly using optimization.
IEEE Congress on Evolutionary Computation 2013: pp. 1570-1577.

G. M. Mallén-Fullerton, J, A. Hughes, S. Houghten, and G. Fernández-Anaya,
Benchmark datasets for the DNA fragment assembly problem.
Int. J. Bio-Inspired Computation, Vol. 5, No. 6, pp, 384-394, 2013.

B. Mamalis,
Prolonging Network Lifetime in Wireless Sensor Networks with Path-Constrained
Mobile Sink
.
International Journal of Advanced Computer Science and Applications,
Vol. 5, No. 10, 2014.

D. Manerba and R. Mansini,
A branch-and-cut algorithm for the Multi-Vehicle Traveling Purchaser Problem with
Exclusionary Side Constraints
.
Technical Report No. 02, University of Brescia, 2013.

D. Manerba, M, Gendreau, and R. Mansini,
The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints
and unitary demands: A branch-and-price approach
.
CIRRELT, CIRRELT-2014-52, 2014.

S. G. Manyam, S. Rathinam, and S. Darbha,
Computation of Lower bounds for a Multiple Depot, Multiple Vehicle Routing Problem
With Motion Constraints
.
ASME Dynamic Systems and Control Conference, 2015.

S. G. Manyam, S. Rathinam, S. Darbha, D. Casbeer, Y. Cao, and P. Chandler,
GPS Denied UAV Routing with Communication Constraints
Journal of Intelligent & Robotic Systems, doi: 10.1007/s10846-016-0343-2, pp. 1-13, 2016.

S. G. Manyam, S. Rathinam, S. Darbha, and K. J. Obermeyer,
Lower Bounds for a Vehicle Routing Problem with Motion Constraints.
Journal of Intelligent & Robotic Systems, 30(3), pp. 1-13, 2015.

Y. Marinakis and A. Migdalas, and P. M. Pardalos,
Expanding Neighborhood GRASP for the Traveling Salesman Problem.
Computational Optimization and Applications, Volume 32, Number 3, pp. 231-257, 2005.

E. Marques, S. de Givry, P. Stothard, B. Murdoch, Z. Wang, J. Womack, and S. S. Moore,
A high resolution radiation hybrid map of bovine chromosome 14 identifies scaffold
rearrangement in the latest bovine assembly
.
BMC Genomics, 8: 254, 2007.

E. Marques,
Application of Genomics-based Tools Leading to the Identification of Markers on
Bovine Chromosome 14 Influencing Milk Production and Carcass Quality Traits
.
Ph.D. thesis, University of Alberta, 2009.

N. Mathew, S. L. Smith, and S. L. Waslander,
A Graph-Based Approach to Multi-Robot Rendezvous for Recharging in Persistent Tasks.
IEEE Conf. on Robotics and Automation, 2013.

N. Mathew, S. L. Smith, and S. L. Waslander,
Optimal Path Planning in Cooperative Heterogeneous Multi-robot Delivery Systems.
Workshop on the Algorithmic Foundations of Robotics, 2014.

N. Mathew, S. L. Smith, and S. L. Waslander,
Multirobot Rendezvous Planning for Recharging in Persistent Tasks.
IEEE Transactions on Robotics. 128. Volume: 31. Issue: 1, 2015.

N. Mathew, S. L. Smith, and S. L. Waslander,
Planning Paths for Package Delivery in Heterogeneous Multirobot Teams.
IEEE Transactions on Automation Science and Engineering. 1298. Volume: 12. Issue: 4, 2015.

N. Mathew,
Discrete Path Planning Strategies for Coverage and Multi-robot Rendezvous.
Thesis, University of Waterloo, 2013.

M. Matusiak, R. de Koster, and J. Saarinen,
Data-driven warehouse optimization: deploying skills of order pickers.
ERIM Report Series Reference No. ERS-2015-008-LIS, 2015.

D. Mitra, S. Roy, K. Chakrabarty, and B. B. Bhattacharya,
On-Chip Sample Preparation with Multiple Dilutions using Digital Microfluidics.
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems,
33 (8), pp. 1131-1141, 2014.

M. Matusiak,
Optimizing Warehouse Order Batching when Routing Is Precedence Constrained and
Pickers Have VaryingSkills
.
Doctoral Dissertationa 62/2014, Aalto University publication series, 2014.

R. Montemanni, J. Barta, and L.M. Gambardella,
The robust traveling salesman problem with interval data.
Technical report IDSIA-20-05,
Istituto Dalle Molle di Studi sull'Intelligenza Artificiale (IDSIA), 2005.

R. Montemanni, J. Barta, and L.M. Gambardella,
Heuristic and preprocessing techniques for the robust traveling salesman problem
with interval data
.
Technical report IDSIA-01-06,
Istituto Dalle Molle di Studi sull'Intelligenza Artificiale (IDSIA), 2006.

M. Moshir, D. W. Murphy, D. L. Meier, and M. H. Milman,
Systems engineering and application of system performance modeling in SIM Lite Mission.
Proc. SPIE, Vol. 7734-52, 2010.

O. Muliarevych and V. Golembo,
New Approaches for Solving Traveling Salesman Problems Using Agent Swarm
Iintelligence Behavior Model
.
European Cooperation, Vol. 5(5), 2015.

D. W. Murphy, M. H. Milman, D. L. Meier, and M. Moshir,
SIM Lite narrow-angle modeling and processing.
Proc. SPIE 7734-23, 2010.

Z.. Mu,
Analysing the empirical time complexity of high-performance algorithms for SAT and TSP.
M.Sc. thesis, University of British Columbia, 2015.

Z. Mu, H. H. Hoos, and Thomas Stützle,
The Impact of Automated Algorithm Configuration on the Scaling Behaviour
of State-of-the-Art Inexact TSP Solvers
.
International Conference on Learning and Intelligent Optimization, pp. 157-172, 2016.

O. Muliarevych and V. Golembo,
New approaches for solving travelling salesman problems using agents swarm
intelligence behavior model
,
Współpraca europejska, Nr 5(5), pp. 131-143, 2015.

A. Mustedanagic,
A generalized vehicle routing problem with spatial and temporal synchronization.
Mathematical modelling and solution
.
M.Sc. thesis, Chalmers tekniska högskola, 2016.

Y. Nagata and S. Kobayashi,
A Powerful Genetic Algorithm Using Edge Assembly Crossover for the Traveling
Salesman Problem
.
INFORMS Journal on Computing, 2012.

Z. Naji-Azimi,
Algorithms for Combinatorial Opimization Problems.
Ph.D. thesis, Università di Bologna, 2010.

Z. Naji-Azimi, M. Salari, and P. Toth,
A heuristic procedure for the Capacitated m-Ring-Star problem.
European Journal of Operational Research, 2010. DOI:10.1016.

B. T. Nguimeya, M. Soh, and L. P. Fotso,
Algorithmes hybrides pour la résolution du problème du voyageur de commerce.
Procesedings of CARI, pp. 63-74, 2016.

A. G. Nikolaev, S. H. Jacobson, S. N. Hall, and D. Henderson,
A framework for analyzing sub-optimal performance of local search algorithms.
Computation Optimization and Applications, 2009. DOI:10.1007/s10589-009-9290-1.

A. G. Nilolaev and S. H. Jacoson,
Using Markov Chains to Analyze the Effectiveness of Local Search Algorithms.
Discrete Optimization, Volume 8, Issue 2, pp. 160-173, 2011,

H. D. Nguyen, I. Yoshihara, K. Yamamo, and M. Yasunaga,
Implementation of an effective hybrid GA for large-scale traveling salesman problems.
IEEE Transactions on Systems, Man, and Cybernetics, Part B 37 (1), pp. 92-99, 2007.

A. Nowak, S. Villar, A. S. Bandeir, and J. Bruna,
A Note on Learning Algorithms for Quadratic Assignment with Graph Neural Networks.
eprint arXiv:1706.07450, 2017.

J. Le Ny and E. Feron,
Approximation Algorithms for the Dubins' Traveling Salesman Problem.
MIT-LIDS report #2654, 2005.

J. Le Ny and E. Feron,
An Approximation Algorithm for the Curvature-Constrained Traveling Salesman Problem.
Proceedings Allerton Conference on Communications, Control and Computing, 2005.

J. Le Ny,
Performance optimization for unmanned vehicle systems.
Ph.D. thesis, MIT, 2008 .

J. Le Ny, M. M. Zavlanos, and G. J. Pappas,
Resource Allocation for Signal Detection with Active Sensors.
Proceedings of the 28th Chinese Control Conference, 2009.

P. Oberlin,
Path Planning Algorithms for Multiple Heterogeneous Vehicles.
M.Sc. thesis, Texas A&M University, 2009.

P. Oberlin, S. Rathinam, and S. Darbha,
A transformation for a Heterogeneous, Multiple Depot, Multiple Traveling Salesman Problem.
American Control Conference, pp. 1292-1297, 2009.

P. Oberlin, S. Rathinam, and S. Darbha,
Today's Traveling Salesman Problem.
Heterogeneous, multiple depot, multiple UAV routing problem
.
IEEE Robotics & Automation Magazine, Vol. 17 (4), pp.70-77, 2010.

K. J. Obermeyer,
Visibility Problems for Sensor Networks and Unmanned Air Vehicles.
Ph.D. thesis, University of California at Santa Barbara, 2010.

K. J. Obermeyer, P. Oberlin, and S. Darbha,
Sampling-Based Path Planning for a Visual Reconnaissance UAV.
AIAA Journal of Guidance, Control, and Dynamics, 2011.

J. B. Odili, Mohammad, N. Kahar, and A. Noraziah,
Solving Traveling Salesman’s Problem Using African Buffalo Optimization,
Honey Bee Mating Optimization & Lin-Kerninghan Algorithms
.
World Applied Sciences Journal 34 (7), pp. 911-916, 2016.

D. Ospina-Toro, E. M. Toro-Ocampo, and R. A. Gallego-Rendón,
Methodology for creating feeder routes in mass transit systems.
Revista Facultad de Ingeniería, v. 26, n. 45, 2017.

C. Oysua and Z. Bingul,
Application of heuristic and hybrid-GASA algorithms to tool-path optimization problem
for minimizing airtime during machining
.
Engineering Applications of Artificial Intelligence, Vol. 22 (3), pp. 389-396, 2008.

S. G. OzdenA. E. Smith, and K. R. Gue,
Solving large batches of traveling salesman problems with parallel and
distributed computing
.
Computers & Operations Research, In Press, 2017.

S. G. Ozden,
A Computational System to Solve the Warehouse Aisle Design Problem.
PhD. thesis, Auburn University, 2017.

A. Palau,
Solucions Paral·leles del TSP utilitzant Oracle Coherence.
Thesis, Universitat Politècnica de Catalunya, 2013.

E. Pampalk, T. Pohle, J. Petrak, S. Dixon, F. Gouyon, and A. Flexer,
D3.5.1 Music Collection Structuring and Navigation Module.
SIMAC, public deliverable, 2006.

L. Pansart,
Exact algorithms for picking problem.
M.Sc. thesis, Université Grenoble Alpes, 2016.

L. Pansarta, N. Catussea, and H. Cambazarda,
Exact algorithms for the picking problem.
arXiv:1703.00699v1, 2017.

C. Papachristos, K. Alexi, L. R. G. Carrillo, and A. Tzes,
Distributed infrastructure inspection path planning for aerial robotics subject
to time constraints
.
Proceedings of the International Conference on Unmanned Aircraft System, 2016.

C Papachristos and K Alexis,
Augmented reality-enhanced structural inspection using aerial robots.
IEEE International Symposium on Intelligent Control, 2016.

M. Park, P. Oberlin, S. Rathinam, L. Quadrifoglio, and S. Darbha,
Algorithms for Routing Vehicles and Their Application to the Paratransit Vehicle
Scheduling Problem
.
UTCM Final Technical Reports, UTCM 09-15-13, 2012.

P. Pellegrini and E. Moretti,
Quick-and-dirty ant colony optimization.
Proceedings of the 9th annual conference on Genetic and evolutionary
computation, 2007.

P. Pellegrini and E. Moretti,
A Computational Analysis on a Hybrid Approach: Quick-and-dirty ant colony optimization.
Applied Mathematical Sciences, Vol. 3, no. 23, pp. 1127-1140, 2009.

F. Perea, R. Ruiz,and K. Katragjini,
Integer programming, clustering, and local search approaches for grouping urban
waste collection sites
.
Boletín de Estadística e Investigación Operativa, 32(3), pp. 203-224, 2016.

A. Petrenko, O. N. Timo, and S. Ramesh,
Model-based testing of automotive software: some challenges and solutions.
Proceedings of the 52nd Annual Design Automation Conference, 2015.

A. Petrie and T. R. Willemain,
The snake for visualizing and for counting clusters in multivariate data.
Statistical Analysis and Data Mining, Vo. 3, Issue 4, pp. 236-252, 2010.

U. Pferschy and R. Staněk,
Generating subtour constraints for the TSP from pure integer solutions.
Central European Journal of Operations Research, Volume 25, Issue 1,
pp. 231-260, 2017.

J. Pihera and N. Musliu,
Application of Machine Learning to Algorithm Selection for TSP.
Proc. of the IEEE 26th Int. Conference on Tools with Artificial Intelligence, 2014.

E. Plaku, S. Rashidian, and S.Edelkamp,
Multi-group motion planning in virtual environments.
Comp. Anim. Virtual Worlds. DOI: 10.1002/cav.1688, 2016.

A. Plebe and A. M. Anile,
A Neural-Network-Based Approach to the Double Traveling Salesman Problem.
Neural Computation, 14(2), pp. 437-471, 2002.

T. Pohle, E. Pampalk, and G. Widmer,
Generating Similary-based Playlist Using Traveling Salesman Algorithms.
Proc. of the 8th Int. Conference on Digital Audio Effects (DAFx'05),
Madrid, Spain, September 20-22, 2005.

A. Prasad,
Fine Scale Mapping and Association Study of Economically Important Traits on
Chromosomes 19 and 29 in Beef and Dairy Cattle
.
Ph.D. thesis, University of Alberta, 2009.

Álvaro Nunes Prestes,
Uma Análise Experimental de Abordagens Heurìsticas Aplicadas ao Problema do
Caixeiro Viajante
.
Dissertaçâo de mestrado, Universidade Federal do Rio Grande do Norte, 2006.

C. C. Price,
Applications of Operations Research Models to Problems in Health Care.
Dissertation, University of Maryland, 2009.

J. Qin,
Algorithms for an Unmanned Vehicle Path Planning Problem.
Thesis, Texas A&M University, 2013.

N-H. Qutteineh, T. Larsson, K. Lundberg, K. Holmberg,
Aircraft Mission Planning.
Technical Report LiTH-MAI-R-2012/07-SE, Linköping University, 2012.

K. R. Rajagopal, S. Darbha and S. Rathinam,
Combinatorial Motion Planning Algorithms for a Heterogeneous Collection of Unmanned
Vehicles
.
Technical report, 1410, Texas Engineering Experiment Station, 2013.

R. Ramakrishnan, P. Sharma, and A. P. Punnen,
An efficient heuristic algorithm for the bottleneck traveling salesman problem.
OPSEARCH, 46(3), pp. :275-288, 2009.

R. Rangarajan,
Approximation Algorithms and Heuristics for a Heterogeneous Traveling Salesman.
M.Sc. thesis, National Institute of Technology, Jalandhar, 2011.

K. Ravichandran and S. Pande,
Multiverse: Efficiently Supporting Distributed High-Level Speculation.
ACM SIGPLAN Notices - OOPSLA '13, 48(10), pp. 533-552 , 2013.

S. S. Ray, S. Bandyopadhyay, and S. K. Pal,
Genetic Operators for Combinatorial Optimization in TSP and Microarray Gene Ordering.
Applied Intelligence, vol. 26(3), pp. 183-195, 2007.

S. S. Ray,
New Computational Methods for Gene Analysis from Microarray Data.
Ph.D. thesis, Jadavpur University, 2008.

C. Rego, D. Gamboa, F. Glover, and Colin Osterman,
Traveling salesman problem heuristics: Leading methods, implementations and
latest advances
.
European Journal of Operational Research, 211(3), pp. 427-441, 2011.

C. Rego, D. Gamboa, and F. Glover,
Doubly-Rooted Stem-and-Cycle Ejection ChainAlgorithm for the Asymmetric Traveling
Salesman Problem
.
Networks, Volume 68, Issue 1, pp. 23-33, 2016.

C. Rego, D. Gamboa, and F. Glover,
Doubly-Rooted Stem-and-Cycle Ejection ChainAlgorithm for the Asymmetric Traveling
Salesman Problem
.
Networks, 28 April, 2016.

H. Renard, Y. Robert, and F. Vivien,
Static load-balancing techniques foriterative computations on heterogeneous clusters.
INRIA, Ecole normale supérieure de Lyon,
Research Report No 2003-12, 2003.

J. Renaud, F. F. Boctor, and G. Laporte,
Fast and Efficient Heuristics to Solve Two Version of the Median Cycle Problem.
Unicersité Laval,
Research Report, No 2003-020, 2003.

J. Renaud, F. F. Boctor, and G. Laporte,
Efficient heuristics for Median Cycle Problems.
Journal of the Operational Research Society, 55(2), pp.179-186, 2004.

Dirk Richter,
Toleranzen in Helsgauns Lin-Kernighan-Heuristik für das TSP.
Diploma Thesis, Martin-Luther-University Halle-Wittenberg, 2006.

D. Richter, B. Goldengorin, G. Jäger, and P. Molitor,
Improving the Efficiency of Helsgauns Lin-Kernighan Heuristic for the Symmetric TSP.
Fourth Workshop on Combinatorial and Algorithmic Aspects of Networking, 2007.

A. M. Rocha, E. Fernandes, and J. Soares,
Solution of asymmetric traveling salesman problems combining the volume and
simplex algorithms
.
Technical Report, University of Minho, 2004.

A. M. Rocha, E. Fernandes, and J. Soares,
Aplicação do algoritmo volumétrico à resolução aproximada e exacta do problema
do caixeiro viajante assimétrico
.

Investigação Operacional, 25, pp. 277-294, 2005.

A. Rodrìguez and R. Ruiz,
El impacto de la asimetrìa en la resolución de problemas de distribución y rutas.
3rd International Conference on Industrial Engineering and Management,
pp. 1645-1654, 2009.

A. Rodrìguez and R. Ruiz,
The effect of asymmetry on traveling salesman problems.
Technical Report, Universidad Polité́cnica de Valencia, 2010.

A. Rohleder,
Kandidatenmengen für das TSP - Ein neuer heuristischer Ansatz.
Josef Eul Verlag, 2006.

D. G. Rossit, D. Vigo, F. Thomé, and M. Frutos,
Improving Visual Attractiveness in CapacitatedVehicle Routing Problems:
a Heuristic Algorithm
.
Proceedings of CLAIO, pp. 748-755, 2016.

A. Sadeghi and S. L. Smith,
On Efficient Computation of Shortest Dubins Paths Through Three Consecutive Points.
Systems and Control, 2016.

A. Sadeghi and S. L. Smith,
Heterogeneous Task Allocation and Sequencing via Decentralized Large
Neighborhood Search
.
Unmanned Systems, Vol. 5, No. 2, pp. 1-17, 2017.

A. J. Sadovsky, P. B. Kruskal, J. M. Kimmel, J. Ostmeyer, F. B. Neubauer,
and J. N. Maclean,
Heuristically Optimal Path Scanning (HOPS) for High Speed Multiphoton Circuit Imaging.
Journal of Neurophysiology, Vol. 106, No. 3, pp. 1591-1598, 2011.

T. Sahai, S. Klus, and M. Dellnitz,
A Traveling Salesman Learns Bayesian Networks.
Science i/o, arXiv:1211.4888v1, 2012.

T. Sahai, S. Klus, and M. Dellnitz,
Continuous Relaxations for the Traveling Salesman Problem.
arXiv:1702.05224, 2017.

Y. Sakurai, K. Takada, N. Tsukamoto, T. Onoyama, R. Knauf, and S. Tsuruta,
Backtrack and Restart Genetic Algorithm to Optimize Delivery Schedule.
Sixth International Conference on Signal-Image Technology and Internet Based Systems,
pp. 85-92, 2010.

M. Salari,
Formulations and Algorithms for Routing Problems.
Thesis, University of Bologna, 2010.

D. Sanches, D. Whitley, and R. Tinós,
Improving an Exact Solver for the Traveling Salesman Problem using Partition Crossover.
Proceedings of GECCO '17, pp. 337-344, 2017.

K. Sang-Ho, G. Young-Gun, and Maing-Kyu,
Application of the out-of-kilter algorithm to the asymmetric traveling salesman problem.
Journal of the Operational Research Society, 54(10), pp. 1085-1092, 2003.

S. G. Manyam, S. Rathinam, S. Darbha, D. Casbeer, Y. Cao, and P Chandler,
GPS Denied UAV Routing with Communication Constraints.
J. Intell. Robot Syst, 84, pp. 691-703, 2016.

J. G. Sauer,
Abordagem de evolução diferencial híbrida com busca local aplicada ao problema
do caixeiro viajante
.
Thesis, Pontifícia Universidade Católica do Paraná, 2007.

J. G. Sauer and L. Coelho,
Discrete Differential Evolution with local search to solve the Traveling Salesman Problem:
Fundamentals and case studies
.
7th IEEE International Conference on Cybernetic Intelligent Systems, pp. 1-6, 2008.

P. Schrammel, T. Melham, and D. Kroening,
Chaining Test Cases for Reactive System Testing (extended version).
arXiv:1306.3882, University of Oxford, 2013.

B. Schubert and O. Kohlbacher,
Designing string-of-beads vaccines with optimal spacers.
Genome Medicine, 8:9 doi:10.1186/s13073-016-0263-6, 2016.

B. Schubert, L. de la Garza, C. Mohr, M. Walzer, and O. Kohlbacher,
ImmunoNodes - Graphical Development of Complex Immunoinformatics Workflows.
Bioinformatics BMC series, 18:242, 2017

C. Segura, S. B. Rionda, A. H. Aguirre, and S. I. V. Peña,
A Novel Diversity-based Evolutionary Algorithm for the Traveling Salesman Problem.
Proceedings of GECCO '15, pp. 489-496, 2015.

K. Shin and S. Han,
A Centroid-based Heuristic Algorithm for the Capacitated Vehicle Routing Problem.
Computing and Informatics. Vol. 30, No. 4, pp. 701-720, 2011.

S. L. Smith and F. Imeson,
GLNS: An Effective Large Neighborhood Search Heuristic for the Generalized
Traveling Salesman Problem
.
Computers & Operations Research, May 2017.

T. Soh, D. Le Berre, S. Roussel, M. Banbara, and N. Tamura,
Incremental SAT-based Method with Native Boolean Cardinality Handling for the
Hamiltonian Cycle Problem
.
Lecture Notes in Computer Science, Volume 8761, pp. 684-693, 2014.

S. Song and S. Jo,
Online Inspection Path Planning for Autonomous 3D Modeling using a
Micro-Aerial Vehicle
.
2017 IEEE International Conference on Robotics and Automation, pp. 6217-6224, 2017.

G. R. Souza, E. F.G. Goldbarg, M. C. Goldbarg, and A. M.P. Canuto,
A Multiagent Approach for Metaheuristics Hybridization Applied to the Traveling
Salesman Problem
.
2012 Brazilian Symposium on Neural Networks.

J. Styles, H. H. Hoos, and M. Müller,
Automatically Configuring Algorithms for Scaling Performance.
Learning and Intelligent OptimizatioN Conference, France, Paris, 2011.

J. Styles and H. H.Hoos,
Ordered racing protocols for automatically configuring algorithms for scaling performance.
GECCO 2013: 551-558.

K. Sundar,
Motion Planning for Unmanned Aerial Vehicles with Resource Constraints.
M.Sc. thesis, Texas A&M University, 2012.

K. Sundar and S. Rathinam,
Route Planning Algorithms for Unmanned Aerial Vehicles with Refueling Constraints.
American Control Conference, pp. 3266-3271, 2012.

K. Sundar and S. Rathinam,
A Primal-Dual Heuristic for a Heterogeneous Unmanned Vehicle Path Planning Problem.
International Journal of Advanced Robotic Systems, 10, 2013.

K. Sundar and S. Rathinam,
Generalized multiple depot traveling salesmen problem - polyhedral study
and exact algorithm.

arXiv:1508.01813, 2015.

K. Sundar,
Algorithms for Routing Unmanned Vehicles with Motions, Resource,
and Communication Constraints
.
Ph.D. thesis, Texas A&M University, 2016.

K. Sundar and S. Rathinam,
Multiple depot ring star problem: a polyhedral study and an exact algorthm.
Journal of Global Optimization, Volume 67, Issue 3, pp. 527-551, 2017.

B. Tadunfock Teti and L. P. Fotso,
Heuristiques du problème du voyageur de commerce.
8th African Conference on Research in Computer Science, 2006.

L. Talarico, J. Springael, K. Sörensen, and F. Talarico,
A large neighbourhood metaheuristic fo rthe risk-constrained cash-in-transit
vehicle routing problem
.
Computers & OperationsResearch , In Press, 2016.

L. Talarico, K. Sörensen, and J. Springael,
Meta heuristics for therisk-constrained cash-in-transit vehicle routing problem.
European Journal of Operationa lResearch, Vol. 244, pp. 457-470, 2015.

L. Talarico, K. Sörensen, and J. Springael,
Metaheuristics for the Risk-constrained Cash-in-Transit Vehicle Routing Problem.
University of Antwerp, Research paper 2013-005, 2013.

L. Talarico, K. Sörensen, and J. Springael,
The k-dissimilar vehicle routing problem.
University of Antwerp, Working paper 2013-029, 2013.

L. Talarico, F. Meisel, and K. Sörensen,
Ambulance routing for disaster response with patient groups.
Computers & Operations Research, Vol. 56, pp. 120-133, 2015.

L. Talarico,
Secure Vehicle Routing: models and algorithms to increase security and reduce costs
in the cash-in-transit sector.

Dissertation, Universiteit Antwetpen, 2015.

H. Tamaki,
Alternating cycles contribution: a strategy of tour-merging for the traveling
salesman problem
.

Max-Planck Institute Research Report MPI-I-2003-1-007, 2203.

T. Tanskanen,
Heuristinen etsintä ja tietorakenteet kauppamatkustajan ongelmassa.
Univerty of Helsinki, 2013.

M. Tarkov,
Solving the traveling salesman problem using a recurrent neural network.
Numerical Analysis and Applications. Volume 8. Issue 3. pp. 275-283, 2015.

C. Theys, O. Bräysy, W. Dullaert, and B. Raa,
Towards a Metaheuristic for Routing Order Pickers in a Warehouse.
Evolutionary Methods for Design, Optimization and Control,
P. Neittaanmaki, J. Periaux, and T. Tuovinen (Eds., Barcelona, Spain, 2007.

C. Theys, O. Bräysy, W. Dullaert, and B. Raa,
Using a TSP heuristic for routing order pickers in warehouses,
Journal of Operational Research, 200(3), pp. 755-763, 2010.

W. Tian, X. Wang, Q. Xiong, and Y. Chen,
Obtaining Quality-Proved Near Optimal Results for Traveling Salesman Problem.
Technical Report 20150129, arXiv:1502.00447, 2015.

W. Tian,
NP=P: From Polynomial Time Approximation Bounded Solutions of TSP.
UESTC, arXiv:1605.06183, 2016.

W. Tian, C. Huang, and X. Wang,
A Near Optimal Approach for SymmetricTraveling Salesman Problem in
EuclideanSpace
.
arxiv:1502.00447v2, 2016.

R. Tinós, D. Whitley, and G. Ochoa,
Generalized Asymmetric Partition Crossover (GAPX) for the Asymmetric TSP.
Genetic and Evolutionary Computation Conference, 2014.

R. Tinós, D. Whitley, and A. Howe,
Use of Explicit Memory in the Dynamic Traveling Salesman Problem.
GECCO 2014: 999-1006.

S. Trigui, O. Cheikhrouhou, A. Koubaa, U. Baroudi, and H. Youssef,
FL-MTSP: a fuzzy logic approach to solve the multi-objective multiple traveling
salesman problem for multi-robot systems
.
Soft Computing, doi:10.1007/s00500-016-2279-7, 2016.

S. Trigui, O. Cheikhrouhou, A. Koubaa, U. Baroudi, and H. Youssef,
A clustering market-based approach for multi-robot emergency response applications.

16th IEEE International Conference on Autonomous Robot systems and Competition, 2016.

Huai-Kuang Tsai, Jinn-Moon Yang, Yuan-Fang Tsai, and Cheng-Yan Kao,
An Evolutionary Algorithm for Large Traveling Salesman Problems.
IEEE Trans Syst Man Cybern B Cybern. 34(4), pp. 1718-29, 2004.

"B. Tsofak Nguimeya, M. Soh, and L. P. Fotso,
Algorithmes Hybrides Pour la Résolution du Problème du Voyageur de Commerce.
Proceedings of CARI, 2016.

S. Tsutsui, M. Pelikan, and A. Ghosh,
Edge histogram based sampling with local search for solving permutation problems.
Int. J. Hybrid Intell. Syst., 3(1), pp. 11-22, 2006.

M. Turkensteen, D. Malyshev, B. Goldengorin, and P. M. Pardalos,
The reduction of computation times of upper and lower tolerances for selected combinatorial
optimization problems
.
Journal of Global Optimization, 68(3), pp. 601-622, 2017.

C. Twomey, T. Stützle, M. Dorigo, M. Manfrin, and M. Birattari,
An Analysis of Communication Policies for Homogeneous Multi-colony ACO Algorithms.
Information Sciences, 180, pp. 2390-2404, 2010.

T. Valkonen and T. Kärkkäinen,
Continuous reformulations and heuristics for the Euclidean travelling salesperson problem.
ESAIM: Control, Optimization and Calculus of Variations, 15, 2009.

P. Váña,
Path Planning for Non-holonomic Vehicle in Surveillance Missions.
Master's thesis, Czech Technical University in Prague, 2015.

P. Váña and J. Faigl,
The Dubins traveling salesman problem with constrained collecting maneuvers,
Acta Polytechnica CTU Proceedings 6, pp. 34-39, 2016.

D. E. Vargas,
Metodología de solución híbrida: heuristica-metaheuristica-enumeración implicita 1-0 para
el problema de ruteamiento de vehiculos capacitado (CVRP)
.
Ph.D. thesis, Universidad Tecnológica de Pereira, 2014.

S. Venkatachalam and K. Sundar,
Branch-and-price algorithm for an auto-carrier transportation problem.
arXiv:1605.09030, 2016.

T. Vidal,
Technical Note: Split algorithm in O(n) for the vehicle routing problem.
Computers & Operations Research, Vol. 69, pp. 40-47, 2016.

V. Vig and U. S. Palekar,
On estimating the distribution of optimal traveling salesman tour lengths using
heuristics
.
European Journal of Operational Research, 186, pp. 111-119, 2008.

Ramesh Viswanathan, Jing (Tiffany) Li, and Mooi Choo Chuah,
Message Ferrying for Constrained Scenarios.
World of Wireless Mobile and Multimedia Networks, pp. 487-489, 2005.

C. Walshaw,
A Multilevel Lin-Kernighan-Helsgaun Algorithm for the Travelling Salesman Problem.
Computing and Mathematical Sciences, University of Greenwich,
Mathematics Research Report: 01/IM/80, September 27, 2001.

S. X.-J. Wang,
Analysis of Hybrid Method for Solving the Traveling Salesman Problem to Optimality.
Faculty of Computer Science, Dalhousie University, 2004.

C. Wang, F. Ma, J. Yan, D. De, and S. K. Das,
Efficient Aerial Data Collection with UAV in Large-scale Wireless Sensor Networks.
International Journa lof Distributed SensorNetworks, 8(3), 2015.

X. Wang, B. Golden, and E. Wasil,
The min-max multi-depot vehicle routing problem: heuristics and computational results.
Journal of the Operational Research Society, pp. 1-14, 2014, doi:10.1057/jors.2014.108.

X. Wang, B. Golden, E. Wasil, and R. Zhang,
The min–max split delivery multi-depot vehicle routing problem with minimum service time
requirement
.
Computers & Operations Research, Vol. 71, pp. 110-126, 2016.

Wang, Yong, Peng, Wei, Dou, Qiang, and Gong, Zheng-hu,
Energy-constrained ferry route design for sparse wireless sensor networks.
Journal of Central South University, 20. pp. 3142-3149, 2013.

Yun Wang and Chenh Hu,
Moving as a whole: multirobot traveling problem constrained by connectivity.
Turkish Journal of Electrical Engineering & Computer Sciences, 23, pp. 769-788, 2015.

S. Westphal and K. Noparlik,
A 5.875-approximation for the Traveling Tournament Problem.
Annals of Operations Research, Violume 118, Ussue 1, pp. 347-360, 2014.

L.-P. Wong, M.Y.H. Low, and Chin Soon Chong,
Bee Colony Optimization with local search for traveling salesman problem.
6th IEEE International Conference on Industrial Information, pp. 1019 - 1025, 2008.

L.-P. Wong, M. Y. H. Low, and C. S. Chong,
Finding the Shortest Hamiltonian Circuit of Selected Places in Penang Using a Generic
Bee Colony Optimization Framework
.
Sixth International Conference on Bio-Inspired Computing, pp. 51-57, 2011.

H. Wu, .i Nie, and F.-C. Kuo,
The optimal testing order in the presence of switching cost.
Information and Software Technology, 80, pp. 57-72, 2016.

M. Wu and W. Zhu,
A dynamic convexized method for the TSP.
IEEE International Conferenceon Intelligent Computing and Intelligent Systems,
pp. 307-311, 2010.

S. Wu and T. W. S Chow,
Self-Organizing and Self-Evolving Neurons: A New Neural Network for Optimization.
IEEE Transactions on Neural Networks, Volume 18, Number 3, pp. 385-296, 2007.

X.-F. Xie and J. Liu,
Multiagent optimization system for solving the traveling salesman problem (TSP).
IEEE Transactions on Systems, Man, and Cybernetics - Part B, Vol. 39, No. 2, 2009.

L.-N. Xing, Y.-W. Chen, and X.-S. Shen,
Multiprogramming genetic algorithm for optimization problems with permutation property.
Applied Mathematics and Computation, 185(1), pp. 473-483, 2007.

L.-N. Xing, Y.-W. Chen, K.-W. Yang, F. Hou, H.-P. Cai, and X.-S. Shen,
A hybrid approach combining an improved genetic algorithm and optimization strategies
for the asymmetric traveling salesman problem
.
Engineering Applications of Artificial Intelligence archive, 21( 8), pp. 1370-1380, 2008.

F. Xue, C. Y. Chan, W. H. Ip and C. F. Cheung,
A learning-based variable assignment weighting scheme for heuristic and exact
searching in Euclidean traveling salesman problems
.
NETNOMICS, DOI: 10.1007/s11066-011-9064-7, pp. 1-25, 2012.

F. Xue,
A suboptimum-and proportion-based heuristic generation method for combinatorial
optimization problems
.
Ph.D. thesis, Hong Kong Polytechnic University, 2012.

S. Yadlapalli, Jungyun Bae, S. Rathinam, and S. Darbha,
Approximation Algorithms for a Heterogeneous Multiple Depot Hamiltonian Path Problem.
American Control Conference, pp. 2789 - 2794, 2011.

M. E. Yafrani and B. Ahiod,
Cosolver2B: An Efficient Local Search Heuristic for the Travelling Thief Problem.
ACS/IEEE International Conference on Computer Systems and Applications, 2015.

V. Yajnanarayana, K. E. G. Magnusson, R. Brandt, S. Dwivedi, and P. Händel,
Optimal Scheduling for Interference Mitigation by Range Information.
IEEE Trans. Mobile Computing, 2015.

V. P. Yajnanarayana,
Ultra Wideband: Communication and Localization.
Doctoral Thesis, KTH, School of Electrical Engineering, 2017.

S-L. Yan and K-F. Zhou,
Three-Tier Multi-agent Approach for Solving Traveling Salesman Problem.
Lecture Notes in Computer Science, Volume 4099, pp. 813-817, 2006.

J-J. Yang, J-R. Jiangm Y-L. Lai,
A Decreasing k-Means Algorithm for the Disk Covering Tour Problem in Wireless
Sensor Networks
.
International Workshop on Internet of Things Technologies, 2014.

A. S. Yengejeh,
Distributed Task Allocation and Task Sequencing for Robots with Motion Constraints.
MSc thesis, University of Waterloo, 2016.

S. K. Yi, M. Steyvers, M. D. Lee, and M. J. Dry,
Wisdom of the Crowds in Traveling Salesman Problems.
University of California, University of Adelaide, 2009 (submitted).

S. K. Yi, M. Steyvers, M. D. Lee, and M. J. Dry,
Wisdom of the Crowds in Combinatorial Problems.
Cognitive Science, 38 (3), pp. 452-470, 2012.

W. Yong,
Hybrid Max-Min ant system with four vertices and three linesinequality for traveling
salesman problem
.
Soft Computing, 2014, DOI 10.1007/s00500-014-1279-8.

Xin Yu,
Optimization Approaches for a Dubins Vehicle in Coverage Planning Problem
and Traveling Salesman Problem
s.
Ph.D. thesis, Auburn University, 2015.

V. Yajnanarayana, K. E. G. Magnusson, R. Brandt, S. Dwivedi, and P. Händel,
Optimal Scheduling for Interference Mitigation by Range Information.
IEEE Trans. Mobile Computing, 2017.

B. Yuan, M. Orlowska, and S. Sadiq,
Finding the Optimal Path in 3D Spaces Using EDAs - The Wireless Sensor Networks Scenario.
Lecture Notes in Computer Science, Volume 4431, pp. 536-545, 2007.

R. Zamani and S. K. Lau,
Embedding learning capability in Lagrangean relaxation: An application to the travelling
salesman problem
.

European Journal of Operational Research, 2001(1), pp. 82-88, 2010.

W. Zahrouni and H. Kamoun,
Transforming part-sequencing problems in a robotic cell into a GTSP.
Journal of the Operational Research Society, January 2010, DOI:10.1057/jors.2009.158.

R. Zamora-Cristales and J. Sessions,
Are double trailers cost effective for transporting forest biomass on steep terrain?
California Agriculture, 69(3), pp.177-183, 2015.

J. Zhang and B. Khoshnevis,
Contour Crafting Process Planning and Optimization. Part I: Single-Nozzle Case.
Journal of Industrial and Systems Engineering, Vol. 4, No. 1, pp 33-46, 2010.

J. Zhang and B. Khoshnevis,
Toolpath Planning and Optimization for Single and Multiple Gantry Contour Crafting System.
International Journal of Advanced Manufacturing Systems, Vol. 13, No.1, pp. 61-73, 2011.

J. Zhang and B. Khoshnevis,
Optimal machine operation planning for construction by Contour Crafting.
Automation in Construction, Vol. 29, pp. 50.67, 2013.

Yu Zhang, Jing Chen, and Lincheng Shen,
Hybrid hierarchical trajectory planning for a fixed-wing UCAV performing air-to-surface
multi-target attack
.
Journal of Systems Engineering and Electronics, Vol. 23 (4), pp. 536-552, 2012.

L. Zikou, C. Papachristos, K. Alexis2, and A. Tzes,
Inspection Operations Using an Aerial Robot Powered-over-Tether by a Ground Vehicle.
Lecture Notes in Computer Science, Volume 9474, pp. 455-465, 2015.