This paper introduces a novel approach to performance refinement of a heuristic algorithm for combinatorial optimization. The proposed Adaptive Tabu Search (A–TS) algorithm introduces adaptive behavior in the traditional Tabu Search algorithm. The adaptive nature of this algorithm is based on two adaptive coefficients that drive the heuristic. Choosing appropriate values for these parameters ha...

This paper presents the solution quality analysis of a parallel tabu search algorithm for the task scheduling problem on heterogeneous processors under precedence constraints. We evaluate the achieved makespan reduction of diierent parallel applications relatively to the results obtained by the best greedy algorithm in the literature, as a function of parameters such as problem size, system het...

This paper introduces a hybrid algorithm for the dynamic dial-a-ride problem in which service requests arrive in real time. The hybrid algorithm combines an exact constraint programming algorithm and a tabu search heuristic. An important component of the tabu search heuristic consists of three scheduling procedures which are executed sequentially. Experiments show that the constraint programmin...

In this paper, we study the problem of placing limited number of wavelength converting nodes in a multi-fiber network with static traffic demands and propose a tabu search based heuristic algorithm. The objective of the algorithm is to achieve the performance of full wavelength conversion in terms of minimizing the total number of fibers used in the network by placing minimum number of waveleng...

We propose a dedicated tabu search algorithm (TSX_WDP) for the winner determination problem (WDP) in combinatorial auctions. TSX_WDP integrates two complementary neighborhoods designed respectively for intensification and diversification. To escape deep local optima, TSX_WDP employs a backbone-based recombination operator to generate new starting points for tabu search and to displace the searc...

A new algorithm called Enhanced Continuous Tabu Search (ECTS) is proposed for the global optimization of multiminima functions. It results from an adaptation of combinatorial Tabu Search which aims to follow, as close as possible, Glover's basic approach. In order to cover a wide domain of possible solutions, our algorithm ®rst performs the diversi®cation: it locates the most promising areas, b...

This paper introduces a framework for the interactive solving of optimization problems and presents an interactive tabu search algorithm for the pick-up-and-delivery problem with time windows (PDPTW). The framework for the development of interactive algorithms is based on the idea of activating and deactivating constraints in the model of the problem under consideration. We start with an introd...

This paper proposes three algorithms for multiple-choice hardware-software partitioning with the objectives: minimizing execution time and power consumption, while meeting the area constraint. A heuristic algorithm is proposed to rapidly generate an approximate solution. A tabu search algorithm is customized to refine the heuristic solution. Also, a dynamic programming algorithm is proposed to ...

In this communication Simulated Annealing and Genetic Algorithms, are applied to the graph partitioning problem. These techniques mimic processes in statistical mechanics and biology, respectively, and are the most popular meta-heuristics or general-purpose optimization strategies. A hybrid algorithm for circuit partitioning, which uses tabu search to improve the simulated annealing meta-heuris...

This paper presents a method of job allocation and scheduling that determines optimal job allocation and the shortest paths for robots having collision regions. The problem described in this paper is an application of a classical flexible jobshop scheduling problem with shared resources. A genetic algorithm and a TABU search are used for the job allocation and scheduling procedures. Overlapping...