Bilal Kanso, Lebanese University, Lebanon. International Journal of Artificial Intelligence & Applications. Solving the capacitated vehicle routing problem with two-dimensional loading constraints using a parallel VNS approach. ISSN : 0975-900X ( Online ) 0976-2191 (Print). The proposed algorithm is evaluated on three different benchmarks sets and numerical results show that the proposed approach achieves highly efficient results.Īrc routing problem, Periodic, Multi-Depot, Meta heuristic, Ant Colony Optimization, Simulated Annealing algorithm. Bilal Kanso International Journal of Metaheuristics Vol. International Journal of Software Engineering & Applications (IJSEA), Vol.10, No. We developed a constructive heuristic, called Nearest Insertion Heuristic (NIH) to build an initial solution. The Dearborn Soccer Club is a volunteer association organized for the purpose of developing youth soccer players of all. The final edge of the route is not required to be a depot. Dearborn Soccer Club, Dearborn, Michigan. This problem is a new variant of OCARP that has never been studied in the literature and consists in determining optimal routes in each period where each route starts from a given depot, visits a list of required edges and finishes by the last one. View the profiles of professionals named 'Bilal Kanso' on LinkedIn. In this paper we present a hybrid technique that applies an ant colony optimization algorithm followed by simulated annealing local search approach to solving the Multi-Depot Periodic Open Capacitated Arc Routing Problem (MDPOCARP). ![]() Volume 11, Number 1 Hybrid ANT Colony Algorithm for the Multi-depot Periodic Open Capacitated Arc Routing Problemīilal Kanso, Lebanese University, Lebanon Abstract
0 Comments
Leave a Reply. |