In this paper we present a metaheuristic procedure constructed for the special case of the Vehicle Routing Problem in which the demands of the clients can be split, i.e., any client can be serviced by more than one vehicle. The proposed algorithm, based on the scatter search methodology, produces a feasible solution using the minimum number of vehicles. The results obtained compare with the bes...

The Multi Trip Vehicle Routing Problem with Time Windows and Release Dates is a variant of the Multi Trip Vehicle Routing Problem where a time windows is associated with each customer and a release date is associated with each merchandise to be delivered at a certain client. The release date represents the moment the merchandise becomes available at the depot for final delivery. The problem is ...

Effective co-ordination of distribution operations of a manufacturing organization is paramount since it represents the major cost component of the logistic supply chain. In order to deal with high demand of orders with shorter lead time, distributed warehouse concept is introduced and this is currently being practiced. Furthermore, due to inherent deficiencies in VRP, rules have been extended ...

In this paper, a tour-based multi-objective logistics model for optimized scheduling of the delivery of critical items in a disaster relief operation is proposed. Our model considers multi-items, multi-vehicles, multi-periods, and a split delivery scenario in a disaster. Two heuristic approaches are introduced to solve the logistics problem. In the first approach, a genetic algorithm is applied...

Motivation: Traditionally there has been a split between programming languages designed for prototyping and those for delivery. Unfortunately, examining the software life-cycle more closely, one sees that a large percentage of cost and effort is spent after first deployment, including a large amount of time spent re-engineering the original code. If an application is first developed in a script...

In the Skip Delivery Problem (SDP) a fleet of vehicles must deliver skips to a set of customers. Each vehicle has a maximum capacity of two skips and has to start and end its tour at a central depot. The demand of each customer can be greater than the capacity of the vehicles. The objective is to minimize the cost of the total distance traveled by the vehicles to serve all the customers. We sho...

This paper considers the problem of determining the lead-time and price to be quoted to a single order in a make-to-order manufacturing setting. The manufacturing system consists of several processing centers all subject to random failures and repairs. Because of a time window constraint on the delivery of the order, the latter has to be split among several processing centers to meet the constr...

We consider the Split Delivery Vehicle Routing Problem (SDVRP) where a fleet of homogeneous vehicles has to serve a set of customers. Each customer can be visited more than once, contrary to what is usually assumed in the classical Vehicle Routing Problem (VRP) and the demand of each customer can be greater than the capacity of the vehicles. No constraint on the number of available vehicles is ...

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