985 resultados para Urban transportation


Relevância:

100.00% 100.00%

Publicador:

Resumo:

4 p.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

18 p.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Dissertação de mestrado, Engenharia Informática, Faculdade de Ciências e Tecnologia, Universidade do Algarve, 2015

Relevância:

100.00% 100.00%

Publicador:

Resumo:

In this paper, we propose an algorithm for an upgrading arc median shortest path problem for a transportation network. The problem is to identify a set of nondominated paths that minimizes both upgrading cost and overall travel time of the entire network. These two objectives are realistic for transportation network problems, but of a conflicting and noncompensatory nature. In addition, unlike upgrading cost which is the sum of the arc costs on the path, overall travel time of the entire network cannot be expressed as a sum of arc travel times on the path. The proposed solution approach to the problem is based on heuristic labeling and exhaustive search techniques, in criteria space and solution space, respectively. The first approach labels each node in terms of upgrading cost, and deletes cyclic and infeasible paths in criteria space. The latter calculates the overall travel time of the entire network for each feasible path, deletes dominated paths on the basis of the objective vector and identifies a set of Pareto optimal paths in the solution space. The computational study, using two small-scale transportation networks, has demonstrated that the algorithm proposed herein is able to efficiently identify a set of nondominated median shortest paths, based on two conflicting and noncompensatory objectives.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

This paper proposes an alternative algorithm to solve the median shortest path problem (MSPP) in the planning and design of urban transportation networks. The proposed vector labeling algorithm is based on the labeling of each node in terms of a multiple and conflicting vector of objectives which deletes cyclic, infeasible and extreme-dominated paths in the criteria space imposing cyclic break (CB), path cost constraint (PCC) and access cost parameter (ACP) respectively. The output of the algorithm is a set of Pareto optimal paths (POP) with an objective vector from predetermined origin to destination nodes. Thus, this paper formulates an algorithm to identify a non-inferior solution set of POP based on a non-dominated set of objective vectors that leaves the ultimate decision to decision-makers. A numerical experiment is conducted using an artificial transportation network in order to validate and compare results. Sensitivity analysis has shown that the proposed algorithm is more efficient and advantageous over existing solutions in terms of computing execution time and memory space used.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

This paper proposes an efficient solution algorithm for realistic multi-objective median shortest path problems in the design of urban transportation networks. The proposed problem formulation and solution algorithm to median shortest path problem is based on three realistic objectives via route cost or investment cost, overall travel time of the entire network and total toll revenue. The proposed solution approach to the problem is based on the heuristic labeling and exhaustive search technique in criteria space and solution space of the algorithm respectively. The first labels each node in terms of route cost and deletes cyclic and infeasible paths in criteria space imposing cyclic break and route cost constraint respectively. The latter deletes dominated paths in terms of objectives vector in solution space in order to identify a set of Pareto optimal paths. The approach, thus, proposes a non-inferior solution set of Pareto optimal paths based on non-dominated objective vector and leaves the ultimate decision to decision-makers for purpose specific final decision during applications. A numerical experiment is conducted to test the proposed algorithm using artificial transportation network. Sensitivity analyses have shown that the proposed algorithm is advantageous and efficient over existing algorithms to find a set of Pareto optimal paths to median shortest paths problems.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

The purpose of this paper is to describe the benefits of sugar cane ethanol in Brazil, appointing the productivity of this type of fuel based on hectares of plantation, its carbon dioxide cycle and the contribution to reduce the greenhouse effect. In the following step the uses of ethanol for hydrogen production by steam reforming is analyzed and some comparison with natural gas steam reforming is performed. The sugar cane industry in Brazil, in a near future, in the hydrogen era, could be modified according to our purpose, since besides the production of sugar, and ethylic and anhydric alcohol, Brazilian sugar cane industry will also be able to produce biohydrogen.Fuel cells appear like a promising technology for energy generation. Among several technologies in the present, the PEMFC (proton exchange membrane fuel cell) is the most appropriate for vehicles application, because it combines durability, high power density, high efficiency, good response and it works at relatively low temperatures. Besides that it is easy to turn it on and off and it is able to support present vibration in vehicles. A PEMFC's problem is the need of noble catalysts like platinum. Another problem is that CO needs to be in low concentration, requiring a more clean hydrogen to avoid fuel cell deterioration.One part of this paper was developed in Stockholm, where there are some buses within the CUTE (clean urban transport for Europe) project that has been in operation with FC since January 2004. Another part was developed in Guaratingueta, Brazil. Brazil intends to start up a program of FC buses. As conclusion, this paper shows the economical analysis comparing buses moved by fuel cells using hydrogen by different kinds of production. Electrolyze with wind turbine, natural gas steam reforming and ethanol steam reforming. (C) 2009 Elsevier Ltd. All rights reserved.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

After nearly 80 years since the construction of its core, represented today by the city's central area, Londrina, located in the state of Parana, has the appearance of a new city but its features and trends of planning policies depict the bad examples of Brazilian cities. With a booming urban growth, from north to south of the county, the urban interstices represented by big voids in the middle of the city created speculation and the concept of an ideal city slowly disappeared. With a metropolitan appearance and, at the same time, with small town aspects, Londrina stands out as an automobile-oriented city, a fact that has impacted the livelihood of the population, generating environmental impacts for all social classes. This paper discusses how the form of occupation in Londrina, characterized by the sprawl phenomenon and its relation to car preference as a mode of transportation has generated urban environmental impacts. It was concluded that the choice of using cars in Londrina, as well in other medium-sized Brazilian cities studied by the comparative method, has increased and has generated bottlenecks in traffic. As a consequence, there is a constant expropriation of properties for widening roads and at the same time, the presence of various densities and urban voids that form an uneven urban space and an obstacle to efficient urban planning. © 2012 WIT Press.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Mode of access: Internet.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Mode of access: Internet.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Mode of access: Internet.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Mode of access: Internet.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Transportation Department, Office of University Research, Washington, D.C.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Federal Highway Administration, Washington, D.C.