The Solution of Machines’ Time Scheduling Problem Using Artificial Intelligence Approaches
Journal Title: International Journal of Advanced Research in Artificial Intelligence(IJARAI) - Year 2012, Vol 1, Issue 1
Abstract
The solution of the Machines’ Time Scheduling Problem (MTSP) is a hot point of research that is not yet matured, and needs further work. This paper presents two algorithms for the solution of the Machines’ Time Scheduling Problem that leads to the best starting time for each machine in each cycle. The first algorithm is genetic-based (GA) (with non-uniform mutation), and the second one is based on particle swarm optimization (PSO) (with constriction factor). A comparative analysis between both algorithms is carried out. It was found that particle swarm optimization gives better penalty cost than GA algorithm and max-separable technique, regarding best starting time for each machine in each cycle.
Authors and Affiliations
Ghoniemy S. , El-sawy A. A. , Shohla M. A. , Gihan E. H. Ali
Keywords
Related Articles
- EP ID EP103353
- DOI -
- Views 118
- Downloads 0
A New Optimization Algorithm For Combinatorial Problems
Combinatorial optimization problems are those problems that have a finite set of possible solutions. The best way to solve a combinatorial optimization problem is to check all the feasible solutions in the search s...
Evolutionary Approaches to Expensive Optimisation
Surrogate assisted evolutionary algorithms (EA) are rapidly gaining popularity where applications of EA in complex real world problem domains are concerned. Although EAs are powerful global optimizers, finding opti...
Improvement of Automated Detection Method for Clustered Microcalcification Based on Wavelet Transformation and Support Vector Machine
The main problem that corresponding with breast cancer is how to deal with small calcification part inside the breast called microcalcification (MC). A breast screening examination called mammogram is provided as p...
Multi Spectral Image Classification Method with Selection of Independent Spectral Features through Correlation Analysis
Multi spectral image classification method with selection processes of independent spectral features through correlation analysis is proposed. The proposed method is validated by applying to the polarimetric Synthetic Ap...
FISHER DISTANCE BASED GA CLUSTERING TAKING INTO ACCOUNT OVERLAPPED SPACE AMONG PROBABILITY DENSITY FUNCTIONS OF CLUSTERS IN FEATURE SPACE
Fisher distance based Genetic Algorithm: GA clustering method which takes into account overlapped space among probability density functions of clusters in feature space is proposed. Through experiments with simulation da...