A modified Pareto genetic algorithm for multi-objective build-to-order supply chain planning with product assembly. (English) Zbl 1231.90397

Summary: The build-to-order supply chain (BOSC) model is a key operation model for providing services/products at present. This study focuses on performing the supply chain planning for the BOSC network. The planning is designed to integrate supplier selection, product assembly, as well as the logistic distribution system of the supply chain in order to meet market demands. With multiple suppliers and multiple customer needs, the assembly model can be divided into several sub-assembly steps by applicable sequence. Considering three evaluation criteria, namely costs, delivery time, and quality, a multi-objective optimization mathematical model is established for the BOSC planning in this study. The multi-objective problems usually have no unique optimal solution, and the Pareto genetic algorithm (PaGA) can find good trade-offs among all the objectives. Therefore, the PaGA is applied to find solutions for the mathematical model. In addition, regarding BOSC problems solving, this study proposes a modified Pareto genetic algorithm (mPaGA) to improve the solution quality through revision of crossover and mutation operations. After application and analysis of cases, mPaGA is found to be superior to traditional PaGA (tPaGA) in solution performance.


90C90 Applications of mathematical programming
90C59 Approximation methods and heuristics in mathematical programming
Full Text: DOI


[1] Altiparmak, F.; Gen, M.; Lin, L.; Paksoy, T.: A genetic algorithm approach for multi-objective optimization of supply chain networks, Comput ind eng 51, No. 1, 196-215 (2006)
[2] Chakraborti, N.; Mishra, P.; Aggarwal, A.; Banerjee, A.; Mukherjee, S. S.: The Williams and otto chemical plant re-evaluated using a Pareto-optimal formulation aided by genetic algorithms, Appl soft comput 6, No. 2, 189-197 (2006)
[3] Che, Z. H.: Using fuzzy analytic hierarchy process and particle swarm optimisation for balanced and defective supply chain problems considering WEEE/rohs directives, Int J prod res 48, No. 11, 3355-3381 (2010) · Zbl 1197.90048
[4] Chen, C. T.; Lin, C. T.; Huang, S. F.: A fuzzy approach for supplier evaluation and selection in supply chain management, Int J prod econ 102, 289-301 (2006)
[5] Dai, C.; Yao, M.; Xie, Z.; Chen, C.; Liu, J.: Parameter optimization for growth model of greenhouse crop using genetic algorithms, Appl soft comput 9, No. 1, 13-19 (2009)
[6] Dickson, G. W.: An analysis of supplier selection system and decision, J purch 2, No. 1, 5-17 (1966)
[7] Fei, Y.; Li, N. N.; Han, Z. G.: Multi-objective optimization method and its application based on Pareto sets, Hoist convey Mach 2006, No. 9, 13-15 (2006)
[8] Fujita K, Hirokawa N, Akagi S. Multi-objective optimal design of automotive engine using genetic algorithm. In: Proceeding of DETC’98 – ASME design engineering technical conferences; 1998.
[9] Gen, M.; Cheng, R.: Genetic algorithms and engineering design, (1997)
[10] Glickmana, T. S.; White, S. C.: Optimal vendor selection in a multiproduct supply chain with truckload discounts, Transport res part E – logist transport rev 44, No. 5, 684-695 (2008)
[11] Goossens, D. R.; Maas, A. J. T.; Spieksma, F. C. R.; Van De Klundert, J. J.: Exact algorithms for procurement problems under a total quantity discount structure, Eur J oper res 178, No. 2, 603-626 (2007) · Zbl 1107.90043
[12] Gunasekaran, A.: The build-to-order supply chain (BOSC): a competitive strategy for 21st century, J oper manage 23, No. 5, 419-422 (2005)
[13] Gunasekaran, A.; Lai, K. H.; Cheng, E. T. C.: Responsive supply chain: a competitive strategy in a networked economy, Omega 36, No. 4, 549-564 (2008)
[14] Gunasekaran, A.; Ngai, E. W. T.: Modeling and analysis of build-to-order supply chains, Eur J oper res 195, No. 2, 319-334 (2009) · Zbl 1156.90409
[15] Ha, S. H.; Krishnan, R.: A hybrid approach to supplier selection for the maintenance of a competitive supply chain, Expert syst appl 34, 1303-1311 (2008)
[16] Hosung, C.; Rogers, R. L.; Hao, L.: Design of electrically small wire antennas using a Pareto genetic algorithm, IEEE trans antennas propag 53, No. 3, 1038-1046 (2005)
[17] Houlihan, J. B.: International supply chain management, Int J phys D mater manage 15, No. 1, 22-38 (1985)
[18] Howard, M.; Miemczykb, J.; Graves, A.: Automotive supplier parks: an imperative for build-to-order, J purch supply manage 12, 91-104 (2006)
[19] Jones, T. C.; Riley, D. W.: Using inventory for competitive advantage through supply chain management, Int J phys D mater manage 15, No. 5, 16-26 (1985)
[20] Krajewski, L.; Wei, J. C.; Tang, L. L.: Responding to schedule changes in build-to-order supply chains, J oper manage 23, No. 5, 452-469 (2005)
[21] Li, K.; Sivakumar, A. I.; Ganesan, V. K.: Complexities and algorithms for synchronized scheduling of parallel machine assembly and air transportation in consumer electronics supply chain, Eur J oper res 187, No. 2, 442-455 (2008) · Zbl 1149.90022
[22] Liaoa, Z.; Rittscherb, J.: A multi-objective supplier selection model under stochastic demand conditions, Int J prod econ 105, 150-159 (2006)
[23] Pareto, V.: Cours d’economic politique, (1896)
[24] Poulos, P. N.; Rigatos, G. G.; Tzafestas, S. G.; Koukos, A. K.: A Pareto-optimal genetic algorithm for warehouse multi-objective optimization, Eng appl artif intell 14, No. 6, 737-749 (2001)
[25] Prasad, S.; Tata, J.; Madan, M.: Build to order supply chains in developed and developing countries, J oper manage 23, No. 5, 551-568 (2005)
[26] Rahman, M. A. A.; Sarker, B. R.: Supply chain models for an assembly system with preprocessing of raw materials, Eur J oper res 181, 733-752 (2007) · Zbl 1131.90307
[27] Rojas, I.; Gonzalez, J.; Pomares, H.; Merelo, J. J.; Castillo, P. A.; Romero, G.: Statistical analysis of the Main parameters involved in the design of a genetic algorithm, IEEE trans syst man cybern C 32, No. 1, 31-37 (2002)
[28] Sha, D. Y.; Che, Z. H.: Supply chain network design: partner selection and production/distribution planning using a systematic model, J oper res soc 57, No. 1, 52-62 (2006) · Zbl 1121.90047
[29] Simaria, A. S.; Vilarinho, P. M.: A genetic algorithm based approach to the mixed-model assembly line balancing problem of type II, Comput ind eng 47, No. 4, 391-407 (2004)
[30] Tutkun, N.: Parameter estimation in mathematical models using the real coded genetic algorithms, Expert syst appl 36, No. 2, 3342-3345 (2009)
[31] Wadhwa, V.; Ravindran, A. R.: Vendor selection in outsourcing, Comput oper res 34, No. 12, 3725-3737 (2007) · Zbl 1127.90064
[32] Weber, C. A.; Current, J. R.; Benton, W. C.: Vendor selection criteria and methods, Eur J oper res 50, 2-18 (1991) · Zbl 1403.90061
[33] Weber, C. A.; Current, J. R.; Desai, A.: Vendor: a structured approach to vendor selection and negotiation, J bus logist 21, No. 1, 135-167 (2000)
[34] Xu, J.; Liu, Q.; Wang, R.: A class of multi-objective supply chain networks optimal model under random fuzzy environment and its application to the industry of chinese liquor, Inf sci 178, 2022-2043 (2008) · Zbl 1161.90016
[35] Zhao, X.; Xu, D.; Zhang, H.; He, Q.: Modeling and analysis of a supply – assembly – store chain, Eur J oper res 176, 275-294 (2007) · Zbl 1137.90363
[36] Zhou, S. Q.; Xiang, J. W.: Multiobjective collaborative optimization based on BP neural network and Pareto genetic algorithm, Mach des res 22, No. 5, 10-13 (2006)
[37] Zhu, X. J.; Pan, D.; Wang, A. L.; Zhang, H. Q.; Ye, Q. T.: Multiobjective optimization design with mixed-discrete variables in mechanical engineering via Pareto genetic algorithm, J Shanghai jiaotong univ 34, No. 3, 411-414 (2000)
[38] Zitzler, E.: Evolutionary algorithms for multiobjective optimization: methods and applications, (1999)
[39] Zitzler, E.; Laumanns, M.; Bleuler, S.: A tutorial on evolutionary multiobjective optimization, Metaheuristics for multiobjective optimisation, lecture notes in economics and mathematical systems 535, 3-37 (2004) · Zbl 1134.90491
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.