Nowadays, logistic companies are dealing with the pressure of a highly competitive environment and trying to reduce operational costs. At same time, customers requiring not wait so long get their delivery pickup demands satisfied. In this study, these two factors considered a-static-periodic solution strategy. The problem is modelled as Dynamic Vehicle Routing Problem Simultaneous Pickup Delive...

The ship routing problem (SRP) is a special variant of the classical vehicle routing problems (VRPs), which is different from both the VRP with backhauls (VRPB) and the VRP with pickup and delivery (VRPPD). This paper proposes a new immune genetic algorithm for the large scale SRP. The backhaul and time window constraints are also considered. The immune GA is innovated based on the classic GA a...

The Vehicle Routing Problem with Simultaneous Deliveries and Pickups (VRPSDP) has attracted great interest in research due to its potential cost savings to transportation and logistics operators. There exist several extensions of VRPSDP, and among these extensions, Simultaneous Deliveries and Pickups with Split Loads Problem (SDPSLP) is particularly proposed for eliminating the vehicle capacity...

We analyze a business model for e-supermarkets to enable multi-product sourcing capacity through co-opetition (collaborative competition). The logistics aspect of our approach is to design and execute a network system where ‘‘premium’’ goods are acquired from vendors at multiple locations in the supply network and delivered to customers. Our specific goals are to: (i) investigate the role of pr...

The problem of designing a set of routes with minimum cost to serve a collection of customers with a fleet of vehicles is a fundamental challenge when the number of customers to be dropped or picked up is not known during the planning horizon. The purpose of this paper is to develop a vehicle routing Problem (VRP) model that addresses stochastic simultaneous pickup and delivery in the urban pub...

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

We study a generalization of the well-known traveling salesman problem (TSP) where each customer provides or requires a given non-zero amount of product, and the vehicle in a depot has a given capacity. Each customer and the depot must be visited exactly once by the vehicle supplying the demand while minimizing the total travel distance. We assume that the product collected from pickup customer...

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