A two-stage ant colony optimization approach based on a directed graph for process planning

2015 ◽  
Vol 80 (5-8) ◽  
pp. 839-850 ◽  
Author(s):  
JinFeng Wang ◽  
Xuehua Wu ◽  
Xiaoliang Fan
2014 ◽  
Vol 2014 ◽  
pp. 1-11 ◽  
Author(s):  
JinFeng Wang ◽  
XiaoLiang Fan ◽  
Shuting Wan

The complex process planning problem is modeled as a combinatorial optimization problem with constraints in this paper. An ant colony optimization (ACO) approach has been developed to deal with process planning problem by simultaneously considering activities such as sequencing operations, selecting manufacturing resources, and determining setup plans to achieve the optimal process plan. A weighted directed graph is conducted to describe the operations, precedence constraints between operations, and the possible visited path between operation nodes. A representation of process plan is described based on the weighted directed graph. Ant colony goes through the necessary nodes on the graph to achieve the optimal solution with the objective of minimizing total production costs (TPC). Two cases have been carried out to study the influence of various parameters of ACO on the system performance. Extensive comparative experiments have been conducted to demonstrate the feasibility and efficiency of the proposed approach.


2018 ◽  
Vol 204 ◽  
pp. 214-226 ◽  
Author(s):  
Jiangtao Hong ◽  
Ali Diabat ◽  
Vinay V. Panicker ◽  
Sridharan Rajagopalan

2014 ◽  
Vol 978 ◽  
pp. 209-212
Author(s):  
Jin Feng Wang ◽  
Kai Yu Chu ◽  
Qing Yu Wang

An ant colony optimization (ACO) approach has been developed to deal with process planning problem to achieve the optimal process plan. A disjunctive weighted directed graph is conducted to describe the operations, precedence constraints between operations, and the possible visited path between operation nodes. A represent of process plan is described based on the disjunctive weighted directed graph. Ant colony goes through the necessary nodes on the graph to achieve the optimal solution with the objective of minimizing Total Production Costs (TPC). Extensive comparative experiments have been carried out to demonstrate the feasibility and efficiency of the proposed approach.


2019 ◽  
Vol 28 (2) ◽  
pp. 183-189
Author(s):  
COSMIN SABO ◽  
ANDREI HORVAT MARC ◽  
PETRICA C. POP

The two-stage supply chain problem with fixed costs consists of designing a mimimum distribution cost configuration of the manufacturers, distribution centers and retailers in a distribution network, satisfying the capacity constraints of the manufacturers and distribution centers so as to meet the retailers specific demands. The aim of this work is to pinpoint some inaccuracies regarding the paper entitled ”A two-stage supply chain problem with fixed costs: An ant colony optimization approach” by Hong et al. published in International Journal of Production Economics, Vol. 204, pp. 214–226 (2018) and to propose a valid mixed integer programming based mathematical model of the problem. The comments are related to the mathematical formulation proposed by Hong et al. and the considered test instances.


Sign in / Sign up

Export Citation Format

Share Document