José A. Moreno-Pérez

Publication Activity (10 Years)

Years Active: 1998-2022
Publications (10 Years): 10

Top Topics

Benchmark Problems

Waste Collection

Routing Problem

Top Venues

Int. Trans. Oper. Res.

Publications

Dolores-Rosa Santos-Peñate, José A. Moreno-Pérez, Clara M. Campos Rodríguez, Rafael Suárez-Vega
A Mathematical Model and GRASP for a Tourist Trip Design Problem. EUROCAST (2022)
Aljoscha Gruler, Javier Panadero, Jésica de Armas, José A. Moreno-Pérez, Angel A. Juan
A variable neighborhood search simheuristic for the multiperiod inventory routing problem with stochastic demands. Int. Trans. Oper. Res. 27 (1) (2020)
Dolores-Rosa Santos-Peñate, Clara M. Campos Rodríguez, José A. Moreno-Pérez
The generalized discrete -centroid problem. Int. Trans. Oper. Res. 26 (1) (2019)
José A. Moreno-Pérez, Julio Brito-Santana, Agustín Santana Talavera, Dagoberto Castellanos Nieves, Iradiel García Pérez, Airam Expósito-Márquez
Smart Recommender for Blue Tourism Routing. EUROCAST (2) (2019)
Airam Expósito-Marquez, Christopher Expósito Izquierdo, Julio Brito-Santana, José A. Moreno-Pérez
Solving an Eco-efficient Vehicle Routing Problem for Waste Collection with GRASP. IDC (2018)
Aljoscha Gruler, Javier Panadero, Jésica de Armas, José A. Moreno-Pérez, Angel A. Juan
Combining variable neighborhood search with simulation for the inventory routing problem with stochastic demands and stock-outs. Comput. Ind. Eng. 123 (2018)
Airam Expósito, Günther R. Raidl, Julio Brito, José A. Moreno-Pérez
GRASP-VNS for a Periodic VRP with Time Windows to Deal with Milk Collection. EUROCAST (1) (2017)
José A. Moreno-Pérez, Juan Moreno García, Luis Jimenez Linares, Luis Rodriguez-Benitez
Time series represented by means of fuzzy piecewise lineal segments. J. Comput. Appl. Math. 318 (2017)
Dolores-Rosa Santos-Peñate, Clara M. Campos Rodríguez, José A. Moreno-Pérez
A Matheuristic to Solve a Competitive Location Problem. EUROCAST (1) (2017)
Julio Brito, Airam Expósito, José A. Moreno-Pérez
Solving the Team Orienteering Problem with fuzzy scores and constraints. FUZZ-IEEE (2016)
José A. Moreno-Pérez, Sergio Consoli
On the Minimum Labelling Spanning bi-Connected Subgraph problem. CoRR (2015)
Sergio Consoli, Nenad Mladenovic, José A. Moreno-Pérez
Solving the minimum labelling spanning tree problem by intelligent optimization. Appl. Soft Comput. 28 (2015)
Sergio Consoli, Nenad Mladenovic, José A. Moreno-Pérez
BVNS para el problema del bosque generador k-etiquetado. CoRR (2015)
Jésica de Armas, Belén Melián-Batista, José A. Moreno-Pérez, Julio Brito
GVNS for a real-world Rich Vehicle Routing Problem with Time Windows. Eng. Appl. Artif. Intell. 42 (2015)
Belén Melián-Batista, José A. Moreno-Pérez
Introduction to the special issue on intelligent metaheuristics for logistic planning. J. Heuristics 19 (2) (2013)
Jésica de Armas, Belén Melián-Batista, José A. Moreno-Pérez
Restricted Dynamic Heterogeneous Fleet Vehicle Routing Problem with Time Windows. IWANN (2) (2013)
Sergio Consoli, José A. Moreno-Pérez
Solving the minimum labelling spanning tree problem using hybrid local search. Electron. Notes Discret. Math. 39 (2012)
Julio Brito, F. Javier Martínez, José A. Moreno-Pérez, José L. Verdegay
ACO-GRASP-VNS Metaheuristic for VRP with Fuzzy Windows Time Constraints. EUROCAST (1) (2011)
Clara M. Campos Rodríguez, José A. Moreno-Pérez, Dolores-Rosa Santos-Peñate
Particle Swarm Optimization with Two Swarms for the Discrete (r|p)-Centroid Problem. EUROCAST (1) (2011)
Juan Pedro Castro Gutiérrez, Dario Landa-Silva, José A. Moreno-Pérez
Nature of real-world multi-objective vehicle routing with evolutionary algorithms. SMC (2011)
Miguel García-Torres, Roberto Ruiz, Belén Melián-Batista, José A. Moreno-Pérez, J. Marcos Moreno-Vega
A Two-Phase Heuristic Construction of Feature Sets for Classification. ICTAI (2011)
Juan Pedro Castro Gutiérrez, Dario Landa-Silva, José A. Moreno-Pérez
Improved Dynamic Lexicographic Ordering for Multi-Objective Optimisation. PPSN (2) (2010)
Pierre Hansen, Nenad Mladenovic, José A. Moreno-Pérez
Variable neighbourhood search: methods and applications. Ann. Oper. Res. 175 (1) (2010)
Sergio Consoli, Ken Darby-Dowman, Nenad Mladenovic, José A. Moreno-Pérez
Variable neighbourhood search for the minimum labelling Steiner tree problem. Ann. Oper. Res. 172 (1) (2009)
Sergio Consoli, Ken Darby-Dowman, Nenad Mladenovic, José A. Moreno-Pérez
Greedy Randomized Adaptive Search and Variable Neighbourhood Search for the minimum labelling spanning tree problem. Eur. J. Oper. Res. 196 (2) (2009)
Clara M. Campos, Lourdes Canós, María José Canós, Vicente Liern, José A. Moreno-Pérez, Dolores Santos
Decision Making in Competitive Location using Fuzzy Sets. IFSA/EUSFLAT Conf. (2009)
Clara M. Campos Rodríguez, José A. Moreno-Pérez, Hartmut Noltemeier, Dolores-Rosa Santos-Peñate
Two-Swarm PSO for Competitive Location Problems. NICSO (2008)
Pierre Hansen, Nenad Mladenovic, José A. Moreno-Pérez
Variable neighbourhood search: methods and applications. 4OR 6 (4) (2008)
Juan Pedro Castro Gutiérrez, Dario Landa-Silva, José A. Moreno-Pérez
Exploring Feasible and Infeasible Regions in the Vehicle Routing Problem with Time Windows Using a Multi-objective Particle Swarm Optimization Approach. NICSO (2008)
Clara M. Campos Rodríguez, José A. Moreno-Pérez
Multiple voting location problems. Eur. J. Oper. Res. 191 (2) (2008)
Pierre Hansen, Nenad Mladenovic, José A. Moreno-Pérez
Variable neighborhood search. Eur. J. Oper. Res. 191 (3) (2008)
Nenad Mladenovic, Jack Brimberg, Pierre Hansen, José A. Moreno-Pérez
The p-median problem: A survey of metaheuristic approaches. Eur. J. Oper. Res. 179 (3) (2007)
Félix García-López, Miguel García-Torres, Belén Melián-Batista, José A. Moreno-Pérez, J. Marcos Moreno-Vega
Solving feature subset selection problem by a Parallel Scatter Search. Eur. J. Oper. Res. 169 (2) (2006)
Ignacio José García del Amo, Miguel García-Torres, Belén Melián-Batista, José A. Moreno-Pérez, J. Marcos Moreno-Vega, Raquel Rivero Martín
Data Mining with Scatter Search. EUROCAST (2005)
Belén Melián-Batista, Manuel Laguna, José A. Moreno-Pérez
Minimizing the cost of placing and sizing wavelength division multiplexing and optical crossconnect equipment in a telecommunications network. Networks 45 (4) (2005)
Miguel García-Torres, Félix C. García López, Belén Melián-Batista, José A. Moreno-Pérez, J. Marcos Moreno-Vega
Solving Feature Subset Selection Problem by a Hybrid Metaheuristic. Hybrid Metaheuristics (2004)
Jesús David Beltrán, Jose Eduardo Calderón, Rayco Jorge Cabrera, José A. Moreno-Pérez, J. Marcos Moreno-Vega
GRASP-VNS hybrid for the Strip Packing Problem. Hybrid Metaheuristics (2004)
Belén Melián-Batista, Manuel Laguna, José A. Moreno-Pérez
Capacity expansion of fiber optic networks with WDM systems: problem formulation and comparative analysis. Comput. Oper. Res. 31 (3) (2004)
José A. Moreno-Pérez, J. Marcos Moreno-Vega, José L. Verdegay
Fuzzy location problems on networks. Fuzzy Sets Syst. 142 (3) (2004)
Belén Melián-Batista, José A. Moreno-Pérez, J. Marcos Moreno-Vega
Metaheuristicas: Una visión global. Inteligencia Artif. 7 (19) (2003)
Clara M. Campos Rodríguez, José A. Moreno-Pérez
Relaxation of the Condorcet and Simpson conditions in voting location. Eur. J. Oper. Res. 145 (3) (2003)
Félix C. García López, Miguel García-Torres, José A. Moreno-Pérez, J. Marcos Moreno-Vega
Scatter Search for the Feature Selection Problem. CAEPIA (2003)
Félix García-López, Belén Melián-Batista, José A. Moreno-Pérez, J. Marcos Moreno-Vega
Parallelization of the scatter search for the p-median problem. Parallel Comput. 29 (5) (2003)
José A. Moreno-Pérez, J. Marcos Moreno-Vega, Inmaculada Rodríguez Martín
Variable neighborhood tabu search and its application to the median cycle problem. Eur. J. Oper. Res. 151 (2) (2003)
Pierre Hansen, Nenad Mladenovic, José A. Moreno-Pérez
Búsqueda de Entorno Variable. Inteligencia Artif. 7 (19) (2003)
Félix García-López, Belén Melián-Batista, José A. Moreno-Pérez, J. Marcos Moreno-Vega
The Parallel Variable Neighborhood Search for the p-Median Problem. J. Heuristics 8 (3) (2002)
Arie Tamir, Dionisio Pérez-Brito, José A. Moreno-Pérez
A polynomial algorithm for the p-centdian problem on a tree. Networks 32 (4) (1998)