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.
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.
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.
Dong Hyun 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.
D. Barbucha, I. Czarnowski, P. Jȩdrzejowicz, E. Ratajczak-Ropel, and I. Wierzbowska,
e-JABAT - An Implementation of the Web-Based A-Team.
IIntelligent Agents in the Evolution of Web and Applications, pp. 57-86, 2009.
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.
Talal Bonny and Jörg 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.
Talal Bonny and Jörg Henkel,
Efficient code density through look-up table compression.
Proceedings of the conference on Design, automation and test in Europe, pp. 809-814, 2007.
Talal Bonny and Jörg Henkel,
Instruction Re-encoding Facilitating Dense Embedded Code.
IEEE/ACM Proc. of Design, Automation and Test in Europe Conference, pp. 770-775, 2008.
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.
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.
Kenneth Castelino, Roshan D’Souza, and Paul 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.
Minsik Cho, Hua Xiang, Ruchir Puri, and David 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.
William Cook and Paul D. Seymour,
Tour Merging via Branch-Decomposition.
INFORMS Journal on Computing 15(3), pp. 233-248, 2003.
Changxing Dong, Gerold Jäger, Dirk Richter, and Paul Molitor,
Effective Tour Searching for TSP by Contraction of Pseudo Backbone Edges,
University Halle-Wittenberg, Institute of Computer Science, Technical Report 2008/4.
Javier Garcés Eisele, Carolina Yolanda, Castañeda 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.
Christian Ernst, Changxing Dong, Dirk Richter, Gerold Jäger, and Paul 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.
Thomas Faraut, Simon de Givry, Patrick Chabrier, Thomas Derrien, Francis Galibert,
Christophe Hitte and Thomas Schiex,
A comparative genome approach to marker ordering.
In Proc. of ECCB-06, Eilat, Israel, 2006.
Thomas Fischer and Peter Merz,
Embedding a Chained Lin-Kernighan Algorithm into a Distributed Algorithm.
MIC'2005 - 6th Metaheuristics International Conference, 2005.
Thomas Fischer, Thomas Stützle, Holger Hoos, and Peter 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.
Thomas Fischer and Peter Merz,
A Distributed Chained Lin-Kernighan Algorithm for TSP Problems.
Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium, 2005.
Thomas Fischer and Peter Merz,
Reducing the Size of Traveling Salesman Problem Instances by Fixing Edges.
Lecture Notes In Computer Science, volume 4446, pp. 7283, 2007.
Dorabela Gamboa, Colin Osterman, César Rego, and Fred Glover,
An Experimental Evaluation of Ejection Chain Algorithms for the Traveling Salesman Problem.
School of Business Administration, University of Mississippi, 2006.
Simon de Givry , Martin Bouchez , Patrick Chabrier , Denis Milan, and Thomas 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.
L. B. Gueta, R. Chiba, Jun Ota, T. Arai, and T. Ueyama,
A practical and integrated method to optimize a manipulator-based inspection system.
IEEE International Conference on Robotics and Biomimetic, pp. 1911-1918, 2007.
Puneet Gupta, Andrew B. Kahng, and Stefanus Mantik,
Routing-Aware Scan Chain Ordering.
ACM Transactions on Design Automation of Electronic Systems (TODAES),
Volume 10, Issue 3, pp. 546-560, July 2005.
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.
Yuichi Handa, Hirotaka Ono, Kunihiko Sadakane, and Masafumi Yamashita,
Neighborhood Composition: A Parallelization of Local Search Algorithms.
Lecture Notes in Computer Science, Volume 3241, pp. 155-163, 2004.
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.
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.
Pontifícia Universidade Católica do Paraná, M.Sc. Thesis, 2007.
A. Hertel,
Hamiltonian Cycles in Sparse Graphs.
University of Toronte, M.Sc. Thesis, 2004.
N. Holden and G. Hasle,
Extending the Lin-Kernighan algorithm to improve solutions to VRPs with Time Windows.
SINTEF report A13822, 2009,
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.
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.
S. H. Jacobson,
Finite-Time Performance of Local Search Algorithms: Theory and Application.
Research report, University of Illinois, 2009.
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.
A. B. Kahng and S. Reda,
Match twice and stitch: a new TSP tour construction heuristic.
Operations Research Letters, Volume 32, pp. 499-509, 2204.
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
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.
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.
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.
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.
Kim T. Le Dong, H. Baik 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.
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.
Shih Ping Lin, Chung Len 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.
Fei Liu and Guangzhou Zeng,
Study of genetic algorithm with reinforcement learning to solve the TSP.
Expert Systems with Applications, 36, pp. 6995-7001, 2009.
Thibaut Lust and Jacques 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.
Thibaut Lust and Jacques Teghem,
Two-phase Pareto local search for the biobjective traveling salesman problem.
Journal of Heuristics, 2009, DOI: 10.1007/s10732-009-9103-9.
Thibaut Lust and Jacques Teghem,
Multiobjective Decomposition of Positive Integer Matrix: Application to Radiotherapy.
EMO 2009, pp. 335-349.
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.
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.
D. W. Murphy, M. H. Milman, D. L. Meiera, and M, Moshir,
SIM Lite narrow-angle modeling and processing.
Proc. SPIE, Vol. 7734, 2010.
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,
Fifteenth INFORMS Applied Probability Conference, 2009.
Hung Dinh Nguyen , Ikuo Yoshihara , Kunihito Yamamori , and Moritoshi 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.
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.S. 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.
K. J. Obermeyer,
Visibility Problems for Sensor Networks and Unmanned Air Vehicles.
PhD thesis, University of California at Santa Barbara, 2010.
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.
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.
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.
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
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.
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.
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.
Hélène Renard, Yves Robert, and Frédéric 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,
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.
Martin-Luther-University Halle-Wittenberg, Diploma Thesis, 2006.
Dirk Richter, Boris Goldengorin, Gerold Jäger, and Paul 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. Rohleder,
Kandidatenmengen für das TSP - Ein neuer heuristischer Ansatz.
Josef Eul Verlag, 2006.
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.
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.
Hisao 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.
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,
European Journal of Operational Research, In Press, 2009.
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.
Shigeyoshi Tsutsui, Martin Pelikan, and Ashish Ghosh,
Edge histogram based sampling with local search for solving permutation problems.
Int. J. Hybrid Intell. Syst., 3(1), pp. 11-22, 2006.
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.
Vikrant Vig and Udatta 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.
Chris 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.
Singer XJ Wang,
Analysis of Hybrid Method for Solving the Traveling Salesman Problem to Optimality.
Faculty of Computer Science, Dalhousie University, 2004.
Sitao 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.
Xiao-Feng Xie, Jiming 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.
Li-Ning Xing, Ying-Wu Chen, and Xue-Shi Shen,
Multiprogramming genetic algorithm for optimization problems with permutation property.
Applied Mathematics and Computation, 185(1), pp. 473-483, 2007.
Li-Ning Xing, Ying-Wu Chen, Ke-Wei Yang, Feng Hou, Huai-Ping Cai, and Xue-Shi 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.
Shi-Liang Yan and Ke-Feng Zhou,
Three-Tier Multi-agent Approach for Solving Traveling Salesman Problem.
Lecture Notes in Computer Science, Volume 4099, pp. 813-817, 2006.
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).
Bo Yuan, Maria Orlowska, and Shazia 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. Zamania and S. K. Lau,
Embedding learning capability in Lagrangean relaxation: An application to the travelling
salesman problem.
European Journal of Operational Research, In Press, 2009.
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.
Jing Zhang and Behrokh Khoshnevis,
Contour Crafting Process Planning and Optimization.
ISARC Proceedings, pp. 576-583, 2009.