scholarly journals A Genetic Crow Search Algorithm for Optimization of Operation Sequencing in Process Planning

2021 ◽  
Vol 11 (5) ◽  
pp. 1981
Author(s):  
Mica Djurdjev ◽  
Robert Cep ◽  
Dejan Lukic ◽  
Aco Antic ◽  
Branislav Popovic ◽  
...  
Keyword(s):  
Process Planning ◽  
Computer Aided Design ◽  
Search Algorithm ◽  
Combinatorial Problem ◽  
Optimization Criterion ◽  
Total Production ◽  
Operation Sequencing ◽  
Computer Aided Process Planning ◽  
Sequencing Problem ◽  
Computer Aided

Computer-aided process planning represents the main link between computer-aided design and computer-aided manufacturing. One of the crucial tasks in computer-aided process planning is an operation sequencing problem. In order to find the optimal process plan, operation sequencing problem is formulated as an NP hard combinatorial problem. To solve this problem, a novel genetic crow search approach (GCSA) is proposed in this paper. The traditional CSA is improved by employing genetic strategies such as tournament selection, three-string crossover, shift and resource mutation. Moreover, adaptive crossover and mutation probability coefficients were introduced to improve local and global search abilities of the GCSA. Operation precedence graph is adopted to represent precedence relationships among features and vector representation is used to manipulate the data in the Matlab environment. A new nearest mechanism strategy is added to ensure that elements of machines, tools and tool approach direction (TAD) vectors are integer values. Repair strategy to handle precedence constraints is adopted after initialization and shift mutation steps. Minimization of total production cost is used as the optimization criterion to evaluate process plans. To verify the performance of the GCSA, two case studies with different dimensions are carried out and comparisons with traditional and some modern algorithms from the literature are discussed. The results show that the GCSA performs well for operation sequencing problem in computer-aided process planning.

Computer-Aided Process Planning for Turned Parts Using Fundamental and Heuristic Principles

1992 ◽  
Vol 114 (1) ◽  
pp. 31-40 ◽  
Author(s):  
U. P. Korde ◽  
B. C. Bora ◽  
K. A. Stelson ◽  
D. R. Riley
Keyword(s):  
Process Planning ◽  
Search Algorithm ◽  
Optimality Criteria ◽  
Machining Processes ◽  
Critical Material ◽  
Computer Aided Process Planning ◽  
Process Plans ◽  
Computer Aided ◽  
Turned Parts ◽  
Manufacturability Evaluation

Research on generative computer-aided process planning (CAPP) for turned parts using combined fundamental and heuristic principles is presented. The rationale for the process planning approach is that many preconditions of machining processes can be expressed as a small number of domain principles. The domain is defined by processes and the part description as features for simple turned parts. The motivation is to detect faulty designs early on in the design process. Preliminary designs defined by features are first evaluated using manufacturability rules in a rule-based expert system, developed in LISP. Manufacturability rules are based on feature properties such as accessibility, stability, and critical material thickness. The rules were acquired from design and manufacturing personnel from industry through interviews. Parts that satisfy the manufacturability checks are used to generate all feasible process plans. A search algorithm selects the “best” process plan from the feasible set. Process plans are generated and subsequently optimized using two distinct sets of feasibility and optimality criteria which may be either fundamental or heuristic in nature. The presently incorporated criteria successfully restrict the set of plans to a small number without missing any apparently feasible process plans. Manufacturability evaluation, feasible process plans, and optimal process plans for actual industrial parts have been obtained and compared.

Common Product/Process Models for Integrating Manufacturing Simulation, Process Planning and Computer Aided Design

1996 ◽  
Author(s):  
Robert V. E. Bryant ◽  
Thomas J. Laliberty
Keyword(s):  
Process Planning ◽  
Collaborative Design ◽  
Computer Aided Design ◽  
Automatic Generation ◽  
Process Models ◽  
Virtual Enterprises ◽  
Computer Aided Process Planning ◽  
Manufacturing Simulation ◽  
Computer Aided ◽  
Aided Design

