Hybrid Tabu Search And Guided Local Search And Existence 2-Opt Local Search To Contribute In Solving The Vehicle Routing Problem With Time Windows
published by Tishreen 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 Vehicle
Routing Problem with Time Windows(VRPTW),that is one of the optimization problems
of the NP-hard type.
Moreover, Hybrid algorithm (HA) provided that integrates between Tabu Search
Algorithm and Guided Local Search algorithm And existence 2- Opt Local Search, based
on the savings algorithm in terms of continued of a particular objective to provide a lot of
savings. As we will compare the presented approach with standard tests to demonstrate
the efficiency, and their impact on the quality of the solution in terms of speed of
convergence and the ability to find better solutions.
References used
SOLOMON, M.M. ,"Algorithms for the vehicle routing and scheduling problems with time window constrains", Operational Research,Vol.35,No.2, 1987,PP. 250-265
DANTZIG, G.B., RAMSER, J. H., "The Truck Dispatching Problem". Management Science, Vol. 6, No. 1,1959. pp. 79-89
BRÄYSY.O ; GENDREAU, M., "Vehicle routing problem with time windows", part ii: Metaheuristics. Transportation Science, 39(1):pp.119–139, 2005