An Adaptive Memory-Based Approach Based on Partial Enumeration

Authors:
Enrico Bartolini;Vittorio Maniezzo;Aristide Mingozzi
Affiliations:
Department of Computer Science, University of Bologna, Italy;Department of Computer Science, University of Bologna, Italy;Department of Mathematics, University of Bologna, Italy
Venue:
Learning and Intelligent Optimization
Year:
2008

Citing 7
Cited 0

Tabu Search

Tabu Search
Network Design Using Cut Inequalities

SIAM Journal on Optimization
An Ant-Based Framework for Very Strongly Constrained Problems

ANTS '02 Proceedings of the Third International Workshop on Ant Algorithms
A Template for Scatter Search and Path Relinking

AE '97 Selected Papers from the Third European Conference on Artificial Evolution
Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem

INFORMS Journal on Computing
Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design

Operations Research
A simple filter-and-fan approach to the facility location problem

Computers and Operations Research - Anniversary focused issue of computers & operations research on tabu search

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose an iterative memory-based algorithm for solving a class of combinatorial optimization problems. The algorithm generates a sequence of gradually improving solutions by exploiting at each iteration the knowledge gained in previous iterations. At each iteration, the algorithm builds an enumerative tree and stores at each tree level a set of promising partial solutions that will be used to drive the tree exploration in the following iteration. We tested the effectiveness of the proposed method on an hard combinatorial optimization problem arising in the design of telecommunication networks, the Non Bifurcated Network Design Problem, and we report computational results on a set of test problems simulating real life instances.