Biologically Inspired Optimization Algorithms for Flexible Process Planning

Author(s):  
Milica Petrović ◽  
Zoran Miljković
Author(s):  
Eiji Morinaga ◽  
Takuma Hara ◽  
Hidefumi Wakamatsu ◽  
Eiji Arai

Computer support technology for modern manufacturing should deal with variable situations to accomodate to high-mix low-volume manufacturing. Computer-aided process planning (CAPP) has been discussed from this point of view, and a method for flexible CAPP, which generates a new proper process plan easily when manufacturing situation has changed, was proposed for rough milling by a three-axis vertical machine. This method was enhanced to handle millings by a multiaxis vertical machine and by both vertical and horizontal machines. The basic idea of these methods is to generate all process plans and then choose the best one. In the choice process of the best plan, all of the generated plans are evaluated. However, this process requires a large computational power when employed in actual machining where products of complex shapes have to be produced. For this computational problem, this paper discusses application of the mathematical optimization framework to this choice process.


2009 ◽  
Vol 2009.84 (0) ◽  
pp. _6-21_ ◽  
Author(s):  
Makoto UKO ◽  
Youko OKUDA ◽  
Tatsuhiko SAKAGUCHI ◽  
Keiichi SHIRASE

2014 ◽  
Vol 8 (3) ◽  
pp. 396-405 ◽  
Author(s):  
Eiji Morinaga ◽  
◽  
Takuma Hara ◽  
Hiroki Joko ◽  
Hidefumi Wakamatsu ◽  
...  

Process planning plays an important role as a bridge between product design and manufacturing. Computer-aided process planning (CAPP) has been a topic of discussion in this half century. The recent diversification in customers’ needs has been driving the development of agile manufacturing that can adapt to different manufacturing situations. CAPP should also be discussed from this point of view and, to this end, a set of flexible process planning methods have been proposed. Unlike conventional CAPP methods, these methods first generate all the feasible process plans. These are then evaluated, and then an optimal plan is selected. Therefore, it is possible to quickly provide an optimal new plan in the event of a change in the situation, by re-evaluating the plans against the new situation. However, these methods generally involve a large computational load, since the full search approach is taken to select an optimal plan. This study set out to reduce the computational load by formulating the selection process as a 0-1 integer programming problem that can now be solved thanks to recent developments in computer technology and solvers. Case studies have proven the efficacy of this method.


Sign in / Sign up

Export Citation Format

Share Document