Abstract Integrated Product Process Development tools which minimize downstream manufacturing risk at the earliest design stages and avoid costly Design-Build-Test cycles are essential to achieving product profitability and meeting market windows. This paper summarizes initial work performed towards the development of the Manufacturing Simulation Driver (MSD) system which will demonstrate the automatic generation and execution of distributed manufacturing simulations. These simulation models are produced by Computer Aided Process Planning (CAPP) software tools which reason about Computer Aided Design (CAD) product models and produce manufacturing “scripts” from a process and resource model of a manufacturing facility. This capability will enable emerging virtual enterprises conducting collaborative design and manufacturing to simulate and prove out the manufacturing cycle of a product prior to launching production ramp-up. 1

scholarly journals An Improved Ant Colony Optimization Approach for Optimization of Process Planning

2014 ◽  
Vol 2014 ◽  
pp. 1-15 ◽  
Author(s):  
JinFeng Wang ◽  
XiaoLiang Fan ◽  
Haimin Ding
Keyword(s):  
Ant Colony Optimization ◽  
Process Planning ◽  
Weighted Graph ◽  
Ant Colony ◽  
Production Costs ◽  
Planning Problem ◽  
Total Production ◽  
Simple Method ◽  
Computer Aided Process Planning ◽  
Computer Aided

Computer-aided process planning (CAPP) is an important interface between computer-aided design (CAD) and computer-aided manufacturing (CAM) in computer-integrated manufacturing environments (CIMs). In this paper, process planning problem is described based on a weighted graph, and an ant colony optimization (ACO) approach is improved to deal with it effectively. The weighted graph consists of nodes, directed arcs, and undirected arcs, which denote operations, precedence constraints among operation, and the possible visited path among operations, respectively. Ant colony goes through the necessary nodes on the graph to achieve the optimal solution with the objective of minimizing total production costs (TPCs). A pheromone updating strategy proposed in this paper is incorporated in the standard ACO, which includes Global Update Rule and Local Update Rule. A simple method by controlling the repeated number of the same process plans is designed to avoid the local convergence. A case has been carried out to study the influence of various parameters of ACO on the system performance. Extensive comparative experiments have been carried out to validate the feasibility and efficiency of the proposed approach.

An ant colony approach to operation sequencing optimization in process planning

2016 ◽  
Vol 231 (3) ◽  
pp. 470-489 ◽  
Author(s):  
Quanwei Hu ◽  
Lihong Qiao ◽  
Guanwei Peng
Keyword(s):  
Ant Colony Optimization ◽  
Process Planning ◽  
Optimization Algorithm ◽  
Ant Colony ◽  
Local Optimum ◽  
Ant Colony Optimization Algorithm ◽  
Operation Sequencing ◽  
Computer Aided Process Planning ◽  
Process Plans ◽  
Computer Aided

Computer-aided process planning is an important component for linking design and manufacturing in computer-aided design/computer-aided process planning/computer-aided manufacturing integrated manufacturing systems. Operation sequencing in computer-aided process planning is one of the most essential tasks. To solve the problem and acquire optimal process plans, operation sequencing is modeled as a combinatorial optimization problem with various constraints, and a novel modified ant colony optimization algorithm is developed to solve it. To ensure the feasibility of process plans, constrained relationships considered among operations are classified into two categories called precedence constraint relationships and clustering constraint relationships. Operation precedence graph based on constrained relationships is formed to get visual representation. To ensure good manufacturing economy, in the mathematical model for optimization, total weighted production cost or weighted resource transformation time related to machine changes, setup changes, tool changes, machines and tools is utilized as the evaluation criterion. To avoid local optimum and enhance global search ability, adaptive updating method and local search mechanism are embedded into the optimization algorithm. Case studies of three parts are carried out to demonstrate the feasibility and robustness of the modified ant colony optimization algorithm, and some comparisons between the modified ant colony optimization algorithm and previous genetic algorithm, simulated annealing algorithm, tabu search and particle swarm optimization algorithm are discussed. The results show that the modified ant colony optimization algorithm performs well in the operation sequencing problem.

