A new local search for the bees algorithm to optimize multiple traveling salesman problem

Autor: Ali Hamza, Ahmed Haj Darwish, Omar Rihawi

Publikováno v: Intelligent Systems with Applications, Vol 18, Iss , Pp 200242- (2023)

This paper presents a new local search operator with the Bees Algorithm (BA) to solve the Multiple Traveling Salesman Problem (MTSP), which is a kind of combinatorial optimization problem. Many algorithms and techniques were used to solve this proble

Externí odkaz: https://doaj.org/article/bf0210fc41c648b4b61cb9ce7b3976bc

Load-Balancing for Large Scale Situated Agent-based Simulations

Autor: Philippe Mathieu, Omar Rihawi, Yann Secq

Publikováno v: ICCS
International Conference On Computational Science, ICCS 2015 — Computational Science at the Gates of Nature
International Conference On Computational Science, ICCS 2015 — Computational Science at the Gates of Nature, Slawomir Koziel, Leifur Leifsson, Michael Lees, Valeria V. Krzhizhanovskaya, Jack Dongarra and Peter M.A. Sloot, Jun 2015, Reykjavik, Iceland. pp.90-99, ⟨10.1016/j.procs.2015.05.204⟩

International audience; In large scale agent-based simulations, memory and computational power requirements can increase dramatically because of high numbers of agents and interactions. To be able to simulate millions of agents, distributing the simu

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::874bd93dedbf78bedc0bfca260e3d785
https://doi.org/10.1016/j.procs.2015.05.204

Effective Distribution of Large Scale Situated Agent-based Simulations

Autor: Philippe Mathieu, Omar Rihawi, Yann Secq

Publikováno v: ICAART 2014 6th International Conference on Agents and Artificial Intelligence
ICAART 2014 6th International Conference on Agents and Artificial Intelligence, Stephane Loiseau, Joaquim Filipe, Béatrice Duval, Jaap van den Herik, Mar 2014, LOIRE, France. pp.312-319, ⟨10.5220/0004756903120319⟩
ICAART (1)
Scopus-Elsevier

When we simulate a high number of agents and interactions in situated agent-based simulations, the necessary computing and storage needs to execute a time step can be increased dramatically. To be able to execute such simulations, it becomes mandator

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::583ef8098b434a5f1796bdf56e6e3a62
https://inria.hal.science/hal-01115950

Relaxing Synchronization Constraints in Distributed Agent-based Simulations

Autor: Yann Secq, Omar Rihawi, Philippe Mathieu

Publikováno v: Jurnal Teknologi (Sciences and Engineering)
Jurnal Teknologi (Sciences and Engineering), Penerbit UTM Press, 2013, Special Edition, 63 (3), pp.65-76. ⟨10.11113/jt.v63.1957⟩
Jurnal Teknologi (Sciences and Engineering), 2013, Special Edition, 63 (3), pp.65-76. ⟨10.11113/jt.v63.1957⟩
Scopus-Elsevier

International audience; In the context of situated agents simulations, when the number of agents increases, the number of their interactions will be increased too. These growths leads to higher requirements in memory and computation power. When simul

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::180b50eaa1b598b3570dc9deb71c44c5
https://hal.inria.fr/hal-01115943