A. D. López-Sánchez

Orcid: 0000-0003-3022-3865

Affiliations:
  • Pablo de Olavide University, Sevilla, Spain


According to our database1, A. D. López-Sánchez authored at least 18 papers between 2013 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
A reactive path relinking algorithm for solving the bi-objective p-Median and p-Dispersion problem.
Soft Comput., June, 2023

An iterated greedy algorithm for finding the minimum dominating set in graphs.
Math. Comput. Simul., May, 2023

2022
A multi-objective parallel variable neighborhood search for the bi-objective obnoxious p-median problem.
Optim. Lett., 2022

GRASP with strategic oscillation for the α-neighbor p-center problem.
Eur. J. Oper. Res., 2022

An Efficient Fixed Set Search for the Covering Location with Interconnected Facilities Problem.
Proceedings of the Metaheuristics - 14th International Conference, 2022

A Fast Metaheuristic for Finding the Minimum Dominating Set in Graphs.
Proceedings of the Metaheuristics - 14th International Conference, 2022

2021
A New Scatter Search Design for Multiobjective Combinatorial Optimization with an Application to Facility Location.
INFORMS J. Comput., 2021

Optimizing a bi-objective vehicle routing problem that appears in industrial enterprises.
Expert Syst. J. Knowl. Eng., 2021

2020
Preface to the special issue on optimization in vehicle routing and logistics.
Networks, 2020

A matheuristic for the MinMax capacitated open vehicle routing problem.
Int. Trans. Oper. Res., 2020

A general variable neighborhood search for solving the multi-objective open vehicle routing problem.
J. Heuristics, 2020

2019
GRASP and VNS for solving the <i>p</i>-next center problem.
Comput. Oper. Res., 2019

Optimizing a Bi-objective Vehicle Routing Problem Appearing in Industrial Enterprises.
Proceedings of the 14th International Conference on Soft Computing Models in Industrial and Environmental Applications (SOCO 2019), 2019

2018
A multiobjective GRASP-VND algorithm to solve the waste collection problem.
Int. Trans. Oper. Res., 2018

A Multi-start Algorithm with Intelligent Neighborhood Selection for solving multi-objective humanitarian vehicle routing problems.
J. Heuristics, 2018

How to Locate Disperse Obnoxious Facility Centers?
Proceedings of the Variable Neighborhood Search - 6th International Conference, 2018

2014
A multi-start algorithm for a balanced real-world Open Vehicle Routing Problem.
Eur. J. Oper. Res., 2014

2013
Compromise utilitarian solutions in multi-criteria optimization problems as a guide for evolutionary algorithms.
Comput. Oper. Res., 2013


  Loading...