Abstract Roughly speaking, parallel local search techniques can be divided into three categories:... more Abstract Roughly speaking, parallel local search techniques can be divided into three categories: low-level parallelization strategies (eg, master-slave schemes), solutionspace partitioning methods and multi-thread procedures in which several processes explore ...
2009 IEEE International Symposium on Parallel & Distributed Processing, 2009
... In CC Ribeiro and P. Hansen, editors, Essays and Surveys in Metaheuristics, Kluwer Academic P... more ... In CC Ribeiro and P. Hansen, editors, Essays and Surveys in Metaheuristics, Kluwer Academic Publishers, Norwell, MA, pages 263–308. [13] PM Francis, KR Smilowitz and M. Tzur (2008). ... [19] A. Le Bouthillier and TG Crainic (2005). ...
Proceedings of the 11th annual conference companion on Genetic and evolutionary computation conference - GECCO '09, 2009
... Of course, enhancement of offspring through local search or more complex meta-heuristics, lea... more ... Of course, enhancement of offspring through local search or more complex meta-heuristics, leading to Lamar-ckian evolution, has proved its worth and is included from the beginning as appropriate for each specific application. ... [10] BL Golden, AA Assad and EW Wasil (2002). ...
We propose an algorithmic framework that successfully addresses three vehicle routing problems: t... more We propose an algorithmic framework that successfully addresses three vehicle routing problems: the multidepot VRP, the periodic VRP, and the multidepot periodic VRP with capacitated vehicles and constrained route duration. The metaheuristic combines the exploration breadth of population-based evolutionary search, the aggressive-improvement capabilities of neighborhood-based metaheuristics, and advanced population-diversity management schemes. Extensive computational experiments show that the method performs impressively in terms of computational efficiency and solution quality, identifying either the best known solutions, including the optimal ones, or new best solutions for all currently available benchmark instances for the three problem classes. The proposed method also proves extremely competitive for the capacitated VRP.
In this paper we present a classification of parallel tabu search metaheuristics based, on the on... more In this paper we present a classification of parallel tabu search metaheuristics based, on the one hand, on the control and communication strategies used in the design of the parallel tabu search procedures, and on the other hand, on how the search space is partitioned. These criteria are then used to review the parallel tabu search implementations described in the literature. The taxonomy is further illustrated by the results of several parallelization implementations of a tabu search procedure for multicommodity location-allocation problems with balancing requirements.
This paper shows how local branching can be used to accelerate the classical Benders decompositio... more This paper shows how local branching can be used to accelerate the classical Benders decomposition algorithm. By applying local branching throughout the solution process, one can simultaneously improve both the lower and upper bounds. We also show how Benders feasibility cuts can be strengthened or replaced with local branching constraints. To assess the performance of the different algorithmic ideas presented in this hybrid solution approach, extensive computational experiments were performed on two families of network design problems. Numerical results clearly illustrate their benefits.
Abstract Roughly speaking, parallel local search techniques can be divided into three categories:... more Abstract Roughly speaking, parallel local search techniques can be divided into three categories: low-level parallelization strategies (eg, master-slave schemes), solutionspace partitioning methods and multi-thread procedures in which several processes explore ...
2009 IEEE International Symposium on Parallel & Distributed Processing, 2009
... In CC Ribeiro and P. Hansen, editors, Essays and Surveys in Metaheuristics, Kluwer Academic P... more ... In CC Ribeiro and P. Hansen, editors, Essays and Surveys in Metaheuristics, Kluwer Academic Publishers, Norwell, MA, pages 263–308. [13] PM Francis, KR Smilowitz and M. Tzur (2008). ... [19] A. Le Bouthillier and TG Crainic (2005). ...
Proceedings of the 11th annual conference companion on Genetic and evolutionary computation conference - GECCO '09, 2009
... Of course, enhancement of offspring through local search or more complex meta-heuristics, lea... more ... Of course, enhancement of offspring through local search or more complex meta-heuristics, leading to Lamar-ckian evolution, has proved its worth and is included from the beginning as appropriate for each specific application. ... [10] BL Golden, AA Assad and EW Wasil (2002). ...
We propose an algorithmic framework that successfully addresses three vehicle routing problems: t... more We propose an algorithmic framework that successfully addresses three vehicle routing problems: the multidepot VRP, the periodic VRP, and the multidepot periodic VRP with capacitated vehicles and constrained route duration. The metaheuristic combines the exploration breadth of population-based evolutionary search, the aggressive-improvement capabilities of neighborhood-based metaheuristics, and advanced population-diversity management schemes. Extensive computational experiments show that the method performs impressively in terms of computational efficiency and solution quality, identifying either the best known solutions, including the optimal ones, or new best solutions for all currently available benchmark instances for the three problem classes. The proposed method also proves extremely competitive for the capacitated VRP.
In this paper we present a classification of parallel tabu search metaheuristics based, on the on... more In this paper we present a classification of parallel tabu search metaheuristics based, on the one hand, on the control and communication strategies used in the design of the parallel tabu search procedures, and on the other hand, on how the search space is partitioned. These criteria are then used to review the parallel tabu search implementations described in the literature. The taxonomy is further illustrated by the results of several parallelization implementations of a tabu search procedure for multicommodity location-allocation problems with balancing requirements.
This paper shows how local branching can be used to accelerate the classical Benders decompositio... more This paper shows how local branching can be used to accelerate the classical Benders decomposition algorithm. By applying local branching throughout the solution process, one can simultaneously improve both the lower and upper bounds. We also show how Benders feasibility cuts can be strengthened or replaced with local branching constraints. To assess the performance of the different algorithmic ideas presented in this hybrid solution approach, extensive computational experiments were performed on two families of network design problems. Numerical results clearly illustrate their benefits.
Uploads
Papers by Michel Gendreau