This paper proposes a linear integer programming formulation and several heuristics based on GRASP and path relinking for the antibandwidth problem. In the antibandwidth problem, one is given an undirected graph with n nodes and must label the nodes in a way that each node receives a unique label from the set {1, 2, . . . , n}, such that, among all adjacent node pairs, the minimum difference be...

We present a new implementation of a widely used swap-based local search procedure for the p-median problem, proposed in 1968 by Teitz and Bart. Our method produces the same output as the best alternatives described in the literature and, even though its worst-case complexity is similar, it can be significantly faster in practice: speedups of up to three orders of magnitude were observed. We al...

Practical elements of Scatter Search and Path Relinking are illustrated by seven recent applications. The computational outcomes, based on comparative tests involving real world and experimental benchmark problems, demonstrate that these methods provide useful alternatives to more established search procedures. The designs in these applications are straightforward, and can be readily adapted to...

In this work the optimal design of sensor networks for chemical plants is addressed using stochastic optimization strategies. The problem consists in selecting the type, number and location of new sensors that provide the required quantity and quality of process information. Ad-hoc strategies based on Tabu Search, Scatter Search and Population Based Incremental Learning Algorithms are proposed....

We consider the problem of designing error correcting codes (ECC), a hard combinatorial optimization problem of relevance in the field of telecommunications. This problem is tackled here with two related techniques, scatter search and memetic algorithms. The instantiation of these techniques for ECC design will be discussed. Specifically, the design of the local improvement strategy and the com...

To address the problems of both structured coordination of linked and modularised ontologies and to query a large dynamic ontology system, we propose a basic granularity framework and a set of functions to query such a granulated system. The granularity framework enforces a constrained and structured modularization. This facilitates automation of both dividing a large body of represented inform...

Multiprocessor systems, especially those based on multicore or multithreaded processors, and new operating system architectures can satisfy the ever increasing computational requirements of embedded systems. ASMP-LINUX is a modified, high responsiveness, open-source hard real-time operating system for multiprocessor systems capable of providing high real-time performance while maintaining the c...

The Orienteering Problem with Time Windows (OPTW) is an optimisation NP-hard problem. This paper proposes a hybrid genetic algorithm (GAPR) for approximating a solution to the OPTW. Instead of the usual crossover we use a path relinking (PR) strategy as a form of intensification solution. This approach generates a new solution by exploring trajectories between two random solutions: genes not pr...

The corridor allocation problem is one of assigning a given set of facilities in two rows along a straight corridor so as to minimize a weighted sum of the distances between every pair of facilities. This problem has practical applications in arrangements of rooms in offices and in hospitals. The problem is NP-hard. In this paper, we present two population based metaheuristic implementations fo...