Abstract. In this paper we present a study of several Ant Colony Optimization (ACO) algorithms for the Set Covering Problem. In our computational study we emphasize the influence ...
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,...
— The problem of parts nesting in plane areas is found in several industries, with restrictions and different objectives. Among these industries having this process they are pack...
Roberto Selow, Flavio Neves Junior, Heitor S. Lope...
Troubleshooting problems in real manufacturing environments impose constraints on admissible solutions that make the computational solutions offered by "troubleshooting from ...
D. Volovik, Imran A. Zualkernan, Paul E. Johnson, ...
The Linear Ordering Problem with Cumulative Costs is an NP-hard combinatorial optimization problem arising from an application in UMTS mobile-phone communication systems. This pap...