This seminar will take place on April 15 at 10:00. The seminar will be in a hybrid format with:
- in-person session in the IST Alameda Campus, Department of Engineering and Management's Meeting Room
- online, via Zoom https://videoconf-colibri.zoom.us/j/93418356405?pwd=LMavSYTTHoBlboOGU10NcX5k3LyvlC.1
Our seminars are free to attend and open to everyone. Please share with whomever may be interested.
Summary
Vehicle routing is a hard and extensively studied combinatorial optimization problem which has numerous practical applications in transportation and logistics. In the last two decades several effective solution methods were proposed for the heuristic solution of the vehicle routing problem (VRP) and its many variants but most of these methods do not scale well with respect to the computing time when the size of the problem grows. We discuss a family of approaches, originated from the FILO framework, which were explicitly designed to obtain a linear growth of the computing time making it possible to solve very large instances with up to one million customers within a very limited computing time.
Speaker's bio
Daniele Vigo is Professor of Operations Research at the Department of Electrical, Electronic and Information Engineering of the University of Bologna. He is interested in the design of innovative algorithms for the solution of difficult decision and optimization problems arising in several applications fields ranging from Logistics to Energy Production and to Smart Cities. He is author of more than 150 scientific papers and coeditor of some highly cited books. He was president of the Italian OR society from 2016 to 19 and is coordinator of the EURO working group on Vehicle Routing and Logistics optimization.
Personal homepage: https://www.unibo.it/sitoweb/daniele.vigo/en