Author
Elena Fernández
Other affiliations: University of Cádiz, University of Barcelona, University of California, Berkeley ...read more
Bio: Elena Fernández is an academic researcher from Polytechnic University of Catalonia. The author has contributed to research in topics: Integer programming & Facility location problem. The author has an hindex of 34, co-authored 93 publications receiving 3203 citations. Previous affiliations of Elena Fernández include University of Cádiz & University of Barcelona.
Papers published on a yearly basis
Papers
More filters
TL;DR: An auxiliary network is defined and the LP solution to the considered model provides an initial lower bound and is also used in a rounding procedure that provides the initial solution for a Tabu search heuristic.
184 citations
TL;DR: This paper develops a solution procedure that considers each objective separately and search for a set of efficient solutions instead of a single optimum within the framework of the evolutionary approach known as scatter search.
Abstract: In this paper we address the problem of routing school buses in a rural area. We approach this problem with a node routing model with multiple objectives that arise from conflicting viewpoints. From the point of view of cost, it is desirable to minimise the number of buses used to transport students from their homes to school and back. From the point of view of service, it is desirable to minimise the time that a given student spends en route. The current literature deals primarily with single-objective problems and the models with multiple objectives typically employ a weighted function to combine the objectives into a single one. We develop a solution procedure that considers each objective separately and search for a set of efficient solutions instead of a single optimum. Our solution procedure is based on constructing, improving and then combining solutions within the framework of the evolutionary approach known as scatter search. Experimental testing with real data is used to assess the merit of our proposed procedure.
176 citations
TL;DR: This paper presents the Tree of Hubs Location Problem, a network hub location problem with single assignment where a fixed number of hubs have to be located, with the particularity that it is required that the hubs are connected by means of a tree.
150 citations
TL;DR: The most distinctive features of the proposed Tabu search heuristic for the GAP are its simplicity and its flexibility, which result in an algorithm that provides good quality solutions in competitive computational times.
149 citations
TL;DR: A reactive GRASP approach to a commercial territory design problem motivated by a real-world application in a beverage distribution firm, which incorporates several features such as reactivity, by allowing self-adjustment of the restricted candidate list quality parameter, and filtering, which avoids executing the local search phase in unpromising bad solutions generated by the construction phase.
123 citations
Cited by
More filters
Book•
22 Jun 2009
TL;DR: This book provides a complete background on metaheuristics and shows readers how to design and implement efficient algorithms to solve complex optimization problems across a diverse range of applications, from networking and bioinformatics to engineering design, routing, and scheduling.
Abstract: A unified view of metaheuristics This book provides a complete background on metaheuristics and shows readers how to design and implement efficient algorithms to solve complex optimization problems across a diverse range of applications, from networking and bioinformatics to engineering design, routing, and scheduling. It presents the main design questions for all families of metaheuristics and clearly illustrates how to implement the algorithms under a software framework to reuse both the design and code. Throughout the book, the key search components of metaheuristics are considered as a toolbox for: Designing efficient metaheuristics (e.g. local search, tabu search, simulated annealing, evolutionary algorithms, particle swarm optimization, scatter search, ant colonies, bee colonies, artificial immune systems) for optimization problems Designing efficient metaheuristics for multi-objective optimization problems Designing hybrid, parallel, and distributed metaheuristics Implementing metaheuristics on sequential and parallel machines Using many case studies and treating design and implementation independently, this book gives readers the skills necessary to solve large-scale optimization problems quickly and efficiently. It is a valuable reference for practicing engineers and researchers from diverse areas dealing with optimization or machine learning; and graduate students in computer science, operations research, control, engineering, business and management, and applied mathematics.
2,735 citations
TL;DR: In this article, the authors present a review of the state-of-the-art in continuous location models and network location models, mixed-integer programming models, and applications for distribution system design.
935 citations
TL;DR: This paper proposes a classification scheme and looks at a number of problem variants in location-routing: a relatively new branch of locational analysis that takes into account vehicle routing aspects.
907 citations
TL;DR: The OP is formally described and many relevant variants are presented and all published exact solution approaches and (meta) heuristics are discussed and compared.
882 citations