Aymen Aloui

dblp:288/1186 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2022
0000-0003-1174-7110ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 2 · 1 first-author · 2 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 1 first-author · 2 since 2021
YearPublicationVenuePosition
2022 A two-stage stochastic programming for the cooperative supply network planning
abstract
Nowadays, managers are looking for adequate strategies and advanced logistics management models in order to achieve their competitiveness and improve their overall performance. The current literature on supply network planning has not adequately incorporated sustainability factors, uncertainties, and the integration of various levels of planning (operational, tactical and strategic). In this paper, we address the integrated planning of logistics networks in an uncertain and sustainable environment. The problem is formulated as a two-stage stochastic programming which minimizes the logistics costs and evaluates a posteriori the CO2 emissions and the transport accident risk. This model is solved using the Sample Average Approximation (SAA) approach. Numerical experiments are performed using CPLEX to study the impact of different parameters on sustainability aspects.
Aymen Aloui, Nadia Hamani, Jaouher Chrouta, Laurent Delahoche
CoDIT1
2022 Improved Multi-Particle Swarm Optimization based on multi-exemplar and forgetting ability
abstract
Several variants of particle swarm optimization (PSO) have been created to identify various solutions to compli-cated optimization problems. Only a few PSO algorithms exist that can locate and monitor multiple optima in dynamically shifting search landscapes when dealing with dynamic optimization situations. These methods have yet to be thoroughly tested on a large number of dynamic optimization problems. In fact, because there are so many PSO algorithm modifications, it's simple to get stuck in a local optima. To address the aforementioned flaws, this work proposes and evaluates an enhanced version of the multiswarm particle swarm optimization technique (MsPSO) with numerous variations particle swarm optimization published in the literature. Standard tests and indicators provided in the specialized literature are used to verify the effectiveness of the suggested algorithm. Furthermore, on the CEC’ 13 test suite, comparison results between the extended heterogeneous multi swarm PSO algorithm (XMsPSO) and other nine popular PSO show that XMsPSO achieves a very optimistic performance for solving various kinds of problems, contributing to both higher solution accuracy.
Jaouher Chrouta, Aymen Aloui, Nadia Hamani, Abderrahmen Zaafouri
CoDIT2