scholarly journals Introduction and Analysis of Optimal Routing Algorithm in Benes Networks

2014 ◽  
Vol 42 ◽  
pp. 313-319 ◽  
Author(s):  
Abbas Karimi ◽  
Kiarash Aghakhani ◽  
Seyed Ehsan Manavi ◽  
Faraneh Zarafshan ◽  
S.A.R. Al-Haddad
Author(s):  
Dao Xuan Uoc

Zigbee wireless network built on IEEE 802.15.4 standard is becoming one of the most popular wireless networks in modern IoT devices. One of the disadvantages of Zigbee networks is the short transmission distance between devices. This paper focuses on researching and comparing routing algorithms in Zigbee networks, thereby building the optimal routing algorithm in the existing system. The paper’s objective is to form the basis for making Zigbee tree and mesh networks, which improves the transmission distance for Zigbee networks better than the star network.


2010 ◽  
Vol 40-41 ◽  
pp. 341-346
Author(s):  
Cai Xia Zhang ◽  
Liang Liang Zhuang ◽  
Xiang Dong Wang ◽  
Hai Wu Rong

This paper introduces the Adjacency Matrix at the very beginning, the least transfer between two nodes can be obtained by using the Adjacency Matrix, and then Z matrix is introduced to achieve optimal routing algorithm for public transit transfer and to obtain optimal route by using the “two-step-descending-proliferation” algorithm. Through the "two-step" approach, efficiency and feasibility of data processing was increased. The algorithm focus on multi-objective optimization - takes the least transfer, the least cost, the shortest time, and so on.


2013 ◽  
Vol 380-384 ◽  
pp. 1338-1341
Author(s):  
Yu Liu ◽  
Yi Xiao

in order to improve the efficiency of maze optimal routing problem, a GPU acceleration programming model OpenACC is used in this paper. By analyzing an algorithm which solves the maze problem based on ant colony algorithm, we complete the task mapping on the model. Though GPU acceleration, ant colony searching process was changed into parallel matrix operations. To decrease the algorithm accessing overhead and increase operating speed, data were rationally organized and stored for GPU. Experiments of different scale maze matrix show that the parallel algorithm greatly reduces the operation time. Speedup will be increased with the expansion of the matrix size. In our experiments, the maximum speedup is about 6.1. The algorithm can solve larger matrices with a high level of processing performance by adding efficient OpenACC instruction to serial code and organizing the data structure for parallel accessing.


Author(s):  
Jooyoung Kim

Demand responsive transport (DRT) is operated according to flexible routes, dispatch intervals, and dynamic demand, is attracting a lot of attention. The biggest characteristic of DRT service is that the vehicle routes and schedules are operated optimally based on real-time travel requests of using passengers without fixed operating schedules. Today, the smart-city era has arrived, particularly because of progress in the wireless communications technology and technology related to location information service and real-time passenger demands and requests, and services that change the vehicles’ operating schedules in real-time according to dynamic demand have attracted more attention. In this study, we analyze the effects of the DRT system to solve the first mile/last mile problem based on a proposed DRT routing algorithm considering real-time travel behavior. The algorithm is modified from the dynamic vehicle routing problem (DVRP), in which a DRT-based routing algorithm tends to minimize users’ cost and providers’ operation cost. So far, the DVRP has only been able to serve a single request per vehicle at a time. However, this needs to be extended for the purpose of DRT, wherein several passengers board a vehicle at the same time. The routing algorithm can serve multiple requests at a time and schedule picks ups, drop offs, and rides according to the requests and as calculated by the dispatch algorithm. The basic principle of routing is as follows. The DRT vehicle moves on an attractive path and picks up a passenger if boarding is requested, but it does not simply hang around as a DVRP would. In this step, if another DRT vehicle is present near another passenger, the vehicle that would minimize that passenger’s total travel time picks up the passenger. The optimal routing algorithm developed in this study is applied to the activity-based model; that is, a microscopic traffic demand estimation method is implemented through an activity-based model by using an open-source, activity-based model package called Multi-Agent Transport Simulation (MATSim). MATSim is used for the simulation, because it combines a multi-modal traffic flow simulation with a scoring model for agents, and it provides co-evolutionary algorithms that can alter agents’ daily routines. This process is applied to a type of mode choice and route choice repeatedly over several iterations until some form of user equilibrium has been reached. This study analyzed the feasibility of implementing the DRT service by analyzing the benefits for the users and cost of the operator from the effects of increasing public transportation use and providing personalized mobility service based on DRT implementation by the introduction of DRT will be analyzed according to the scale of DRT supply. Through the simulation, the DRT is expected to provide convenient, fast, and cost-effective mobility services to customers; provide an optimal vehicle scale to providers; and, ultimately, achieve a safe and efficient transportation system.


1992 ◽  
Vol 18 (12) ◽  
pp. 1393-1402 ◽  
Author(s):  
Cassilda Ribeiro ◽  
Didier El Baz

Sign in / Sign up

Export Citation Format

Share Document