Use of technological constraints as enumeration criteria for the solution of a travelling salesman problem applicable to production machinery

Proceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture

Volumn 214, Issue 1, 2000, Pages 61-77

  Khan, W A ^a,b   Khan, M A ^a   Hayhurst, D R ^a  

^a GIK INSTITUTE OF ENGINEERING SCIENCES AND TECHNOLOGY   (Pakistan)

^b UNIVERSITY OF MANCHESTER   (United Kingdom)

Author keywords

Combinatorial analysis; Probabilistic programming; Production; Routing; Travelling salesman

Indexed keywords

EID: 29844451178     PISSN: 09544054     EISSN: None     Source Type: Journal    
DOI: 10.1243/0954405001517441     Document Type: Article

References (20)

1. Kalpakjian, S. Manufacturing Engineering and Technology, 2nd edition, 1992 (Addison-Wesley, New York).
2. Chryssolouris, G. Manufacturing Systems-Theory and Practice, 1992 (Springer-Verlag, New York).
3. Alting, L. Manufacturing Engineering Processes, 2nd edition, 1994 (Marcel Dekker, New York).
4. Khan, W. A. Investigation of tool path sequencing problem in hierarchical CIM environment. PhD thesis, University of Sheffield, Sheffield, 1990.
5. Khan, \V. A., Ha) hurst, D. R. and Cannings, C. Probabilistic shortest path determination under approach and exit constraints. Accepted for publication by Eur. J. Opl Res., 1998.
6. Dantzig, G. B., et al. Solution of a large scale traveling salesman problem. Ops Res., 1954, 2, 393-410.
7. Bellmore, M., et al. The traveling salesman problem: a survey. Ops Res., 1968, 17, 538-557.
8. Golden, B., et al. Approximate traveling salesman algorithm. Ops Res., 1980, 28, 694-710.
9. Lawler, E. L., Lenstra, J. K., Rinooy Kan, A. H. G. and Shmoys, D. B. The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, 1997 (John Wiley, Chichester).
10. Kirckpatrick, S., Gelatt, C. D. and Vecchi, M. P. Optimization by simulated annealing. Science, 1983, 220, 671-680.
11. Lundy, M. Application of annealing algorithm to combination problems in statistics. Biometrika, 1985, 72, 191-198.
12. Lundy, M. and Mees, A. Convergence of the annealing algorithm. Mathl Progm., 1986, 34, 11-124.
13. Johnson, D. S., et al. Optimization by simulated annealing: an experimental evaluation (Part I), Graph partitioning. Ops Res., 1989, 37(6), 865-892.
14. Johnson, D. S., et al. Optimization by simulated annealing: an experimental evaluation (Part II), Graph partitioning. Ops Res., 1991, 39(3), 378-406.
15. Johnson, D. S., et al. The traveling salesman problem: a case study. In Local Search in Combinatorial Optimisation (Eds E. Aarts and J. K. Lenstra), 1997 (John Wiley, Chichester).
16. Aarts, E. H. L., et al. Simulated annealing. In Local Search in Combinatorial Optimisation (Eds E. Aarts and J. K. Lenstra), 1997 (John Wiley, Chichester).
17. Metropolis, N., Rosenbluth, A. W., Roscnbluth, M. N. and Teller, A. H. Equation of state calculation by fast computing machines. J. Chem. Phys., 1953, 21, 1087-1092.
18. Khan, W. A. and Hayhurst, D. R. Computer aided part program segmentation and reconstruction for minimization of machine tool residence time. Int. J. Compiit. Integrated Mfg, 1991,4,300-314.
19. Khan, W. A. Path optimisation for computer numerical control machines. In Proceedings of 36th Annual Convention of the Institution of Engineers, Pakistan.
20. Reinelt, G. The traveling salesman: computational solutions for TSP applications. In Lecture Notes in Computer Science, No. 840, 1994 (Springer-Verlag).