نتایج جستجو برای: multimodal multi criteria route planning

تعداد نتایج: 972590  

2007
Mohit Virendra Arunn Krishnamurthy Krishnan Narayanan Shambhu Upadhyaya Kevin Kwiat

Current multipath protocols for Multi-Hop Wireless Networks (MWNs) use hop-count as the default route selection criteria. Route selection should also consider network and link conditions. We propose a networkenvironment-aware trust-based route selection framework for MWNs that makes informed and adaptive route-selection decisions. A node quantifies trust values for its neighboring nodes and for...

2017
Aysun Mutlu Yasanur Kayikci

Purpose: Multimodal freight transport developed in the transportation sector as an alternative to unimodal transport faced with the challenges brought by the growing global demand for transporting goods. Multimodal transport is the transportation of goods using at least two modes of transport, usually door-to-door. The common transport modes include railways, maritime routes, and the roads. Whe...

2010
Björn Zenker Bernd Ludwig

In this paper, we describe ROSE (Routing Service), an application for mobile phones, which suggests the user events and locations and guides him to them, using the public transport system. It determines the best possible transport link and accompanies passengers throughout their entire journey. Further, it reacts in real time to delays in the public transport system and calculates alternative r...

2012
Gernot Veit Batz Robert Geisberger Dennis Luxen Peter Sanders Roman Zubkov

We describe an algorithmic framework for lossless compression of route descriptions. This is useful for hybrid route planning where routes are computed by a server and then transmitted to a client device in a car using some mobile radio communication where bandwidth may be low. Compressed routes are represented by only a few via nodes which are the connection points when the route is decomposed...

1999
Charles B. McVey David P. Clements Barton C. Massey Andrew J. Parkes

We consider the common problem of calculating routes from a starting point to a destination through a given space. This process typically involves discretizing the navigational space into a graph of intermediate waypoints linked together through transitions. A search for a solution that fits desired criteria can then be performed. Typical criteria include: minimum distance, minimum transit time...

2003
INGRID FLINSENBERG JOHAN LUKKIEN

We investigate fast optimum route planning in large, real-world road networks for car navigation systems. We show how graph partitioning can be used to increase the speed of planning optimum routes. Creating a graph partition with future route planning in mind leads to a non-standard graph partitioning problem. In particular, the quality of a partition, indicated by the objective value, is assu...

Journal: :Computers & Chemical Engineering 2013
Roni F. Banaszewski Lúcia Valéria Ramos de Arruda Jean Marcelo Simão Cesar Augusto Tacla Ana Paula F. D. Barbosa-Póvoa Susana Relvas

The transportation planning of oil products in Brazil’s multimodal network is a complex problem that involves various negotiations between decentralized entities in order to agree on which products to transfer, their amounts, and the allocation of shared resources. Due to such complexity, there is a clear need for a decision support tool. This paper presents a model for solving this problem bas...

2015
Isha Sehgal Sohan Garg

In this paper, we present the optimized routing technique for mobile ad hoc network based on the Hopfield neural network and mobile agent technology with primary goal to find an optimal route. Mobile agent technique is used to share the information of network conditions. Here, we realized the proposed routing technique through two independent methods. They are both based on the Hopfield neural ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید