Daniele Vigo
Orcid: 0000-0002-1499-8452Affiliations:
- University of Bologna, Italy
According to our database1,
Daniele Vigo
authored at least 103 papers
between 1994 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
-
on id.loc.gov
-
on d-nb.info
On csauthors.net:
Bibliography
2024
Central Eur. J. Oper. Res., June, 2024
Dynamic operator management in meta-heuristics using reinforcement learning: an application to permutation flowshop scheduling problems.
CoRR, 2024
2023
Expert Syst. Appl., December, 2023
Int. Trans. Oper. Res., November, 2023
The multiple traveling salesman problem in presence of drone- and robot-supported packet stations.
Eur. J. Oper. Res., 2023
2022
Guidelines for the computational testing of machine learning approaches to vehicle routing problems.
Oper. Res. Lett., 2022
CoRR, 2022
2021
A Fast and Scalable Heuristic for the Solution of Large-Scale Capacitated Vehicle Routing Problems.
Transp. Sci., 2021
Reliable vehicle routing problem in stochastic networks with correlated travel times.
Oper. Res., 2021
2020
Efficient Neighborhood Evaluations for the Vehicle Routing Problem with Multiple Time Windows.
Transp. Sci., 2020
Transp. Sci., 2020
Networks, 2020
Eur. J. Oper. Res., 2020
An Iterated Local Search for the Traveling Salesman Problem with Pickup, Delivery and Handling Costs.
Proceedings of the 39th International Conference of the Chilean Computer Science Society, 2020
2019
An Exact Algorithm for a Rich Vehicle Routing Problem with Private Fleet and Common Carrier.
Transp. Sci., 2019
Preface: Special issue on network optimization in transportation, logistics, and industry.
Networks, 2019
Eur. J. Oper. Res., 2019
A Branch-and-Cut-and-Price algorithm for the Multi-trip Separate Pickup and Delivery Problem with Time Windows at Customers and Facilities.
Eur. J. Oper. Res., 2019
The Dynamic-Demand Joint Replenishment Problem with Approximated Transportation Costs.
Eur. J. Oper. Res., 2019
EURO J. Transp. Logist., 2019
2018
Transp. Sci., 2018
The Need of Multidisciplinary Approaches and Engineering Tools for the Development and Implementation of the Smart City Paradigm.
Proc. IEEE, 2018
A Multi-Depot Two-Echelon Vehicle Routing Problem with Delivery Options Arising in the Last Mile Distribution.
Eur. J. Oper. Res., 2018
An Efficient Implementation of a Static Move Descriptor-based Local Search Heuristic.
Comput. Oper. Res., 2018
2017
Eur. J. Oper. Res., 2017
Models and algorithms for reliability-oriented Dial-a-Ride with autonomous electric vehicles.
Eur. J. Oper. Res., 2017
2016
Transp. Sci., 2016
IEEE Internet Things J., 2016
Oper. Res., 2016
Eur. J. Oper. Res., 2016
Eur. J. Oper. Res., 2016
2015
Transp. Sci., 2015
A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem.
Eur. J. Oper. Res., 2015
2014
Models and Algorithms for the Integrated Planning of Bin Allocation and Vehicle Routing in Solid Waste Management.
Transp. Sci., 2014
SPRINT: Optimization of Staff Management for Desk Customer Relations Services at Hera.
Interfaces, 2014
Eur. J. Oper. Res., 2014
Eur. J. Oper. Res., 2014
Operations research in solid waste management: A survey of strategic and tactical issues.
Comput. Oper. Res., 2014
An iterated local search for the multi-commodity multi-trip vehicle routing problem with time windows.
Comput. Oper. Res., 2014
Proceedings of the Vehicle Routing, 2014
Proceedings of the Vehicle Routing, 2014
2013
An Adaptive Variable Neighborhood Search Algorithm for a Vehicle Routing Problem Arising in Small Package Shipping.
Transp. Sci., 2013
EURO J. Transp. Logist., 2013
2012
J. Oper. Res. Soc., 2012
Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs.
Comput. Oper. Res., 2012
2011
The Two-Echelon Capacitated Vehicle Routing Problem: Models and Math-Based Heuristics.
Transp. Sci., 2011
2010
Transp. Sci., 2010
Ann. Oper. Res., 2010
Proceedings of the Operations Research Proceedings 2010, 2010
2009
Valid inequalities for the fleet size and mix vehicle routing problem with fixed costs.
Networks, 2009
An adaptive guidance approach for the heuristic solution of a minimum multiple trip vehicle routing problem.
Comput. Oper. Res., 2009
2008
J. Oper. Res. Soc., 2008
2007
An Exact Approach for the Vehicle Routing Problem with Two-Dimensional Loading Constraints.
Transp. Sci., 2007
Heuristic Approaches for the Fleet Size and Mix Vehicle Routing Problem with Time Windows.
Transp. Sci., 2007
Algorithm 864: General and robot-packable variants of the three-dimensional bin packing problem.
ACM Trans. Math. Softw., 2007
Eur. J. Oper. Res., 2007
2005
Erratum to "The Three-Dimensional Bin Packing Problem": Robot-Packable and Orthogonal Variants of Packing Problems.
Oper. Res., 2005
2004
Ann. Oper. Res., 2004
2003
INFORMS J. Comput., 2003
2002
Eur. J. Oper. Res., 2002
Models, relaxations and exact approaches for the capacitated vehicle routing problem.
Discret. Appl. Math., 2002
Discret. Appl. Math., 2002
Proceedings of the Vehicle Routing Problem., 2002
Proceedings of the Vehicle Routing Problem., 2002
2000
Eur. J. Oper. Res., 2000
1999
Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems.
INFORMS J. Comput., 1999
A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls.
Eur. J. Oper. Res., 1999
Eur. J. Oper. Res., 1999
Electron. Notes Discret. Math., 1999
Comput. Oper. Res., 1999
Proceedings of the Handbook of Combinatorial Optimization, 1999
1998
Integrating Constraint Logic Programming and Operations Research Techniques for the Crew Rostering Problem.
Softw. Pract. Exp., 1998
1997
Transp. Sci., 1997
Transp. Sci., 1997
A branch-and-cut algorithm for the resource-constrained minimum-weight arborescence problem.
Networks, 1997
J. Heuristics, 1997
1995
Discret. Appl. Math., 1995
Ann. Oper. Res., 1995
1994
A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs.
Oper. Res., 1994