D
Daniele Vigo
Researcher at University of Bologna
Publications - 157
Citations - 16383
Daniele Vigo is an academic researcher from University of Bologna. The author has contributed to research in topics: Vehicle routing problem & Heuristic (computer science). The author has an hindex of 54, co-authored 150 publications receiving 14813 citations. Previous affiliations of Daniele Vigo include Kadir Has University & VU University Amsterdam.
Papers
More filters
Journal ArticleDOI
Heuristics for the traveling salesman problem with pickup and delivery
TL;DR: New heuristics for TSPPD are described, the first based on the exact solution of a special case and the second based on tabu search, and their average performance is analyzed through extensive computational experiments.
Journal ArticleDOI
Heuristic algorithms for the three-dimensional bin packing problem
TL;DR: A Tabu Search framework is introduced exploiting a new constructive heuristic for the evaluation of the neighborhood of 3BP, showing the effectiveness of the approach with respect to exact and heuristic algorithms from the literature.
Journal ArticleDOI
A Multi-Depot Two-Echelon Vehicle Routing Problem with Delivery Options Arising in the Last Mile Distribution
TL;DR: A hybrid multi-population genetic algorithm is proposed to solve a new city logistics problem arising in the last mile distribution of e-commerce, and the computational results obtained show the effectiveness of the different components of the algorithm.
Journal ArticleDOI
A Linear Programming Approach for Battery Degradation Analysis and Optimization in Offgrid Power Systems with Solar Energy Integration
Chiara Bordin,Chiara Bordin,Harold Oghenetejiri Anuta,Andrew Crossland,Isabel Lascurain Gutierrez,Chris Dent,Daniele Vigo +6 more
TL;DR: In this article, the authors present linear programming models for the optimal management of off-grid systems and develop a methodology to include battery degradation processes inside the optimization models, through the definition of battery degradation costs.
Journal ArticleDOI
Exact algorithms for routing problems under vehicle capacity constraints
TL;DR: This paper provides a review of the most recent developments that had a major impact in the current state-of-the-art of exact algorithms for vehicle routing problems under capacity constraints, with a focus on the basic Capacitated Vehicle Routing Problem (CVRP) and on heterogeneous vehicle routing problem.