scholarly journals Optical tomography based on shortest-path model for diffuse surface object

2018 ◽  
Vol 10 (1) ◽  
Author(s):  
Takafumi Iwaguchi ◽  
Takuya Funatomi ◽  
Takahito Aoto ◽  
Hiroyuki Kubo ◽  
Yasuhiro Mukaigawa
Keyword(s):  
Shortest Path ◽  
Optical Tomography ◽  
Path Model ◽  
Diffuse Surface ◽  
Surface Object

Research on Multimodal Transport Shortest Path Based on the Genetic Algorithm

2015 ◽  
Vol 744-746 ◽  
pp. 1813-1816
Author(s):  
Shou Wen Ji ◽  
Shi Jin ◽  
Kai Lv
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Shortest Path ◽  
Optimal Solution ◽  
Path Model ◽  
Time Analysis ◽  
Multimodal Transportation ◽  
Network Time ◽  
Multimodal Transport ◽  
Crossover And Mutation

This paper focuses on the research of multimodal transportation optimization model and algorithm, designs an intermodal shortest time path model and gives a solution to algorithm, constructs a multimodal transport network time analysis chart. By using genetic algorithms, the transportation scheme will be optimized. And based on each path’s code, the population will be evolved to obtain the optimal solution by using crossover and mutation rules.

Shortest Path of Emergency Vehicles under Uncertain Urban Traffic Conditions

1996 ◽  
Vol 1560 (1) ◽  
pp. 34-39 ◽  
Author(s):  
Y. Hadas ◽  
A. Ceder
Keyword(s):  
Stochastic Model ◽  
Shortest Path ◽  
Deterministic Model ◽  
Relevant Information ◽  
Urban Traffic ◽  
Path Model ◽  
Emergency Vehicle ◽  
Stochastic Shortest Path ◽  
Emergency Event ◽  
Security Event

Emergency vehicle characteristics amplify the stochastic nature of transportation networks. The emergency vehicle operator who aims at reaching his destination in the fastest time possible cannot rely on “average” data alone. Each emergency event has its own implications (accident, fire, injury, security event, etc.) and must be dealt with as an individual incident. The need to deal with each event separately led, first, to the development of a stochastic shortest-path algorithm that refers to the dynamic traffic flow and then to a presentation method of the results so as to incorporate the operator's accumulated knowledge. The whole algorithm is based on a K shortest-path model incorporated with a simulation element in order to consider stochastic characteristics. The stochastic model uses a new definition, namely, the probability that a given path is the shortest. In contrast to a deterministic model, which yields a single shortest path, the stochastic model yields a set of paths, each having a different probability. This set of paths, along with relevant information for the emergency vehicle, is presented in a particular way to the operator. In addition, it was found that the arrangement of information is vital to the selection of the most promising path.

A Stochastic Shortest Path Model to Minimize the Reading Time in DFSA-Based RFID Systems

2013 ◽  
Vol 17 (2) ◽  
pp. 341-344 ◽  
Author(s):  
Juan J. Alcaraz ◽  
Javier Vales-Alonso ◽  
Esteban Egea-Lopez ◽  
Joan Garcia-Haro
Keyword(s):  
Shortest Path ◽  
Reading Time ◽  
Path Model ◽  
Stochastic Shortest Path ◽  
Rfid Systems

Optimizing Public Transit Quality and System Access: The Multiple-Route, Maximal Covering/Shortest-Path Problem

2005 ◽  
Vol 32 (2) ◽  
pp. 163-178 ◽  
Author(s):  
Changshan Wu ◽  
Alan T Murray
Keyword(s):  
Service Quality ◽  
Shortest Path ◽  
Public Transit ◽  
The United States ◽  
Path Model ◽  
Transit System ◽  
Transit Service ◽  
Maximal Covering ◽  
Transit Ridership ◽  
Transit Agencies

Public transit service is a promising travel mode because of its potential to address urban sustainability. However, current ridership of public transit is very low in most urban regions—particularly those in the United States. Low transit ridership can be attributed to many factors, among which poor service quality is key. Transit service quality may potentially be improved by decreasing the number of service stops, but this would be likely to reduce access coverage. Improving transit service quality while maintaining adequate access coverage is a challenge facing public transit agencies. In this paper we propose a multiple-route, maximal covering/shortest-path model to address the trade-off between public transit service quality and access coverage in an established bus-based transit system. The model is applied to routes in Columbus, Ohio. Results show that it is possible to improve transit service quality by eliminating redundant or underutilized service stops.

scholarly journals Multi-Objective Shortest Path Model for Optimal Route between Commercial Cities on America

2019 ◽  
pp. 1394-1403
Author(s):  
Mohammed S. Ibrahim
Keyword(s):  
Shortest Path ◽  
Transportation Network ◽  
Optimal Path ◽  
Path Model ◽  
Multi Objective ◽  
Proposed Model ◽  
Shortest Distance ◽  
Lexicographic Method ◽  
Package Program ◽  
Us Cities

