A new spanning tree-based genetic algorithm for the design of multi-stage supply chain networks with nonlinear transportation costs

Optimization and Engineering

Volumn 10, Issue 2, 2009, Pages 219-237

  Yao, Ming Jong ^a   Hsu, Hsin Wei ^b  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

^b NATIONAL TSING HUA UNIVERSITY   (Taiwan)

Author keywords

Genetic algorithm; Multi stage supply chain networks; Non linear transportation costs; Spanning tree

Indexed keywords

EID: 69749087441     PISSN: 13894420     EISSN: 15732924     Source Type: Journal    
DOI: 10.1007/s11081-008-9059-x     Document Type: Article

References (23)

1. Abuali FN, Wainwright RL, Schoenefeld DA (1995) Determinant factorization: A new encoding scheme for spanning trees applied to the probabilistic minimum spanning tree problem. In: Eshelman LJ (ed) Proceedings of the sixth international conference on genetic algorithms. Morgan Kaufmann, San Mateo, pp 155-192.
2. Azevedo AL, Sousa JP (2000) Order planning for networked make-to-order enterprises: A case study. J Oper Res Soc 51: 1116-1127.
3. Bramel J, Simchi-Levi D (1997) The logic of logistics: Theory, algorithms and applications for logistics management. Springer, New York.
4. Chou H, Premkumar G, Chu CH (2001) Genetic algorithm for communications network design-An empirical study for the factors that influence performance. IEEE Trans Evolut Comput 5(3): 236-249.
5. Delbem ACB, de Leon Ferreira de Carvalho A, Bretas NG (2005) Main chain representation for evolutionary algorithms applied to distribution system reconfiguration. IEEE Trans Power Syst 20: 425-436.
6. Gen M, Cheng R (1997) Genetic algorithms and engineering design. Wiley, New York.
7. Gen M, Kumar A, Kim JR (2005) Recent network design techniques using evolutionary algorithms. Int J Prod Econ 98(2): 251-261.
8. Geoffrion A, van Roy TJ (1979) Caution: Common sense planning methods can be hazardous to your corporate health. Sloan Manag Rev 20: 30-42.
9. Jo JB, Li YZ, GenM(2007) Nonlinear fixed charge transportation problem by spanning tree-based genetic algorithm. Comput Ind Eng 53: 290-298.
10. Marry JM, Vidyaranya BG (2005) Global supply chain design: A literature review and critique. Transp Res Part E 41: 531-550.
11. Narula SC, Ho CA (1980) Degree-constrained minimum spanning tree. Comput Oper Res 7(4): 239-249.
12. Pirkul H, Jayaraman V (1998) A multi-commodity, multi-plant, capacitated location allocation problem: Formulation and efficient heuristic solution. Comput Oper Res 25: 869-878.
13. Ro H, Tcha D (1984) A branch and bound algorithm for two level uncapacitated facility location problem with some side constraint. Eur J Oper Res 18: 349-358.
14. Russell RM, Krajewski LJ (1991) Optimal purchase and transportation cost lot sizing for a single item. Dec Sci 22: 940-954.
15. Siajadi HR, Ibrahim N, Lochert PB, Chan WM (2005) Joint replenishment policy in inventory-production systems. Prod Plan Control 16: 255-262.
16. Sim E, Jang Y, Park J (2000) Study on the supply chain network design considering multi-level, multiproduct, capacitated facility. In: Proceedings of Korean supply chain management society.
17. Simchi-Levi D, Kaminsky P, Simchi-Levi E (2003) Designing and managing the supply chain: Concepts, strategies, and case studies, 2nd edn. McGraw-Hill, New York.
18. Syarif A, Yun YS, Gen M (2002) Study on multi-stage logistic chain network A spanning tree-based genetic algorithm approach. Comput Ind Eng 43: 299-314.
19. Tilanus B (1997) Introduction to information system in logistics and transportation. Elsevier, London.
20. Tragantalerngsak S, Holt J, Ronnqvist M (1997) Lagrangian heuristics for the two-echelon, single-source, capacitate location problem. Eur J Oper Res 102: 611-625.
21. Yeh WC (2005) A hybrid heuristic algorithm for the multistage supply chain network problem. Int J Adv Manuf Technol 26(5-6): 675-685.
22. Yu H (1997) ILOG in the supply chain. ILOG Technical Report.
23. Zhou G, Gen M (2003) A genetic algorithm approach on tree-like telecommunication network design problem. J Oper Res Soc 54(3): 248-254.