Buradasınız

Anasayfa » Content

Combined Memetic Algorithm in Case of Supply Chain System's Scheduling (Approach of Cost Maintenance)

Journal Name:

  • International Journal of Science and Engineering Investigations

Publication Year:

  • 2013

Key Words:

Author NameUniversity of Author
Abstract (2. Language): 
Scheduling of supply chain systems (SSCS) is one of problems in NP-Hard optimization. The aim of scheduling of these systems is to maximize the system efficiency by finding an optimal planning for a better cooperation among various processes. In recent years many algorithms proposed to solve this problem, and most of them are based on heuristic methods. In This paper we have proposed a new algorithm namely SCMTP, a Memetic algorithm combined with Timed Petri Net, for scheduling supply chain systems considering maintenance problem. The experimental results show that our proposed algorithm, i.e. SCMTP has about %6.73 and %23.82 improvements over GADG and PN-GA algorithms respectively.
Bookmark/Search this post with
FULL TEXT (PDF): 
PDF icon ijsei-21613-02.pdf
  • 17
11-14
  • English

REFERENCES

References: 

[1] Takahashi, Masakazu, and Setsuya Kurahashi. "Tabu Search Algorithms for Multimodal and Multi-Objective Function Optimizations." International Journal of Computer Science and Network Security 7, no. 10, 257 – 264, 2007.
[2] Kumar, R, M K Tiwari, and R Shankar. "Scheduling of supply chain systems: an ant colony optimization approach." IMechE, 1443–1453, 2003.
[3] Caballero, J, and G. Mejia, "A Hybrid Approach that Combines Petri Net Models And Genetic Algorithms for Scheduling of Supply chain Systems" .III Congreso Colombiano y I Conferencia Andina Internacional de Investigación de Operaciones. Cartagena, Colombia. Electronic Proceedings, 2004.
[4] Li, Aiping, and Nan Xie. "A Robust Scheduling for Reconfigurable Manufacturing System Using Petri Nets and Genetic Algorithm." Proceedings of the 6th World Congress on Intelligent Control and Automation, 7302-7306, 2006.
[5] Rossi, Andrea, and Elena Boschi. "A hybrid heuristic to solve the parallel machines job-shop scheduling problem." Advances in Engineering Software (Elsevier Ltd), 2008.
[6] Chan, Felix, S H Chung, L Y Chan, G Finke, and M K Tiwari. "Solving distributed SCS scheduling problems subject to maintenance: Genetic algorithms approach." Robotics and Computer-Integrated Manufacturing (Elsevier Ltd) 22, 493–504, 2006.
[7] M Yadollahi and A M Rahmani, “Solving distributed supply chain systems scheduling problems subject to maintenance: Memetic algorithms approach”, The 9th IEEE International Conference on Computer and Information Technology(CIT2009), Xiamen , China, 36-41, 2009.
[8] Peres, F, and D Noyes. "Evaluation of a maintenance strategy by the analysis of the rate of repair." Qual Reliab Eng Int 19, 129 – 148, 2003.
[9] Dreo, J, A Petrowski, P Siarry, and E Taillard. Metaheuristics for Hard Optimization. New York: Springer Berlin Heidelberg, 2003.
[10] Moscato P. "Memetic algorithms: A short introduction", In Corne, D., Glover, F., Dorigo, M., editors, New Ideas in Optimizations, McGraw-Hill, Londres, 219 – 235, 1999.

Thank you for copying data from http://www.arastirmax.com