A new hybrid GA solution to combinatorial optimization problems— an application to the multiprocessor scheduling problem

1998 ◽  
Vol 2 (2) ◽  
pp. 74-79 ◽  
Author(s):  
M. Nakamura ◽  
B. M. Ombuki ◽  
K. Shimabukuro ◽  
K. Onaga
Keyword(s):  
Combinatorial Optimization ◽  
Optimization Problems ◽  
Multiprocessor Scheduling ◽  
Scheduling Problem ◽  
Combinatorial Optimization Problems

SOLVING A SINGLE MACHINE SCHEDULING PROBLEM BY A DISCRETE VERSION OF ELECTROMAGNETISM-LIKE METHOD

2009 ◽  
Vol 18 (08) ◽  
pp. 1597-1608 ◽  
Author(s):  
NIKBAKHSH JAVADIAN ◽  
MOHSEN GOLALIKHANI ◽  
REZA TAVAKKOLI-MOGHADDAM
Keyword(s):  
Combinatorial Optimization ◽  
Single Machine ◽  
Optimization Problems ◽  
Continuous Optimization ◽  
Machine Scheduling ◽  
Population Based ◽  
Single Machine Scheduling ◽  
Discrete Version ◽  
Scheduling Problem ◽  
Combinatorial Optimization Problems

The electromagnetism-like method (EM) is a population based meta-heuristic algorithm utilizing an attraction-repulsion mechanism to move sample points (i.e., our solutions) towards the optimality. In general, the EM has been initially used for solving continuous optimization problems and could not be applied on combinatorial optimization ones. This paper proposes a discrete binary version of the EM for solving combinatorial optimization problems. To show the efficiency of our proposed EM, we solve a single machine scheduling problem and compare our computational results with the solutions reported in the literature. Finally, we conclude that our proposed method is capable of solving such well-known problems more efficiently than the previous studies.

Sign in / Sign up

Export Citation Format

Share Document