Optimal Traffic Relief Road Design using Bilevel Programming and Greedy Seeded Simulated Annealing: A Case Study of Kinshasa
About
Context: The city of Kinshasa faces severe traffic congestion, requiring strategic infrastructure capacity enhancements. Although a comprehensive master plan has been proposed, its implementation requires substantial financial investment, which remains constrained in the Democratic Republic of the Congo (DRC), an emerging economy. This research proposes a traffic flow based algorithm to support the development of priority road segments. The objective is to enable more effective prioritisation of road construction projects and facilitate the optimal allocation of limited infrastructure budgets. Methods: The study was conducted by formulating a standard transport network design problem (TNDP) that included estimated origin demand data specific to the city of Kinshasa. Given the high computational nature of the 30 node network design, TNDP relevant metaheuristics (GA, ACO, PSO, SA, TS, Greedy) were used selectively and hybridised to achieve high quality, stable solutions. A greedy search seeded simulated annealing and Tabu search were devised to achieve the design goals. Results: Greedy Simulated Annealing and Greedy Tabu search yielded the best travel time reduction and the most stable solutions compared to other solvers, also improving network edge betweenness centrality by nearly a scale of two and a half. Conclusions: Road priorities were proposed, including junctions connecting the Bandundu and Kongo Central entry point to main attraction centres (Limete Poids Lourd, Gombe, Airport) and additional inner city areas (Ngaliema, Selembao, Lemba, Masina, Kimwenza).