A new heuristic for the multi-depot vehicle routing problem that improves upon best-known solutions
American Journal of Mathematical and Management Sciences - Special issue: vehicle routing 2000: advances in time windows, optimality, fast bounds, & multi-depot routing
A tabu search heuristic for the multi-depot vehicle routing problem
Computers and Operations Research
The vehicle routing problem
Branch-and-bound algorithms for the capacitated VRP
The vehicle routing problem
Branch-and-cut algorithms for the capacitated VRP
The vehicle routing problem
A new branch-and-cut algorithm for the capacitated vehicle routing problem
Mathematical Programming: Series A and B
Computers and Operations Research - Anniversary focused issue of computers & operations research on tabu search
A Memetic Algorithm with Population Management (MA|PM) for the Periodic Location-Routing Problem
HM '08 Proceedings of the 5th International Workshop on Hybrid Metaheuristics
Study on multi-depots vehicle scheduling problem and its two-phase particle swarm optimization
ICIC'09 Proceedings of the Intelligent computing 5th international conference on Emerging intelligent computing technology and applications
Hi-index | 0.00 |
The Multi-Depot Periodic Vehicle Routing Problem (MDPVRP) is the problem of designing, for an homogeneous fleet of vehicles of capacity Q, a set of routes for each day of a given p-day period. The routes of day k must be executed by mk vehicles based at the depot assigned to day k. Each vehicle performs only one route per day and each vehicle route must start and finish at the same depot. Each customer i may require to be visited on fi (say) di.erent days during the period and these visits may only occur in one of a given number of allowable daycombinations. For example, a customer may require to be visited twice during a 5-day period imposing that these visits should take place on Monday-Thursday or Monday-Friday or Tuesday-Friday. The MDPVRP consists of simultaneously assigning a day-combination to each customer and designing the vehicle routes for each day of the planning period so that each customer is visited the required number of times, the number of routes on each day does not exceed the number of vehicles available at the depot assigned to that day and the total cost of the routes is minimized.