Filters








363 Hits in 4.4 sec

A first multilevel cooperative algorithm for capacitated multicommodity network design

Teodor Gabriel Crainic, Ye Li, Michel Toulouse
2006 Computers & Operations Research  
We describe the first multilevel cooperative tabu search for the capacitated multicommodity network design problem.  ...  Mots clés : Recherches parallèles, coopération multi-niveaux, recherche avec tabou par des cycles, synthèse de réseaux multi-produits avec coûts fixes et capacités.  ...  Acknowledgments Funding for this project has been provided by the Natural Sciences and Engineering Council of Canada, through its Discovery Grant programs, and by the Fonds F.C.A.R. of the Province of  ... 
doi:10.1016/j.cor.2005.07.015 fatcat:mdksfe3cqrgqxm7gfic4zekx44

A Hybrid Simulated Annealing and Simplex Method for Fixed-Cost Capacitated Multicommodity Network Design

Masoud Yaghini, Mohammad Karimi, Mohadeseh Rahbar, Rahim Akhavan
2011 International Journal of Applied Metaheuristic Computing  
The fixed-cost Capacitated Multicommodity Network Design (CMND) problem is a well known NP-hard problem.  ...  In this matheuristic approach, for a given design vector, CMND becomes a Capacitated Multicommodity minimum Cost Flow (CMCF) problem.  ...  (2000) , a simplex-based Tabu Search (TS) for solving path-based capacitated network design was presented.  ... 
doi:10.4018/jamc.2011100102 fatcat:ubkhr2csh5byhmufokxoudm43e

Parallel Meta-heuristics [chapter]

Teodor Gabriel Crainic, Michel Toulouse
2010 International Series in Operations Research and Management Science  
CIRRELT-2009-22 40 Parallel Meta-Heuristics [32] Crainic, T.G. and Gendreau, M. Cooperative Parallel Tabu Search for Capacitated Net- work Design.  ...  A First Multilevel Cooperative Algorithm for the Capacitated Multicommodity Network Design. Computers & Operations Research, 33(9):2602–2622, 2006.  ... 
doi:10.1007/978-1-4419-1665-5_17 fatcat:5hhwwngx6jb6pnaugdgvenjraq

A COMBINED CAPACITY SCALING AND LOCAL BRANCHING APPROACH FOR CAPACITATED MULTI-COMMODITY NETWORK DESIGN PROBLEM
English

Naoto Katayama
2015 Far East Journal of Applied Mathematics  
Crainic and Gendron (2002) proposed a cooperative parallel tabu search heuristic, while Crainic et al. (2006) developed a multilevel cooperative search heuristic.  ...  The capacitated multi-commodity network design problem (CMND) represents a generic network design model for applications used in designing construction and improvements to telecommunication, logistics,  ...  Acknowledgments This work was supported by Grant-in-Aid for Scientific Research of Japan, No.21510155.  ... 
doi:10.17654/fjamjul2015_001_030 fatcat:vwujqynjvzhohgrfncz6xgfdna

A Simplex-Based Tabu Search Method for Capacitated Network Design

Teodor Gabriel Crainic, Michel Gendreau, Judith M. Farvolden
2000 INFORMS journal on computing  
The fixed charge capacitated multicommodity network design problem is a well-known problem, of both practical and theoretical significance.  ...  Feasible solutions are obtained by using a tabu search framework that explores the space of the continuous flow variables by combining pivot moves with column generation, while evaluating the actual mixed  ...  and by the Québec-Ontario Cooperation Program.  ... 
doi:10.1287/ijoc.12.3.223.12638 fatcat:473c44wm7fgdhnq2omdwi2ufky

Parallel Metaheuristic Search [chapter]

Teodor Gabriel Crainic
2018 Handbook of Heuristics  
We present a general picture of the parallel meta-heuristic search for optimization.  ...  We recall the main concepts and strategies in designing parallel metaheuristics, pointing to a number of contributions that instantiated them for neighborhoodand population-based meta-heuristics, and identify  ...  meta-heuristics for combinatorial optimization.  ... 
doi:10.1007/978-3-319-07124-4_40 fatcat:2hpzacmchre2hbdksb5sgav6ii

Strategies for the Parallel Implementation of Metaheuristics [chapter]

Van-Dat Cung, Simone L. Martins, Celso C. Ribeiro, Catherine Roucairol
2002 Operations Research/Computer Science Interfaces Series  
Parallel implementations of tabu search, GRASP, genetic algorithms, simulated annealing, and ant colonies are reviewed and discussed to illustrate the main strategies used in the parallelization of different  ...  Parallel implementations of metaheuristics appear quite naturally as an effective alternative to speed up the search for approximate solutions of combinatorial optimization problems.  ...  Crainic and Gendreau [59] have also implemented a cooperative multiple-walk parallel tabu search for the fixed charge, capacitated, multicommodity network design problem, which is shown to outperform  ... 
doi:10.1007/978-1-4615-1507-4_13 fatcat:syvr7spvynhntdp6ya44ntlimq

An annotated bibliography of GRASP - Part I: Algorithms