A Framework for Integrated Computer-Aided Design, Process Planning and Manufacturing Systems Engineering for Powertrain Machining

2004 ◽  
Author(s):  
Derek Yip-Hoi ◽  
Jianming Li ◽  
Liang Zhou ◽  
Wencai Wang ◽  
Madhumati Ramesh ◽  
...  
Keyword(s):  
Design Process ◽  
Process Planning ◽  
Systems Engineering ◽  
Computer Aided Design ◽  
Manufacturing Systems ◽  
Manufacturing System ◽  
Value Added ◽  
Computer Aided Process Planning ◽  
Computer Aided ◽  
Aided Design

Machined powertrain components are a subset of machined parts that introduce unique and difficult problems to product design, process planning and manufacturing system design for the automotive industry. They are complex, high value-added components that must be produced at large volumes to stringent quality standards. Accordingly product development cycles are typically long. Integrated computer-aided approaches are thus desirable for reducing this time and helping manufacturing engineers design the best process and specify the optimal manufacturing system configuration. This paper presents a framework for integrating Computer-Aided Design (CAD), Computer-Aided Process Planning (CAPP) and Computer-Aided Manufacturing Systems Engineering (CAE-MS) for producing machined powertrain components. It describes the key components of this framework and in some cases details of the methods and technologies adopted for their realization. This solution is based upon a feature-centric philosophy. This stands in contrast to the product-variant approach that has been common practice in this industry.

Programmable Support Functions to Assist Process Planning for Aeronautical Parts Manufacturing

2014 ◽  
Author(s):  
Nikolaos A. Fountas ◽  
Constantinos I. Stergiou ◽  
Nikolaos M. Vaxevanidis
Keyword(s):  
Process Planning ◽  
Computer Aided Design ◽  
Shop Floor ◽  
Support Functions ◽  
Computer Aided Process Planning ◽  
Software Application ◽  
Process Plans ◽  
Computer Aided ◽  
Technical Instructions ◽  
Parts Manufacturing

Despite the fast development and the continuous evolution of computer-aided systems for product design, analysis and manufacturing, an unlinked gap appears between the interfaces of computer-aided design (CAD) and computer-aided process planning (CAPP) modules. Various CAPP systems have been built to address this problem and forward a “passage” to link the design phase and the planning of manufacturing processes; hence, providing precise technical instructions in the shop-floor. To support the manufacturing trends and contribute to the research efforts for the realization of precise, reliable and efficient process plans, a set of programmable support functions are presented in the form of an object-oriented software application that enable process planners to produce accurate process plans for aircraft parts and components.

Representation and reasoning in computer aided process planning

1997 ◽  
Vol 211 (6) ◽  
pp. 473-485 ◽  
Author(s):  
C A McMahon ◽  
D R Cox ◽  
J H Sims Williams ◽  
J A Scott
Keyword(s):  
Process Planning ◽  
Computer Aided Design ◽  
Recursive Algorithm ◽  
Geometric Model ◽  
Search Space ◽  
Boundary Representation ◽  
Automatic Process ◽  
Computer Aided Process Planning ◽  
Topological Relationships ◽  
Computer Aided

This article is concerned with part representation and reasoning algorithms for automatic process planning in CADCAM (computer aided design and manufacture). Process planning involves the translation of a part description into instructions for a sequence of operations for the manufacture of the part. Part representations in CADCAM are reviewed, and a hierarchical representation is introduced which describes parts as the set-theoretic union of positive (protrusion) features, with the set-theoretic union of negative (depression) features subtracted. The model information hierarchy also incorporates topological relationships among features (adjacency, ownership and intersection), tolerances and links to a boundary representation (B-rep) geometric model. The hierarchical part representation is used as the basis for a reasoning scheme that uses topological relationships between features to restrict the search space of operation sequences. A recursive algorithm produces candidate operation sequences that are then ranked by applying manufacturing heuristics in a process called machining regularization. The representation approach is illustrated by an example, and possible extensions to the scheme are briefly discussed.

Sign in / Sign up

Export Citation Format

Share Document