A Spatio-Temporally Opportunistic Approach to Best-Start-Time Lagrangian Shortest Path

Author(s):  
Sarnath Ramnath ◽  
Zhe Jiang ◽  
Hsuan-Heng Wu ◽  
Venkata M. V. Gunturi ◽  
Shashi Shekhar
Keyword(s):  
IET Networks ◽  
2014 ◽  
Vol 3 (2) ◽  
pp. 143-149 ◽  
Author(s):  
Ravindra Sandaruwan Ranaweera ◽  
Islam Mohammad Kamrul ◽  
Eiji Oki
Keyword(s):  

2000 ◽  
Vol 5 (5) ◽  
pp. 4-5
Author(s):  
James B. Talmage ◽  
Leon H. Ensalada

Abstract Evaluators must understand the complex overall process that makes up an independent medical evaluation (IME), whether the purpose of the evaluation is to assess impairment or other care issues. Part 1 of this article provides an overview of the process, and Part 2 [in this issue] reviews the pre-evaluation process in detail. The IME process comprises three phases: pre-evaluation, evaluation, and postevaluation. Pre-evaluation begins when a client requests an IME and provides the physician with medical records and other information. The following steps occur at the time of an evaluation: 1) patient is greeted; arrival time is noted; 2) identity of the examinee is verified; 3) the evaluation process is explained and written informed consent is obtained; 4) questions or inventories are completed; 5) physician reviews radiographs or diagnostic studies; 6) physician records start time and interviews examinee; 7) physician may dictate the history in the presence of the examinee; 8) physician examines examinee with staff member in attendance, documenting negative, physical, and nonphysiologic findings; 9) physician concludes evaluation, records end time, and provides a satisfaction survey to examinee; 10) examinee returns satisfaction survey before departure. Postevaluation work includes preparing the IME report, which is best done immediately after the evaluation. To perfect the IME process, examiners can assess their current approach to IMEs, identify strengths and weaknesses, and consider what can be done to improve efficiency and quality.


Author(s):  
Achmad Fanany Onnilita Gaffar ◽  
Agusma Wajiansyah ◽  
Supriadi Supriadi

The shortest path problem is one of the optimization problems where the optimization value is a distance. In general, solving the problem of the shortest route search can be done using two methods, namely conventional methods and heuristic methods. The Ant Colony Optimization (ACO) is the one of the optimization algorithm based on heuristic method. ACO is adopted from the behavior of ant colonies which naturally able to find the shortest route on the way from the nest to the food sources. In this study, ACO is used to determine the shortest route from Bumi Senyiur Hotel (origin point) to East Kalimantan Governor's Office (destination point). The selection of the origin and destination points is based on a large number of possible major roads connecting the two points. The data source used is the base map of Samarinda City which is cropped on certain coordinates by using Google Earth app which covers the origin and destination points selected. The data pre-processing is performed on the base map image of the acquisition results to obtain its numerical data. ACO is implemented on the data to obtain the shortest path from the origin and destination point that has been determined. From the study results obtained that the number of ants that have been used has an effect on the increase of possible solutions to optimal. The number of tours effect on the number of pheromones that are left on each edge passed ant. With the global pheromone update on each tour then there is a possibility that the path that has passed the ant will run out of pheromone at the end of the tour. This causes the possibility of inconsistent results when using the number of ants smaller than the number of tours.


2020 ◽  
Vol 9 (10) ◽  
pp. 7803-7809 ◽  
Author(s):  
J. P. Praveena ◽  
N. S. Stalin ◽  
A. Rajkumar

Sign in / Sign up

Export Citation Format

Share Document