Solving the Traveling Salesman Problem with release dates via branch-and-cut

In this paper we study the Traveling Salesman Problem with release dates (TSP-rd) and completion time minimization. The TSP-rd considers a single vehicle and a set of customers that must be served with goods that arrive to the depot over time, during the planning horizon. The time at which each requested good arrives is called … Read more

An Integer Programming approach for the Time-Dependent Traveling Salesman Problem with Time Windows

Congestion in large cities and populated areas is one of the major challenges in urban logistics, and should be addressed at different planning and operational levels. The Time-Dependent Travelling Salesman Problem (TDTSP) is a generalization of the well known Traveling Salesman Problem (TSP) where the travel times are not assumed to be constant along the … Read more

An ILP-based local search procedure for the VRP with pickups and deliveries

In this paper we address the Vehicle Routing Problem with Pickups and Deliveries (VRPPD), an extension of the classical Vehicle Routing Problem (VRP) where we consider precedences among customers, and develop an Integer Linear Programming (ILP) based local search procedure. We consider the capacitated one-to-one variant, where a particular precedence must be satisfied between pairs … Read more

A cluster-first route-second approach for the Swap Body Vehicle Routing Problem

The Swap Body Vehicle Routing Problem (SB-VRP) is a generalization of the classical Vehicle Routing Problem (VRP) where a particular structure as well as several operational aspects for the trucks composing the fleet are considered. This research has been motivated by the VeRoLog Solver Challenge 2014, organized together by VeRoLog and PTV group, aiming to … Read more