APPLYING SUB-POPULATION MEMETIC ALGORITHM FOR MULTI-OBJECTIVE SCHEDULING PROBLEMS

2012 ◽  
Vol 544 ◽  
pp. 245-250 ◽  
Author(s):  
Guo Hui Zhang

The multi objective job shop scheduling problem is well known as one of the most complex optimization problems due to its very large search space and many constraint between machines and jobs. In this paper, an evolutionary approach of the memetic algorithm is used to solve the multi objective job shop scheduling problems. Memetic algorithm is a hybrid evolutionary algorithm that combines the global search strategy and local search strategy. The objectives of minimizing makespan and mean flow time are considered while satisfying a number of hard constraints. The computational results demonstrate the proposed MA is significantly superior to the other reported approaches in the literature.


Author(s):  
Ahmad Reza Jafarian-Moghaddam

AbstractSpeed is one of the most influential variables in both energy consumption and train scheduling problems. Increasing speed guarantees punctuality, thereby improving railroad capacity and railway stakeholders’ satisfaction and revenues. However, a rise in speed leads to more energy consumption, costs, and thus, more pollutant emissions. Therefore, determining an economic speed, which requires a trade-off between the user’s expectations and the capabilities of the railway system in providing tractive forces to overcome the running resistance due to rail route and moving conditions, is a critical challenge in railway studies. This paper proposes a new fuzzy multi-objective model, which, by integrating micro and macro levels and determining the economical speed for trains in block sections, can optimize train travel time and energy consumption. Implementing the proposed model in a real case with different scenarios for train scheduling reveals that this model can enhance the total travel time by 19% without changing the energy consumption ratio. The proposed model has little need for input from experts’ opinions to determine the rates and parameters.


2013 ◽  
Vol 651 ◽  
pp. 548-552
Author(s):  
Parinya Kaweegitbundit

This paper considers two stage hybrid flow shop (HFS) with identical parallel machine. The objectives is to determine makespan have been minimized. This paper presented memetic algorithm procedure to solve two stage HFS problems. To evaluated performance of propose method, the results have been compared with two meta-heuristic, genetic algorithm, simulated annealing. The experimental results show that propose method is more effective and efficient than genetic algorithm and simulated annealing to solve two stage HFS scheduling problems.


2012 ◽  
Vol 4 (1) ◽  
pp. 33-47 ◽  
Author(s):  
Minh Luan Nguyen ◽  
Siu Cheung Hui ◽  
Alvis C. M. Fong

Sign in / Sign up

Export Citation Format

Share Document