Vehicle routing problems (VRPs) are among the most studied problems in operations
research. Nowadays, the leading exact algorithms for solving many classes of VRPs are …

During the last decade, a number of challenging applications in logistics, tourism and other
fields were modelled as orienteering problems (OP). In the orienteering problem, a set of …

In this paper, we describe an effective exact method for solving both the capacitated vehicle
routing problem (cvrp) and the vehicle routing problem with time windows (vrptw) that …

The tourist trip design problem (TTDP) refers to a route-planning problem for tourists
interested in visiting multiple points of interest (POIs). TTDP solvers derive daily tourist tours …

The best performing exact algorithms for the capacitated vehicle routing problem developed
in the last 10 years are based in the combination of cut and column generation. Some …

The increasing number and severity of natural and man-made disasters worldwide has led
to calls for more precise and effective humanitarian responses, and the use of humanitarian …

In the pickup and delivery problem with time windows vehicle routes must be designed to
satisfy a set of transportation requests, each involving a pickup and delivery location, under …

This paper presents a branch-and-cut-and-price algorithm for the vehicle-routing problem
with time windows. The standard Dantzig-Wolfe decomposition of the arc flow formulation …

A personalised electronic tourist guide assists tourists in planning and enjoying their trip.
The planning problem that needs to be solved, in real-time, can be modelled as a team …

This article presents an exact algorithm for the multi-depot vehicle routing problem (MDVRP)
under capacity and route length constraints. The MDVRP is formulated using a vehicle-flow …