Optimal Traffic Relief Road Design Using Bilevel Programming and Greedy–Seeded Simulated Annealing: A Case Study of Kinshasa

The city of Kinshasa faces severe traffic congestion, requiring strategic enhancements to its transport infrastructure capacity. Although a comprehensive transport master plan has been proposed by the Japanese International Cooperation Agency (JICA) report its implementation requires substantial financial investment, which presents a significant challenge for the resource-constrained environment of the Democratic Republic of Congo. This research proposes an indicative optimisation-based network augmentation strategy that accounts for traveller equilibrium behaviour, the primary origin–destination demand patterns, and the underlying network structure. The study formulates the problem as a bilevel Transport Network Design Problem (TNDP) under a construction length budget constraint. Greedy-Simulated Annealing and Greedy-Tabu Search are proposed as the recommended computational search approaches, as they achieved the highest travel time reductions in the experimental study while also demonstrating stable and repeatable solution performance compared with other classical metaheuristic methods commonly used in TNDP research. Greedy Simulated Annealing and Greedy-Tabu Search are proposed as the recommended computational search approaches, as they achieved the highest travel time reductions in the experimental study while also demonstrating stable and repeatable solution performance compared with other classical metaheuristic methods commonly used in TNDP research. The computational experiments indicate a 30% reduction in total travel time, accompanied by a substantial decrease in highly congested links from 52.94% in the baseline network to 3.45% in the optimised design and nearly threefold improvement in edge betweenness centrality for a 100 Km constrained budget. The study further provides recommended new link constructions, together with alternative network redesign solutions that achieve comparable performance improvements.

Authors

Institutions

Publication Details

Journal
Future Transportation
Published
2026-03-17
DOI
https://doi.org/10.3390/futuretransp6020066
Primary Topic
Transportation Planning and Optimization
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Optimal Traffic Relief Road Design Using Bilevel Programming and Greedy–Seeded Simulated Annealing: A Case Study of Kinshasa

Yves Matanga, Etienne van Wyk, Chunling Tu
Future Transportation
Transportation Planning and Optimization
article

Optimal Traffic Relief Road Design Using Bilevel Programming and Greedy–Seeded Simulated Annealing: A Case Study of Kinshasa

Yves Matanga, Etienne van Wyk, Chunling Tu
article en

Abstract

The city of Kinshasa faces severe traffic congestion, requiring strategic enhancements to its transport infrastructure capacity. Although a comprehensive transport master plan has been proposed by the Japanese International Cooperation Agency (JICA) report its implementation requires substantial financial investment, which presents a significant challenge for the resource-constrained environment of the Democratic Republic of Congo. This research proposes an indicative optimisation-based network augmentation strategy that accounts for traveller equilibrium behaviour, the primary origin–destination demand patterns, and the underlying network structure. The study formulates the problem as a bilevel Transport Network Design Problem (TNDP) under a construction length budget constraint. Greedy-Simulated Annealing and Greedy-Tabu Search are proposed as the recommended computational search approaches, as they achieved the highest travel time reductions in the experimental study while also demonstrating stable and repeatable solution performance compared with other classical metaheuristic methods commonly used in TNDP research. Greedy Simulated Annealing and Greedy-Tabu Search are proposed as the recommended computational search approaches, as they achieved the highest travel time reductions in the experimental study while also demonstrating stable and repeatable solution performance compared with other classical metaheuristic methods commonly used in TNDP research. The computational experiments indicate a 30% reduction in total travel time, accompanied by a substantial decrease in highly congested links from 52.94% in the baseline network to 3.45% in the optimised design and nearly threefold improvement in edge betweenness centrality for a 100 Km constrained budget. The study further provides recommended new link constructions, together with alternative network redesign solutions that achieve comparable performance improvements.

Future TransportationVol. 6(2)
Tshwane University of Technology (ZA)
Openalex Percentile: Top 19%
Transportation Planning and Optimization
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Optimal Traffic Relief Road Design Using Bilevel Programming and Greedy–Seeded Simulated Annealing: A Case Study of Kinshasa — Yves Matanga, Etienne van Wyk, et al. · Future Transportation (2026) | TGRS Research Map | TGRS