This work proposes a Branch-cut-and-price (BCP) approach for the Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD). We also deal with a particular case of the VRPSPD, known as the Vehicle Routing Problem with Mixed Pickup and Delivery. The BCP algorithm was tested in well-known benchmark instances involving up to 200 customers. Four instances were solved for the first time ...

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...

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...

This paper discusses the vehicle routing problem with simultaneous pickup and delivery (VRPSPD), in which both pickup and delivery tasks simultaneously occur at various customer locations. The objective is to design a set of minimum distance routes with the minimum number of vehicles satisfying all the customers. This paper proposes a heuristic algorithm consisting of a route construction proce...

Dynamic vehicle routing problems with backhauling (VRPB), although important, have attracted little attention in the literature. Dynamic VRPB is more complex than dynamic vehicle routing problems (VRP) without backhauling, and since VRP without backhauling is a special case of VRPB, models and algorithms for dynamic VRPB can easily be adapted for dynamic VRP. In this paper, the author compared ...

This paper addresses the Vehicle Routing Problem with Delivery Time Cost. This problem aims to find a set of routes of minimal total costs including the travelling cost and delivery time cost, starting and ending at the depot, in such a way that each customer is visited by one vehicle given the capacity of the vehicle to satisfy a specific demand. In this research, a hybrid metaheuristic approa...

One of the most important factors in implementing supply chain management is to efficiently control the physical flow of the supply chain. Due to its importance, many companies are trying to develop efficient methods to increase customer satisfaction and reduce costs. In various methods, cross-docking is considered a good method to reduce inventory and improve responsiveness to various customer...