A parallel simulated annealing algorithm to solve the vehicle routing problem with time windows is presented. The objective is to find the best possible solutions to some wellkno...
We analyze various forms of the Frequency Assignment Problem using the theory of elementary landscapes. We show that three variants of the Frequency Assignment Problem are either ...
L. Darrell Whitley, J. Francisco Chicano, Enrique ...
In this paper, we present an optimal algorithm for solving the simultaneous technology mapping and linear placement problem for tree-structured circuits with the objective of mini...
We present two hybrid Metaheuristics, a hybrid Iterated Local Search and a hybrid Simulated Annealing, for solving real-world extensions of the Vehicle Routing Problem with Time Wi...
Tonci Caric, Juraj Fosin, Ante Galic, Hrvoje Gold,...
When evolutionary algorithms are used for solving numerical constrained optimization problems, how to deal with the relationship between feasible and infeasible individuals can dir...