4 Presentations

• 
  03:30 PM - 03:55 PM

  Evolutionary Approaches to a Pickup and Delivery Problem with Incompatible Loads

  • Jörn Schönberger, presenter, University of Bremen

  A customer orders several goods that are delivered by two vehicles from different depots. The time span between the starting times of the two deliveries at a customer location must not be longer than a threshold value. We present evolutionary algorithm approaches that handle these inter-routes constraints in a pickup-and-delivery problem.

• 
  03:55 PM - 04:20 PM

  A Hybrid Metaheuristic for the Pickup and Delivery Problem with Time Windows and LIFO Loading

  • Marilène Cherkesly, presenter, Polytechnique Montréal
  • Guy Desaulniers, GERAD - Polytechnique Montréal
  • Gilbert Laporte, HEC Montréal

  We consider the pickup and delivery problem with time windows and last-in-first-out loading. This policy ensures that no handling is required while unloading objects from the vehicle. We propose a population-based metaheuristic and adapt the order crossover based on a giant tour representation. Computational results on medium-size instances are presented.

• 
  04:20 PM - 04:45 PM

  A Hybrid Evolutionary Algorithm for Heterogeneous Fleet Vehicle Routing Problems with Time Windows

  • Çağrı Koç, presenter, University of Southampton
  • Tolga Bektas, University of Southampton
  • Ola Jabali, HEC Montréal
  • Gilbert Laporte, HEC Montréal

  This paper presents a hybrid evolutionary algorithm (HEA) to solve heterogeneous fleet vehicle routing problems with time windows. The HEA successfully combines several metaheuristics and offers a number of new advanced efficient procedures. Extensive computational experiments on benchmark instances have shown that the HEA is highly effective on the problems.

• 
  04:45 PM - 05:10 PM

  Solving the Rural Postman Problem with Time Windows

  • Ingrid Marcela Monroy Licht, presenter, Polytechnique Montréal
  • Ciro Alberto Amaya, Universidad de Los Andes
  • André Langevin, Polytechnique Montréal

  We present a branch and cut algorithm to solve the Rural Postman Problem with Time Windows. For the largest instances a competitive Adaptive Large Neighbourhood Search is proposed. We tested the algorithms in a set of instances adapted from the literature and in a set of instances based on a real network.