Optimization of process plans using a constraint-based tabu search approach
Authors:
W. D. Li a;
S. K. Ong b;
A. Y. C. Nee b
| Affiliations: | a Singapore Institute of Manufacturing Technology, Singapore 638075 |
| b Department of Mechanical Engineering, National University of Singapore, Singapore 117576 |
DOI:
10.1080/00207540310001652897
Publication Frequency:
24 issues per year
Published in:
International Journal of Production Research,
Volume
42,
Issue
10
May
2004
, pages 1955
- 1985
Subjects:
Logistics;
Manufacturing Engineering;
Manufacturing Industries;
Manufacturing Technology;
Operations Management;
Production & Quality Control Management;
Production Research & Economics;
Production Systems;
Production Systems & Automation;
Number of References: 27
Formats available:
HTML
(English)
:
PDF
(English)
View Article:
View Article (PDF)
View Article (HTML)
Abstract
A computer-aided process planning system should ideally generate and optimize process plans to ensure the application of good manufacturing practices and maintain the consistency of the desired functional specifications of a part during its production processes. Crucial processes, such as selecting machining resources, determining set-up plans and sequencing operations of a part should be considered simultaneously to achieve global optimal solutions. In this paper, these processes are integrated and modelled as a constraint-based optimization problem, and a tabu search-based approach is proposed to solve it effectively. In the optimization model, costs of the utilized machines and cutting tools, machine changes, tool changes, set-ups and departure from good manufacturing practices (penalty function) are the optimization evaluation criteria. Precedence constraints from the geometric and manufacturing interactions between features and their related operations in a part are defined and classified according to their effects on the plan feasibility and processing quality. A hybrid constraint-handling method is developed and embedded in the optimization algorithm to conduct the search efficiently in a large-size constraint-based space. Case studies, which are used for comparing this approach with the genetic algorithm and simulated annealing approaches, and the proposed constraint-handling method and other constraint methods, are discussed to highlight the performance of this approach in terms of the solution quality and computational efficiency of the algorithm.
|
| view references (27) : view citations |

Download Citation

CiteULike
Del.icio.us
BibSonomy
Connotea