Comparative Study for a Multi-objective MLCSP Problem Solved Using NSGA-II & E-Constraint
Operational production planning received much attention in the literature. In this paper, a multi-objective MLCLSP problem is proposed and two approaches “ε-constraint” and “NSGA-II” are compared when solving this problem. The multi-objective optimization model aims to minimize simultaneously the total production cost and the average inventory levels in a multi-period, multi-item environment. Several tests are developed to generate the Pareto optimal solution using the two optimization methods. The experimental results indicate that the ɛ-constraint is faster than NSGA-II and provides a better quality of the Pareto optimal solution.
KeywordsMulti-objective MLCLSP model ε-constraint method elitist genetic algorithm NSGA-II
Unable to display preview. Download preview PDF.
- Chankong, V., Haimes, Y.: Multi-objective decision making theory and methodology. Elsevier Science, New York (1983)Google Scholar
- Coello, C.A., Lamont, G.B.: Application of mutli-objective evolutionary algorithms, 1st edn. World Scientific Pub. Co. Inc. (2004)Google Scholar
- Dudek, G.: Collaborative planning in supply chains: a negotiation-based approach. Springer (2004)Google Scholar
- Ertogral, K., Wu, S.D.: Auction-theoretic coordination of production planning in the supply chain. IIE Transactions 32(10), 931–940 (2000)Google Scholar