Adaptive memory in multistart heuristics for multicommodity network design

Authors:
Daniel Aloise;Celso C. Ribeiro
Affiliations:
Department of Production Engineering, Universidade Federal do Rio Grande do Norte, Natal, Brazil 59072-970;Department of Computer Science, Universidade Federal Fluminense, Niterói, Brazil 24210-240
Venue:
Journal of Heuristics
Year:
2011

Citing 16
Cited 1

Ejection chains, reference structures and alternating path methods for traveling salesman problems

Discrete Applied Mathematics - Special volume: first international colloquium on graphs and optimization (GOI), 1992
An efficient implementation of a scaling minimum-cost flow algorithm

Journal of Algorithms
Intensification and diversification with elite tabu search solutions for the linear ordering problem

Computers and Operations Research
A More Portable Fortran Random Number Generator

ACM Transactions on Mathematical Software (TOMS)
Tabu Search

Tabu Search
Tabu Search for a Network Loading Problem with Multiple Facilities

Journal of Heuristics
Probability Distribution of Solution Time in GRASP: An Experimental Investigation

Journal of Heuristics
D.C. programming approach for multicommodity network optimization problems with step increasing cost functions

Journal of Global Optimization
Algorithms and Extended Formulations for One and Two Facility Network Design

Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
A Cutting Plane Algorithm for Multicommodity Survivable Network Design Problems

INFORMS Journal on Computing
Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory

INFORMS Journal on Computing
A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs

INFORMS Journal on Computing
A survey of very large-scale neighborhood search techniques

Discrete Applied Mathematics
A Comparison of Heuristics for the Discrete Cost Multicommodity Network Optimization Problem

Journal of Heuristics
Capacity expansion of fiber optic networks with WDM systems: problem formulation and comparative analysis

Computers and Operations Research
Exact solution of multicommodity network optimization problems with general step cost functions

Operations Research Letters

Adaptive and multi-mining versions of the DM-GRASP hybrid metaheuristic

Journal of Heuristics

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper focuses on the use of different memory strategies to improve multistart methods. A network design problem in which the costs are given by discrete stepwise increasing cost functions of the capacities installed in the edges is used to illustrate the contributions of adaptive memory and vocabulary building strategies. Heuristics based on shortest path and maximum flow algorithms are combined with adaptive memory in order to obtain an approximate solution to the problem in the framework of a multistart algorithm. Furthermore, a vocabulary building intensification mechanism supported by the resolution of a linear program is also explored. Numerical experiments have shown that the proposed algorithm obtained the best known solutions for some instances in the literature. These results show the contribution of each memory component and the effectiveness of their combination.