Wissenschaftliche Studie, 2014
15 Seiten, Note: 2
1. Introduction
2. Literature review
3. Model formulation
3.1 Notation
3.2 MIP-formulation
4. Numerical results
4.1 Description of the case
4.2 Data for the example
4.3 Results
5. Discussion
6. Conclusion and research outlook
This paper aims to investigate the occurrence of the Braess paradox within logistics networks, specifically examining how the assignment of shipping units to transportation carriers influences traffic latency. The research addresses whether load-dependent travel times per vehicle and different assignment strategies exacerbate or mitigate the phenomenon of increased total system travel time when additional paths are introduced.
1. Introduction
Traffic flows can be modeled using a network consisting of several nodes which are connected via arcs. From a single start node to a single sink node, one or more paths can provide the opportunity to travel from origin to destination via different available directed arcs. Braess stated that adding a path to a network may increase its optimal total traffic flow time. The idea behind this is that each vehicle, obtaining all information about the theoretical time required from a source node to a sink node, takes the path that looks most preferable to it, neglecting the decisions of other vehicle drivers and therefore neglecting any congestion influences. The resulting total time spent for all vehicles in the whole system need not be minimal as the duration of travelling on a specific path depends on the congestion on the arcs that are used by the vehicles and that are part of the respective path.
Extensions of an existing network may cause a redistribution of flows that can result in longer individual running times [1], [2]. Therefore, the Braess paradox occurs in a graph if the traffic flow is not Pareto-optimal [3]. The linear mixed integer programming formulation (MIP) presented in this paper aims at minimizing the total latency occurring in the system, respectively the maximum time amongst all paths that connect start and sink nodes and that are used by at least one vehicle. We make the assumption that each vehicle takes an individual choice of its path, neglecting any path congestions that may arise due to the decisions of other vehicles. This can be modeled by forcing at least one vehicle to use the theoretically shortest path of all available paths, measured in time units. We use the original traffic network as provided in [1], but make an extension that shipping units have to be carried from origin to destination, which can be operated by several vehicles. However, the amount of load causes the vehicles to slow down speed based on a load-based latency function. Therefore it is analyzed how the assignment of shipping units to transportation carriers causes the Braess paradox and how the load-latency costs influence the time functions.
1. Introduction: Introduces the Braess paradox and outlines the research objective of applying a MIP formulation to assess load-dependent latency in transportation networks.
2. Literature review: Provides a survey of existing research on the Braess effect in traffic, communication, and engineering networks, establishing the research gap.
3. Model formulation: Details the mathematical framework, including notation and the Mixed Integer Programming formulation used to model vehicle and unit assignments.
4. Numerical results: Describes the test cases, data sets, and experimental setup, presenting computational findings across different network configurations.
5. Discussion: Analyzes the experimental results, examining how load-latency parameters and distribution strategies impact the frequency of the Braess effect.
6. Conclusion and research outlook: Summarizes the findings regarding the link between load-based costs and the Braess paradox, while suggesting future research directions.
Braess Paradox, Mixed Integer Linear Programming, Game Theory, Truck Assignment, Traffic Flows, Latency Functions, Load-dependent Travel, Network Equilibrium, Logistics Optimization, Pareto-optimality, Routing Decisions, Transportation Networks, System Latency, Vehicle Scheduling, Network Congestion.
The research focuses on the Braess paradox, a phenomenon where adding infrastructure to a network can paradoxically increase total travel time, specifically within the context of cargo and truck-based logistics.
The key themes include network flow optimization, game-theoretic decision making by vehicle drivers, load-dependent latency modeling, and the impact of shipping unit assignments on network efficiency.
The primary goal is to analyze how the distribution of shipping units onto vehicles affects the occurrence of the Braess paradox, supported by a novel Mixed Integer Linear Programming (MIP) model.
The authors employ a Mixed Integer Linear Programming (MIP) formulation to simulate traffic flows and identify non-Pareto-optimal routing decisions under congestion.
The paper moves from a theoretical literature overview to the mathematical modeling of the network, followed by empirical numerical tests that vary vehicle counts, load weights, and network arcs to identify when the paradox emerges.
The study is characterized by terms such as Braess Paradox, Mixed Integer Linear Programming, Game Theory, Truck Assignment, and load-dependent latency.
The study finds that the amount of load a vehicle carries affects its speed via a load-based latency function; higher loads increase congestion, which alters the attractiveness of paths and influences the overall occurrence of the paradox.
No, the authors note that it is not easy to detect a simple, direct linear relationship between the number of trucks and the paradox; however, they observe that 4-truck configurations sometimes minimize the effect compared to others.
The distribution is critical; the study shows that uniform distribution of goods across all trucks leads to the globally highest frequency of the Braess paradox (86%), whereas uneven distribution can help avoid the paradox.
Der GRIN Verlag hat sich seit 1998 auf die Veröffentlichung akademischer eBooks und Bücher spezialisiert. Der GRIN Verlag steht damit als erstes Unternehmen für User Generated Quality Content. Die Verlagsseiten GRIN.com, Hausarbeiten.de und Diplomarbeiten24 bieten für Hochschullehrer, Absolventen und Studenten die ideale Plattform, wissenschaftliche Texte wie Hausarbeiten, Referate, Bachelorarbeiten, Masterarbeiten, Diplomarbeiten, Dissertationen und wissenschaftliche Aufsätze einem breiten Publikum zu präsentieren.
Kostenfreie Veröffentlichung: Hausarbeit, Bachelorarbeit, Diplomarbeit, Dissertation, Masterarbeit, Interpretation oder Referat jetzt veröffentlichen!