The traditional shortest path problem is mainly concerned with identifying the associated paths in the transportation network that represent the shortest distance between the source and the destination in the transportation network by finding either cost or distance. As for the problem of research under study it is to find the shortest optimal path of multi-objective (cost, distance and time) at the same time has been clarified through the application of a proposed practical model of the problem of multi-objective shortest path to solve the problem of the most important 25 commercial US cities by travel in the car or plane. The proposed model was also solved using the lexicographic method through package program Win-QSB 2.0 for operational research applications.

scholarly journals Installation and Dispatch of the Traffic Patrol Service Platform

2016 ◽  
Vol 6 (1) ◽  
pp. 95
Author(s):  
Tang Jiahui ◽  
Zhang Yuanbiao ◽  
Peng Churu ◽  
Huang Xinxin
Keyword(s):  
Integer Programming ◽  
Response Time ◽  
Mathematical Models ◽  
Shortest Path ◽  
Large Scale ◽  
Real Data ◽  
Path Model ◽  
Multiple Objective ◽  
Service Platform ◽  
Present Distribution

In this paper, we construct three mathematical models to install and dispatch the traffic patrol service platform properly based on the real data of a certain city. Firstly, we build the shortest path model based on the Floyd algorithm to determine the jurisdictional of each platform. Then, we designed the dispatch model combined with 0-1 integer programming and the Hungarian algorithm to find the dispatching schemes when coming across large-scale emergencies. Lastly, we build the multiple-objective location model to optimize the present distribution situation of the traffic patrol platforms considering the workload differences among these existing platforms and overlong response time in some places.

Comprehensive Optimization Model of Stage Development about Marshalling Stations

2011 ◽  
Vol 97-98 ◽  
pp. 485-488
Author(s):  
Yang Wang ◽  
Li Juan Wang ◽  
Tian Wei Zhang ◽  
Qing Dong Zhou
Keyword(s):  
Objective Function ◽  
Shortest Path ◽  
Optimization Model ◽  
Development Process ◽  
Decision Makers ◽  
Path Model ◽  
Planning Model ◽  
Railway Freight ◽  
Total Investment ◽  
Stage Development

With the changes of composition about railway freight and car, the development process from small to big was experienced to many marshalling stations. Various possible schemes were faced when stations were expanded, how to choose so as to minimize the total investment for all stages was concerned by the decision makers. Based on the actual development, the dynamic planning model was built. Minimizing the total investment in the design stages was the objective function, subject to three groups: first is the sorting capacity was to meet the demand, second was the utilization of sorting capacity was not too low, the last was the capacity was larger and larger. Taking into account the difficulty of solving model directly, this model is transformed into shortest path model. The specific solution is expounded through an example application, the use area of the model is described in the end.

scholarly journals Optimizing meta-slots for nonblocking elastic optical switching networks

2021 ◽  
Vol 7 (3) ◽  
pp. 046-061
Author(s):  
Satoru Ohta
Keyword(s):  
Shortest Path ◽  
Communication Systems ◽  
Optical Switching ◽  
Bin Packing ◽  
Optical Network ◽  
Path Model ◽  
Switching Network ◽  
Switching Networks ◽  
Elastic Optical Network ◽  
Optical Switching Networks

Elastic optical network is a promising technology for building flexible and wideband communication systems. This technology features the frequency slot unit (FSU) concept, which defines the bandwidth unit in the frequency domain. The utilization of a specified number of consecutive FSUs allows the bandwidth to be flexibly assigned to a data stream. For a successful elastic optical network operation, the use of nonblocking optical switching networks is indispensable. This paper focuses on two previously proposed W-S-W switching network architectures, namely, WSW1 and WSW2. With regard to WSW1, a previous study elucidated that the hardware complexity, which is evaluated by the number of FSUs, decreases by employing the meta-slot scheme. A meta-slot is a frequency range containing one or more FSUs. Although its effectiveness depends on the sizes of meta-slot classes, the previous study did not present how to optimize the meta-slot class sizes. Moreover, the employment of meta-slots was not considered for WSW2 in the previous study. This paper investigates the optimization of meta-slot class sizes and demonstrates that such optimization is modeled as the shortest path problem. For WSW1, the meta-slot scheme optimized by the shortest path model is compared with the previously reported nonblocking conditions. The result confirms the superiority of the optimized meta-slot scheme. For WSW2, the assignment of meta-slots among S-switches is also essential. The paper models the assignment of meta-slots as a bin-packing problem. Thus, the near-optimal assignment can be obtained by a known bin-packing heuristic. For WSW2, the number of S-switches is evaluated for the optimized meta-slot scheme and the previously known nonblocking conditions. The result confirms that the meta-slot scheme is advantageous for WSW2 as well as for WSW1.

Sign in / Sign up

Export Citation Format

Share Document