Sciweavers

1332 search results - page 71 / 267
» Combinatorial Algorithms
Sort
View
CEC
2007
IEEE
14 years 3 months ago
Modified genetic algorithm for job-shop scheduling: A gap utilization technique
—The Job-Shop Scheduling Problem (JSSP) is one of the most critical combinatorial optimization problems. The objective of JSSP in this research is to minimize the makespan. In th...
S. M. Kamrul Hasan, Ruhul A. Sarker, David Cornfor...
CEC
2007
IEEE
14 years 3 months ago
Memetic algorithms for inexact graph matching
—The noise-robust matching of two graphs is a hard combinatorial problem with practical importance in several domains. In practical applications, a unique solution for a given in...
Thomas Bärecke, Marcin Detyniecki
ENGL
2008
118views more  ENGL 2008»
13 years 9 months ago
Hybrid Architecture of Genetic Algorithm and Simulated Annealing
This paper discusses novel dedicated hardware architecture for hybrid optimization based on Genetic algorithm (GA) and Simulated Annealing (SA). The proposed architecture achieves ...
Masaya Yoshikawa, Hironori Yamauchi, Hidekazu Tera...
TSMC
2011
324views more  TSMC 2011»
13 years 4 months ago
Genetic Algorithms With Guided and Local Search Strategies for University Course Timetabling
—The university course timetabling problem (UCTP) is a combinatorial optimization problem, in which a set of events has to be scheduled into time slots and located into suitable ...
Shengxiang Yang, Sadaf Naseem Jat
FGCS
2000
139views more  FGCS 2000»
13 years 9 months ago
Ant algorithms
This paper overviews recent work on ant algorithms, that is, algorithms for discrete optimization which took inspiration from the observation of ant colonies foraging behavior, an...
Marco Dorigo, Gianni Di Caro, Thomas Stützle