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.
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.
D. Apiletti, E. Baralis, and T. Cerquitelli,
Energy-saving models for wireless sensor networks.
Knowledge and Information Systems, pp. 1-30-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.
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.
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.
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.
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.
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.
Riddhi Doshi, Sai Yadlapalli, Sivakumar Rathinam, and Swaroop 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.
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.
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.
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.
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.
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.
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 , 2011.
L. B. 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. B. 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. B. 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.
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.
T. Harks, F. G. König, and Jannik 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.
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.
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.
Vu Anh Huynh, John Enright, and Emilio 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.
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.
S. H. Jacobson,
Finite-Time Performance of Local Search Algorithms: Theory and Application.
Research report, University of Illinois, 2009.
S. S. J. Jaheruddin,
Friendly Interchange Heuristic for Vehicle Routing Problems with Time Windows.
B.Sc. Thesis, Tilburg University, 2010.
F. R. Jensen,
Using the Traveling Salesman Problem in Bioinformatic Algorithms.
Department of Computer Science, Aarhus University, M.Sc. Thesis, 2010.
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.
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, 2004.
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.
V. S. Kumar,
Specification, Configuration and Execution of Data-Intensive Scientific Applications.
Ph.D. Thesis,
The Ohio State University, 2008.
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.
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.
Jan Christian Lang and Zuo-Jun Max 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.
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.
C. Li,
Rational swarm for global optimization.
Ph.D. Thesis, University of Virginia, 2010.
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.
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.
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.
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.
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. 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.
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,
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.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.
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.
M. Park, P. Oberlin, S. Rathinam, L. Quadrifoglio, and S. Darbha,
Multiple Depot Vehicle Routing with Applications to Paratransit and Rural Transportation.
UTCM Final Technical Reports
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.
C. C. Price,
Applications of Operations Research Models to Problems in Health Care.
Dissertation, University of Maryland, 2009.
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.
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ésar Rego, Dorabela Gamboa, Fred 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.
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,
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.
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. 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.
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.
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.
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.
J. Styles, H. Hoos, and M. Müller,
Automatically Configuring Algorithms for Scaling Performance.
Learning and Intelligent OptimizatioN Conference, France, Paris, 2011.
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,
Journal of Operational Research, 200(3), pp. 755-763, 2010.
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.
B. Tadunfock Teti and L. P. Fotso,
Heuristiques du problème du voyageur de commerce.
8th African Conference on Research in Computer Science, 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.
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.
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.
Li-Pei 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.
Li-Pei Wong, M.Y.H. Low, and Chin Soon 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.
Miaoling Wu and Wenxing Zhu,
A dynamic convexized method for the TSP.
IEEE International Conferenceon Intelligent Computing and Intelligent Systems, pp. 307-311, 2010.
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 and 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.
Fan 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.
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.
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. 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.
Jing Zhang and Behrokh 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.
Jing Zhang and Behrokh 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.