default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDA. D. López-Sánchez
Person information
- affiliation: Pablo de Olavide University, Sevilla, Spain
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j17]Isaac Lozano-Osorio
, Jesús Sánchez-Oro, A. D. López-Sánchez, Abraham Duarte:
A variable neighborhood search for the median location problem with interconnected facilities. Int. Trans. Oper. Res. 32(1): 69-89 (2025)- [j16]R. Morante-González, A. D. López-Sánchez, Jesús Sánchez-Oro, Alfredo García Hernández-Díaz:
The multiobjective traveling salesman-repairman problem with profits: design and implementation of a variable neighborhood descent algorithm for a real scenario. Int. Trans. Oper. Res. 32(1): 221-243 (2025) - [j15]Eva Barrena, Sergio Bermudo, A. G. Hernández-Díaz, A. D. López-Sánchez, José A. Zamudio:
Finding the minimum k-weighted dominating sets using heuristic algorithms. Math. Comput. Simul. 228: 485-497 (2025) - 2023
- [j14]Alejandra Casado, Sergio Bermudo, A. D. López-Sánchez, Jesús Sánchez-Oro:
An iterated greedy algorithm for finding the minimum dominating set in graphs. Math. Comput. Simul. 207: 41-58 (2023) - [j13]Isaac Lozano-Osorio, Jesús Sánchez-Oro, A. D. López-Sánchez, Abraham Duarte:
A reactive path relinking algorithm for solving the bi-objective p-Median and p-Dispersion problem. Soft Comput. 27(12): 8029-8059 (2023) - 2022
- [j12]Jesús Sánchez-Oro, A. D. López-Sánchez, Alfredo García Hernández-Díaz, Abraham Duarte:
GRASP with strategic oscillation for the α-neighbor p-center problem. Eur. J. Oper. Res. 303(1): 143-158 (2022) - [j11]Jesús Sánchez-Oro, Ana Dolores López-Sánchez, J. Manuel Colmenar:
A multi-objective parallel variable neighborhood search for the bi-objective obnoxious p-median problem. Optim. Lett. 16(1): 301-331 (2022) - [c4]Isaac Lozano-Osorio, Jesús Sánchez-Oro, Anna Martínez-Gavara, Ana Dolores López-Sánchez, Abraham Duarte:
An Efficient Fixed Set Search for the Covering Location with Interconnected Facilities Problem. MIC 2022: 485-490 - [c3]Alejandra Casado, Sergio Bermudo, Ana Dolores López-Sánchez, Jesús Sánchez-Oro:
A Fast Metaheuristic for Finding the Minimum Dominating Set in Graphs. MIC 2022: 554-559 - 2021
- [j10]Ana Dolores López-Sánchez, Julián Molina, Manuel Laguna, Alfredo García Hernández-Díaz:
Optimizing a bi-objective vehicle routing problem that appears in industrial enterprises. Expert Syst. J. Knowl. Eng. 38(1) (2021) - [j9]A. D. López-Sánchez, Jesús Sánchez-Oro, Manuel Laguna:
A New Scatter Search Design for Multiobjective Combinatorial Optimization with an Application to Facility Location. INFORMS J. Comput. 33(2): 629-642 (2021) - 2020
- [j8]Jesús Sánchez-Oro, Ana Dolores López-Sánchez, J. Manuel Colmenar:
A general variable neighborhood search for solving the multi-objective open vehicle routing problem. J. Heuristics 26(3): 423-452 (2020) - [j7]Jens Lysgaard, Ana Dolores López-Sánchez, Alfredo García Hernández-Díaz:
A matheuristic for the MinMax capacitated open vehicle routing problem. Int. Trans. Oper. Res. 27(1): 394-417 (2020) - [j6]Ana Dolores López-Sánchez, Jesús Sánchez-Oro, Daniele Vigo:
Preface to the special issue on optimization in vehicle routing and logistics. Networks 76(2): 125-127 (2020)
2010 – 2019
- 2019
- [j5]Ana Dolores López-Sánchez, Jesús Sánchez-Oro, Alfredo García Hernández-Díaz:
GRASP and VNS for solving the p-next center problem. Comput. Oper. Res. 104: 295-303 (2019) - [c2]Ana Dolores López-Sánchez, Alfredo García Hernández-Díaz, Julián Molina, Manuel Laguna:
Optimizing a Bi-objective Vehicle Routing Problem Appearing in Industrial Enterprises. SOCO 2019: 452-462 - 2018
- [j4]Julián Molina Luque, A. D. López-Sánchez, Alfredo García Hernández-Díaz, Iris Martínez-Salazar:
A Multi-start Algorithm with Intelligent Neighborhood Selection for solving multi-objective humanitarian vehicle routing problems. J. Heuristics 24(2): 111-133 (2018) - [j3]A. D. López-Sánchez, Alfredo García Hernández-Díaz, Francisco Gortázar, Miguel A. Hinojosa:
A multiobjective GRASP-VND algorithm to solve the waste collection problem. Int. Trans. Oper. Res. 25(2): 545-567 (2018) - [c1]Jesús Sánchez-Oro, J. Manuel Colmenar, Enrique García-Galán, Ana Dolores López-Sánchez:
How to Locate Disperse Obnoxious Facility Centers? ICVNS 2018: 52-63 - 2014
- [j2]A. D. López-Sánchez, Alfredo García Hernández-Díaz, Daniele Vigo, Rafael Caballero, Julián Molina:
A multi-start algorithm for a balanced real-world Open Vehicle Routing Problem. Eur. J. Oper. Res. 238(1): 104-113 (2014) - 2013
- [j1]Miguel A. Hinojosa, A. D. López-Sánchez, Alfredo García Hernández-Díaz, Luis V. Santana-Quintero:
Compromise utilitarian solutions in multi-criteria optimization problems as a guide for evolutionary algorithms. Comput. Oper. Res. 40(5): 1155-1164 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 21:43 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
