scispace - formally typeset
G

Giovanni Righini

Researcher at University of Milan

Publications -  82
Citations -  3184

Giovanni Righini is an academic researcher from University of Milan. The author has contributed to research in topics: Column generation & Vehicle routing problem. The author has an hindex of 21, co-authored 77 publications receiving 2786 citations. Previous affiliations of Giovanni Righini include Eindhoven University of Technology & Polytechnic University of Milan.

Papers
More filters
Journal ArticleDOI

A heuristic approach for the green vehicle routing problem with multiple technologies and partial recharges

TL;DR: In this article, the authors present several heuristics for a variation of the vehicle routing problem in which the transportation fleet is composed of electric vehicles with limited autonomy in need for recharge during their duties.
Journal ArticleDOI

Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints

TL;DR: This paper illustrates how the basic dynamic programming algorithm can be improved by bounded bi-directional search and experimentally evaluates the effectiveness of the enhancement proposed.
Journal ArticleDOI

Heuristics from Nature for Hard Combinatorial Optimization Problems

TL;DR: The main characters of Heuristics ‘derived’ from Nature are described, a border area between Operations Research and Artificial Intelligence, with applications to graph optimization problems.
Journal ArticleDOI

New dynamic programming algorithms for the resource constrained shortest path problem.

Giovanni Righini, +1 more
- 01 Jan 2008 - 
TL;DR: The resource constrained elementary shortest path problem (RCESPP) arises as a pricing subproblem in branch‐and‐price algorithms for vehicle‐routing problems with additional constraints and is addressed by addressing the optimization of the RCESPP and presenting and comparing three methods.
Journal ArticleDOI

Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery

TL;DR: Heuristic algorithms to solve the vehicle routing problem with simultaneous pick-up and delivery approximately in a small amount of computing time are presented and constructive algorithms, local search algorithms and tabu search algorithms are presented.