Open Capacitated ARC routing problem by Hybridized Ant Colony Algorithm

Autor: Adnan Yassine, Bilal Kanso, Ali Kansou

Publikováno v: RAIRO - Operations Research. 55:639-652

The Open Capacitated Arc Routing Problem OCARP is a well-known NP-hard real-world combinatorial optimization problem. It consists of determining optimal routes for vehicles in a given service area at a minimal cost distance. The main real application

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::7ce3da9facd8fddc2f6a82e447088cee
https://doi.org/10.1051/ro/2021034

Converting A Subset of LTL Formula to Buchi Automata

Autor: Bilal Kanso, Ali Kansou

Publikováno v: International Journal of Software Engineering & Applications. 10:35-52

The translation of LTL formula into equivalent Buchi automata plays an important role in many algorithms for LTL model checking, which consist in obtaining a Buchi automaton that is equivalent to the software system specification and another one that

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::44eeb7348a5b60408470a93721d3bb68
https://doi.org/10.5121/ijsea.2019.10204

Scheduling of lifting vehicles with time windows in an automated port container terminal

Autor: Thierry Galinho, Riadh Moussi, Ali Kansou, Adnan Yassine

Publikováno v: 2011 4th International Conference on Logistics.

A port container terminal is generally exploited with three types of equipments: Quay Cranes (QCs), vehicles and Yard Cranes (YCs). In this paper, we present a particular type of vehicles which is used at terminal of Normandy in Le Havre port in Fran

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::85c9738d1d935af45f0d4eb2ed6d6d32
https://doi.org/10.1109/logistiqua.2011.5939403

New upper bounds for the multi-depot capacitated arc routing problem

Autor: Ali Kansou, Adnan Yassine

Publikováno v: International Journal of Metaheuristics
International Journal of Metaheuristics, 2010, 1 (1), 〈10.1504/IJMHeur.2010.033124〉
International Journal of Metaheuristics, Inderscience Enterprises Ltd., 2010, 1 (1), ⟨10.1504/IJMHeur.2010.033124⟩

The multi-depot capacitated arc routing problem (MD-CARP) generalises the well-known capacitated arc routing problem (CARP) by extending the single depot to a multi-depot network. The CARP consists of designing a set of vehicle trips, so that each ve

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6955d7be605a01fcacbaeb2baf39a3e8
https://hal.archives-ouvertes.fr/hal-01509905