Search results for "metaheuristic"

GRASP & evolutionary path relinking for medical image registration based on point matching

2010

Image registration is a very active research area in computer vision. Image registration methods, aim to find a transformation between two images taken under different conditions. Point matching is an image registration approach based on searching for the right pairing of points between the two images. From this matching, the registration transformation can be inferred by means of numerical methods. In this paper, we tackle the medical image registration problem adapting a new advanced hybrid metaheuristic composed by the GRASP and the evolutionary path relinking algorithms, called G&EvPR. The experiments conducted in this work have shown the good performance of G&EvPR compared to similar a…

A parallel variable neighborhood search approach for the obnoxious p -median problem

2018

Advanced Greedy Randomized Adaptive Search Procedure for the Obnoxious p-Median problem

2016

Abstract The Obnoxious p-Median problem consists in selecting a subset of p facilities from a given set of possible locations, in such a way that the sum of the distances between each customer and its nearest facility is maximized. The problem is NP -hard and can be formulated as an integer linear program. It was introduced in the 1990s, and a branch and cut method coupled with a tabu search has been recently proposed. In this paper, we propose a heuristic method – based on the Greedy Randomized Adaptive Search Procedure, GRASP, methodology – for finding approximate solutions to this optimization problem. In particular, we consider an advanced GRASP design in which a filtering mechanism avo…

A biased random-key genetic algorithm for the time-invariant berth allocation and quay crane assignment problem

2017

We address Berth Allocation and Quay Crane Assignment Problems in a heuristic wayWe propose a Biased Random-Key Genetic Algorithm for BACAP and its extension BACASPSolutions of the Genetic Algorithm are improved by a Local SearchThe complete procedure obtains high-quality solutions for large instances Maritime transportation plays a crucial role in the international economy. Port container terminals around the world compete to attract more traffic and are forced to offer better quality of service. This entails reducing operating costs and vessel service times. In doing so, one of the most important problems they face is the Berth Allocation and quay Crane Assignment Problem (BACAP). This pr…

Heuristics for the Bi-Objective Diversity Problem

2018

Abstract The Max-Sum diversity and the Max-Min diversity are two well-known optimization models to capture the notion of selecting a subset of diverse points from a given set. The resolution of their associated optimization problems provides solutions of different structures, in both cases with desirable characteristics. They have been extensively studied and we can find many metaheuristic methodologies, such as Greedy Randomized Adaptive Search Procedure, Tabu Search, Iterated Greedy, Variable Neighborhood Search, and Genetic algorithms applied to them to obtain high quality solutions. In this paper we solve the bi-objective problem in which both models are simultaneously optimized. No pre…

Intelligent Multi-Start Methods

2018

Heuristic search procedures aimed at finding globally optimal solutions to hard combinatorial optimization problems usually require some type of diversification to overcome local optimality. One way to achieve diversification is to re-start the procedure from a new solution once a region has been explored, which constitutes a multi-start procedure. In this chapter we describe the best known multi-start methods for solving optimization problems. We also describe their connections with other metaheuristic methodologies. We propose classifying these methods in terms of their use of randomization, memory and degree of rebuild. We also present a computational comparison of these methods on solvi…

District metered area design through multicriteria and multiobjective optimization

2022

[EN] The design of district metered areas (DMA) in potable water supply systems is of paramount importance for water utilities to properly manage their systems. Concomitant to their main objective, namely, to deliver quality water to consumers, the benefits include leakage reduction and prompt reaction in cases of natural or malicious contamination events. Given the structure of a water distribution network (WDN), graph theory is the basis for DMA design, and clustering algorithms can be applied to perform the partitioning. However, such sectorization entails a number of network modifications (installing cut-off valves and metering and control devices) involving costs and operation changes,…

The continuous Berth Allocation Problem in a container terminal with multiple quays

2015

We propose an integer linear model for the case of BAP with multiple quays.We design several constructive procedures and propose a large set of priority rules.We design a genetic algorithm, using the solutions obtained by the priority rules.For BAP with one quay, our genetic algorithm outperforms the best published methods. This paper extends the study of the continuous Berth Allocation Problem to the case of multiple quays, which is found in many container terminals around the world. Considering multiple quays adds a problem of assigning vessels to quays to the problem of determining berthing times and positions for each incoming vessel.This problem has not been considered in the literatur…

Scatter search for the profile minimization problem

2014

We study the problem of minimizing the profile of a graph and develop a solution method by following the tenets of scatter search. Our procedure exploits the network structure of the problem and includes strategies that produce a computationally efficient and agile search. Among several mechanisms, our search includes path relinking as the basis for combining solutions to generate new ones. The profile minimization problem PMP is NP-Hard and has relevant applications in numerical analysis techniques that rely on manipulating large sparse matrices. The problem was proposed in the early 1970s but the state-of-the-art does not include a method that could be considered powerful by today's compu…

GRASP with path relinking heuristics for the antibandwidth problem

2010

This article 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 between the node labels is maximized. Computational results show that only small instances of this problem can be solved exactly (to optimality) with a commercial integer programming solver and that the heuristics find high-quality solutions in much less time than the commercial solver. © 2010 Wiley Periodic…