An efficient memetic algorithm for the multi-stage supply chain network problem

International Journal of Advanced Manufacturing Technology

Volumn 29, Issue 7-8, 2006, Pages 803-813

  Yeh, Wei Chang ^a  

^a NATIONAL TSING HUA UNIVERSITY   (Taiwan)

Author keywords

Fibonacci number; Genetic algorithm; Greedy heuristic algorithm; Linear programming technique; Local search methods; Memetic algorithm; Network; Supply chain

Indexed keywords

GENETIC ALGORITHMS; HEURISTIC METHODS; INFORMATION ANALYSIS; LINEAR PROGRAMMING; NUMBERING SYSTEMS;

FIBONACCI NUMBERS; GREEDY HEURISTIC ALGORITHMS; LINEAR PROGRAMMING TECHNIQUE; LOCAL SEARCH METHODS; MEMETIC ALGORITHMS; NETWORKS; SUPPLY CHAIN;

INDUSTRIAL MANAGEMENT;

EID: 33745712728     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/s00170-005-2556-6     Document Type: Article

References (23)

1. Yeh W-C (in press) A hybrid heuristic algorithm for the multi-stage supply chain network problem. Int J Adv Manuf Technol 26:675-685
2. 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
3. Chopra S, Meindl P (2003) Supply chain management: strategy, planning and operation, 2nd edn, Prentice-Hall, New York
4. Stadtler H, Kilger C (eds) (2002) Supply chain management and advanced planning. Springer, Berlin Heidelberg New York
5. Poirier CC (1999) Advanced supply chain management: how to build a sustained competitive advantage. Berrett-Kochler, San Francisco, CA
6. Yu H (1997) ILOG in the supply chain. ILOG Technical Report
7. Gen M, Cheng R (1997) Genetic algorithm and engineering design. Wiley, New York
8. Kaufman L, Eede MV, Hansen P (2000) A plant and warehouse location problem. Oper Res Q 2:547-554
9. Lee CY (1993) A cross decomposition algorithm for a multi-product multi-type facility location problem. Comput Oper Res 20:527-540
10. Leipins G, Hilliard M (1989) Genetic algorithm: foundation and applications. Ann Oper Res 21:31-58
11. Goldberg DE (1989) Genetic algorithms in search, optimization, and machine learning. Addison-Wesley, Reading, MA
12. Nachtigall K, Voget S (1996) A genetic algorithm approach to periodic railway synchronization. Comput Oper Res 23:453-463
13. Hoi DY, Dutta D (1996) A genetic algorithm application for sequencing operations in process planning for parallel machining. HE Trans 28:55-68
14. Al-Sultan KS, Hussain MF, Nizami JS (1996) A genetic algorithm for the set covering problem. J Oper Res Soc 47:702-709
15. Moscato P, Norman M (1992) A memetic approach for the traveling salesman problem: implementation of a computational ecology for combinatorial optimization on message-passing system. Proceeding of 20th International Conference on Parallel Computing and Transportation Applications
16. Takashi K, Hiroaki K, Masakazu N (1993) A hybrid search for genetic algorithms: combining genetic algorithms, tabu search, and simulated annealing. Proceeding of 5th International Conference on Genetic Algorithms, pp 641
17. Ghoshray S, Yeh KK, Andrian J (1995) Modified genetic algorithms by efficient unification with simulated annealing. In: Pearson DW, Steele NC, Albrecht RF (eds) Artificial Neural Nets Genetic Algorithm. Springer-Verlag, pp 487-490
18. Cotta A, Aldana JF, Nebro AJ, Troya JM (1995) Hybridizing genetic algorithms with branch-and-bound techniques for the resolution of the TSP. In: Pearson DW, Steele NC, Albrecht RF (eds) Artificial Neural Nets and Genetic Algorithm. Springer-Verlag, pp 277-280
19. Hattori M, Naruse M, Shirataki J, Tomikawa T (1996) A study of parameter optimization in mega-genetic algorithm. Proceeding of 20th International Conference on Computers & Industrial Engineering, pp 445-448
20. Yeh W-C (2000) A memetic algorithm for the min k-cut problem. Control Intell Syst 28:47-55
21. max scheduling problem. Int J Adv Manuf Technol 20(9):464-473
22. Corley HW, Rosenberger J, Yeh W-C, Sung TK (2005) The cosine simplex algorithm. Int J Adv Manuf Technol. Published online 6 April 2005
23. Bazaraa MS, Jarvis JJ (1990) Linear programming and network flows 2nd edn. Wiley, New York