A Layer Hybrid Intelligent Algorithm for Solving Resources Scheduling Problem

Yun Jie Ma; Zi Hui Ren; Ping Zhu

doi:10.4028/www.scientific.net/AMM.644-650.1506

Paper Titles

A Fast Algorithm Based on Discrete Cosine Transform(DCT)
p.1488

G(1,1,λ,ρ) Optimization Model and Application Based on the FS
p.1494

Distortion Analysis in the Axial Offset Parallel Video System
p.1498

The Attractor of 2D Autonomous g-Navier-Stokes Flows with Linear Dampness
p.1502

A Layer Hybrid Intelligent Algorithm for Solving Resources Scheduling Problem
p.1506

An Particle Swarm Optimization to Alloy Tensile Organization Evolution
p.1510

Optimization Research in Heat-Moisture Comfort Evaluation System Parameters of Fabric Based on Matlab
p.1514

Determination Analysis Model of Inter-Regional Power Replacement in our Country
p.1519

User Oriented Semi-Supervised Document Clustering
p.1523

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 644-650A Layer Hybrid Intelligent Algorithm for Solving...

A Layer Hybrid Intelligent Algorithm for Solving Resources Scheduling Problem

Abstract:

A New hybrid intelligent algorithm is used to solve the resources scheduling problem. This new algorithm contains Adaptive Particle Swarm Optimization (APSO) algorithm and Modified Genetic Algorithm (MGA) and Machine Learning (ML) algorithm, MGA is used to realize global searching, APSO is used to get the local searching. The choose processing depend on the definite of information in ant algorithm. Machine learning principle was proposed, after some iteration, the part of the optimal solution was deserved. Then we search the optimal solution in each layer. Simulational results based on the well-known benchmark suites in the literature showed that the algorithm had better optimization performance.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 644-650)

Pages:

1506-1509

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.644-650.1506

Citation:

Cite this paper

Online since:

September 2014

Authors:

Yun Jie Ma*, Zi Hui Ren, Ping Zhu

Keywords:

Adaptive Particle Swarm Algorithm, Job Shop Scheduling Problem, Machine Learning Algorithm, Modified Genetic Algorithm

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] Liu Fei, Yang Dan, Wang Shilong. CIMS manufacturing automation [M]. Beijing: China Machine Press, 2003 (in Chinese).

Google Scholar

[2] ALDOWAISANT, ALLAHVERDI A. New heuristic for no-wait flowshops to minimize makes pan [J]. Computer and Operation Research, 2003, 30(8): 1219-1231.

DOI: 10.1016/s0305-0548(02)00068-0

Google Scholar

[3] GRABOWSKI J, PEMPERA J. Some local search algorithms for no-wait floe-shop problem with make pan criterion [J], Computers and Operations Research, 2005, 32(8): 2197-2122.

DOI: 10.1016/j.cor.2004.02.009

Google Scholar

[4] PANQK, TASGE TIREN MF, LIANGYC. A discrete particles swarm optimization algori- thm for the no-wait flowshop scheduling problem with makes pan criterion[C]/ Pro- ceedings of International Workshop on UK Planning and Scheduling Special Interest Group. London, UK: City University, 2005: 31-41.

Google Scholar

[5] Pan Quanke, Wang Wenhong, Zhu Jianying. Some meta-heuristics for no-walt flow shop problem. Computer Integrated Manufacturing Systems [J]，May 2007. Vol. 13 No. 5.

Google Scholar

[6] Kennedy J and Eberhert R. Particle swarm optimization, in IEEE International Confer- ence on Neural Networks. 1995，1942~ (1948).

Google Scholar

[7] Fen Qifeng, Li yan. Applying genetic algorithm with memory base to solve JSP。Computer Integrated Manufacturing Systems [J] ，Aug. 2005, Vol. 11 No. 8.

Google Scholar