This paper introduces the pickup and delivery traveling salesman problem with handling costs (PDTSPH). In the PDTSPH, a single vehicle has to transport loads from origins to destinations. Loading and unloading of the vehicle is operated in a last-in-firstout (LIFO) fashion. However, if a load must be unloaded that was not loaded last, additional handling operations are allowed to unload and rel...

In the stochastic and dynamic multi-stage vehicle routing problem, a set of vehicles collectively transports and services demands which require service at multiple spatially separated locations. Arrival times and service locations of individual demands are not known until the demand’s arrival, and vehicles are assumed to have infinite capacity and to travel with bounded velocity. The objective ...

The split pickup and delivery problem is to find the shortest route that can provide delivery nodes with commodities collected from pickup nodes, subject to the vehicle load constraint. In particular, the split feature allows multiple visits to nodes and thus enables the vehicle to load or discharge an arbitrary portion of commodities along the route. This problem concerns the practical situati...

One important problem in transportation and logistics systems is the Multiple Vehicle Pickup and Delivery Problem with Time Windows (MV-PDPTW). The problem deals with a number of pickup and delivery (P&D) requests that should be served by a fleet of vehicles. A delivery location must be served after its corresponding pickup location. The vehicle’s journey should start and end at a central depot...

The double travelling salesman problem with multiple stacks (DTSPMS) is a pickup and delivery problem in which all pickups must be completed before any deliveries can be made. The problem originates from a real-life application where a 40 foot container (configured as 3 columns of 11 rows) is used to transport up to 33 pallets from a set of pickup customers to a set of delivery customers. The p...

In this paper, we review a three dimensional (3D) passive imaging system that exploits the visual information captured from the scene from multiple perspectives to reconstruct the scene voxel by voxel in 3D space. The primary contribution of this work is to provide a computational reconstruction scheme based on randomly distributed sensor locations in space. In virtually all of multi perspectiv...

For many industrial tasks (push, pull, lift, carry, etc.), restrictions on grip locations and visibility constrain the hand and head positions and help to define feasible postures. In contrast, foot locations are often minimally constrained and an ergonomics analyst can choose several different stances in selecting a posture to analyze. Also, because stance can be a critical determinant of a bi...

The pickup and delivery problem with time windows is the problem of serving a number of transportation requests using a limited amount of vehicles. Each request involves moving a number of goods from a pickup location to a delivery location. Our task is to construct routes that visit all locations such that corresponding pickups and deliveries are placed on the same route and such that a pickup...

We consider the multi-vehicle one-to-one pickup and delivery problem with split loads, a NP-hard problem linked with a variety of applications for bulk product transportation, bike-sharing systems and inventory re-balancing. This problem is notoriously difficult due to the interaction of two challenging vehicle routing attributes, “pickups and deliveries” and “split deliveries”. This possibly l...

The pickup and delivery problem with time windows is the problem of serving a number of transportationrequests using a limited amount of vehicles. Each request involves moving a number of goods from apickup location to a delivery location. Our task is to construct routes that visit all locations such thatcorresponding pickups and deliveries are placed on the same route and such that...