Tabu Search for a Network Loading Problem with Multiple Facilities

Authors:
David Berger;Bernard Gendron;Jean-Yves Potvin;S. Raghavan;Patrick Soriano
Affiliations:
Centre Universitaire des Sciences et Techniques, Université/ Blaise Pascal, B.P. 206, 63174 Aubiè/re Cedex, France;Centre de recherche sur les transports, Université/ de Montré/al, C.P. 6128, succursale Centre-ville, Montré/al, Qué/bec, Canada H3C 3J7&semi/ Dé/partement d'informatique et d ...;Centre de recherche sur les transports, Université/ de Montré/al, C.P. 6128, succursale Centre-ville, Montré/al, Qué/bec, Canada H3C 3J7&semi/ Dé/partement d'informatique et d ...;Robert H. Smith School of Business, University of Maryland, College Park, MD 20742, USA;Centre de recherche sur les transports, Université/ de Montré/al, C.P. 6128, succursale Centre-ville, Montré/al, Qué/bec, Canada H3C 3J7&semi/ Ecole des Hautes Etudes Commerciale ...
Venue:
Journal of Heuristics
Year:
2000

Citing 6
Cited 10

The GENITOR algorithm and selection pressure: why rank-based allocation of reproductive trials is best

Proceedings of the third international conference on Genetic algorithms
Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
The convex hull of two core capacitated network design problems

Mathematical Programming: Series A and B
Tabu Search

Tabu Search
Network Design Using Cut Inequalities

SIAM Journal on Optimization
Adaptive Selection Methods for Genetic Algorithms

Proceedings of the 1st International Conference on Genetic Algorithms

Ensemble planning for digital audio broadcasting

Handbook of wireless networks and mobile computing
A Novel Approach for Composing Test Sheets from Large Item Banks to Meet Multiple Assessment Criteria

ICALT '05 Proceedings of the Fifth IEEE International Conference on Advanced Learning Technologies
A tabu search algorithm for the routing and capacity assignment problem in computer networks

Computers and Operations Research
The Multilevel Capacitated Minimum Spanning Tree Problem

INFORMS Journal on Computing
An innovative parallel test sheet composition approach to meet multiple assessment criteria for national tests

Computers & Education
0-1 reformulations of the multicommodity capacitated network design problem

Discrete Applied Mathematics
GRASP with hybrid heuristic-subproblem optimization for the multi-level capacitated minimum spanning tree problem

Journal of Heuristics
The Robust Network Loading Problem Under Hose Demand Uncertainty: Formulation, Polyhedral Analysis, and Computations

INFORMS Journal on Computing
Adaptive memory in multistart heuristics for multicommodity network design

Journal of Heuristics
A hybrid data mining GRASP with path-relinking

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper examines a network design problem that arises inthe telecommunications industry. In this problem, communicationbetween a gateway vertex and a number of demand vertices is achievedthrough a network of fiber optic cables. Since each cable has anassociated capacity (bandwidth), enough capacity must be installed onthe links of the network to satisfy the demand, using possiblydifferent types of cables. Starting with a network with no capacityor some capacity already installed, a tabu search heuristic isdesigned to find a solution that minimizes the cost of installing anyadditional capacity on the network. This tabu search applies ak-shortest path algorithm to find alternative paths from thegateway to the demand vertices. Numerical results are presented ondifferent types of networks with up to 200 vertices and 100 demandvertices.