983 resultados para intermodal transportation problem
Resumo:
Governments are challenged by the need to ensure that ageing populations stay active and engaged as they age. Therefore, it is critical to investigate the role of mobility in older people's engagement in out-of-home activities, and to identify the experiences they have within their communities. This research investigates the use of transportation by older people and its implications for their out-of-home activities within suburban environments. The qualitative, mixed-method approach employs data collection methods which include a daily travel diary (including a questionnaire), Global Positioning System (GPS) tracking and semi-structured interviews with older people living in suburban environments in Brisbane, Australia. Results show that older people are mobile throughout the city, and their car provides them with that opportunity to access desired destinations. This ability to drive allows older people to live independently and to assist others who do not drive, particularly where transport alternatives are not as accessible. The ability to transport goods and other people is a significant advantage of the private car over other transport options. People with no access to private transportation who live in low-density environments are disadvantaged when it comes to participation within the community. Further research is needed to better understand the relationship between transportation and participation within the community environment, to assist policy makers and city and transportation planners to develop strategies for age-friendly environments within the community.
Resumo:
Addressing the Crew Scheduling Problem (CSP) in transportation systems can be too complex to capture all details. The designed models usually ignore or simplify features which are difficult to formulate. This paper proposes an alternative formulation using a Mixed Integer Programming (MIP) approach to the problem. The optimisation model integrates the two phases of pairing generation and pairing optimisation by simultaneously sequencing trips into feasible duties and minimising total elapsed time of any duty. Crew scheduling constraints in which the crew have to return to their home depot at the end of the shift are included in the model. The flexibility of this model comes in the inclusion of the time interval of relief opportunities, allowing the crew to be relieved during a finite time interval. This will enhance the robustness of the schedule and provide a better representation of real-world conditions.
Resumo:
Locomotion and autonomy in humanoid robots is of utmost importance in integrating them into social and community service type roles. However, the limited range and speed of these robots severely limits their ability to be deployed in situations where fast response is necessary. While the ability for a humanoid to drive a vehicle would aide in increasing their overall mobility, the ability to mount and dismount a vehicle designed for human occupants is a non-trivial problem. To address this issue, this paper presents an innovative approach to enabling a humanoid robot to mount and dismount a vehicle by proposing a simple mounting bracket involving no moving parts. In conjunction with a purpose built robotic vehicle, the mounting bracket successfully allowed a humanoid Nao robot to mount, dismount and drive the vehicle.
Resumo:
Access to transport systems and the connection to such systems provided to essential economic and social activities are critical to determine households' transportation disadvantage levels. In spite of the developments in better identifying transportation disadvantaged groups, the lack of effective policies resulted in the continuum of the issue as a significant problem. This paper undertakes a pilot case investigation as test bed for a new approach developed to reduce transportation policy shortcomings. The approach, ‘disadvantage-impedance index’, aims to ease transportation disadvantages by employing representative parameters to measure the differences between policy alternatives run in a simulation environment. Implemented in the Japanese town of Arao, the index uses trip-making behaviour and resident stated preference data. The results of the index reveal that even a slight improvement in accessibility and travel quality indicators makes a significant difference in easing disadvantages. The index, integrated into a four-step model, proves to be highly robust and useful in terms of quick diagnosis in capturing effective actions, and developing potentially efficient policies.
Resumo:
With the installation by the Pacific Electric Railway of a bus system in Pasadena to supplant most of its trolley lines, the problem of the comparison of the costs of the two systems naturally presented itself. The study here undertaken was originally started as just a comparison of the motor bus and Birney Safety Car, but as the work progressed it seemed advisable to include the trolley bus as well - a method of transportation that is comparatively new as far as development is concerned, but which seems to be finding increasing favor in the East.
Resumo:
Multi-Agent Reinforcement Learning (MARL) algorithms face two main difficulties: the curse of dimensionality, and environment non-stationarity due to the independent learning processes carried out by the agents concurrently. In this paper we formalize and prove the convergence of a Distributed Round Robin Q-learning (D-RR-QL) algorithm for cooperative systems. The computational complexity of this algorithm increases linearly with the number of agents. Moreover, it eliminates environment non sta tionarity by carrying a round-robin scheduling of the action selection and execution. That this learning scheme allows the implementation of Modular State-Action Vetoes (MSAV) in cooperative multi-agent systems, which speeds up learning convergence in over-constrained systems by vetoing state-action pairs which lead to undesired termination states (UTS) in the relevant state-action subspace. Each agent's local state-action value function learning is an independent process, including the MSAV policies. Coordination of locally optimal policies to obtain the global optimal joint policy is achieved by a greedy selection procedure using message passing. We show that D-RR-QL improves over state-of-the-art approaches, such as Distributed Q-Learning, Team Q-Learning and Coordinated Reinforcement Learning in a paradigmatic Linked Multi-Component Robotic System (L-MCRS) control problem: the hose transportation task. L-MCRS are over-constrained systems with many UTS induced by the interaction of the passive linking element and the active mobile robots.
Resumo:
The rapid proliferation and extensive spread of water hyacinth Eichhornia crassipes (Mart) Solms in the highland lakes of the Nile Basin within less than 15 years of introduction into the basin in the 1980s pauses potential environmental and social economic menace if the noxious weed is not controlled soon. The water weed has spread all round Lake Victoria and, in Uganda where infes tation is mos t severe, water hyacinth estimated at 1,330,000 ton smothers over 2,000 ha of the lakeshore (August,1994). Lake Kyoga which already constantly supplies River Nile with the weed is infested with over 570 ha, while over 80% of the river course in Uganda is fringed on either side with an average width of about 5m of water hyacinth. As the impact of infestation with water hyacinth on water quality and availability, transportation by water, fishing activities, fisheries ecology, hydro-power generation etc becomes clear in Uganda, serious discussion is under way on how to control and manage the noxious weed. This paper pauses some of the questions being asked regarding the possible application of mechanical and chemical means to control the water weed.Uganda has already initiated the use of biological control of water hyacinth on Lake Kyoga with a strategy to use two weevils namely Neochetinabruchi and Neochetina eichhorniae. The strategy to build capacity and infrastructure for mass multiplication and deployment of biological control of the weevils in the field developed in Uganda by the Fisheries Research Insti tu te (FIRI) and the Namulonge Agricultural and Animal production Research Insti tute (NAARI) is proposed in outline for evaluation. Plans to deploy this strategy on lake Kyoga are under way
Resumo:
The route planning problem for an order in freight transportation involves the selection of the best route for its transportation given a set of options that the network can offer. In its adaptive (or dynamic) version, the problem deals with the planning of a new route for an order while it is actually in transit typically because part or all of its pre-selected route is blocked or disrupted. In the intelligent product approach we are proposing, an order would be capable of identifying and evaluating such new routes in an automated manner and choosing the most preferable one without the intervention of humans. Because such approaches seek to mirror (and then automate) human decision making, in this paper we seek to identify new ways for dynamic route planning in industrial logistics inspired by the way people make similar decisions about their journey when they travel in multi-modal networks. We propose a new simulation game as a methodological tool for capturing their travel behaviour and we use it in this study. The results show that a simulation game can be used for capturing strategies and tactics of travellers and that intelligent products can provide a proper platform for the usage of such strategies in freight logistics. © 2012 IEEE.
Resumo:
Plakhov, A.Y., (2004) 'Precise solutions of the one-dimensional Monge-Kantorovich problem', Sbornik: Mathematics 195(9) pp.1291-1307 RAE2008
Resumo:
The paper considers a problem of scheduling n jobs in a two-machine open shop to minimise the makespan, provided that preemption is not allowed and the interstage transportation times are involved. In general, this problem is known to be NP-hard. We present a linear time algorithm that finds an optimal schedule if no transportation time exceeds the smallest of the processing times. We also describe an algorithm that creates a heuristic solution to the problem with job-independent transportation times. Our algorithm provides a worst-case performance ratio of 8/5 if the transportation time of a job depends on the assigned processing route. The ratio reduces to 3/2 if all transportation times are equal.
Resumo:
This paper addresses the problem of optimally locating intermodal freight terminals in Serbia. To solve this problem and determine the effects of the resulting scenarios, two modeling approaches were combined. The first approach is based on multiple-assignment hub-network design, and the second is based on simulation. The multiple-assignment p-hub network location model was used to determine the optimal location of intermodal terminals. Simulation was used as a tool to estimate intermodal transport flow volumes, due to the unreliability and unavailability of specific statistical data, and as a method for quantitatively analyzing the economic, time, and environmental effects of different scenarios of intermodal terminal development. The results presented here represent a summary, with some extension, of the research realized in the IMOD-X project (Intermodal Solutions for Competitive Transport in Serbia).
Resumo:
O transporte marítimo e o principal meio de transporte de mercadorias em todo o mundo. Combustíveis e produtos petrolíferos representam grande parte das mercadorias transportadas por via marítima. Sendo Cabo Verde um arquipelago o transporte por mar desempenha um papel de grande relevância na economia do país. Consideramos o problema da distribuicao de combustíveis em Cabo Verde, onde uma companhia e responsavel por coordenar a distribuicao de produtos petrolíferos com a gestão dos respetivos níveis armazenados em cada porto, de modo a satisfazer a procura dos varios produtos. O objetivo consiste em determinar políticas de distribuicão de combustíveis que minimizam o custo total de distribuiçao (transporte e operacões) enquanto os n íveis de armazenamento sao mantidos nos n íveis desejados. Por conveniencia, de acordo com o planeamento temporal, o prob¬lema e divido em dois sub-problemas interligados. Um de curto prazo e outro de medio prazo. Para o problema de curto prazo sao discutidos modelos matemáticos de programacao inteira mista, que consideram simultaneamente uma medicao temporal cont ínua e uma discreta de modo a modelar multiplas janelas temporais e taxas de consumo que variam diariamente. Os modelos sao fortalecidos com a inclusão de desigualdades validas. O problema e então resolvido usando um "software" comercial. Para o problema de medio prazo sao inicialmente discutidos e comparados varios modelos de programacao inteira mista para um horizonte temporal curto assumindo agora uma taxa de consumo constante, e sao introduzidas novas desigualdades validas. Com base no modelo escolhido sao compara¬das estrategias heurísticas que combinam três heur ísticas bem conhecidas: "Rolling Horizon", "Feasibility Pump" e "Local Branching", de modo a gerar boas soluçoes admissíveis para planeamentos com horizontes temporais de varios meses. Finalmente, de modo a lidar com situaçoes imprevistas, mas impor¬tantes no transporte marítimo, como as mas condicões meteorológicas e congestionamento dos portos, apresentamos um modelo estocastico para um problema de curto prazo, onde os tempos de viagens e os tempos de espera nos portos sao aleatórios. O problema e formulado como um modelo em duas etapas, onde na primeira etapa sao tomadas as decisões relativas as rotas do navio e quantidades a carregar e descarregar e na segunda etapa (designada por sub-problema) sao consideradas as decisoes (com recurso) relativas ao escalonamento das operacões. O problema e resolvido por um metodo de decomposto que usa um algoritmo eficiente para separar as desigualdades violadas no sub-problema.
Resumo:
Dissertação de mestrado, Engenharia Informática, Faculdade de Ciências e Tecnologia, Universidade do Algarve, 2015
Resumo:
The best places to locate the Gas Supply Units (GSUs) on a natural gas systems and their optimal allocation to loads are the key factors to organize an efficient upstream gas infrastructure. The number of GSUs and their optimal location in a gas network is a decision problem that can be formulated as a linear programming problem. Our emphasis is on the formulation and use of a suitable location model, reflecting real-world operations and constraints of a natural gas system. This paper presents a heuristic model, based on lagrangean approach, developed for finding the optimal GSUs location on a natural gas network, minimizing expenses and maximizing throughput and security of supply.The location model is applied to the Iberian high pressure natural gas network, a system modelised with 65 demand nodes. These nodes are linked by physical and virtual pipelines – road trucks with gas in liquefied form. The location model result shows the best places to locate, with the optimal demand allocation and the most economical gas transport mode: by pipeline or by road truck.