Methods for solving road network problems with disruptions - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Electronic Notes in Discrete Mathematics Année : 2018

Methods for solving road network problems with disruptions

Résumé

In this study, we provide two approximate methods for solving both Unidirectional and Multidirectional Road Network problems with Disruptions and connecting requirements. These problems aim at defining alternative paths to deviate traffic flows, allowing the arc orientation to be reversed, such that the network remains strongly connected. The objectives are set to minimize the total travel cost and the number of reversed arcs. Two methods, a Biased Random Key Genetic Algorithm and an Iterated Local Search, are proposed. Numerical experiments with single objective and bi-objective versions are performed and results are hence compared to the exact method studied in previous works.
Fichier non déposé

Dates et versions

hal-02196339 , version 1 (28-07-2019)

Identifiants

Citer

Yipeng Huang, Andréa Cynthia Santos, Christophe Duhamel. Methods for solving road network problems with disruptions. Electronic Notes in Discrete Mathematics, 2018, 64, pp.175-184. ⟨10.1016/j.endm.2018.01.019⟩. ⟨hal-02196339⟩
47 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More