Embedded local search approaches for routing optimization
暂无分享,去创建一个
[1] TingTing Hwang,et al. Layout-driven chaining of scan flip-flops , 1996 .
[2] David Applegate,et al. Finding Cuts in the TSP (A preliminary report) , 1995 .
[3] Jon Louis Bentley,et al. K-d trees for semidynamic point sets , 1990, SCG '90.
[4] William J. Cook,et al. Finding Tours in the TSP , 1999 .
[5] G. Wade,et al. Ordering of cascade FIR filter structures , 1994 .
[6] Peter I. Cowling,et al. Effective heuristic and metaheuristic approaches to optimize component placement in printed circuit board assembly , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).
[7] M. Held,et al. A dynamic programming approach to sequencing problems , 1962, ACM National Meeting.
[8] J. K. Lenstra,et al. Local Search in Combinatorial Optimisation. , 1997 .
[9] Christos H. Papadimitriou,et al. Local Search for the Asymmetric Traveling Salesman Problem , 1980, Oper. Res..
[10] Edward W. Felten,et al. Large-step markov chains for the TSP incorporating local search heuristics , 1992, Oper. Res. Lett..
[11] E. Baum. Towards practical `neural' computation for combinatorial optimization problems , 1987 .
[12] A. Volgenant,et al. The travelling salesman, computational solutions for TSP applications , 1996 .
[13] Beom Hee Lee,et al. A hierarchical optimization method in the PCB assembly for surface mounting machines , 1997, ISIE '97 Proceeding of the IEEE International Symposium on Industrial Electronics.
[14] Eugene L. Lawler,et al. A Guided Tour of Combinatorial Optimization , 1985 .
[15] Michael O. Ball,et al. Sequencing of Insertions in Printed Circuit Board Assembly , 1988, Oper. Res..
[16] Peter I. Cowling,et al. New models and heuristics for component placement in printed circuit board assembly , 1999, Proceedings 1999 International Conference on Information Intelligence and Systems (Cat. No.PR00446).
[17] J. Pekny,et al. Exact solution of the no-wait flowshop scheduling problem with a comparison to heuristic methods , 1991 .
[18] Pierre Hansen,et al. Variable neighborhood search: Principles and applications , 1998, Eur. J. Oper. Res..
[19] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[20] Richard Bellman,et al. Dynamic Programming Treatment of the Travelling Salesman Problem , 1962, JACM.
[21] Weixiong Zhang,et al. The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests , 2001, ALENEX.
[22] John A. Buzacott,et al. Simulation and analysis of a circuit board manufacturing facility , 1986, WSC '86.
[23] Edward W. Felten,et al. Large-Step Markov Chains for the Traveling Salesman Problem , 1991, Complex Syst..
[24] Ronald G. Askin,et al. An Algorithm for NC Turret Punch Press Tool Location and Hit Sequencing , 1984 .
[25] David S. Johnson,et al. Local Optimization and the Traveling Salesman Problem , 1990, ICALP.
[26] Jon Louis Bentley,et al. Multidimensional binary search trees used for associative searching , 1975, CACM.
[27] Dennis Johnson,et al. Component Allocation and Partitioning for a Dual Delivery Placement Machine , 1988, Oper. Res..
[28] G. Reinelt. The traveling salesman: computational solutions for TSP applications , 1994 .
[29] Ming Liang,et al. A tabu search approach to optimization of drilling operations , 1996 .
[30] Pierre Hansen,et al. Variable Neighborhood Search , 2018, Handbook of Heuristics.
[31] R. Bland,et al. Large travelling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation , 1989 .
[32] Fred W. Glover,et al. Finding a best traveling salesman 4-opt move in the same time as a best 2-opt move , 1996, J. Heuristics.
[33] Brian W. Kernighan,et al. An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..
[34] Peter I. Cowling,et al. Effective Local and Guided Variable Neighbourhood Search Methods for the Asymmetric Travelling Salesman Problem , 2001, EvoWorkshops.
[35] Keld Helsgaun,et al. An effective implementation of the Lin-Kernighan traveling salesman heuristic , 2000, Eur. J. Oper. Res..
[36] César Rego,et al. Relaxed tours and path ejections for the traveling salesman problem , 1998, Eur. J. Oper. Res..
[37] Gerhard Reinelt,et al. TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..
[38] Giovanni Manzini,et al. Perturbation: An Efficient Technique for the Solution of Very Large Instances of the Euclidean TSP , 1996, INFORMS J. Comput..
[39] Gilbert Laporte,et al. A tiling and routing heuristic for the screening of cytological samples , 1998, J. Oper. Res. Soc..
[40] Jon Jouis Bentley,et al. Fast Algorithms for Geometric Traveling Salesman Problems , 1992, INFORMS J. Comput..
[41] David Sankoff,et al. Multiple Genome Rearrangement and Breakpoint Phylogeny , 1998, J. Comput. Biol..
[42] D. M. Deighton,et al. Computers in Operations Research , 1977, Aust. Comput. J..
[43] Dae-Won Kim,et al. An effective algorithm for a surface mounting machine in printed circuit board assembly , 1997, Proceedings of the 1997 IEEE/RSJ International Conference on Intelligent Robot and Systems. Innovative Robotics for Real-World Applications. IROS '97.
[44] Nenad Mladenović,et al. An Introduction to Variable Neighborhood Search , 1997 .
[45] Olivier C. Martin,et al. Combining simulated annealing with local search heuristics , 1993, Ann. Oper. Res..
[46] G BlandRobert,et al. Large travelling salesman problems arising from experiments in X-ray crystallography , 1989 .
[47] Andrew B. Kahng,et al. Improved Large-Step Markov Chain Variants for the Symmetric TSP , 1997, J. Heuristics.
[48] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .