Abstract
A supply chain is dynamic and involves the constant flow of information, production, services, and funds from suppliers to customers between different stages. In this paper, a memetic algorithm (MA, a hybrid genetic algorithm) is developed to find the strategy that can give the lowest cost of the physical distribution flow. The proposed MA is combined with the genetic algorithm (GA), a multi-greedy heuristic method (GH), three local search methods (LSMs): the pairwise exchange procedure (XP), the insert procedure (IP), and the remove procedure (RP), the Fibonacci number procedure, and the linear programming technique (LP) to improve the tradition genetic algorithm (GA). Preliminary computational experiments demonstrate the efficiency and performance of the proposed MA.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
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
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
Chopra S, Meindl P (2003) Supply chain management: strategy, planning and operation, 2nd edn, Prentice-Hall, New York
Stadtler H, Kilger C (eds) (2002) Supply chain management and advanced planning. Springer, Berlin Heidelberg New York
Poirier CC (1999) Advanced supply chain management: how to build a sustained competitive advantage. Berrett-Kochler, San Francisco, CA
Yu H (1997) ILOG in the supply chain. ILOG Technical Report
Gen M, Cheng R (1997) Genetic algorithm and engineering design. Wiley, New York
Kaufman L, Eede MV, Hansen P (2000) A plant and warehouse location problem. Oper Res Q 2:547–554
Lee CY (1993) A cross decomposition algorithm for a multi-product multi-type facility location problem. Comput Oper Res 20:527–540
Leipins G, Hilliard M (1989) Genetic algorithm: foundation and applications. Ann Oper Res 21:31–58
Goldberg DE (1989) Genetic algorithms in search, optimization, and machine learning. Addison-Wesley, Reading, MA
Nachtigall K, Voget S (1996) A genetic algorithm approach to periodic railway synchronization. Comput Oper Res 23:453–463
Hoi DY, Dutta D (1996) A genetic algorithm application for sequencing operations in process planning for parallel machining. IIE Trans 28:55–68
Al-Sultan KS, Hussain MF, Nizami JS (1996) A genetic algorithm for the set covering problem. J Oper Res Soc 47:702-709
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
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
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
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
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
Yeh W-C (2000) A memetic algorithm for the min k-cut problem. Control Intell Syst 28:47–55
Yeh W-C (2000) A memetic algorithm for the n/2/flowshop/αF+βCmax scheduling problem. Int J Adv Manuf Technol 20(9):464–473
Corley HW, Rosenberger J, Yeh W-C, Sung TK (2005) The cosine simplex algorithm. Int J Adv Manuf Technol. Published online 6 April 2005
Bazaraa MS, Jarvis JJ (1990) Linear programming and network flows 2nd edn. Wiley, New York
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Yeh, WC. An efficient memetic algorithm for the multi-stage supply chain network problem. Int J Adv Manuf Technol 29, 803–813 (2006). https://doi.org/10.1007/s00170-005-2556-6
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00170-005-2556-6