2015.07.30 09:42
author | Eoksu Sim |
---|---|
2nd author | / Sungwon Jung (Dept. of Industrial Engineering, Seoul National University) / Haejoong Kim (Dept. of Industrial Engineering, Seoul National University) / Jinwoo Park (Dept. of Industrial Engineering, Seoul National University) |
info | Lecture Notes in Computer Science (SCIE, 0.402), Vol. 3103, pp.1214-1225, 2004 |
year | 2004 |
c | IJ |
저널/학회 | LNCS |
group | SCIE |
keyword | Closed-loop supply chain, network design, genetic algorithm |
abstract | GECCO(Genetic and Evolutionary Computation Conference) 2004, Seattle, WA, USA Recently much research has focused on both the supply chain and reverse logistics network design problem. The rapid progress in computer and network technology and the increasingly fierce competition in recent times have compelled global company to consider these two networks in integrated view for efficient decision-making throughout the supply chain. The integrated problem, however, resembles a combinatorial problem, whose computation time to obtain an optimal solution increases exponentially in proportion to the size of the problem. Therefore, an algorithm able to generate a relatively good solution within a reasonable time is needed. In this study, we propose an LP-based genetic algorithm. The experimental results show that the proposed algorithm is superior to MIP solver in time and to traditional genetic algorithm in quality. |