Two- and three-dimensional path optimization for production machinery

Journal of Manufacturing Science and Engineering, Transactions of the ASME

Volumn 122, Issue 1, 2000, Pages 244-252

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

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

^b UNIVERSITY OF MANCHESTER   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 13544268095     PISSN: 10871357     EISSN: 15288935     Source Type: Journal    
DOI: 10.1115/1.538901     Document Type: Article

References (20)

1. Khan, W. A., 1990, Investigation of Tool Path Sequencing Problem in Hierarchical CIM Environment, Ph.D. thesis, University of Sheffield, Sheffield, UK.
2. Khan, W. A., and Hayhurst, D. R., 1991, “Computer Aided Part Program Segmentation and Reconstruction for Minimization of Machine Tool Residence Time,” Int. J. Comput. Integr. Manuf., 4, No. 5, pp. 300-314.
3. Kalpakjian, S., 1992, Manufacturing Engineering and Technology, 2nd Ed., Addison-Wesley Publishing Company, New York, USA.
4. Chryssolouris, G., 1992, Manufacturing Systems-Theory and Practice, Springer Verlag, New York.
5. Alting, L., 1994, Manufacturing Engineering Processes, 2nd Ed., Marcel Dekker, New York.
6. Dantzig, G. B., et al., 1954, “Solution of a Large Scale Traveling Salesman Problem,” Oper. Res., 2, pp. 393-410.
7. Johnson, D. S., et al., 1989, “Optimization by Simulated Annealing: An Experimental Evaluation (Part I), Graph Partitioning,” Oper. Res., 37, No. 6, pp. 865-892.
8. Johnson, D. S., et al., 1991, “Optimization by Simulated Annealing: An Experimental Evaluation (Part II), Graph Partitioning,” Oper. Res., 39, No. 3, pp. 378-406.
9. Johnson, D. S., et al., 1997, The Traveling Salesman Problem: A Case Study. Local Search in Combinatorial Optimization, Aarts, E., and Lenstra, J. K., eds., John Wiley & Sons.
10. Hoffman, A. J., and Wolfe, P., 1997, “History,” in The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, Lawler, E. L., Lenstra, J. K., Rinooy Kan, A. H. G., and Shmoys, D. B., eds., John Wiley, Chichester.
11. 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.
12. Reinelt, G., 1994, “The Traveling Salesman: Computational Solutions for TSP Applications,” Lecture Notes in Computer Science, Vol. 840, Springer Verlag.
13. Khan, W. A., Hayhurst, D. R., and Cannings, C., 1999, “Probabilistic Shortest Path Determination Under Approach and Exit Constraints,” Eur. J. of Operational Res., 117, pp. 310-325.
14. Khan, W. A., Khan, M. A., and Hayhurst, D. R., 1998, “Use of Technological Constraints as Enumeration Criteria for the Solution of TSP Applicable to Production Machinery,” submitted for publication in Journal of Engineering Manufacture: Proceedings of the Institution of Mechanical Engineers, UK.
15. Kirkpatric, S., Gelatt, C. D., and Vecchi, M. P., 1983, “Optimization by Simulated Annealing,” Science, 220, pp. 671-680.
16. Lundy, M., 1985, “Application of Annealing Algorithm to Combination Problems in Statistics,” Biometrika, 72, pp. 191-198.
17. Lundy, M., and Mees, A., 1986, “Convergence of the Annealing Algorithm,” Math. Program., 34.
18. Khan, W. A., 1996, “Path Optimisation for Computer Numerical Control Machines,” Proceedings 36th Annual Convention of the Institution of Engineers, Pakistan.
19. Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., and Teller, A. H., 1953, “Equation of State Calculation by Fast Computing Machines,” J. Chem. Phys., 21, pp. 1087-1092.
20. Reinelt, G., 1998, “The TSPLIB: A Library of TSP Problem Instances,” reinelt@ares.iwr.Uni-Heidelberg.DE.