A tabu search heuristic for the multi-depot vehicle routing problem
Computers and Operations Research
Vehicle routing with pick-up and delivery: tour-partitioning heuristics
Computers and Industrial Engineering
A parallel evolutionary algorithm for the vehicle routing problem with heterogeneous fleet
Future Generation Computer Systems - Special issue: Bio-inspired solutions to parallel processing problems
A tabu search heuristic for the heterogenous fleet vehicle routing problem
Computers and Operations Research
Supply chain modeling: past, present and future
Computers and Industrial Engineering - Supply chain management
Decomposition heuristic to minimize total cost in a multi-level supply chain network
Computers and Industrial Engineering
A concurrent evolutionary approach for rich combinatorial optimization
Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers
Bin-packing multi-depots vehicle scheduling problem and its ant colony optimization
CCDC'09 Proceedings of the 21st annual international conference on Chinese control and decision conference
A metaheuristic for a teaching assistant assignment-routing problem
Computers and Operations Research
A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
Operations Research
A path relinking algorithm for a multi-depot periodic vehicle routing problem
Journal of Heuristics
Hi-index | 0.00 |
This study is on the multi period vehicle scheduling problem in a supply chain where a fleet of vehicle delivers single type product from multi depots to multi retailers. The purpose of this model is to design the least costly schedule of vehicles in each depot to minimize transportation costs for product delivery and inventory holding costs at retailers over the planning period. A mixed integer programming formulation and an exact algorithm are suggested. In the exact algorithm, all feasible schedules are generated from each depot to each retailer and set of vehicle schedules are selected optimally by solving the shortest path problem. The effectiveness of the proposed procedure is evaluated by computational experiment.