Results (2)
Search Parameters:
Keyword: Local searchA Comparative Study of a Hybrid Ant Colony Algorithm MMACS for the Strongly Correlated Knapsack Problem
Metaheuristic hybridization has recently been widely studied and discussed in many research works as it allows benefiting from the strengths of metaheuristics by combining adequately the different algorithms. MMACS is a new hybrid ant colony optimization algorithm based on the foraging behavior of ants. This algorithm presents two hybridization levels. The first hybridization consists in…
Read MoreSolving the Capacitated Network Design Problem in Two Steps
In this paper, we propose a two steps-based algorithm to solve the modular link version of the Capacitated Network Design Problem (CNDP) which consists to determine the optimal network that guarantees the routing of a set of commodities. In our proposition, CNDP is divided into two sub-problems: Network Design problem (NDP) and Network Loading Problem…
Read More
