A survey on pickup and delivery problems: Part i: Transportation between customers and depot <s> VRPPD subclass definitions <s> In the last four decades (1960-2000), the container, as an essential part of a unit-load-concept, has scored a great success in international sea freight transportation. With increasing containerization, the number of seaport container terminals and competition have increased considerably. One of the success factors of a terminal is related to the time in port for container vessels and the transshipment rates the ship operators have to pay. We describe the main logistics processes in seaport container terminals and present methods for their optimization. We focus on the process of container transport by gantry cranes and straddle carriers between the container vessel and the container yard. The primary objective is the reduction of the time in port for the vessels by maximizing the productivity of the gantry cranes, or in other words, minimizing the delay times of container transports that causes the gantry cranes to stop. We investigate different dispatching strategies for straddle carriers to gantry cranes and show the potential of evolutionary algorithms to improve the solutions. <s> BIB001 </s> A survey on pickup and delivery problems: Part i: Transportation between customers and depot <s> VRPPD subclass definitions <s> In this paper we discuss a real-life case study to optimize the logistics network for the collection of containers from end-of-life vehicle dismantlers in the Netherlands. Advanced planning concepts, such as dynamic assignment of dismantlers to logistic service providers, are analyzed using a simulation model. Based on this model, we periodically solve a vehicle routing problem to gain insight into the long-term performance of the system. The vehicle routing problem considered is a multi-depot pickup and delivery problem with alternative delivery locations. A special characteristic of the problem is the limited vehicle capacity of two containers. We solve this problem with a heuristic based on route generation and set partitioning. <s> BIB002
The class we denote VRPPD refers to problems where goods are transported from pickup to delivery points. It can be further divided into two subclasses. The first subclass refers to situations where pickup and delivery locations are unpaired. A homogeneous good is considered. Each unit picked up can be used to fulfill the demand of any delivery customer. In the literature mostly the single vehicle case is tackled, denoted as capacitated traveling Furthermore, there exists a problem class that is by definition not part of the full-truckload class, since vehicles with capacity two are considered. However, these problems are strongly related to the full-truck-load category since they originate from the same application area (container dispatching). The aim of this paper is to present a concise classification scheme and survey limited to vehicle routing problems involving pickup and delivery operations where the routing and not the scheduling aspect is of predominant importance. Therefore, full-truck-load dispatching approaches as well as approaches strongly related to this class (see e.g. Archetti et al., 2005 BIB002 will not be covered in this article. Also literature on sequencing problems, e.g. arising at intermodal stations, involving gantry crane pickup and delivery operations (compare e.g.  BIB001  will not be part of this survey.