Paola Festa, Mauricio G. C. Resende
2009 International Transactions in Operational Research  
A greedy randomized adaptive search procedure (GRASP) is a metaheuristic for combinatorial optimization.  ...  It is a multi-start or iterative process, in which each GRASP iteration consists of two phases, a construction phase, in which a feasible solution is produced, and a local search phase, in which a local  ...  They compare their tabu search construction with a memoryless design and with previous algorithms recently developed for this problem.  ... 
doi:10.1111/j.1475-3995.2009.00663.x fatcat:gqolwm2hafgzlfdckt7kblixgu

Parallel Local Search [chapter]

Philippe Codognet, Danny Munera, Daniel Diaz, Salvador Abreu
2018 Handbook of Parallel Constraint Reasoning  
This situation is further compounded by the good adequacy exhibited by this class of search procedures for large-scale parallel operation.  ...  In this chapter we explore and discuss ways which lead to parallelization in local search.  ...  model for a problem in radio network design.  ... 
doi:10.1007/978-3-319-63516-3_10 fatcat:ah7ngeucercjvbbo6qr757boq4

Hybridizing exact methods and metaheuristics: A taxonomy

L. Jourdan, M. Basseur, E.-G. Talbi
2009 European Journal of Operational Research  
First, we propose some natural approaches for the different schemes of cooperation encountered, and we analyse, for each model, some examples taken from the literature.  ...  The interest about hybrid optimization methods has grown for the last few years. Indeed, more and more papers about cooperation between heuristics and exact techniques are published.  ...  : Simulated Annealing GA: Genetic Algorithm MA: Memetic Algorithm ES: Evolution Strategy GP: Genetic Programming NN: Neural Network DW: Descent Walk LS: Local Search ILS: Iterated Local Search TS: Tabu  ... 
doi:10.1016/j.ejor.2007.07.035 fatcat:uq3aphcfqbgujf5idpcdqxd66i

An annotated bibliography of GRASP-Part II: Applications

Paola Festa, Mauricio G. C. Resende
2009 International Transactions in Operational Research  
A greedy randomized adaptive search procedure (GRASP) is a metaheuristic for combinatorial optimization.  ...  It is a multi-start or iterative process, in which each GRASP iteration consists of two phases, a construction phase, in which a feasible solution is produced, and a local search phase, in which a local  ...  Avoiding local optima in the p-hub location problem using tabu search and GRASP. Poppe, M. Pickavet, P. Arijs, and P. Demeester. Design techniques for SDH meshrestorable networks.  ... 
doi:10.1111/j.1475-3995.2009.00664.x fatcat:wdqwc6xvcnfq3fi5ujy6jy5wtm

A cooperative parallel metaheuristic for the capacitated vehicle routing problem

Jianyong Jin, Teodor Gabriel Crainic, Arne Løkketangen
2014 Computers & Operations Research  
This paper introduces a cooperative parallel metaheuristic for solving the capacitated vehicle routing problem.  ...  The proposed metaheuristic consists of multiple parallel tabu search threads that cooperate by asynchronously exchanging best found solutions through a common solution pool.  ...  Acknowledgements The authors thank Compute Canada and the Norwegian Metasenter for Computational Science (NOTUR) for providing computing resources to conduct the experiments of this research.  ... 
doi:10.1016/j.cor.2013.10.004 fatcat:nixjh3cchrab7a3pxtcat2srnm

Parallel Metaheuristics Applications [chapter]

Teodor Gabriel Crainic, Nourredine Hail
2005 Parallel Metaheuristics  
and Tabu Search, while some others address the field in more comprehensive terms:  ...  1 2 PARALLEL META-HEURISTICS APPLICATIONS problems, set covering and partitioning, satisfiability and max-sat problems, quadratic assignment, location and network design, traveling salesman and vehicle  ...  Acknowledgments Funding for this project has been provided by the Natural Sciences and Engineering Council of Canada, and by the Fonds FQRNT of the Province of Québec.  ... 
doi:10.1002/0471739383.ch19 fatcat:junbparoinckhfulturvyqvuxu

Parallel Hybrid Metaheuristics [chapter]

Carlos Cotta, El-Ghazali Talbi, Enrique Alba
2005 Parallel Metaheuristics  
Examples of the former class are descent local search (LS) [109], greedy heuristics (GH) [81], simulated annealing (SA) [72], or tabu search (TS) [56].  ...  Focusing on the latter techniques, metaheuristics approaches can be broadly categorized into two major classes: single-solution search algorithms (also known as trajectory-based or local-search based algorithms  ...  A heterogeneous HTH algorithm based on genetic algorithms and tabu search has been proposed in [34] to solve a network design problem.  ... 
doi:10.1002/0471739383.ch15 fatcat:frvcocssmbalbgx6lwnjbj3npu

A capacity scaling heuristic for the multicommodity capacitated network design problem

N. Katayama, M. Chen, M. Kubo
2009 Journal of Computational and Applied Mathematics  
The capacity scaling heuristic is an approximate iterative solution method for capacitated network problems based on changing arc capacities, which depend on flow volumes on the arcs.  ...  The capacity scaling heuristic offers one of the best current results among approximate solution algorithms designed to address the multicommodity capacitated network design problem.  ...  Acknowledgments The authors wish to thank Professor Teodor Gabriel Crainic, Université du Québec à Montréal, for sending data of multicommodity capacitated network design problems.  ... 
doi:10.1016/j.cam.2008.10.055 fatcat:wjxcgztmjbdyzdo272wbk2afnq
« Previous Showing results 1 — 15 out of 363 results