Daniele Vigo

Orcid: 0000-0002-1499-8452

Affiliations:
  • University of Bologna, Italy


According to our database1, Daniele Vigo authored at least 103 papers between 1994 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Waste collection routing: a survey on problems and methods.
Central Eur. J. Oper. Res., June, 2024

Operational Research: methods and applications.
J. Oper. Res. Soc., March, 2024

Dynamic operator management in meta-heuristics using reinforcement learning: an application to permutation flowshop scheduling problems.
CoRR, 2024

Routing one million customers in a handful of minutes.
Comput. Oper. Res., 2024

2023
A new hybrid distribution paradigm: Integrating drones in medicines delivery.
Expert Syst. Appl., December, 2023

Effective metaheuristics for the latency location routing problem.
Int. Trans. Oper. Res., November, 2023

Decomposition Strategies for Vehicle Routing Heuristics.
INFORMS J. Comput., 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

Very large-scale neighborhood search for drone routing with energy replenishment.
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

The Vehicle Routing Problem with Partial Outsourcing.
Transp. Sci., 2020

A Hybrid Metaheuristic for Single Truck and Trailer Routing Problems.
Transp. Sci., 2020

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

The Hybrid Electric Vehicle - Traveling Salesman Problem with time windows.
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

A stochastic programming model for a tactical solid waste management problem.
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

Advances in vehicle routing and logistics optimization: exact methods.
EURO J. Transp. Logist., 2019

Visual attractiveness in routing problems: A review.
Comput. Oper. Res., 2019

Computers & operations research.
Comput. Oper. Res., 2019

2018
Exact Solutions for the Carrier-Vehicle Traveling Salesman Problem.
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

Extending the OR horizons.
Eur. J. Oper. Res., 2018

Scheduling EURO-k conferences.
Eur. J. Oper. Res., 2018

An Efficient Implementation of a Static Move Descriptor-based Local Search Heuristic.
Comput. Oper. Res., 2018

2017
Designing granular solution methods for routing problems with time windows.
Eur. J. Oper. Res., 2017

Models and algorithms for reliability-oriented Dial-a-Ride with autonomous electric vehicles.
Eur. J. Oper. Res., 2017

2016
Intermediate Facilities in Freight Transportation Planning: A Survey.
Transp. Sci., 2016

From a Real Deployment to a Downscaled Testbed: A Methodological Approach.
IEEE Internet Things J., 2016

Erratum - Exact Algorithms for the Clustered Vehicle Routing Problem.
Oper. Res., 2016

A service network design model for multimodal municipal solid waste transport.
Eur. J. Oper. Res., 2016

The Hybrid Electric Vehicle - Traveling Salesman Problem.
Eur. J. Oper. Res., 2016

An optimization approach for district heating strategic network design.
Eur. J. Oper. Res., 2016

2015
Territory-Based Vehicle Routing in the Presence of Time-Window Constraints.
Transp. Sci., 2015

A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem.
Eur. J. Oper. Res., 2015

Integrated vehicle routing problems.
Comput. Oper. Res., 2015

2014
Models and Algorithms for the Integrated Planning of Bin Allocation and Vehicle Routing in Solid Waste Management.
Transp. Sci., 2014

Exact Algorithms for the Clustered Vehicle Routing Problem.
Oper. Res., 2014

SPRINT: Optimization of Staff Management for Desk Customer Relations Services at Hera.
Interfaces, 2014

Guest editorial to the Special Issue "Routing and Logistics" (VeRoLog 2012).
Eur. J. Oper. Res., 2014

A multi-start algorithm for a balanced real-world Open Vehicle Routing Problem.
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

Classical Exact Algorithms for the Capacitated Vehicle Routing Problem.
Proceedings of the Vehicle Routing, 2014

The Family of Vehicle Routing Problems.
Proceedings of the Vehicle Routing, 2014

Four Variants of the Vehicle Routing Problem.
Proceedings of the Vehicle Routing, 2014

Vehicle Routing Problems with Profits.
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

