periodic vehicle routing problem focuses on establishing a plan of visits to clients over a given time horizon so as to satisfy some service level while optimizing the routes used in each time period. this paper presents a new effective heuristic algorithm based on data mining tools for periodic vehicle routing problem (pvrp). the related results of proposed algorithm are compared with the resu...

The multi-depot pickup and delivery problem with heterogeneous fleet and soft time windows (MDPDPHSTW) requires to find a minimum cost routing for a fleet vehicles with different capacities and based at different depots, satisfying a given set of customers. A customer request is associated with two locations: a source where a certain demand must be picked up and a destination where this demand ...

The classical vehicle routing problem involves to design a set of routes for a fleet of vehicles based at one central depot that is required to service a number of geographically dispersed customers, while minimizing the total travel distance or the total distribution cost. Each route originates and terminates at the central depot and customers’ demand are known. In many practical distribution ...