We study a class of vehicle-routing problems (VRP) with simultaneous pickup and delivery (VRPSPD). In VRPSPDs, each customer may require a certain quantity of goods delivered from the depot and a quantity of goods to be picked up and returned to the depot. Besides the standard VRPSPD, we address (i) the VRPSPD with time limit (VRPSPDTL), which imposes a time limit on the routes of the transport...

This vehicle routing problem involves finding a set of trips, one for each vehicle and to pick up known quantities of perishable goods from a set of geographically dispersed suppliers to the cargo terminal of an international airport in south India. The pickup time is based on the deterministic departure time of the flights. The objective of this Vehicle routing problem with Pickup and Delivery...

in this paper we address the vrpcd, in which a set of homogeneous vehicles are used to transport products from the suppliers to customers via a cross-dock. the products can be consolidated at the cross-dock but cannot be stored for very long as the cross-dock does not have long-term inventory-holding capabilities. the objective of the vrpcd is to minimize the total traveled distance while respe...

The location-routing problem is the most significant and yet new research field in location problems that considers simultaneously vehicle routing problem features with original one for achieving high-quality integrated distribution systems in beside of the global optimum. Simultaneous pickup and delivery based on time windows are the two main characteristics of logistic management that have be...

One of the most important extensions of the capacitated vehicle routing problem (CVRP) is the vehicle routing problem with simultaneous pickup and delivery (VRPSPD) where customers require simultaneous delivery and pick-up service. In this paper, we propose an effective ant colony optimization (EACO) which includes insert, swap and 2-Opt moves for solving VRPSPD that is different with common an...

Customers’ expectations of timely and accurate delivery pickup online purchases pose a new challenge to last-mile delivery. When the goods sent customers are not received, they must be returned warehouse. This situation provides high additional cost. Parcel locker systems convenience stores have been launched solve this problem serve as payment stations. research investigates distribution in au...

In the One-Commodity Pickup and Delivery Problem (1PDP), a single commodity type is collected from a set of pickup customers to be delivered to a set of delivery customers, and the origins and destinations of the goods are not paired. We introduce a new adaptive hybrid VNS/SA (Variable Neighborhood Search/Simulated Annealing) approach for solving the 1-PDP. We perform sequences of VNS runs, whe...

Pickup and Delivery Problems, where customers may both receive and send goods, are an extension to classical Vehicle Routing Problems. We do not make the assumption common in literature that goods may only be picked up after all deliveries have been completed. Thereby we model industry problems encountered by freight forwarding agencies, which have to deal with dynamic pickups and deliveries in...

In one-to-one Pickup and Delivery Problems (PDPs), the aim is to design a set of least cost vehicle routes starting and ending at a common depot in order to satisfy a set of pickup and delivery requests between location pairs, subject to side constraints. Each request originates at one location and is destined for one other location. These requests apply to the transportation of goods or people...

In this paper, we investigate in the applicability of the Contract Net Protocol negotiation (CNP) in the field of the dynamic transportation. We address the optimization of the Dynamic Pickup and Delivery Problem with Time Windows also called DPDPTW. This problem is a variant of the Vehicle Routing Problem (VRP) that may be described as the problem of finding the least possible dispatching cost...