Pickup and delivery problems with time windows (PDPTW) are challenging yet realistic scheduling problems in which each delivery vehicle is assigned to handle different pairs of pickup-anddelivery requests. Our previous work successfully adapted the push forward insertion heuristic (PFIH) for initialization, and proposed a new swap operator to effectively solve PDP-TWs. In this paper, we improve...

A courier company approached NICTA to help develop a decision support tool for managing their daily pickup and delivery problem. They take orders from customers throughout the day and have to allocate one of the vehicles of their fleet to best meet the demand. This decision takes into account a number of hard (e.g. a vehicle must have capacity available for a parcel to be transported, a parcel ...

This paper deals with the Vehicle Routing Problem with Simultaneous Pick-up and Delivery and Time Limit (VRPSPDTL). Due to the combinatorial nature of the problem, heuristics methods are commonly used to generate good quality solutions within an acceptable computational time. Accordingly, an Iterated Local Search (ILS) procedure that uses a Variable Neighborhood Descent (VND) method to perform ...

Cross docking is a logistics strategy that strives to reduce inventory holding costs, shipping costs, and delays in delivering the products. In this research, an optimization model is presented for split loading and unloading products by suppliers and customers, vehicle routing with fuzzy possibilistic time window constraints among them, assignment of vehicles to cross dock, consolidation and i...

We address a single commodity Pickup and Delivery Vehicle Routing Problem from the literature. A network of customer nodes is given with both travel times costs. fleet vehicles limited capacity exploited to satisfy node demands, set routes must be found such that vehicle capacities are never exceeded, each route does not exceed time resource, cost minimized. The demands pickup delivery can spli...

Today manufacturers have become much more concerned with the coordination of both manufacturing (of new products) and recycling (of reusable resources) operations. This requires simultaneous scheduling of both forward and reverse flows of goods over a supply chain network. This paper studies time dependent vehicle routing problems with simultaneous pickup and delivery (TD-VRPSPD). We formulate ...

Neighborhood search is a cornerstone of state-of-the-art traveling salesman and vehicle routing metaheuristics. Whereas neighborhood exploration procedures are well-developed for problems with individual services, their counterparts one-to-one pickup-and-delivery more scarcely studied. A direct extension classic neighborhoods often inefficient or complex because the necessity jointly considerin...