The convex hull of two core capacitated network design problems
Mathematical Programming: Series A and B
Minimum cost capacity installation for multicommodity network flows
Mathematical Programming: Series A and B - Special issue on computational integer programming
Tabu Search
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Network Design Using Cut Inequalities
SIAM Journal on Optimization
A Simplex-Based Tabu Search Method for Capacitated Network Design
INFORMS Journal on Computing
Design of Capacitated Multicommodity Networks with Multiple Facilities
Operations Research
Performance of Various Computers Using Standard Linear Equations Software
Performance of Various Computers Using Standard Linear Equations Software
Bidirected and unidirected capacity installation in telecommunication networks
Discrete Applied Mathematics - International symposium on combinatorial optimisation
Operations Research Letters
Matheuristics: Optimization, Simulation and Control
HM '09 Proceedings of the 6th International Workshop on Hybrid Metaheuristics
Hi-index | 0.00 |
In this paper we consider the non-bifurcated network design problem where a given set of cities must be connected by installing on a given set of links integer multiples of some base capacity so that a set of commodity demands can be routed. Each commodity flow is constrained to run through a single path along the network. The objective is to minimize the sum of capacity installation and routing costs. We present an exact algorithm and four new heuristics. The first heuristic generates an initial feasible solution, then it improves it until a necessary condition for optimality is satisfied. Two heuristics are partial enumeration methods and the last one iteratively applies a tabu search method to different initial feasible solutions. Computational results over a set of test problems from the literature show the effectiveness of the proposed algorithms.