Vehicle routing: historical perspective and recent contributions.
EURO J. Transp. Logist., 2013

2012
An evolutionary approach for tuning parametric Esau and Williams heuristics.
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
The Traveling Salesman Problem with Pickups, Deliveries, and Handling Costs.
Transp. Sci., 2010

Exact algorithms for routing problems under vehicle capacity constraints.
Ann. Oper. Res., 2010

Graph Sparsification for the Vehicle Routing Problem with Time Windows.
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
Tuning a parametric Clarke-Wright heuristic via a genetic algorithm.
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

Route 2005: Recent advances in vehicle routing optimization.
Networks, 2007

Lower bounds and heuristics for the Windy Rural Postman Problem.
Eur. J. Oper. Res., 2007

Recent advances in vehicle routing exact algorithms.
4OR, 2007

Chapter 6 Vehicle Routing.
Proceedings of the Transportation, 2007

2005
Erratum to "The Three-Dimensional Bin Packing Problem": Robot-Packable and Orthogonal Variants of Packing Problems.
Oper. Res., 2005

2004
Models and Bounds for Two-Dimensional Level Packing Problems.
J. Comb. Optim., 2004

TSpack: A Unified Tabu Search Code for Multi-Dimensional Bin Packing Problems.
Ann. Oper. Res., 2004

2003
The Granular Tabu Search and Its Application to the Vehicle-Routing Problem.
INFORMS J. Comput., 2003

An Exact Approach to the Strip-Packing Problem.
INFORMS J. Comput., 2003

2002
Heuristic algorithms for the three-dimensional bin packing problem.
Eur. J. Oper. Res., 2002

Models, relaxations and exact approaches for the capacitated vehicle routing problem.
Discret. Appl. Math., 2002

Recent advances on two-dimensional bin packing problems.
Discret. Appl. Math., 2002

A lower bound for the non-oriented two-dimensional bin packing problem.
Discret. Appl. Math., 2002

VRP with Backhauls.
Proceedings of the Vehicle Routing Problem., 2002

Branch-And-Bound Algorithms for the Capacitated VRP.
Proceedings of the Vehicle Routing Problem., 2002

An Overview of Vehicle Routing Problems.
Proceedings of the Vehicle Routing Problem., 2002

2000
The Three-Dimensional Bin Packing Problem.
Oper. Res., 2000

Exact and heuristic algorithms for data sets reconstruction.
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

Approximation algorithms for the oriented two-dimensional bin packing problem.
Eur. J. Oper. Res., 1999

Solving TSP through the Integration of OR and CP Techniques.
Electron. Notes Discret. Math., 1999

Heuristics for the traveling salesman problem with pickup and delivery.
Comput. Oper. Res., 1999

Bin Packing Approximation Algorithms: Combinatorial Analysis.
Proceedings of the Handbook of Combinatorial Optimization, 1999

1998
A Survey of Optimization Models for Train Routing and Scheduling.
Transp. Sci., 1998

Integrating Constraint Logic Programming and Operations Research Techniques for the Crew Rostering Problem.
Softw. Pract. Exp., 1998

Modeling and Solving the Crew Rostering Problem.
Oper. Res., 1998

1997
An Exact Algorithm for the Vehicle Routing Problem with Backhauls.
Transp. Sci., 1997

Heuristic Algorithms for the Handicapped Persons Transportation Problem.
Transp. Sci., 1997

A branch-and-cut algorithm for the resource-constrained minimum-weight arborescence problem.
Networks, 1997

Algorithms for railway crew management.
Math. Program., 1997

A Genetic/Tabu Thresholding Hybrid Algorithm for the Process Allocation Problem.
J. Heuristics, 1997

1995
Minimizing the Sum of Weighted Completion Times with Unrestricted Weights.
Discret. Appl. Math., 1995

An exact algorithm for the capacitated shortest spanning arborescence.
Ann. Oper. Res., 1995

1994
A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs.
Oper. Res., 1994


  Loading...