APPLICATION OF IMPERIALIST COMPETITIVE ALGORITHM FOR VEHICLE ROUTING PROBLEM

K. Karagyozov; T. Berov

Scientific paper ID 967 : 2014/3

APPLICATION OF IMPERIALIST COMPETITIVE ALGORITHM FOR VEHICLE ROUTING PROBLEM

K. Karagyozov, T. Berov

In this paper, a type of Evolutionary algorithm (Imperialist competitive algorithm) and its application for solving a Heterogeneous Fixed Fleet Vehicle Routing Problem with Time Windows is reviewed. This is a combinatorial optimization problem, dealing with route scheduling and the distribution of goods from the distribution center to geographically dispersed customers by a limited available fleet of vehicles with different capacity. We first formulated the mathematical model of the problem and then has been viewed the implementation of the Imperialist competitive algorithm to solve it.

• Reload article • Open/Download as PDF

транспорт товарен автомобилен империалистически конкурентен алгоритъм проблем за маршрутизацията на транспортните средстваTransport Freight Automotive Vehicle routing Problem Imperialist Competitive AlgorithmK. Karagyozov T. Berov

BIBLIOGRAPHY

[1] Atashpaz-Gargari, Caro Lucas (2007), An Algorithm for Optimization Inspired by Imperialistic Competition. Proceedings of Congress on Evolutionary Computation, pp.4661-4667

[2] Chi-Bin Cheng, Keng-Pin Wang (2009), Solving a vehicle routing problem with time windows by a decomposition technique and a genetic algorithm,Expert Systems with Applications 36 (2009) 7758–7763

[3] Liu, F. H., S. Y. Shen. (1999). A Method for Vehicle Routing Problem with Multiple Vehicle Types and Time Windows. Proc. Natl. Sci. Counc. ROC(A) Vol. 23, No. 4, 1999. pp. 526-536.

[4] Geng-jia Wang, Yuan-Biao Zhang, Jia-Wei Chen (2011) A Novel Algorithm to Solve the Vehicle Routing Problem with Time Windows: Imperialist Competitive Algorithm. Advanced in Information Sciences and Service Sciences. Volume 3, Number 5

[5] http://www.bernabe.dorronsoro.es/vrp/