A first multilevel cooperative algorithm for capacitated multicommodity network design

Authors:
Teodor Gabriel Crainic;Ye Li;Michel Toulouse
Affiliations:
Départment management et technologie, École des sciences de la gestion, Université du Québec à Montréal, Que., Canada and Centre de recherche sur les transports, Univ ...;Department of Computer Science, University of Manitoba, Man., Canada;Department of Computer Science, University of Manitoba, Man., Canada
Venue:
Computers and Operations Research - Anniversary focused issue of computers & operations research on tabu search
Year:
2006

Citing 15
Cited 9

Multilevel cooperative search: application to the circuit/hypergraph partitioning problem

ISPD '00 Proceedings of the 2000 international symposium on Physical design
Global optimization properties of parallel cooperative search algorithms: a simulation study

Parallel Computing - High performance computing in operations research
Essays and Surveys in Metaheuristics

Essays and Surveys in Metaheuristics
Bundle-based relaxation methods for multicommodity capacitated fixed charge network design

Discrete Applied Mathematics - Special issue on the combinatorial optimization symposium
Cooperative Parallel Tabu Search for Capacitated Network Design

Journal of Heuristics
Parallel Search for Combinatorial Optimization: Genetic Algorithms, Simulated Annealing, Tabu Search and GRASP

IRREGULAR '95 Proceedings of the Second International Workshop on Parallel Algorithms for Irregularly Structured Problems
Multi-level Cooperative Search: A New Paradigm for Combinatorial Optimization and an Application to Graph Partitioning

Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
Multimodal Express Package Delivery: a Service Network Design Application

Transportation Science
A Simplex-Based Tabu Search Method for Capacitated Network Design

INFORMS Journal on Computing
Composite Variable Formulations for Express Shipment Service Network Design

Transportation Science
A linear-time heuristic for improving network partitions

DAC '82 Proceedings of the 19th Design Automation Conference
Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design

Operations Research
A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem

Operations Research
A Slope Scaling/Lagrangean Perturbation Heuristic with Long-Term Memory for Multicommodity Capacitated Fixed-Charge Network Design

Journal of Heuristics
Multilevel cooperative search for the circuit/hypergraph partitioning problem

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

A multilevel tabu search algorithm for the feature selection problem in biomedical data

Computers & Mathematics with Applications
Explicit and Emergent Cooperation Schemes for Search Algorithms

Learning and Intelligent Optimization
A capacity scaling heuristic for the multicommodity capacitated network design problem

Journal of Computational and Applied Mathematics
A local branching heuristic for the capacitated fixed-charge network design problem

Computers and Operations Research
Survey: matheuristics for rich vehicle routing problems

HM'10 Proceedings of the 7th international conference on Hybrid metaheuristics
A cooperative multilevel tabu search algorithm for the covering design problem

EA'05 Proceedings of the 7th international conference on Artificial Evolution
A Simplex-based simulated annealing algorithm for node-arc capacitated multicommodity network design

Applied Soft Computing
A distributed agent-based approach for simulation-based optimization

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

International Journal of Applied Metaheuristic Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe the first multilevel cooperative tabu search for the capacitated multicommodity network design problem. Main design challenges are associated to the specification of the problem instance addressed at each level in cooperation, as well as to the definition of the cooperation operators. The paper proposes a first approach to address these challenges and tests it on a set of well-known benchmark problems. The proposed method appears competitive, particularly when difficult problems with many commodities are considered. Directions and challenges for future research are identified and discussed.