The Multiple Traveling Salesman problem (mTSP) is an extension of the well-known Traveling Salesman Problem (TSP), where more than one salesman is allowed to be used in order to visit some cities just once. Furthermore, the formulation of the mTSP applies to a wide range of reallife applications, and can be extended to a wide variety of Vehicle Routing Problems (VRPs) by incorporating some addi...

We consider the Capacitated Traveling Salesman Problem with Pickups and Deliveries (CTSPPD). This problem is characterized by a set of n pickup points and a set of n delivery points. A single product is available at the pickup points which must be brought to the delivery points. A vehicle of limited capacity is available to perform this task. The problem is to determine the tour the vehicle sho...

Decomposition methods are techniques for exploiting the tractable substructures of an integer program in order to obtain improved solution procedures. In particular, the goal is to derive improved methods of bounding the optimal solution value, which can then be used to drive a branch-andbound algorithm. Such methods are the preferred solution approaches for a wide range of important models ari...

This paper describes an effective approach to solve the inspection problem via colored traveling salesman tours. Given an environment with obstacles and regions to be inspected, the approach plans a collision-free and dynamicallyfeasible motion trajectory that enables the vehicle to inspect all the regions of interest while reducing the distance traveled. A key aspect of the approach is the tra...

The aim of this paper is to propose a new heuristic for the Periodic Vehicle Routing Problem (PVRP) without time windows. The PVRP extends the classical Vehicle Routing Problem to a planning horizon of several days. Each customer requires a certain number of visits within this time horizon while there is some flexibility on the exact days of the visits. Hence, one has to choose the visit days f...

The double traveling salesman problem with multiple stacks is a variant of the pickup and delivery traveling salesman problem in which all pickups must be completed before any of the deliveries. In addition, items can be loaded on multiple stacks in the vehicle and each stack must obey the last-in-first-out policy. The problem consists in finding the shortest Hamiltonian cycles covering all pic...

We present a novel variation of the vehicle routing problem VRP . Single commodity cargo with pickup and delivery service is considered. Customers are labeled as either cargo sink or cargo source, depending on their pickup or delivery demand. This problem is called a single commodity vehicle routing problem with pickup and delivery service 1-VRPPD . 1-VRPPD deals with multiple vehicles and is t...

 We consider a pickup and delivery vehicle routing problem (PDP) commonly find in real-world logistics operations. The problem includes a set of practical complications that have received little attention in the vehicle routing literature. In this problem, there are multiple vehicle types available to cover a set of transportation orders, each of which has pickup time windows and delivery time...

⎯In the Dynamic and Stochastic Traveling Salesman Problem (DSTSP) a vehicle has to service a number of requests which are disclosed in a dynamic fashion over a planning horizon. When the vehicle is temporarily idle, one option is to reposition it in anticipation of future demand. The aim of this paper is to study waiting strategies for the DSTSP under a probabilistic characterization of custome...