Daniele Ferone

Publication Activity (10 Years)

Years Active: 2013-2023
Publications (10 Years): 30

Top Topics

Top Venues

Comput. Oper. Res.

Publications

Daniele Ferone, Paola Festa, Serena Fugaro, Tommaso Pastore
The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm. Networks 81 (2) (2023)
Daniele Ferone, Paola Festa, Tommaso Pastore, Mauricio G. C. Resende
Efficient GRASP solution approach for the Prisoner Transportation Problem. Comput. Oper. Res. 153 (2023)
Luigi Di Puglia Pugliese, Daniele Ferone, Paola Festa, Francesca Guerriero, Giusy Macrina
Combining variable neighborhood search and machine learning to solve the vehicle routing problem with crowd-shipping. Optim. Lett. 17 (9) (2023)
Stephanie Alvarez Fernandez, Daniele Ferone, Angel A. Juan, Daniele Tarchi
-hub median problem. J. Simulation 16 (5) (2022)
Luigi Di Puglia Pugliese, Daniele Ferone, Paola Festa, Francesca Guerriero, Giusy Macrina
Solution approaches for the vehicle routing problem with occasional drivers and time windows. Optim. Methods Softw. 37 (4) (2022)
Daniele Ferone, Paola Festa, Francesca Guerriero
The Rainbow Steiner Tree Problem. Comput. Oper. Res. 139 (2022)
Luigi Di Puglia Pugliese, Daniele Ferone, Paola Festa, Francesca Guerriero
A generalized shortest path tour problem with time windows. Comput. Optim. Appl. 83 (2) (2022)
Maurizio Bruglieri, Daniele Ferone, Paola Festa, Ornella Pisacane
A GRASP with penalty objective function for the Green Vehicle Routing Problem with Private Capacitated Stations. Comput. Oper. Res. 143 (2022)
Juan Ignacio Latorre Biel, Daniele Ferone, Angel A. Juan, Javier Faulin
Combining simheuristics with Petri nets for solving the stochastic vehicle routing problem with correlated demands. Expert Syst. Appl. 168 (2021)
Francesco Carrabs, Ciriaco D'Ambrosio, Daniele Ferone, Paola Festa, Federica Laureana
The constrained forward shortest path tour problem: Mathematical modeling and GRASP approximate solutions. Networks 78 (1) (2021)
Mirko Alicastro, Daniele Ferone, Paola Festa, Serena Fugaro, Tommaso Pastore
A reinforcement learning iterated local search for makespan minimization in additive manufacturing machine scheduling problems. Comput. Oper. Res. 131 (2021)
Daniele Ferone, Paola Festa, Serena Fugaro, Tommaso Pastore
A dynamic programming algorithm for solving the k-Color Shortest Path Problem. Optim. Lett. 15 (6) (2021)
Daniele Ferone, Paola Festa, Serena Fugaro, Tommaso Pastore
On the Shortest Path Problems with Edge Constraints. ICTON (2020)
Daniele Ferone, Paola Festa, Francesca Guerriero
An efficient exact approach for the constrained shortest path tour problem. Optim. Methods Softw. 35 (1) (2020)
Daniele Ferone, Sara Hatami, Eliana María González-Neira, Angel A. Juan, Paola Festa
A biased-randomized iterated local search for the distributed assembly permutation flow-shop problem. Int. Trans. Oper. Res. 27 (3) (2020)
Luigi Di Puglia Pugliese, Daniele Ferone, Paola Festa, Francesca Guerriero
Shortest path tour problem with time windows. Eur. J. Oper. Res. 282 (1) (2020)
Daniele Ferone, Aljoscha Gruler, Paola Festa, Angel A. Juan
Enhancing and extending the classical GRASP framework with biased randomisation and simulation. J. Oper. Res. Soc. 70 (8) (2019)
Ludovica Maccarrone, Tommaso Giovannelli, Daniele Ferone, Javier Panadero, Angel A. Juan
A simheuristic Algorithm for solving an Integrated Resource Allocation and Scheduling Problem. WSC (2018)
Stephanie Alvarez Fernandez, Daniele Ferone, Angel A. Juan, Daniel G. Silva, Jésica de Armas
A 2-stage biased-randomized iterated local search for the uncapacitated single allocation p-hub median problem. Trans. Emerg. Telecommun. Technol. 29 (9) (2018)
Paola Festa, Tommaso Pastore, Daniele Ferone, Angel A. Juan, Christopher Bayliss
Integrating biased-Randomized grasp with Monte Carlo simulation for solving the Vehicle Routing Problem with stochastic demands. WSC (2018)
Daniele Ferone, Paola Festa, Antonio Napoletano, Mauricio G. C. Resende
On the fast solution of the p-center problem. ICTON (2017)
Eliana María González-Neira, Daniele Ferone, Sara Hatami, Angel A. Juan
A biased-randomized simheuristic for the distributed assembly permutation flowshop problem with stochastic processing times. Simul. Model. Pract. Theory 79 (2017)
Daniele Ferone, Paola Festa, Antonio Napoletano, Mauricio G. C. Resende
A New Local Search for the p-Center Problem Based on the Critical Vertex Concept. LION (2017)
Giovanni Felici, Daniele Ferone, Paola Festa, Antonio Napoletano, Tommaso Pastore
A GRASP for the Minimum Cost SAT Problem. LION (2017)
Daniele Ferone, Angelo M. Facchiano, Anna Marabotti, Paola Festa
A new GRASP metaheuristic for biclustering of gene expression data. PeerJ Prepr. 4 (2016)
Daniele Ferone, Paola Festa, Antonio Napoletano, Tommaso Pastore
Reoptimizing shortest paths: From state of the art to new recent perspectives. ICTON (2016)
Daniele Ferone, Paola Festa, Aljoscha Gruler, Angel A. Juan
Combining simulation with a GRASP metaheuristic for solving the permutation flow-shop problem with stochastic processing times. WSC (2016)
Daniele Ferone, Paola Festa, Mauricio G. C. Resende
Hybridizations of GRASP with path relinking for the far from most string problem. Int. Trans. Oper. Res. 23 (3) (2016)
Giovanni Felici, Daniele Ferone, Paola Festa, Antonio Napoletano, Tommaso Pastore
The solution of large-scale Minimum Cost SAT Problem as a tool for data analysis in bioinformatics. PeerJ Prepr. 4 (2016)
Daniele Ferone, Paola Festa, Francesca Guerriero, Demetrio Laganà
The constrained shortest path tour problem. Comput. Oper. Res. 74 (2016)
Daniele Ferone, Paola Festa, Mauricio G. C. Resende
Hybrid Metaheuristics for the Far From Most String Problem. Hybrid Metaheuristics (2013)