traveled distances
Recently Published Documents


TOTAL DOCUMENTS

18
(FIVE YEARS 3)

H-INDEX

3
(FIVE YEARS 0)

2021 ◽  
Author(s):  
Philipp Dörflinger

Autonomous vehicles will become a significant influence in the field of traffic and transportation. To determine the possible impact of fully automated traffic, this thesis analyzes trip-pattern data for the City of Karlsruhe, Germany. Based on survey data from the year 2012, the traveled distances are calculated in Karlsruhea baseline scenario as well as two competitive scenarios: best-case and worst-case. The database is analyzed for the most emerging trip patterns in three areas of the City of Karlsruhe. Trip data, including trip distance and mode choice, are analyzed by trip purpose and individual groups (based on employment status). By modifying the average trip distance, mode choice and trip patterns based on literature reviewed information, the consequences of autonomous vehicles are estimated. The study shows, that autonomous vehicles have the potential to reduce traffic (best-case), but on the other hand, could approximately double the overall traveled vehicle distances (worst-case).



2021 ◽  
Author(s):  
Philipp Dörflinger

Autonomous vehicles will become a significant influence in the field of traffic and transportation. To determine the possible impact of fully automated traffic, this thesis analyzes trip-pattern data for the City of Karlsruhe, Germany. Based on survey data from the year 2012, the traveled distances are calculated in Karlsruhea baseline scenario as well as two competitive scenarios: best-case and worst-case. The database is analyzed for the most emerging trip patterns in three areas of the City of Karlsruhe. Trip data, including trip distance and mode choice, are analyzed by trip purpose and individual groups (based on employment status). By modifying the average trip distance, mode choice and trip patterns based on literature reviewed information, the consequences of autonomous vehicles are estimated. The study shows, that autonomous vehicles have the potential to reduce traffic (best-case), but on the other hand, could approximately double the overall traveled vehicle distances (worst-case).



2021 ◽  
Vol 13 (2) ◽  
pp. 755
Author(s):  
Matthias Prandtstetter ◽  
Clovis Seragiotto ◽  
Johannes Braith ◽  
Sandra Eitler ◽  
Bernhard Ennser ◽  
...  

The last-mile in the courier express parcel (CEP) sector is the most challenging part of the overall transport chain. This is, among other reasons, because many recipients are not at home when deliveries take place. On the other hand, it is for many recipients inconvenient that they have to collect their parcels at different pickup shops varying from logistics service provider (LSP) to LSP. One solution is to employ (open) parcel lockers which are conveniently located for recipients and which allow successful (first) deliveries for LSPs. In this paper, we investigate the impact of parcel lockers with respect to traveled distances as well as CO2 emissions. We show that under certain situations, parcel lockers positively contribute to both aforementioned performance indexes. Based on our observations, we formulate recommendations how to support the implementation of parcel lockers.



Author(s):  
Anke Stieber ◽  
Armin Fügenschuh

Abstract The multiple traveling salespersons problem with moving targets is a generalization of the classical traveling salespersons problem, where the targets (nodes or objects) are moving over time. Additionally, for each target a visibility time window is given. The task is to find routes for several salespersons so that each target is reached exactly once within its visibility time window and the sum of all traveled distances of all salespersons is minimal. We present different modeling formulations for this TSP variant. The time requirements are modeled differently in each approach. Our goal is to examine what formulation is most suitable in terms of runtime to solve the multiple traveling salespersons problem with moving targets with exact methods. Computational experiments are carried out on randomly generated test instances to compare the different modeling approaches. The results for large-scale instances show, that the best way to model time requirements is to directly insert them into a formulation with discrete time steps.



2020 ◽  
Vol 11 (4) ◽  
pp. 130-148
Author(s):  
Youssef Harrath

In this article, the multiple objective multiple Traveling Salesman Problem is considered. m salesmen have to visit n cities to perform some tasks each taking a given processing time. Two objectives are considered: balance the working loads of different salesmen and minimize their total traveled distance. To solve this NP-hard problem, a 3-phase metaheuristic was developed. In the first 2 phases, the principle of center of mass and a neighborhood search technique are used to assign the n cities to the m salesmen. In the third phase, a TSP solver was used to generate an optimal tour to every salesman using its assigned cities in phase 2. The metaheuristic was tested using TSP benchmarks of different sizes. The obtained results showed almost optimal load balancing for all tested instances and optimal tours in term of total traveled distances. A conducted comparison study showed that the proposed metaheuristic outperforms a recently published clustering algorithm for the workload objective.



