A first multilevel cooperative algorithm for capacitated multicommodity network design
Computers and Operations Research - Anniversary focused issue of computers & operations research on tabu search
Multi-layer MPLS network design: The impact of statistical multiplexing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Tabu search-based metaheuristic algorithm for software system reliability problems
Computers and Operations Research
An Adaptive Memory-Based Approach Based on Partial Enumeration
Learning and Intelligent Optimization
0-1 reformulations of the multicommodity capacitated network design problem
Discrete Applied Mathematics
Benders, metric and cutset inequalities for multicommodity capacitated network design
Computational Optimization and Applications
Algorithms for the non-bifurcated network design problem
Journal of Heuristics
Large-Scale, Less-than-Truckload Service Network Design
Operations Research
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
Models for Evaluating and Planning City Logistics Systems
Transportation Science
Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem
INFORMS Journal on Computing
A metaheuristic for stochastic service network design
Journal of Heuristics
A MILP-based heuristic for energy-aware traffic engineering with shortest path routing
INOC'11 Proceedings of the 5th international conference on Network optimization
Relax-and-cut for capacitated network design
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Tabu assisted guided local search approaches for freight service network design
Information Sciences: an International Journal
Mixed Integer Non-Linear Programming models for Green Network Design
Computers and Operations Research
International Journal of Applied Metaheuristic Computing
Energy-aware IP traffic engineering with shortest path routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
A cutting plane algorithm for the Capacitated Connected Facility Location Problem
Computational Optimization and Applications
Improved Load Plan Design Through Integer Programming Based Local Search
Transportation Science
| Hi-index | 0.00 |
We propose new cycle-based neighbourhood structures for metaheuristics aimed at the fixed-charge capacitated multicommodity network design formulation. The neighbourhood defines moves that explicitly take into account the impact on the total design cost of potential modifications to the flow distribution of several commodities simultaneously. Moves are identified through a shortest-pathlike network optimization procedure and proceed by redirecting flow around cycles and closing and opening design arcs accordingly. These neighbourhoods are evaluated and tested within a simple tabu search algorithm. Experimental results show that the proposed approach is quite powerful and outperforms existing methods reported in the literature.