Souleymane Balde
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Souleymane Balde has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Fouad Riane
Laboratoire de Recherche en Ingénierie, Innovation des Systèmes avancés (LISA), Faculty of Sciences and Techniques, Hassan First University of Settat, Route de Casablanca, P.O. Box 577, Settat 26000, Morocco
2 shared publications - Oussama Dribel
Laboratoire de Recherche en Ingénierie, Innovation des Systèmes avancés (LISA), Faculty of Sciences and Techniques, Hassan First University of Settat, Route de Casablanca, P.O. Box 577, Settat 26000, Morocco
2 shared publications - Abdessamad Ait El Cadi
LAMIH, UMR CNRS 8201, Université Polytechnique Hauts-de-France, Le Mont Houy, 59313 Valenciennes, France
1 shared publication
Latest Publications
- Open Access
Two-Stage Attention-Based Insertion Policy for the Dynamic Vehicle Routing Problem
This paper addresses dynamic vehicle routing with online requests, where insertion heuristics follow fixed rules ignoring the effect of each insertion on later requests. It proposes a two-stage attention-based insertion policy: a first stage selects a vehicle, and a second stage an insertion position within its route. Routes and fleet are encoded by attention, and the policy is trained with REINFORCE and a greedy rollout baseline on the final episode cost instead of immediate insertion costs. It is compared with cheapest, nearest and random insertion and with a single-stage policy over all vehicle–position pairs, on instances with 10 to 120 customers and degrees of dynamism from 10% to 90%. Both learned policies outperform nearest and random insertion and generalize to unseen sizes and degrees of dynamism. When most customers are dynamic on instances with up to 35 customers, the single-stage policy outperforms cheapest insertion by up to 3.1% and the two-stage policy matches it; otherwise, cheapest insertion remains better. The single-stage policy is cheaper in most settings, but the two-stage policy decides up to 2.7 and trains up to 5.7 times faster, for a cost at most 3.6% higher, and becomes cheaper on large, highly dynamic instances.
Open AccessTwo-Stage Attention-Based Insertion Policy for the Dynamic Vehicle Routing Problem
This paper addresses dynamic vehicle routing with online requests, where insertion heuristics follow fixed rules ignoring the effect of each insertion on later requests. It proposes a two-stage attention-based insertion policy: a first stage selects a vehicle, and a second stage an insertion position within its route. Routes and fleet are encoded by attention, and the policy is trained with REINFORCE and a greedy rollout baseline on the final episode cost instead of immediate insertion costs. It is compared with cheapest, nearest and random insertion and with a single-stage policy over all vehicle–position pairs, on instances with 10 to 120 customers and degrees of dynamism from 10% to 90%. Both learned policies outperform nearest and random insertion and generalize to unseen sizes and degrees of dynamism. When most customers are dynamic on instances with up to 35 customers, the single-stage policy outperforms cheapest insertion by up to 3.1% and the two-stage policy matches it; otherwise, cheapest insertion remains better. The single-stage policy is cheaper in most settings, but the two-stage policy decides up to 2.7 and trains up to 5.7 times faster, for a cost at most 3.6% higher, and becomes cheaper on large, highly dynamic instances.
- Open Access
- 24 September 2026
- Published by MDPI AG in Technologies
- Vol. 14 (10) , 605
Designing Bike-Sharing Networks for Urban Mobility: A Case Study of Morocco
Bike-Sharing Systems (BSS) are increasingly viewed as a sustainable and flexible component of urban mobility, particularly in rapidly growing cities such as Casablanca. The effectiveness of such systems depends, critically, on strategic planning decisions, most notably the number and location of stations. This study proposes a spatially explicit modeling framework to support the design of a BSS network based on urban demand characteristics. Ten categories of urban attractors are identified and grouped into four main criteria: socioeconomic activities; education, culture, and health; leisure spaces; and public mobility hubs. A modified Huff model is used to estimate the spatial distribution of potential demand and to identify candidate locations for bike-sharing stations. Walking accessibility is represented by shortest-path distances on the pedestrian network. Building on these demand estimates, the station deployment problem is formulated as a minimum set covering location problem whose objective is to determine the smallest number of stations required to cover a predefined proportion of total mobility demand within a 1000 m walking-network distance. Coverage is constrained separately for each arrondissement, while stations located near administrative boundaries may serve demand in neighboring arrondissements. At the baseline , the model selects 45, 70, and 154 stations for coverage targets of 60%, 80%, and 100%, respectively. The proposed approach provides a systematic and data-driven basis for BSS planning and helps integrate bike sharing into a more efficient, environmentally sustainable, and multimodal urban mobility system in Casablanca.- 24 September 2026
- Published by MDPI AG in Technologies
- Vol. 14 (10) , 605
Open AccessDesigning Bike-Sharing Networks for Urban Mobility: A Case Study of Morocco
Bike-Sharing Systems (BSS) are increasingly viewed as a sustainable and flexible component of urban mobility, particularly in rapidly growing cities such as Casablanca. The effectiveness of such systems depends, critically, on strategic planning decisions, most notably the number and location of stations. This study proposes a spatially explicit modeling framework to support the design of a BSS network based on urban demand characteristics. Ten categories of urban attractors are identified and grouped into four main criteria: socioeconomic activities; education, culture, and health; leisure spaces; and public mobility hubs. A modified Huff model is used to estimate the spatial distribution of potential demand and to identify candidate locations for bike-sharing stations. Walking accessibility is represented by shortest-path distances on the pedestrian network. Building on these demand estimates, the station deployment problem is formulated as a minimum set covering location problem whose objective is to determine the smallest number of stations required to cover a predefined proportion of total mobility demand within a 1000 m walking-network distance. Coverage is constrained separately for each arrondissement, while stations located near administrative boundaries may serve demand in neighboring arrondissements. At the baseline , the model selects 45, 70, and 154 stations for coverage targets of 60%, 80%, and 100%, respectively. The proposed approach provides a systematic and data-driven basis for BSS planning and helps integrate bike sharing into a more efficient, environmentally sustainable, and multimodal urban mobility system in Casablanca.