Datum / čas
Date(s) - 24.11.
15:00 - 17:00

Kategorie ne Kategorie

Tabu search for the time-dependent vehicle routing problem with time windows on a road network

Presenter Michel Gendreau (Polytech Montréal)

Join the seminar online via Youtube: https://www.youtube.com/channel/UCUoCNnaAfw5NAntItILFn4A/live

Travel times inside cities often vary quite a lot during a day and significantly impact the duration of delivery routes. Some authors have proposed time-dependent (TD) variants of several vehicle routing problems (VRPs), including the VRP with time windows (VRPTW). In most papers, time-dependency is defined on customer-based graphs. Thus, a major impact of travel time variations is missed: in an urban environment, not only do travel times change, but also the paths used to travel from one customer to another. To address this issue, we work directly with the road network and consider travel time (or travel speed) variations on each road segment. We present a solution approach, based on tabu search, for a TDVRPTW in which travel speeds are associated with segments in the road network. Computational results on instances with up to 200 nodes and 580 arcs are reported and assessed. (Joint work with Maha Gmira, Andrea Lodi, and Jean-Yves Potvin)

The seminar is organized by Zdeněk Hanzálek (CIIRC CTU in Prague), Michael Pinedo (New Y ork University) and Guohua Wan (Shanghai Jiao Tong).

Find full info and program at https://schedulingseminar.com/.