10h30 - 10h55
A Tabu Based Local Search for Time-Dependent Multi-Zone Multi-trip Vehicle Routing Problem with Time windows
The Time-dependent Multi-zone Multi-trip Vehicle Routing Problem with Time Windows (TMM-VRPTW), a problem arising from the second tier of the two-tiered city logistic system described by (Crainic et al., 2009), is an extension of the VRPTW involving both designing and assigning routes to vehicles within the time synchronization restrictions. This presentation introduces the first tabu search for the TMM-VRPTW which is able to improve the best known solutions of all currently published results.
10h55 - 11h20
An Adaptive Large Neighborhood Search Algorithm for the Pollution-Routing Problem
This talk describes an adaptive large neighbourhood search algorithm (ALNS) for the Pollution-Routing Problem. The algorithm first solves a Vehicle Routing Problem with Time Windows using ALNS, then applies a speed optimization algorithm on the resulting tour. The talk will present computational results on realistic instances using the proposed algorithm.
11h20 - 11h45
A Unified Hybrid Genetic Search for Vehicle Routing Problems
A unified hybrid genetic search is proposed to address multi-attribute vehicle problems. The method relies on problem-specific route evaluation and assignment operators, along with generic implementations of Split procedures, local-search improvement methods, and genetic components. High-quality results are reported for a wide range of vehicle routing variants.
11h45 - 12h10
Timing Problems and Rich Vehicle Routing
"Timing problems" involve determining the execution times of a fixed sequence of activities on a single machine, in presence of various time constraints or objectives. We present a unifying analysis of algorithms for this class of problems, which are frequently encountered during route evaluations in local searches for rich VRPs.