Process planning for rotational parts using the generalized travelling salesman problem

International Journal of Production Research

Volumn 41, Issue 11, 2003, Pages 2581-2596

  Ben Arieh, D ^a   Gutin, G ^a   Penn, M ^c   Yeo, A ^b   Zverovitch, A ^b  

^a Sunflower Networking Group   (United States)

^b UNIVERSITY OF LONDON   (United Kingdom)

^c TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GRAPH THEORY; MACHINING; ROTATING MACHINERY; STRATEGIC PLANNING; TRAVELING SALESMAN PROBLEM;

ROTATIONAL PARTS;

PROCESS CONTROL;

EID: 0242333168     PISSN: 00207543     EISSN: None     Source Type: Journal    
DOI: 10.1080/0020754031000087337     Document Type: Article

References (33)

1. BEN-ARIEH, D. and CHOPRA, M., 1997, Case based NC code generating system for prismatic parts. International Journal of Production Research, 35, 1925-1943.
2. CHANG, T. C., WYSK, R. A. and WANG, H., 1998, Computer Aided Manufacturing, 2nd edn (New York: Prentice Hall).
3. CHEN, C. L. and LECLAIR, S. R., 1993, Unsupervised neural learning algorithm for setup generation in process planning. Proceedings of the Artificial Neural Networks in Engineering Conference (ANNIE'93), 14-17 November 1993, St Louis, MO, pp. 663-668.
4. CONCORDE [http://www.math.princeton.edu/tsp/concorde.html].
5. FISCHETTI, M., SALAZAR-GONZALEZ, J. and TOTH, P., 1997, A branch-and-cut algorithm for the symmetric generalized traveling salesman problem. Operations Research, 45, 378-394.
6. FISCHETTI, M., SALAZAR-GONZALEZ, J. and TOTH, P., 2001, The generalized traveling salesman and orienteering problems. In G. Gutin and A. Punnen (eds), The Traveling Salesman Problem and Its Variations (Dordrecht: Kluwer), pp. 609-662.
7. GUTIN, G., 1999, Exponential neighborhood local search for the traveling salesman problem. Computers and Operations Research, 26, 313-320.
8. HENRY-LABORDERE, A. I., 1969, The record balancing problem: a dynamic programming solution of the generalized traveling salesman problem. RIRO, B-2, 43-49.
9. HUANG, S. H., 1998, Automated setput planning for lathe machining. Journal of Manufacturing Systems, 17, 196-208.
10. HUANG, S. H. and ZHANG, H. C., 1996, Tolerance analysis in setup planning for rotational parts. Journal of Manufacturing Systems, 15(5), 340-350.
11. HUANG, S. H., ZHANG, H. C. and OLDHAM, W. J. B., 1997, Tolerance analysis for setup planning: a graph theoretical approach. International Journal of Production Research, 35, 1107-1124.
12. HUANG, X. and GU, P., 1994, Tolerance analysis in the setup and fixture planning for precision machining. In Proceedings of the Fourth International Conference on Computer Integrated Manufacturing, 10-12 October 1994.
13. IRANI, S. A., MITTAL, R. O AND LEHTIHET, E. A., 1989, Tolerance chart optimization. International Journal of Production Research, 27, 1531-1552.
14. JONEJA, A. and CHANG, T. C., 1999, Setup and fixture planning in automated process planning systems. IIE Transactions, 31, 653-665.
15. KIM, I. H., OH, J. S. and CHO, K. K., 1996, Computer aided setup planning for machining processes. Proceedings of the 18th International Conference on Computers and Industrial Engineering, Shanghai, China, pp. 613-617.
16. LAPORTE, G., ASEF-VAZIRI, A. and SRISKANDARAJAH, C., 1996, Some applications of the generalized traveling salesman problem. Journal of the Operational Research Society, 47, 1461-1467.
17. LAPORTE, G., MERCURE, H. and NOBERT, Y., 1987, Generalized traveling salesman problem through n sets of nodes: the asymmetric case. Discrete Applied Mathematics, 18, 185-197.
18. LAPORTE, G. and NOBERT, Y., 1983, Generalized traveling salesman problem through n sets of nodes: an integer programming approach. INFOR, 21, 60-75.
19. LAWLER, E. L., LENSTRA, J. K., RINNOY KAN, A. H. and SHMOYS, D. B., 1985, The Traveling Salesman Problem (New York: Wiley).
20. LIEN, Y., MA, E. and WAH, B. W. S., 1993, Transformation of the generalized traveling salesman problem into the standard traveling salesman problem. Information Sciences, 74, 177-189.
21. MEI, J. and ZHANO, H. C., 1994, Graphical method for datum and setup selection in process planning. In Proceedings of the 1994 ASME International Mechanical Engineering Congress and exposition, Chicago, IL, 6-11 November 1994, pp. 21-28.
22. MING, X. G. and MAK, K. L., 2000, Intelligent setup planning in manufacturing by neural networks based approach. Journal of Intelligent Manufacturing, 11, 311-331.
23. NIEBEL, B. W., 1965, Mechanized process selection for planning new designs. ASME Paper No. 737.
24. NOON, C. E., 1998, The generalized traveling salesman problem. Unpublished dissertation, Department of Industrial Engineering and Operations Engineering, University of Michigan.
25. NOON, C. E. and BEAN, J. C., 1991, A Lagrangian based approach for the asymmetric generalized traveling salesman problem. Operations Research, 39, 623-632.
26. NOON, C. E. and BEAN, J. C., 1993, An efficient transformation of the generalized traveling salesman problem. INFORM, 31, 39-44.
27. ROUSSEAU, J., 1988, Customization versus a general purpose code for routing and scheduling problems: a point of view. In B. Golden and A. Assad (eds), Vehicle Routing: Methods and Studies (Amsterdam: Elsevier), pp. 469-479.
28. SAKENA, J. P., 1970, Mathematical model of scheduling clients through welfare agencies, CORS Journal, 97-101.
29. TANG, X. and DAVIES, B. J., 1988, Computer aided dimensional planning. International Journal of Production Research, 26, 283-297.
30. WAD, O. R., 1983, Tolerance control. In Tool and Manufacturing Engineering Handbook, vol. 1: Machining (Dearborn: Society of Manufacturing Engineering), pp. 2-1-60.
31. WU, H. C. and CHANG, T. C., 1998, Automated setup selection in feature based process planning. International Journal of Production Research, 36, 695-712.
32. ZHANG, H. C., HUANG, S. H. and MEI, J., 1996, Operational dimensioning and tolerancing in process planning: setup planning. International Journal of Production Research, 34, 1841-1857.
33. ZHANG, H. C. and LIN, E., 1999, Hybrid graph approach for automated setup planning in CAPP. Robotics and Computer Integrated Manufacturing, 15, 89-100.