Similar Search Results

A tabu search approach for proportionate multiprocessor open shop scheduling

Abdelmaguid, Tamer; Shalaby, Mohamed; Awwad, Mohamed - In: Computational Optimization and Applications 58 (2014) 1, pp. 187-203

In the multiprocessor open shop scheduling problem, jobs are to be processed on a set of processing centers—each having one or more parallel identical machines, while jobs do not have a pre-specified obligatory route. A special case is the proportionate multiprocessor open shop scheduling...

Persistent link: https://www.econbiz.de/10010998340

Strategic oscillation for the quadratic multiple knapsack problem

García-Martínez, Carlos; Glover, Fred; Rodriguez, … - In: Computational Optimization and Applications 58 (2014) 1, pp. 161-185

The quadratic multiple knapsack problem (QMKP) consists in assigning a set of objects, which interact through paired profit values, exclusively to different capacity-constrained knapsacks with the aim of maximising total profit. Its many applications include the assignment of workmen to...

Persistent link: https://www.econbiz.de/10010998380

Three new stochastic local search algorithms for continuous optimization problems

Chetty, Sivashan; Adewumi, Aderemi - In: Computational Optimization and Applications 56 (2013) 3, pp. 675-721

This paper introduces three new stochastic local search metaheuristics algorithms namely, the Best Performance … against two well-known local-search metaheuristics namely, Tabu Search (TS) and Simulated Annealing (SA). Results obtained …

Persistent link: https://www.econbiz.de/10010728119

Continuous ant colony system and tabu search algorithms hybridized for global minimization of continuous multi-minima functions

Karimi, Akbar; Nobahari, Hadi; Siarry, Patrick - In: Computational Optimization and Applications 45 (2010) 3, pp. 639-661

Persistent link: https://www.econbiz.de/10008552373

A framework for analyzing sub-optimal performance of local search algorithms

Nikolaev, Alexander; Jacobson, Sheldon; Hall, Shane; … - In: Computational Optimization and Applications 49 (2011) 3, pp. 407-433

Persistent link: https://www.econbiz.de/10009149874

Bounding the optimum for the problem of scheduling the photographs of an Agile Earth Observing Satellite

Habet, Djamal; Vasquez, Michel; Vimont, Yannick - In: Computational Optimization and Applications 47 (2010) 2, pp. 307-333

Persistent link: https://www.econbiz.de/10008674174

The continuous differential ant-stigmergy algorithm for numerical optimization

Korošec, Peter; Šilc, Jurij - In: Computational Optimization and Applications 56 (2013) 2, pp. 481-502

-based metaheuristics. A few of them are based on Swarm-Intelligence Algorithms, which are inspired by the collective behavior of social …

Persistent link: https://www.econbiz.de/10010998299

A benchmark library and a comparison of heuristic methods for the linear ordering problem

Martí, Rafael; Reinelt, Gerhard; Duarte, Abraham - In: Computational Optimization and Applications 51 (2012) 3, pp. 1297-1317

Persistent link: https://www.econbiz.de/10010998366

Tabu search for the linear ordering problem with cumulative costs

Duarte, Abraham; Laguna, Manuel; Martí, Rafael - In: Computational Optimization and Applications 48 (2011) 3, pp. 697-715

Persistent link: https://www.econbiz.de/10008925539