IC insertion: an application of the travelling salesman problem
- 1 October 1989
- journal article
- research article
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 27 (10) , 1837-1841
- https://doi.org/10.1080/00207548908942657
Abstract
Chip insertion problems arise naturally in electronic board assembly. Several examples are considered and the problem is formulated as a travelling salesman problem. Microcomputer solutions are possible using the TRAVEL package of Boyd, Pulleyblank, and Cornuejols which provides inexpensive solutions to symmetric problems with less than 300 cities.Keywords
This publication has 4 references indexed in Scilit:
- Optimization of a 532-city symmetric traveling salesman problem by branch and cutOperations Research Letters, 1987
- Solving Large-Scale Symmetric Travelling Salesman Problems to OptimalityManagement Science, 1980
- An Effective Heuristic Algorithm for the Traveling-Salesman ProblemOperations Research, 1973
- Solution of a Large-Scale Traveling-Salesman ProblemJournal of the Operations Research Society of America, 1954