2020 ◽  
Vol 25 (3) ◽  
pp. 448-454
Author(s):  
José Andrés Chaves Osorio ◽  
Juan Bernardo Gómez Mendoza ◽  
Edward Andrés González Rios

This study is carried out in order to verify if the implementation of the concept of cooperative work among two agents, that use path planners A* to obtain the shortest path (previous work of the authors) is also valid when the cooperative strategy is applied using another path planner such as the so-called GBFS (Greedy Best First Search). In this sense, this paper shows a path planning strategy that combines the capabilities of two Agents each one with its own path planner GBFS (slightly different from each other) in order to obtain the shortest path. The comparisons between paths are made by analyzing the behavior and results obtained from the agents operating in different forms: (1) Working individually; (2) Working as a team (cooperating and exchanging information). The results show that in all analyzed situations are obtained shortest traveled distances when the path planners work as a cooperative team.



Science ◽  
2020 ◽  
Vol 369 (6508) ◽  
pp. 1255-1260 ◽  
Author(s):  
Darlan S. Candido ◽  
Ingra M. Claro ◽  
Jaqueline G. de Jesus ◽  
William M. Souza ◽  
Filipe R. R. Moreira ◽  
...  

Brazil currently has one of the fastest-growing severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2) epidemics in the world. Because of limited available data, assessments of the impact of nonpharmaceutical interventions (NPIs) on this virus spread remain challenging. Using a mobility-driven transmission model, we show that NPIs reduced the reproduction number from >3 to 1 to 1.6 in São Paulo and Rio de Janeiro. Sequencing of 427 new genomes and analysis of a geographically representative genomic dataset identified >100 international virus introductions in Brazil. We estimate that most (76%) of the Brazilian strains fell in three clades that were introduced from Europe between 22 February and 11 March 2020. During the early epidemic phase, we found that SARS-CoV-2 spread mostly locally and within state borders. After this period, despite sharp decreases in air travel, we estimated multiple exportations from large urban centers that coincided with a 25% increase in average traveled distances in national flights. This study sheds new light on the epidemic transmission and evolutionary trajectories of SARS-CoV-2 lineages in Brazil and provides evidence that current interventions remain insufficient to keep virus transmission under control in this country.



2020 ◽  
Author(s):  
Marc Peruzzetto ◽  
Clara Levy ◽  
Yannick Thiery ◽  
Gilles Grandjean ◽  
Anne Mangeney ◽  
...  

<p>The Prêcheur river is located to the West of Montagne Pelée, in the Northern part of Martinique island. For several decades it has produced numerous lahars that directly threaten the Prêcheur village, at the mouth of the river. In recent years, the most important lahars have been correlated to massive collapses of the Samperre cliff, 9 km upstream from the sea, that create a reservoir of loose material at the bottom of the cliff. In 2010, a lahar started from this reservoir, destroyed a bridge and inundated part of the Prêcheur village. A new major period of collapses of the Samperre cliff started on 2 January 2018, involving more than 4 × 10<sup>6</sup> m<sup>3</sup> of material. In the following days, intense rainfalls triggered several lahars that reached the Prêcheur village but remained confined in the river bed. Since then, lahars and collapses have continued to occur, even though their frequency has decreased with time and their intensity is smaller compared to the onset of the crisis. One single lahar overflowed the river bed on 22 February 2018 without significant impact on infrastructures.</p><p>In this study, we test different possible scenarios to model the first and most important phase of the collapse of the Samperre cliff, that occurred in early January 2018, with the shallow-water model SHALTOP. We constrain the collapse geometry with photogrammetric 3D models and LIDAR topographic surveys, acquired in 2010 and in late January 2018. We also consider an intermediate volume to take into account a possible retreat of the cliff face between 2010 and 2018. The modeled traveled distances are compared to field observations. Finally, we use geomorphological and geological observations to identify potentially unstable structures within the cliff, and model the associated collapses.</p><p>These simulations provide insights on the possible geometry (extent and depth) of the debris reservoir at the bottom of the cliff, after a major collapse episode. This is of prior importance in order to estimate the location and volume of future lahars. In order to investigate their dynamics, we model the major 2010 lahar, for which the initial debris reservoir volume is known (about 2 Mm<sup>3</sup>). We first simulate the progressive remobilization of the reservoir by water with the r.avaflow numerical code. In a second test, we impose instead a constant flow discharge upstream until the same volume has been released. We test different parameters to identify which ones have the most significant influence on the lahar travel time, from its initiation until it reaches the Prêcheur village.</p>







Sign in / Sign up

Export Citation Format

Share Document