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

ID: I935 Timothy W. Duket and Seokcheon Lee School of Industrial Engineering, Purdue University West Lafayette, IN 47906

This article addresses an extension of the multi-depot vehicle routing problem in which vehicles may be replenished at intermediate depots along their route. It proposes a heuristic combining the adaptative memory principle, a tabu search method for the solution of subproblems, and integer programming. Tests are conducted on randomly generated instances.

In this paper, we study the location routing problem with replenishment facilities (LRPRF), an extension of the location routing problem (LRP) where the vehicles can replenish at some replenishment facilities. Vehicles leave the depot with load on-board, serve customers until out of load, and then either return to a replenishment facility to reload or return to the depot, completing their route...

The purpose of this paper is to present new methods for solving the vehicle routing problem with time windows (VRPTW). VRPTW can be described as the problem of designing least cost routes from one depot to a set of geographically scattered points. The routes must be designed in such a way that each point is visited only once by exactly one vehicle within a given time interval; all routes start ...

Inspired by a real-life case in the Brussels Capital Region, Belgium, this paper provides Memetic Algorithm with Sequential Split procedure (MASS) for solving large variety of waste collection problems multiple depots, restricted vehicle fleet at each depot, (intermediate) processing facilities, capacity restrictions per facility and partial pick-ups. MASS first generates satisfactory initial s...

This paper presents a survey of the research on the Vehicle Routing Problem with Time Windows (VRPTW). The VRPTW can be described as the problem of designing least cost routes from one depot to a set of geographically scattered points. The routes must be designed in such a way that each point is visited only once by exactly one vehicle within a given time interval, all routes start and end at t...

This report presents a survey of research on the Vehicle Routing Problem with Time Windows (VRPTW). The VRPTW can be described as the problem of designing least cost routes from one depot to a set of geographically scattered points. The routes must be designed in such a way that each point is visited only once by exactly one vehicle within a given time interval, all routes start and end at the ...

This paper considers the problem of finding a route and schedule for a vehicle starting from a depot, visiting a set of customers and returning to the depot, in a time-dependent network where the objective is to minimize the greenhouse gas emissions. In this formulation, the speeds of the vehicle as well as the routes chosen are decision variables subject to limits determined by the level of co...

As pointed out by Nagy and Salhi in their recent survey [1], many variants of the location routing problem (LRP) are addressed in the literature. Generally speaking the LRP consists of determining locations for depots from which customers are served on routes with the objective of minimizing the overall cost. In this talk we consider the capacitated locationrouting problem (CLRP) which is defin...