Dear scheduling researcher, We are delighted to announce the talk given by Michel Gendreau (Polytech Montréal). The title is "Tabu search for the time-dependent vehicle routing problem with time windows on a road network". The seminar will take place on Zoom on Wednesday, November 24 at 14:00 UTC. Join Zoom Meeting https://cesnet.zoom.us/j/94687225692?pwd=SWVESXR6djcvWkpxeUc3a0xiLzVNQT09 Meeting ID: 946 8722 5692 Passcode: 557044 You can follow the seminar online or offline on our Youtube channel as well: https://www.youtube.com/channel/UCUoCNnaAfw5NAntItILFn4A The abstract follows. 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 next talk in our series will be given by Christoph Dürr (Sorbonne Uni)| December 8 | Three models for scheduling under explorable uncertainty For more details, please visit https://schedulingseminar.com/ With kind regards Zdenek, Mike and Guohua -- Zdenek Hanzalek Industrial Informatics Department, Czech Institute of Informatics, Robotics and Cybernetics, Czech Technical University in Prague, Jugoslavskych partyzanu 1580/3, 160 00 Prague 6, Czech Republic https://rtime.ciirc.cvut.cz/~hanzalek/