An Improved PSO for the Multi-Depot Vehicle Routing Problem with Time Windows

Abstract

The distribution of finished products from depots to customers is a practical and challenging problem in logistics management. Better routing and scheduling decisions can result in higher level of customer satisfaction. The distribution problem is generally formulated as the vehicle routing problem (VRP). Nevertheless, there is a rigid assumption that there is only one depot. In cases, for instance, where a logistics company has more than one depot, the VRP is not suitable. To resolve this limitation, this paper focuses on the VRP with multiple depots with time windows, (MDVRPTW). The MDVRP is NP-hard, which means that an efficient algorithm for solving the problem to optimality is unavailable. To deal with the problem efficiently, improved PSO is developed in this paper. A computational study is carried out to verify the algorithms. It is proved that the performance of improved PSO can solve this problem efficiently. V V ).2008 IEEE Pacific-Asia Workshop on Computational Intelligence and Industrial Application 978-0-7695-3490-9/08 $25.00

An Improved Variable Neighborhood Search Algorithm for Multi Depot Heterogeneous Vehicle Routing Problem based on Hybrid Operators

“…Dondo, et al (2009) proposed a hybrid local improvement algorithm to solve large scale MDVRPTW. Wen et al (2008) developed an improved particle swarm algorithm for solving MDVRPTW; Ting et al (2008) combined the ant colony algorithm and simulated annealing algorithm to solve MDVRPTW and got ideal experimental results; Ostertag (2008) integrated the VNS and MA into POPMUSIC algorithm framework respectively, and compared the solving results of two hybrid algorithm for the massive MDVRPTW. Andrea Bettinelli et al (2011) presented a branch-and-cut-and-price algorithm for the exact solution of a variation of the vehicle routing problem with time windows in which the transportation fleet is made by vehicles with different capacities and fixed costs, based at different depots.…”

Βελτιστοποίηση Του Χρόνου Εξυπηρέτησης Σημείων Ζήτησης Και Φορτίου Οχημάτων Διανομής / Συλλογής Σε Αστικό Δίκτυο

“…• Πρόβληµα MDVRP : Tα οχήµατα διανοµής ξεκινούν από περισσότερες της µιας αφετηρίες (αποθήκες-σηµεία στάθµευσης), (Μulti-Depot), βλ (Polacek Michael, Hartl Richard et all, 2004), (Salhi S., et all, 1998), (Taillard E.D., Laporte G, et all, 1996), (Tsouros M., Pitsiava M., Grammenidou K.,2006), (Wen L., Meng F.,2008).…”