एप्लाइड और कम्प्यूटेशनल गणित जर्नल

पांडुलिपि जमा करें arrow_forward arrow_forward ..

Two-stage Particle Swarm Optimization Algorithm for the Time Dependent Alternative Vehicle Routing Problem


Hsiao-Fan Wang and Yen-Yi Lee

This study considered a Time Dependent Alternative Vehicle Routing Problem (TDAVRP) in a multi-graph network (TDAVRP) and was formulated into a Mixed Integer Programming model. Due to its NP nature, an algorithm based on Particle Swarm Optimization (PSO) with local improvement was developed to speed up the solution procedure. By using different sets of Solomon’s benchmark problems and continuous travel time functions, the accuracy and efficiency of the two-stage PSO were evaluated. The computational results showed that the proposed algorithm is capable of deriving optimal or near optimal solutions in a short period of time when the size of the problems are small and is able to obtain feasible solutions within a reasonable time when solving the large problems which cannot be solved by ILOG CPLEX. In addition, Sensitivity Analysis was conducted to evaluate the performances of the parameters. The results indicated that the number of customers is a sensitive parameter and will influence the required number of vehicles, value of violations and percentage of alternative edges in the solution sets.

इस लेख का हिस्सा

में अनुक्रमित

arrow_upward arrow_upward