A bi-objective iterated local search heuristic with path-relinking for the p-median problem

Authors:
José E. C. Arroyo;André G. Santos;Paula M. dos Santos;Wellington G. Ribeiro
Affiliations:
Departamento de Informática, Universidade Federal de Viçosa, Viçosa, MG, Brasil;Departamento de Informática, Universidade Federal de Viçosa, Viçosa, MG, Brasil;Departamento de Informática, Universidade Federal de Viçosa, Viçosa, MG, Brasil;Departamento de Informática, Universidade Federal de Viçosa, Viçosa, MG, Brasil
Venue:
EMO'11 Proceedings of the 6th international conference on Evolutionary multi-criterion optimization
Year:
2011

Citing 7
Cited 0

Solution methods for the p-median problem: An annotated bibliography

Networks
Ant colony optimization for multi-objective flow shop scheduling problem

Computers and Industrial Engineering
Hybrid biobjective evolutionary algorithms for the design of a hospital waste management network

Journal of Heuristics
Multi-objective redundancy allocation optimization using a variable neighborhood search algorithm

Journal of Heuristics
A multi-objective genetic algorithm with path relinking for the p-median problem

IBERAMIA'10 Proceedings of the 12th Ibero-American conference on Advances in artificial intelligence
1984-2004 – 20 years of multiobjective metaheuristics. but what about the solution of combinatorial problems with multiple objectives?

EMO'05 Proceedings of the Third international conference on Evolutionary Multi-Criterion Optimization
Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we examine the p-median problem from a bi-objective point of view. Since this is a NP-Hard problem, an efficient algorithm based on the Iterated Local Search heuristic (ILS) is proposed to determine nondominated solutions (an approximation of the Pareto-optimal solutions). ILS is a simple and powerful stochastic method that has shown very good results for a variety of single-objective combinatorial problems. In each component of the ILS, we use the concept of Pareto dominance. An intensification component based on the Path-Relinking is used to improve the quality of the found nondominated solutions. To test the performance of the proposed algorithm, we develop a Mathematical Programming Algorithm, called e-Constraint, that finds a subset of Pareto-optimal solutions by solving iteratively the mathematical model of the problem with additional constraints. The results show that the proposed approach is able to generate good approximations to the non-dominated frontier of the bi-objective problem efficiently.