Zoom (for information email email@example.com)
Title: Hardness of set-partitioning formulation for the vehicle routing problem with stochastic demandsSpeaker: Ricardo Fukasawa Affiliation: University of Waterloo Location: Online (Zoom)
The vehicle routing problem considers the cheapest way to serve a set of customers using a fixed set of vehicles. When a vehicle serves a customer, it picks up its demand which is given as an input, and the total demand picked up cannot exceed the vehicle’s capacity. This classical combinatorial optimization problem combines aspects of routing (like a traveling salesman problem) and packing (like a knapsack problem).