Determination of optimal path under approach and exit constraints

European Journal of Operational Research

Volumn 117, Issue 2, 1999, Pages 310-325

  Khan, W A ^a   Hayhurst, D R ^b   Cannings, C ^c  

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

^b UNIVERSITY OF MANCHESTER   (United Kingdom)

^c UNIVERSITY OF SHEFFIELD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; MACHINING; PERT; PROBABILITY DISTRIBUTIONS; PROCESS ENGINEERING; RANDOM PROCESSES; SCHEDULING; TRAVELING SALESMAN PROBLEM;

COMBINATORIAL ANALYSIS; PROBABILISTIC PROGRAMMING;

CRITICAL PATH ANALYSIS;

EID: 0032683544     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(98)00263-X     Document Type: Article

References (15)

1. Andreou, D.A., 1987. Heuristic strategies for large traveling salesman problem applicable to the traveling sequence optimization of industrial robots. Ph.D. Thesis, Drexel University, USA.
2. Bellmore, M., Nemhauser, G.L., 1968. The traveling salesman problem: A survey. Operations Research 17, 538-557.
3. Dantzig, G.B., Fulkerson, D.R., Johnson, S.M., 1954. Solution of a large scale traveling salesman problem. Operations Research 2, 393-410.
4. Golden, B.L., Bodin, L.D., Doyle, T., Stewart, W., Jr., 1980. Approximate traveling salesman algorithm. Operations Research 28, 694-710.
5. Johnson, D.S., Aragon, C.R., McGeoch, L.A., Schevon, C., 1989. Optimization by simulated annealing: An experimental evaluation (Part I), Graph partitioning. Operations Research 37 (6), 865-892.
6. Johnson, D.S., Aragon, C.R., McGeoch, L.A., Schevon, C., 1991. Optimization by simulated annealing: An experimental evaluation (Part II), Graph partitioning. Operations Research 39 (3), 378-406.
7. Kalpakjian, S., 1992. Manufacturing Engineering and Technology, second edition. Addison-Wesley, New York, U.S.A.
8. Khan, W.A., 1990. Investigation of tool path sequencing problem in hierarchical CIM environment. Ph.D. Thesis, University of Sheffield, Sheffield, UK.
9. Khan, W.A., 1996. Path optimization for computer numerical control machines. In: Proceedings of the 36th Annual Convention of the Institution of Engineers, Pakistan.
10. Khan, W.A., Hayhurst, D.R., 1991. Computer aided part program segmentation and reconstruction for minimization of machine tool residence time. International Journal of Computer Integrated Manufacturing 4, 300-314.
11. Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P., 1983. Optimization by simulated annealing. Science 220, 671-680.
12. Lawler, E.L., Lenstra, J.K., Rinooy Kan, A.H.G., Shmoys, D.B., 1997. The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. Wiley, Chichester, UK.
13. Lundy, M., 1985. Application of annealing algorithm to combination problems in statistics. Biometrika 72, 191-198.
14. Lundy, M., Mees, A., 1986. Convergence of the annealing algorithm. Mathematical Programming 34, 11-124.
15. Metropolis, N., Rosenbluth, A.W., Rosenbluth, M.N., Teller, A.H., 1953. Equation of state calculation by fast computing machines. Journal of Chemical Physics 21, 1087-1092.