Learn More
This article explores the meta-heuristic approach called tabu search, which is dramatically changing our ability to solve a host of problems in applied science, business and engineering. Tabu search has important links to evolutionary and " genetic " methods, often overlooked, through its intimate connection with scatter search and path relinking —(More)
— Researchers and practitioners frequently spend more time fine-tuning algorithms than designing and implementing them. This is particularly true when developing heuristics and metaheuristics, where the " right " choice of values for search parameters has a considerable effect on the performance of the procedure. When testing metaheuristics, performance(More)
In this paper, we develop a new heuristic procedure for the linear ordering problem (LOP). This NP-hard problem has a significant number of applications in practice. The LOP, for example, is equivalent to the so-called triangulation problem for input-output tables in economics. In this paper we concentrate on matrices that arise in the context of this(More)
— In this paper, we develop a greedy randomized adaptive search procedure (GRASP) for the problem of minimizing straight-line crossings in a 2-layer graph. The procedure is fast and is particularly appealing when dealing with low-density graphs. When a modest increase in computational time is allowed, the procedure may be coupled with a path relinking(More)
— Scatter search is a population-based method that has recently been shown to yield promising outcomes for solving combinatorial and nonlinear optimization problems. Based on formulations originally proposed in the 1960s for combining decision rules and problem constraints, such as the surrogate constraint method, scatter search uses strategies for(More)
Scope and Purpo~-The development of hybrid procedures for optimization focuses on enhancing the strengths and compensating for the weaknesses of two or more complementary approaches. The goal is to intelligently combine the key elements of competing methodologies to create a superior solution procedure. Our paper explores the marriage between tabu search(More)
— The bandwidth of a matrix { } ij a A = is defined as the maximum absolute difference between i and j for which 0 ≠ ij a. The problem of reducing the bandwidth of a matrix consists of finding a permutation of the rows and columns that keeps the nonzero elements in a band that is as close as possible to the main diagonal of the matrix. This NP-complete(More)
The Max-Cut problem consists of finding a partition of the nodes of a weighted graph into two subsets such that the sum of the weights between both sets is maximized. This is an NP-hard problem that can also be formulated as an integer quadratic program. Several solution methods have been developed since the 1970s and applied to a variety of fields,(More)