Modeling And Optimizing Route Choice For Multimodal Transportation Networks
Notice bibliographique
Résumé
Traffic congestion has been one of the major issues that most urban areas are facing and thus, many solutions have been developed and deployed in order to mitigate its negative effects. Advanced Traveler Information Systems (ATIS) have been used over the past two decades to provide travelers with pre-trip or real-time traffic information. Most of the efforts have focused on providing timely traffic information at locations with regularly occurring congestion. ATIS can be used to provide travelers with pre-trip and on-route travel information necessary to improve trip decision making with respect to various criteria (e.g. minimizing delay, constraining travel to specific modes). Many jurisdictions within Canada and the United States have implemented the 511 travel information system that provides traffic information, road conditions and closures, traffic cameras, etc. \nSeveral studies were conducted on vehicle routing optimization methods in ATIS. Most of them consider passenger vehicles as the only transportation mode in their routing algorithm. Others that include two transportation modes are mostly based on shortest path algorithms. However, a probabilistic based route optimization approach could better capture the stochastic characteristic of road traffic conditions. This research investigates an adaptive routing methodology for multi-modal transportation networks. A routing algorithm based on Markov decision processes is proposed to capture short-term traffic characteristics of transportation networks. Graph theory is used to model typical travel behavior within a multimodal network. This thesis proposes to use special network modeling elements, e.g. super nodes, to allow the integration of public transportation schedule into the model via the publicly available predefined timetables. The proposed routing algorithm applies an iterative function to select the optimal transportation mode/route through the network junctions along a given path. \nThe proposed methodology is applied to several real-world networks of motorized and non-motorized modes located in the central business district in Toronto, Ontario, and Montreal and Longueuil in Quebec. The networks include train, bus, streetcar, subway and bicycle transportation facilities. Microsimulation models of the networks developed in VISSIM and AIMSUN are used to estimate travel times along major arterials, for all transportation modes and for different traffic demands and congestion levels. The simulation models were calibrated using volume and speed data. The developed routing algorithm is applied to several scenarios in order to estimate optimal routes for a hypothetical traveler moving between two arbitrarily selected nodes in the network. The results identify the most efficient combination of transportation modes that the travelers have to use given specific constraints pertaining to traffic and transit service conditions. It is also shown that by applying the proposed algorithm to bus lines, transit agencies can have significant cost savings by rerouting their fleet. \nThe results of the proposed research have the potential to be integrated into various Intelligent Transportation Systems applications by combining available traveler information services. It can assist travelers in making more informed decisions regarding their travel plans and provide transportation agencies with an overall assessment of the system and its performance. For example, it can be used to minimize the impact of congested traffic conditions on the overall travel time and/or cost incurred by travelers as well as the operating cost of transit agencies.
Récupéré en direct depuis OpenAlex et désinversé. Les résumés ne sont pas conservés dans cette base de données : les index inversés représentent 8,6 Go des 9,3 Go de texte de la base, et le serveur dispose de 13 Go libres.
Comment cette classification a été obtenuedéplier
Prédiction distillée sur la base complète
Imitation des enseignantsNi prévalence calibrée, ni vérité terrain. Validation humaine à venir. Apprise à partir de 10 348 étiquettes directes de Codex et de 10 348 étiquettes directes de Gemma. Le mode candidate est l'union des têtes enseignantes seuillées; le consensus est leur intersection. Ces sorties portent le statut machine_predicted_unvalidated et ne sont ni des étiquettes humaines ni des étiquettes directes de modèles de pointe.
Scores Codex et Gemma par catégorie
| Catégorie | Codex | Gemma |
|---|---|---|
| Métarecherche | 0,001 | 0,000 |
| Méta-épidémiologie (sens strict) | 0,000 | 0,000 |
| Méta-épidémiologie (sens large) | 0,000 | 0,000 |
| Bibliométrie | 0,001 | 0,001 |
| Études des sciences et des technologies | 0,002 | 0,000 |
| Communication savante | 0,000 | 0,001 |
| Science ouverte | 0,000 | 0,000 |
| Intégrité de la recherche | 0,001 | 0,001 |
| Charge utile insuffisante (le modèle a refusé de juger) | 0,000 | 0,000 |
Scores machine (provisoires)
Les deux têtes enseignantes du modèle étudiant, lues sur ce travail. Un score ordonne la base pour la relecture; il n'affirme jamais une catégorie, et le statut de validation accompagne chaque rangée tel quel.
Scores de référence d'un modèle non mature (critères de maturité non atteints, 7 itérations). Un score ordonne; il n'affirme jamais une catégorie.
score_only:v0-immature-baseline · tel quel depuis la passe de notation : score_only signifie que le nombre peut ordonner les travaux, et qu'aucune étiquette de catégorie n'en découleClassification
machine, non validéePrédiction automatique; un appel candidat d’une seule tête enseignante, pas un consensus.
Le détail, modèle par modèle et score par score, se trouve en fin de page sous « Comment cette classification a été obtenue ».