This paper examines the cost-reduction effect of “postponed” routing decisions in a two-echelon supply chain. When a delivery vehicle leaves the warehouse with system replenishment quantities, it sequentially makes routing decisions to choose the next retailer to visit. To measure this effect this paper studies combined vehicle routing and inventoryallocation policies designed to minimize total...

This paper presents a probabilistic technique to diversify, intensify and parallelize a local search adapted for solving vehicle routing problems. This technique may be applied to a very wide variety of vehicle routing problems and local searches. It is shown that efficient first level taboo searches for vehicle routing problems may be significantly improved with this technique. Moreover, the s...

This paper presents an approximate algorithm based on distributed learning automata for solving capacitated vehicle routing problem. The vehicle routing problem (VRP) is an NPhard problem and capacitated vehicle routing problem variant (CVRP) is considered here. This problem is one of the NP-hard problems and for this reason many approximate algorithms have been designed for solving it. Distrib...

in this paper, we study the multi-depot vehiclerouting problem with inter-depot routes, in which the vehicles can replenish atintermediate depots. vehicles leave the origin depot with load on-board andserve customers until out of load. they may visit an intermediate depot toreplenish and finally return to the origin depot, completing their route. weinitiate a mathematical mixed integer programm...

0

This paper presents a method for solving multi-depot vehicle routing problem (MDVRP). First, a virtual central depot is added to transfer MDVRP to the multi-depot vehicle routing problem with the virtual central depot (V-MDVRP), which is similar to a vehicle routing problem (VRP) with the virtual central depot as the origin. An improved ant colony optimization with coarse-grain parallel strateg...

This paper deals with evolutionary algorithms for solving the vehicle routing problem. More precisely, the paper is concerned with eight evolutionary crossover operators, which have originally been designed for the traveling salesman problem but can also be used for vehicle routing. The considered crossovers are tested on a set of well known benchmark problem instances. The obtained experimenta...

In this paper, we study the complexity and (in)approximability of the minimum label vehicle routing problem. Given a simple complete graph G = (V,E) containing a special vertex 0 called the depot and where the edges are colored (labeled), the minimum label k-vehicle routing problem consists in finding a k-vehicle routing E′, i.e. a collection of cycles of size at most k+ 1 which all contain the...

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