Please wait a minute...
ZJUS-A
Journal of Zhejiang University-SCIENCE A (Applied Physics & Engineering)  2010, Vol. 11 Issue (12): 953-958    DOI: 10.1631/jzus.A1001136
APIEMS     
Solving composite scheduling problems using the hybrid genetic algorithm
Azuma Okamoto, Mitsumasa Sugawara
Faculty of Software and Information Science, Iwate Prefectural University, 152-52 Sugo, Takizawa, Iwate, Japan
Download:     PDF (0 KB)     
Export: BibTeX | EndNote (RIS)      

Abstract  This paper dealt with composite scheduling problems which combine manufacturing scheduling problems and/or transportation routing problems. Two scheduling models were formulated as the elements of the composite scheduling model, and the composite model was formulated composing these models with indispensable additional constraints. A hybrid genetic algorithm was developed to solve the composite scheduling problems. An improved representation based on random keys was developed to search permutation space. A genetic algorithm based dynamic programming approach was applied to select resource. The proposed technique and a previous technique are compared by three types of problems. All results indicate that the proposed technique is superior to the previous one.

Key words： Composite scheduling      Manufacturing scheduling      Transportation routing      Hybrid genetic algorithm     
Received: 28 October 2010      Published: 09 December 2010
CLC:  TP301.6  
  U11  
  F406.2  
Service
E-mail this article
Add to my bookshelf
Add to citation manager
E-mail Alert
RSS
Articles by authors
Azuma Okamoto
Mitsumasa Sugawara
Cite this article:

Azuma Okamoto, Mitsumasa Sugawara. Solving composite scheduling problems using the hybrid genetic algorithm. Journal of Zhejiang University-SCIENCE A (Applied Physics & Engineering), 2010, 11(12): 953-958.

URL:

http://www.zjujournals.com/xueshu/zjus-a/10.1631/jzus.A1001136     OR     http://www.zjujournals.com/xueshu/zjus-a/Y2010/V11/I12/953

[1] Taher NIKNAM, Babak AMIRI, Javad OLAMAEI, Ali AREFI. An efficient hybrid evolutionary optimization algorithm based on PSO and SA for clustering[J]. Journal of Zhejiang University-SCIENCE A (Applied Physics & Engineering), 2009, 10(4): 512-519.
[2] Wei-min ZHONG, Shao-jun LI, Feng QIAN. θ-PSO: a new strategy of particle swarm optimization[J]. Journal of Zhejiang University-SCIENCE A (Applied Physics & Engineering), 2008, 9(6): 786-790.
[3] KHOSLA Arun, KUMAR Shakti, AGGARWAL K.K.. Identification of strategy parameters for particle swarm optimizer through Taguchi method[J]. Journal of Zhejiang University-SCIENCE A (Applied Physics & Engineering), 2006, 7(12): 6-.
[4] FAHIM A.M., SALEM A.M., TORKEY F.A., RAMADAN M.A.. An efficient enhanced k-means clustering algorithm[J]. Journal of Zhejiang University-SCIENCE A (Applied Physics & Engineering), 2006, 7(10): 2-.
[5] CHEN Shui-fu, SUN Bing-nan. PARALLEL IMPLEMENTATIONS OF NUMERICAL SIMULATION OF WIND FLOW AROUND BUILDINGS[J]. Journal of Zhejiang University-SCIENCE A (Applied Physics & Engineering), 2000, 1(3): 300-305.
[6] REN Kui, PARK Jaemin, KIM Kwangjo. On the construction of cryptographically strong Boolean functions with desirable trade-off[J]. Journal of Zhejiang University-SCIENCE A (Applied Physics & Engineering), 2005, 6( 5): 2-.
[7] CHEN Chuan-bo, HE Da-hua. A heuristic method for solving triangle packing problem[J]. Journal of Zhejiang University-SCIENCE A (Applied Physics & Engineering), 2005, 6( 6): 15-.