![]() ![]() 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. We developed a constructive heuristic, called Nearest Insertion Heuristic (NIH) to build an initial solution. The final edge of the route is not required to be a depot. Bilal is a resident at 5663 Whitefield Strt, Dearborn Heights, MI 48127-3008. International Journal of Software Engineering & Applications Authors: Bilal Kanso Lebanese University Ali Kansou Figures Discover the worlds research Content uploaded by Bilal Kanso Author. Influencer Category Rank 499 in Portuguese. 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. Keywords: Linear Temporal Logic Buchi automata Model checking Compositional modeling. Bilal Mohamad-ali-taan Kanso Dearborn Heights, MI Search background report He was born on June 1, 1980. Bilal Kanso bilalkansoo Save to List Notes Where to find me. 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). Bilal received a Associate degree from Schoolcraft College and a Bachelor of Science from Lawrence Technological University. Previously, Bilal was an Engineer at HORIZON AUTOMO TIVE GROUP. 2012 19th Asia-Pacific Software Engineering Conference. Bilal Kanso is an Advanced Packaging Engineer at Stellantis based in Hoofddorp, North Holland. Volume 11, Number 1 Hybrid ANT Colony Algorithm for the Multi-depot Periodic Open Capacitated Arc Routing Problemīilal Kanso, Lebanese University, Lebanon Abstract Bilal Kanso, Marc Aiguier, Frdric Boulanger, Christophe Gaston. ![]()
0 Comments
Leave a Reply. |