Ana Dolores Lopez

Ana Dolores Lopez
Universidad Pablo de Olavide | UPO · Department of Economy, Cuantitative Methods and Economic History

About

26
Publications
2,936
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
206
Citations
Citations since 2017
19 Research Items
196 Citations
20172018201920202021202220230102030405060
20172018201920202021202220230102030405060
20172018201920202021202220230102030405060
20172018201920202021202220230102030405060

Publications

Publications (26)
Article
A dominating set in a graph is a set of vertices such that every vertex outside the set is adjacent to a vertex in the set. The domination number is the minimum cardinality of a dominating set in the graph. The problem of finding the minimum dominating set is a combinatorial optimization problem that has been proved to be NP-hard. Given the difficu...
Preprint
Full-text available
This paper deals with an interesting facility location problem known as the Bi-objective p -Median and p -Dispersion problem ( BpMD problem). The BpMD problem seeks to locate p facilities to service a set of n demand points and the goal is to minimize the total distance between facilities and demand points and, simultaneously, maximize the minimum...
Article
Full-text available
This paper presents a competitive algorithm that combines the Greedy Randomized Adaptive Search Procedure including a Tabu Search instead of a traditional Local Search framework, with a Strategic Oscillation post-processing, to provide high-quality solutions for the α-neighbor p-center problem (α−pCP). This problem seeks to locate p facilities to s...
Article
Full-text available
Researchers and practitioners have addressed many variants of facility locations problems. Each location problem can be substantially different from each other depending on the objectives and/or constraints considered. In this paper, the bi-objective obnoxious p-median problem (Bi-OpM) is addressed given the huge interest to locate facilities such...
Article
Full-text available
This paper presents a hybridization of Strategic Oscillation with Path Relinking to provide a set of high-quality nondominated solutions for the Multiobjective k-Balanced Center Location problem. The considered location problem seeks to locate k out of m facilities in order to serve n demand points, minimizing the maximum distance between any deman...
Article
Full-text available
Crowd logistics is a recent trend that proposes the participation of ordinary people in the distribution process of products and goods. This idea is becoming increasingly important to both delivery and retail companies, because it allows them to reduce their delivery costs and, hence, to increase the sustainability of the company. One way to obtain...
Article
Full-text available
The use of the Internet to develop new technologies has generated a considerable change in teaching and student learning in higher education. The pandemic caused by COVID-19 has forced universities to switch from face-to-face to online instruction. Furthermore, this transfer process was planned and executed quickly, with urgent redesigns of courses...
Article
Full-text available
In this paper, a new solution method is implemented to solve a bi‐objective variant of the vehicle routing problem that appears in industry and environmental enterprises. The solution involves designing a set of routes for each day in a period, in which the service frequency is a decision variable. The proposed algorithm, a muti‐start multi‐objecti...
Article
Metaheuristic optimization is at the heart of the intersection between computer science and operations research. The INFORMS Journal of Computing has been fundamental in advancing the ideas behind metaheuristic methodologies. Fred Glover’s “Tabu Search—Part I” was published more than 30 years ago in the first volume of the then ORSA Journal on Comp...
Article
Full-text available
The multi-objective open vehicle routing problem (MO-OVRP) is a variant of the classic vehicle routing problem in which routes are not required to return to the depot after completing their service and where more than one objective is optimized. This work is intended to solve a more realistic and general version of the problem by considering three...
Chapter
A Muti-Start Multiobjective Local Search algorithm is implemented to solve a bi-objective variant of the Vehicle Routing Problem appearing in industry and environmental enterprises. The problem seeks to design a set of routes for each time on a period and in which the service frequency is a decision variable. The algorithm minimizes total emissions...
Article
Full-text available
This paper generalizes the iterated greedy algorithm to solve a multi-objective facility location problem known as the Bi-objective p-Center and p-Dispersion problem ( B p C D ). The new algorithm is coined as Multi-objective Parallel Iterated Greedy (MoPIG) and optimizes more than one objective at the same time. The B p C D seeks to locate p facil...
Chapter
The bi-objective obnoxious p-median problem has not been extensively studied in the literature yet, even having an enormous real interest. The problem seeks to locate p facilities but maximizing two different objectives that are usually in conflict: the sum of the minimum distance between each customer and their nearest facility center, and the dis...
Article
This paper presents two metaheuristic algorithms for the solution of the p-next center problem: a Greedy Randomized Adaptive Search Procedure and a Variable Neighborhood Search algorithm, that will be subsequently hybridized. The p-next center problem is a variation of the p-center problem, which consists of locating p out of n centers and assignin...
Article
In this paper, the MinMax‐COVRP (where COVRP is capacitated open vehicle routing problem) is considered as a variation of the COVRP where the objective is to minimize the duration of the longest route. For the purpose of producing high‐quality solutions, elements from the fields of mathematical programming and metaheuristics are combined, resulting...
Article
Full-text available
In this paper, a problem based on real-world situations in humanitarian logistics is considered, where the main characteristics are the lack of available vehicles and the imperative need of a quick evacuation of all the affected by a disaster, but within the minimum possible travel cost. These aspects will be considered within a Multi-objective Cap...
Article
In this paper, the waste collection problem (WCP) of a city in the south of Spain is addressed as a multiobjective routing problem that considers three objectives. From the company's perspective, the minimization of the travel cost is desired as well as that of the total number of vehicles. Additionally, from the employee's point of view, a set of...
Article
In this paper, the Waste Collection Problem of a city in the south of Spain is addressed as a multi-objective routing problem that considers three objectives. From the company’s perspective, the minimization of the travel cost is desired as well as that of the total number of vehicles. Additionally, from the employee’s point of view, a set of balan...
Article
Full-text available
The aim of this paper is to propose a framework in order to solve the real-world Waste Collection Problem in a city of southern Spain modeled as an Asymmetric Vehicle Routing Problem (AVRP) with side constraints and several variations. In this problem, not only vehicle capacity and temporal constraints are considered but multiple trips are also all...
Article
The aim of this paper is to solve a real-world problem proposed by an international company operating in Spain and modeled as a variant of the Open Vehicle Routing Problem in which the makespan, i.e., the maximum time spent on the vehicle by one person, must be minimized. A competitive multi-start algorithm, able to obtain high quality solutions wi...
Article
Multi-criteria optimization problems are considered where the decision maker is unable to determine the exact weights of importance of the criteria but can provide some imprecise information about these weights. Two solution concepts are studied in this framework: the optimistic min–max solution and the compromise utilitarian solution, both of whic...
Conference Paper
Full-text available
Vehicle Routing Problems (VRP) arise in transportation problems optimizing one or several objectives in conflict. We will focus on Open Vehicle Routing Problems with a homogeneous fleet and three objectives (total distance, maximum travel time and number of routes). We propose a multiobjective local search based algorithm capable of obtaining effic...
Article
Full-text available
En este trabajo se extiende la regla proporcional de los problemas clásicos de reparto al caso de problemas con referencias múltiples y se presenta una caracterización de la regla proporcional ponderada. Como caso particular, se analiza el problema de agregación y actualización de probabilidades. || In this paper we extend the proportional rule to...
Article
Full-text available
En este trabajo se extiende la regla proporcional de los problemas cl¶asicos de reparto al caso de problemas con referencias m¶ultiples y se presenta una caracterización de la regla proporcional ponderada. Como caso particular, se analiza el problema de agregación y actualización de probabilidades.

Network

Cited By