Modified Hybrid Algorithm To Contribute in Solving The Multi- Objective Vehicle Routing Problem With Time windows Based On Pareto Optimization
published by Aِl-Baath University
in 2017
in Mathematics
and research's language is
العربية
Download
Abstract in English
In this research, we are studying the possibility of contribution
in solving the multi-objective vehicle Routing problem with time
windows , that is one of the optimization problems of the NP-hard
type , This problem has attracted a lot of attention now because of
its real life applications.
Moreover, We will also introduced an algorithm called hybrid
algorithm (HA) which depends on integrates between Multiple
objective ant colony optimisation (MOACO) and tabu search (TS)
algorithm based on the Pareto optimization , and compare the
presented approach is the developer with standard tests to
demonstrate the applicability and efficiency.
References used
DE ARMAS, J., MELI- BATISTA,B ., MORENO-PEREZ, J.A., BRITO, J ,. 2015 . Gvns for a real-world rich vehicle routing problem with time windows. Engineering Applications of Artificial Intelligence. (42),PP. 45-56
MOCCIA, L., CORDEAU,F., LAPORTE,G., 2012 An Incremental Tabu Search Heuristic for the Generalized Vehicle Routing Problem with Time Windows." Journal of the Operational Research Society. PP. 238-244
ARCHETTI,C.,SPERANZA,G.,2014.A survey on matheuristics for routing problem. EURO Journal on Computational Optimization, 2 :235–246