11,338 research outputs found
Restart strategies for GRASP with path-relinking heuristics
Abstract. GRASP with path-relinking is a hybrid metaheuristic, or stochastic local search (Monte Carlo) method, for combinatorial optimization. A restart strategy in GRASP with path-relinking heuristics is a set of iterations {i1, i2, . . .} on which the heuristic is restarted from scratch using a new seed for the random number generator. Restart strategies have been shown to speed up stochastic local search algorithms. In this paper, we propose a new restart strategy for GRASP with path-relinking heuristics. We illustrate the speedup obtained with our restart strategy on GRASP with path-relinking heuristics for the maximum cut problem, the maximum weighted satisfiability problem, and the private virtual circuit routing problem
A Solution Merging Heuristic for the Steiner Problem in Graphs Using Tree Decompositions
Fixed parameter tractable algorithms for bounded treewidth are known to exist
for a wide class of graph optimization problems. While most research in this
area has been focused on exact algorithms, it is hard to find decompositions of
treewidth sufficiently small to make these al- gorithms fast enough for
practical use. Consequently, tree decomposition based algorithms have limited
applicability to large scale optimization. However, by first reducing the input
graph so that a small width tree decomposition can be found, we can harness the
power of tree decomposi- tion based techniques in a heuristic algorithm, usable
on graphs of much larger treewidth than would be tractable to solve exactly. We
propose a solution merging heuristic to the Steiner Tree Problem that applies
this idea. Standard local search heuristics provide a natural way to generate
subgraphs with lower treewidth than the original instance, and subse- quently
we extract an improved solution by solving the instance induced by this
subgraph. As such the fixed parameter tractable algorithm be- comes an
efficient tool for our solution merging heuristic. For a large class of sparse
benchmark instances the algorithm is able to find small width tree
decompositions on the union of generated solutions. Subsequently it can often
improve on the generated solutions fast
Local-Search Based Heuristics for Advertisement Scheduling
In the MAXSPACE problem, given a set of ads A, one wants to place a subset A'
of A into K slots B_1, ..., B_K of size L. Each ad A_i in A has size s_i and
frequency w_i. A schedule is feasible if the total size of ads in any slot is
at most L, and each ad A_i in A' appears in exactly w_i slots. The goal is to
find a feasible schedule that maximizes the space occupied in all slots. We
introduce MAXSPACE-RDWV, a MAXSPACE generalization with release dates,
deadlines, variable frequency, and generalized profit. In MAXSPACE-RDWV each ad
A_i has a release date r_i >= 1, a deadline d_i >= r_i, a profit v_i that may
not be related with s_i and lower and upper bounds w^min_i and w^max_i for
frequency. In this problem, an ad may only appear in a slot B_j with r_i <= j
<= d_i, and the goal is to find a feasible schedule that maximizes the sum of
values of scheduled ads. This paper presents some algorithms based on
meta-heuristics GRASP, VNS, Local Search, and Tabu Search for MAXSPACE and
MAXSPACE-RDWV. We compare our proposed algorithms with Hybrid-GA proposed by
Kumar et al. (2006). We also create a version of Hybrid-GA for MAXSPACE-RDWV
and compare it with our meta-heuristics. Some meta-heuristics, such as VNS and
GRASP+VNS, have better results than Hybrid-GA for both problems. In our
heuristics, we apply a technique that alternates between maximizing and
minimizing the fullness of slots to obtain better solutions. We also applied a
data structure called BIT to the neighborhood computation in MAXSPACE-RDWV and
showed that this enabled ours algorithms to run more iterations
Comparative Performance of Tabu Search and Simulated Annealing Heuristics for the Quadratic Assignment Problem
For almost two decades the question of whether tabu search (TS) or simulated
annealing (SA) performs better for the quadratic assignment problem has been
unresolved. To answer this question satisfactorily, we compare performance at
various values of targeted solution quality, running each heuristic at its
optimal number of iterations for each target. We find that for a number of
varied problem instances, SA performs better for higher quality targets while
TS performs better for lower quality targets
Recommended from our members
Combinatorial optimization and metaheuristics
Today, combinatorial optimization is one of the youngest and most active areas of discrete mathematics. It is a branch of optimization in applied mathematics and computer science, related to operational research, algorithm theory and computational complexity theory. It sits at the intersection of several fields, including artificial intelligence, mathematics and software engineering. Its increasing interest arises for the fact that a large number of scientific and industrial problems can be formulated as abstract combinatorial optimization problems, through graphs and/or (integer) linear programs. Some of these problems have polynomial-time (“efficient”) algorithms, while most of them are NP-hard, i.e. it is not proved that they can be solved in polynomial-time. Mainly, it means that it is not possible to guarantee that an exact solution to the problem can be found and one has to settle for an approximate solution with known performance guarantees. Indeed, the goal of approximate methods is to find “quickly” (reasonable run-times), with “high” probability, provable “good” solutions (low error from the real optimal solution). In the last 20 years, a new kind of algorithm commonly called metaheuristics have emerged in this class, which basically try to combine heuristics in high level frameworks aimed at efficiently and effectively exploring the search space. This report briefly outlines the components, concepts, advantages and disadvantages of different metaheuristic approaches from a conceptual point of view, in order to analyze their similarities and differences. The two very significant forces of intensification and diversification, that mainly determine the behavior of a metaheuristic, will be pointed out. The report concludes by exploring the importance of hybridization and integration methods
Recommended from our members
Variable neighbourhood search for the minimum labelling Steiner tree problem
We present a study on heuristic solution approaches to the minimum labelling Steiner tree problem, an NP-hard graph problem related to the minimum labelling spanning tree problem. Given an undirected labelled connected graph, the aim is to find a spanning tree covering a given subset of nodes of the graph, whose edges have the smallest number of distinct labels. Such a model may be used to represent many real world problems in telecommunications and multimodal transportation networks. Several metaheuristics are proposed and evaluated. The approaches are compared to the widely adopted Pilot Method and it is shown that the Variable Neighbourhood Search that we propose is the most effective metaheuristic for the problem, obtaining high quality solutions in short computational running time
- …