Um die anderen Arten von Veröffentlichungen zu diesem Thema anzuzeigen, folgen Sie diesem Link: Route based.
Zeitschriftenartikel zum Thema „Route based“
Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an
Machen Sie sich mit Top-50 Zeitschriftenartikel für die Forschung zum Thema "Route based" bekannt.
Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.
Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.
Sehen Sie die Zeitschriftenartikel für verschiedene Spezialgebieten durch und erstellen Sie Ihre Bibliographie auf korrekte Weise.
1
Zhanabaev, Z. Zh. „CLUSTER ROUTER BASED ON ECCENTRICITY“. Eurasian Physical Technical Journal 19, Nr. 3 (41) (22.09.2022): 84–90. http://dx.doi.org/10.31489/2022no3/84-90.
Der volle Inhalt der QuelleAnnotation:
In this paper, a cluster router based on eccentricity was worked out, related to the field of telecommunications, especially, to the field of message transmission. Messages in this router are transmitted as packets along the route specified in it between devices connected to the network. Each node in this network is assigned a unique address, thanks towhich routing can be accelerated. Each router forms a routing map, thanks to the calculated eccentricity of nodes, with which the physical route of the packet is selected at the logical address of the cluster. In addition, the routing map is stored in the register and non-volatile memory of the device to prevent information loss. To analyze this cluster device, a fractal analysis of the UV-flower model network was carried out and the information dimensions of Tsallis and Renyi were calculated.
2
Jing, Weiwei, Xiangdong Xu und Yichao Pu. „Route Redundancy-Based Network Topology Measure of Metro Networks“. Journal of Advanced Transportation 2019 (03.07.2019): 1–12. http://dx.doi.org/10.1155/2019/4576961.
Der volle Inhalt der QuelleAnnotation:
The metro system plays a very important role in the urban multimodal transportation system, yet it is susceptible to accidents. A well-designed metro system needs to provide alternative routes to travellers both in the disruptive events and the normal operating conditions for providing rerouting opportunities and balancing crowded lines. This paper provides a new dimension of assessing metro network performance—travellers’ route redundancy (or route diversity), which is defined as the number of behaviourally effective routes between each origin-destination (O-D) pair in the network. The route redundancy of metro network is evaluated by statistical indicators of the distribution of the O-D-level number of effective routes. Compared with the existing connectivity and accessibility measures of topology network performance, route redundancy is also based on the topology network, but it takes the travellers’ route choice into consideration. Specifically, the effective routes between each O-D pair would provide disaggregated information from the travellers’ perspective. Case studies in four metropolises in the world, i.e., Shanghai, Beijing, London, and Tokyo, are conducted to examine the predisaster preparedness of the four metro networks explicitly from the perspective of route redundancy. The results indicate that the London metro network has the best route redundancy performance in terms of the statistical indicators of the distribution of the O-D level number of effective routes. Furthermore, the results of route redundancy are compared with typical measures of topology network performance in terms of measuring connectivity and accessibility of metro networks. Their differences are attributed to the fact that the route redundancy measure considers the travellers’ O-D-level route choice beyond the pure network topology and the shortest path considerations of the existing measures. The route redundancy proposed in this paper could assist in evaluating the predisaster preparedness of current or planning metro networks from O-D level to network level.
3
Han, Yan, Hongzhi Guan und Jiaying Duan. „Tour Route Multiobjective Optimization Design Based on the Tourist Satisfaction“. Discrete Dynamics in Nature and Society 2014 (2014): 1–8. http://dx.doi.org/10.1155/2014/603494.
Der volle Inhalt der QuelleAnnotation:
The question prompted is how to design the tour route to make the tourists get the maximum satisfactions considering the tourists’ demand. The influence factors of the tour route choices of tourists were analyzed and tourists’ behavior characteristics and psychological preferences were regarded as the important influence factors based on the tourist behavioral theories. A questionnaire of tourists’ tour route information and satisfaction degree was carried out. Some information about the scene spot and tourists demand and tour behaviors characteristic such as visit frequency, number of attractions visited was obtained and analyzed. Based on the convey datum, tour routes multiobjective optimization functions were prompted for the tour route design regarding the maximum satisfaction and the minimum tour distance as the optimal objective. The available routes are listed and categorized. Based on the particle swarm optimization model, the priorities of the tour route are calculated and finally the suggestion depth tour route and quick route tour routes are given considering the different tour demands of tourists. The results can offer constructive suggestions on how to design tour routes on the part of tourism enterprises and how to choose a proper tour route on the part of tourists.
4
Wang, Ren, Mengchu Zhou, Kaizhou Gao, Ahmed Alabdulwahab und Muhyaddin J. Rawa. „Personalized Route Planning System Based on Driver Preference“. Sensors 22, Nr. 1 (21.12.2021): 11. http://dx.doi.org/10.3390/s22010011.
Der volle Inhalt der QuelleAnnotation:
At present, most popular route navigation systems only use a few sensed or measured attributes to recommend a route. Yet the optimal route considered by drivers needs be based on multiple objectives and multiple attributes. As a result, these existing systems based on a single or few attributes may fail to meet such drivers’ needs. This work proposes a driver preference-based route planning (DPRP) model. It can recommend an optimal route by considering driver preference. We collect drivers’ preferences, and then provide a set of routes for their choice when they need. Next, we present an integrated algorithm to solve DPRP, which speeds up the search process for recommending the best routes. Its computation cost can be reduced by simplifying a road network and removing invalid sub-routes. Experimental results demonstrate its effectiveness.
5
Hu, Wen-Chen, Naima Kaabouch, Hung-Jen Yang und S. Hossein Mousavinezhad. „Route Anomaly Detection Using a Linear Route Representation“. Journal of Computer Networks and Communications 2012 (2012): 1–12. http://dx.doi.org/10.1155/2012/675605.
Der volle Inhalt der QuelleAnnotation:
A location-based service is a service based on the geographical position of a mobile handheld device like a smartphone. This research proposes location-based research, which uses location information to find route anomalies, a common problem of daily life. For example, an alert should be generated when a deliveryman does not follow his regular route to make deliveries. Different kinds of route anomalies are discussed and various methods for detecting the anomalies are proposed in this paper. The proposed method based on a linear route representation finds the matched routes from a set of stored routes as the current route is entered location by location. Route matching is made easy by comparing the current location to linear routes. An alert is generated when no matched routes exist. Preliminary experimental results show the proposed methods are effective and easy to use.
6
Khusnandar, Wahyudi, Fransiscus Ati Halim und Felix Lokananta. „Design of TTL Based Routing Algorithm on UTAR Network on Chip Communication Architecture“. International Journal of New Media Technology 5, Nr. 1 (05.07.2018): 54–57. http://dx.doi.org/10.31937/ijnmt.v5i1.738.
Der volle Inhalt der QuelleAnnotation:
XY adaptive routing protocol is a routing protocol used on UTAR NoC communication architecture. This routing algorithm adapts shrotest-path first algorithm, which will forward will not be able to work optimally if the closest route no longer have enough bandwidth to continue the packet. Packet will be stored inside the router and forwarded to the nearest router when closest route has enough bandwidth. This paper suggest TTL based routing algorithm to resolve this issue. TTL based routing algorithm adapts XY adaptive routing protocol by adding several parameters on RTL UTAR NoC and additional bit in each packet sent by router. This additional bit and parameter will be used by TTL based algorithm as additional factors in choosing alternative routes inside the communication architecture. Use of TTL on TTL based routing different from use of TTL on communication network. Packets that carry TTL value that equal to Maximum TTL will be route using XY adaptive routing protocol. TTL based routing algorithm has shown better performance compared to XY adaptive routing on some of the experiment done using MSCL NoC Traffic Pattern Suite. This research also proves that TTL based routing algorithm cannot work optimally on small-scaled architecture.
7
Hendrawan, Hendra. „Change route preferences based on temporary migration route condition information“. MEDIA KOMUNIKASI TEKNIK SIPIL 26, Nr. 1 (30.07.2020): 17–25. http://dx.doi.org/10.14710/mkts.v26i1.25987.
Der volle Inhalt der QuelleAnnotation:
Mudik is an annual community activity in Indonesia that is carried out simultaneously and in a short time. The government has made various physical or non-physical efforts to reduce the negative impacts arising from Mudik activity. One effort is by providing information related to the condition of Mudik routes. Study of preferences of travelers for changing Mudik routes after obtaining information is needed to anticipate these differences in decisions. The method used in the study is quantitative and qualitative descriptive analysis and uses non-parametric statistical analysis with McNemar and ChiSquare K free samples test to determine whether there are differences in decisions after providing information and differences in preferences for route changes based on factors. The study results show that the factors that cause the same route decisions for travelers who regularly Mudik with private vehicles are the fastest route, and there is no other route choice. The analysis shows that for both factors there is a preference of travelers to change the route by 68.5%, uncertainty by 15%, and not change the route by 16.5%. This study also shows there are differences in decisions after providing information, and there are no differences in route change preferences based on factors.
8
Xin, Lai, Zhao De Cun, Huang Long Yang und Wu D. Ti. „Hybrid Air Route Network Simulation Based on Improved RW-Bucket Algorithm“. International Journal of Information Technologies and Systems Approach 15, Nr. 1 (01.01.2022): 1–19. http://dx.doi.org/10.4018/ijitsa.304808.
Der volle Inhalt der QuelleAnnotation:
The fixed-route network is the basis for airlines to carry out flight direction planning. Some countries and regions have introduced temporary routes as a supplement to the fixed route structure. Temporary routes have the advantages of intercepting curves and straightening, and less detouring areas, which can save airlines fuel consumption and improve operational efficiency. This article takes the mixed airline's route network as the research object. Firstly, the structural properties of mixed air route networks are analyzed by using complex network theory. Secondly, the RW-bucket algorithm to generate a mixed air route network structure is analyzed. According to the conclusion of the analysis, the RW-bucket algorithm is improved. Finally two flight information region route network data are used to verify the proposed hybrid route network construction method by computer simulation.
9
Bin, Chenzhong, Tianlong Gu, Yanpeng Sun, Liang Chang und Lei Sun. „A Travel Route Recommendation System Based on Smart Phones and IoT Environment“. Wireless Communications and Mobile Computing 2019 (14.07.2019): 1–16. http://dx.doi.org/10.1155/2019/7038259.
Der volle Inhalt der QuelleAnnotation:
Tourism recommendation systems play a vital role in providing useful travel information to tourists. However, existing systems rarely aim at recommending tangible itineraries for tourists within a specific POI due to their lack of onsite travel behavioral data and related route mining algorithms. To this end, a novel travel route recommendation system is proposed, which collects tourist onsite travel behavior data automatically regarding a specific POI based on smart phone and IoT technology. Then, the proposed system preprocesses the behavior data to transform raw behavior sequences into Tourist-Behavior pattern sequences. Subsequently, the system discovers frequent travel routes from the generated pattern sequences by using an original route mining algorithm, named Tourist-Behavior PrefixSpan. Finally, a route-recommending method is designed to search and rank tangible travel routes according to the querying tourist’s profile and constraint. The experimental results demonstrate that the proposed system is efficient and effective in recommending POI-oriented tangible travel routes considering tourists’ route constraints and personal profile while ensuring that the suggested routes have considerable route values.
10
Rajkumar, Mylsamy, und Sankaranarayanan Subramanian. „Cluster Based Geographical Routing (CBGR) for MANETs“. Applied Mechanics and Materials 550 (Mai 2014): 210–19. http://dx.doi.org/10.4028/www.scientific.net/amm.550.210.
Der volle Inhalt der QuelleAnnotation:
-Routing has been the main challenge for ad hoc networks due to dynamic topology as well as resource constraints. High computational overhead and high mobility of the nodes typically require completely GPS enabled MANETs for higher performance. Due to the high mobility of nodes, the network topology of MANETs always changes. This makes it more difficult to find the routes that message packets use when they are routed. In this paper, we propose an Cluster based location routing (CBGR) scheme to improve the route discovery in MANET routing. In this scheme, we first decide a baseline, which is the line between the source cluster head and the destination node, for route discovery. The request packet is broadcasted in a request zone based on the baseline to determine the next gateway node. From the neighboring gateway nodes, with the shortest distance to the baseline is chosen as the next gateway node. The flooding of the packets to the intermediate gateway nodes are reduced since the route discovery packets are only forwarded to certain gateway nodes, which, fall into a determined region. Simulations are performed using NS2. The results illustrate that GBLR performs better compared to other protocols.
11
Wang, Zhenqiang, und Gaofeng Jia. „Simulation-Based and Risk-Informed Assessment of the Effectiveness of Tsunami Evacuation Routes Using Agent-Based Modeling: A Case Study of Seaside, Oregon“. International Journal of Disaster Risk Science 13, Nr. 1 (29.12.2021): 66–86. http://dx.doi.org/10.1007/s13753-021-00387-x.
Der volle Inhalt der QuelleAnnotation:
AbstractTypically, tsunami evacuation routes are marked using signs in the transportation network and the evacuation map is made to educate people on how to follow the evacuation route. However, tsunami evacuation routes are usually identified without the support of evacuation simulation, and the route effectiveness in the reduction of evacuation risk is typically unknown quantitatively. This study proposes a simulation-based and risk-informed framework for quantitative evaluation of the effectiveness of evacuation routes in reducing evacuation risk. An agent-based model is used to simulate the tsunami evacuation, which is then used in a simulation-based risk assessment framework to evaluate the evacuation risk. The route effectiveness in reducing the evacuation risk is evaluated by investigating how the evacuation risk varies with the proportion of the evacuees that use the evacuation route. The impacts of critical risk factors such as evacuation mode (for example, on foot or by car) and population size and distribution on the route effectiveness are also investigated. The evacuation risks under different cases are efficiently calculated using the augmented sample-based approach. The proposed approach is applied to the risk-informed evaluation of the route effectiveness for tsunami evacuation in Seaside, Oregon. The evaluation results show that the route usage is overall effective in reducing the evacuation risk in the study area. The results can be used for evacuation preparedness education and hence effective evacuation.
12
Zhai, Shulei. „Research on process route matching mechanism based on similarity calculation“. Journal of Physics: Conference Series 2229, Nr. 1 (01.03.2022): 012015. http://dx.doi.org/10.1088/1742-6596/2229/1/012015.
Der volle Inhalt der QuelleAnnotation:
Abstract Enterprises accumulate successful process route cases in actual production activities. This paper gives a case-based process route matching mechanism by determining process route feature attribute weights and similarity calculation methods to achieve efficient design of process routes with new requirements.
13
Simarmata, Justin Eduardo, und Ferdinandus Mone. „IMPLEMENTATION OF GENETIC ALGORITHM BASED ON JAVASCRIPT IN OBJECT ROUTING SHORTEST TOUR ON TIMOR ISLAND“. BAREKENG: Jurnal Ilmu Matematika dan Terapan 17, Nr. 1 (20.04.2023): 0545–58. http://dx.doi.org/10.30598/barekengvol17iss1pp0545-0558.
Der volle Inhalt der QuelleAnnotation:
The purpose of this study is to apply a genetic algorithm using a programming language that can be used to determine the shortest route to tourist attractions in Timor Island, East Nusa Tenggara. The application of genetic algorithms expected to be able to obtain the shortest route information that is most effective, the route that do not take a long time for tourists, and the presentation of route information for tourists. The method used is genetic algorithm to build the shortest route system for tourist attractions in Timor Island. The results of the system application shown that the optimization of travel routes that have been built can provide convenience in choosing tourist travel routes in Timor Island. Route optimization can help the process of making routes from the first location of departure and the attractions to be visited. The system is also used to assist domestic tourists in getting to know the attractions of Timor Island for solutions the shortest route.
14
Zhang, Zheng, Juan Chen und Qing Guo. „AGVs Route Planning Based on Region-Segmentation Dynamic Programming in Smart Road Network Systems“. Scientific Programming 2021 (22.10.2021): 1–13. http://dx.doi.org/10.1155/2021/9589476.
Der volle Inhalt der QuelleAnnotation:
In this paper, a route-planning approach is proposed based on the region-segmentation Dynamic Programming (DP) algorithm for Automated Guided Vehicles (AGVs) in large Smart Road Network Systems (SRNSs) to deal with the problem of low route computation efficiency of the classical DP algorithm. We introduced an improved Markov Decision Process (MDP) to describe SRNSs, in which the SRNSs are divided into several regions according to the AGVs’ start nodes and their goal nodes to improve the route-planning efficiency. Moreover, the route with the minimum number of turns is selected to reduce the system running time and energy cost in the following way: first, all the equidistant shortest routes are acquired from the AGVs’ start nodes to their goal nodes using the improved DP algorithm; then, the routes are screened by calculating the angular deviation between all feasible routes and AGVs’ initial directions, and the route with the fewest number of turns is taken as the shortest-time route. The simulation results verified that the proposed method can effectively solve the route-planning problem of AGVs in current SRNSs.
15
Tanieva, Guldona Mamanovna. „Journey From Central Asia To Mecca In The 19th Century: Roads And Conditions (Based On Muntahab Ut-Tawarikh)“. American Journal of Social Science and Education Innovations 02, Nr. 11 (30.11.2020): 350–55. http://dx.doi.org/10.37547/tajssei/volume02issue11-59.
Der volle Inhalt der QuelleAnnotation:
It is known that in the XVI-early XX centuries there were three main routes from Central Asia to Mecca - the northern route through the territory of the Russian Empire, the southern route through India and the central route through Iran. It is through these routes that a number of works dedicated to the memories of the pilgrimage by some pilgrims who have made the pilgrimage have come down to us. They contain very valuable information about the history of the pilgrimages of the peoples of Central Asia, the ways of pilgrimage and the conditions in them.
16
Akmaykin, D. A., V. V. Bocharova und S. F. Klyueva. „Ship route simulation based on the cluster analysis“. Vestnik Gosudarstvennogo universiteta morskogo i rechnogo flota imeni admirala S. O. Makarova 15, Nr. 5 (09.11.2023): 735–43. http://dx.doi.org/10.21821/2309-5180-2023-15-5-735-743.
Der volle Inhalt der QuelleAnnotation:
The problem of safe ship’s route planning at the variable hydrometeorological situation along the route is considered in the paper. The problem solved in the paper is based on the division of the water area into separate clusters, depending on its characteristics. The route from Busan Port to Kushiro Port is used as an example. The specifics of this route is that it runs through the open sea, and through the straits and archipelagos. The aim of the work is to automate the process of planning the route and adjusting it during the trip, depending on changes in external conditions. The graph theory for modeling a route is proposed in this paper. The construction of graphs is implemented using the cluster analysis method. In the analysis, the water area of the route is divided into separate subareas, depending on the distance to the coast and the depths difference. Open water areas are separated into larger clusters. Near the coast and at shallow depths, clustering is shorter. The cluster centroids are the vertices of the graphs of the future route. As result it is a simulation of graphs of different sizes. The union of graphs forms the hypergraph. The distance is used as the weight of the graph edges. To determine the most preferable route in criteria of speed, cost or safety, weights are added depending on weather and other factors. As a result of this approach, several routes are planning on the hypergraph. Depending on the weight of the priority criteria, a route is selected automatically. The proposed method can be used to create systems for automated planning of optimal routes, taking into account the selected criteria under changing environmental conditions in the process of voyage and replanning it if necessary.
17
Mazlan, Muhammad Fadhli Mustaqim, Khairul Nizam Abdul Maulud, Syed Ahmad Fadhli Syed Abdul Rahman, Mohd Aizat Saiful Bahri und Muhammad Amartur Rahman. „Emergency Management in Building Based On 3D BIM and GIS Technology“. Jurnal Kejuruteraan 34, Nr. 6 (30.11.2022): 1215–28. http://dx.doi.org/10.17576/jkukm-2022-34(6)-22.
Der volle Inhalt der QuelleAnnotation:
An emergency route is a route designed for human use to save themselves from dangerous situations. However, if it is considered trivial, this has unknowingly led to an increase in accidents. The provision of emergency routes on a community scale in indoor areas in terms of time is rarely discussed in emergency evacuation studies. This study aims to investigate the emergency route in the building due to the environmental factors of the closed area and the arrangement of office equipment. The method of this study is divided into two sub-sections, namely data preparation and data analysis process. Demographic data and physical interactions were used as the selection of walking speed criteria while the use of geometric data to see the actual plan route position of the building. 3D building models are built through Revit software and then converted to industry foundation classes format (.IFC) and then to multipatch shapefile (.shp) to be integrated into ArcGIS software. This is intended for the use of the data analysis process that is to build a geometric network model (GNM). GNM is designed to determine the safest and shortest routes by taking into account a variety of obstacles based on the scenario conditions. The findings shows that the evacuation time is influenced by the speed and distance of the route. 80% of the safest route selection takes a long time compared to the shortest route, while 20% is the same distance and time for the shortest and safest route because route selection is the same. The findings able to be used as a reference and guideline to determine the selection of emergency routes, especially in complex buildings.
18
Yang, Shu, Chengchuan An, Yao-Jan Wu und Jingxin Xia. „Origin–Destination-Based Travel Time Reliability“. Transportation Research Record: Journal of the Transportation Research Board 2643, Nr. 1 (Januar 2017): 139–59. http://dx.doi.org/10.3141/2643-16.
Der volle Inhalt der QuelleAnnotation:
Travel time reliability (TTR) is an important performance indicator for transportation systems. TTR can be generally categorized as either segment based or origin–destination (O-D) based. A primary difference between the two TTR estimations is that route information is implied in segment-based TTR estimations. Segment-based TTR estimations have been widely studied in previous research; however, O-D–based TTR estimations are used infrequently. This paper provides detailed insight into O-D–based TTR estimations and raises three new issues: ( a) How many routes do travelers usually take and what are the TTR values associated with these routes? ( b) Do statistical differences exist between route-specific and non-route-specific (NRS) TTR values? ( c) How can O-D–based TTR information be delivered? Two processes were proposed to address the issues. Three TTR measures—standard deviation, coefficient of variation, and buffer index—were calculated. The bootstrapping technique was used to measure the accuracy of the TTR measures. Approximate confidence intervals were used to investigate statistically the differences between route-specific and NRS TTR measures. A large quantity of taxicab GPS-based data provided data support for estimating O-D–based TTR measures. The results of O-D–based TTR measures showed that no statistically significant differences existed between route-specific and NRS TTR measures for most of the time periods examined. Statistically significant differences could still be found in some time periods. Travelers may take advantage of these differences to choose a more reliable route. Access to both numeric TTR values and route preference, instead of just to TTR information on segments of interest, can be beneficial to travelers in planning an entire trip.
19
Xu, Xiangrong, Lei Wang, Shuo Zhang, Wei Li und Qiaoyong Jiang. „Modelling and Optimization of Personalized Scenic Tourism Routes Based on Urgency“. Applied Sciences 13, Nr. 4 (04.02.2023): 2030. http://dx.doi.org/10.3390/app13042030.
Der volle Inhalt der QuelleAnnotation:
Traditional route planning methods usually plan the “fastest” or “lowest cost” travel route for users with the goal of finding the shortest path or the lowest cost, but this method cannot meet the needs of tourism users for personalized and multifunctional travel routes. Given this phenomenon, this paper proposes a personalized route planning model based on urgency. First, the model uses the visitor’s historical tourism data and public road network data to extract their preferences, POI (point of interest) relationships, edge scenic values and other information. Then, the planned route function is determined according to the urgency value, which provides users with travel routes that accommodate their interest preferences and urgency. Finally, the improved genetic algorithm based on gene replacement and gene splicing operators is used to carry out numerical experiments on the Xi’an and Wuhan road network datasets. The experimental results show that the proposed algorithm is not only capable of planning routes with different functions for diverse users but also performs personalized route planning according to their preferences.
20
Yang, Licai, Yunfeng Shi, Shenxue Hao und Lei Wu. „Route Choice Model Based on Game Theory for Commuters“. PROMET - Traffic&Transportation 28, Nr. 3 (06.06.2016): 195–203. http://dx.doi.org/10.7307/ptt.v28i3.1727.
Der volle Inhalt der QuelleAnnotation:
The traffic behaviours of commuters may cause traffic congestion during peak hours. Advanced Traffic Information System can provide dynamic information to travellers. Due to the lack of timeliness and comprehensiveness, the provided information cannot satisfy the travellers’ needs. Since the assumptions of traditional route choice model based on Expected Utility Theory conflict with the actual situation, a route choice model based on Game Theory is proposed to provide reliable route choice to commuters in actual situation in this paper. The proposed model treats the alternative routes as game players and utilizes the precision of predicted information and familiarity of traffic condition to build a game. The optimal route can be generated considering Nash Equilibrium by solving the route choice game. Simulations and experimental analysis show that the proposed model can describe the commuters’ routine route choice decisionexactly and the provided route is reliable.
21
Ye, Ning, Zhong-qin Wang, Reza Malekian, Qiaomin Lin und Ru-chuan Wang. „A Method for Driving Route Predictions Based on Hidden Markov Model“. Mathematical Problems in Engineering 2015 (2015): 1–12. http://dx.doi.org/10.1155/2015/824532.
Der volle Inhalt der QuelleAnnotation:
We present a driving route prediction method that is based on Hidden Markov Model (HMM). This method can accurately predict a vehicle’s entire route as early in a trip’s lifetime as possible without inputting origins and destinations beforehand. Firstly, we propose the route recommendation system architecture, where route predictions play important role in the system. Secondly, we define a road network model, normalize each of driving routes in the rectangular coordinate system, and build the HMM to make preparation for route predictions using a method of training set extension based onK-means++ and the add-one (Laplace) smoothing technique. Thirdly, we present the route prediction algorithm. Finally, the experimental results of the effectiveness of the route predictions that is based on HMM are shown.
22
Erginli, Mustafa, und Ibrahim Cil. „Deep-Learning-Based Floor Path Model for Route Tracking of Autonomous Vehicles“. Systems 10, Nr. 3 (15.06.2022): 83. http://dx.doi.org/10.3390/systems10030083.
Der volle Inhalt der QuelleAnnotation:
Real-time route tracking is an important research topic for autonomous vehicles used in industrial facilities. Traditional methods such as copper line tracking on the ground, wireless guidance systems, and laser systems are still used in route tracking. In this study, a deep-learning-based floor path model for route tracking of autonomous vehicles is proposed. A deep-learning floor path model and algorithm have been developed for highly accurate route tracking, which avoids collisions of vehicles and follows the shortest route to reach the destination. The floor path model consists of markers. Routes in the floor path model are created by using these markers. The floor path model is transmitted to autonomous vehicles as a vector by a central server. The server dispatches the target marker address to the vehicle to move. The vehicle calculates all possible routes to this address and chooses the shortest one. Marker images on the selected route are processed using image processing and classified with a pre-trained deep-CNN model. If the classified image and the image on the selected route are the same, the vehicle proceeds toward its destination. While the vehicle moves on the route, it sends the last classified marker to the server. Other autonomous vehicles use this marker to determine the location of this vehicle. Other vehicles on the route wait to avoid a collision. As a result of the experimental studies we have carried out, the route tracking of the vehicles has been successfully achieved.
23
Sang, Zi, Bing Zhang, Yunqiang Xue und Hongzhi Guan. „Research on Optimization of Customized Bus Routes Based on Uncertainty Theory“. Journal of Advanced Transportation 2021 (09.04.2021): 1–10. http://dx.doi.org/10.1155/2021/6691299.
Der volle Inhalt der QuelleAnnotation:
In the optimization process of the routes of customized buses, there are numerous uncertainties in the route planning and setting. In this study, the uncertainty theory is introduced into the optimization problem of a customized bus route, and an uncertain customized bus route optimization model is established, which aims at the minimizing the total mileage of vehicle operation. An improved genetic algorithm is used to solve the model, whose feasibility is verified by a case study. The results show that the optimization model based on the uncertainty theory can yield a reasonable customized bus route optimization scheme, and the total mileage reduced from 35.6 kilometers to 32.2 kilometers. This research provides the theoretical support for the optimization of customized bus routes.
24
Lee, Jeong-Seok, und Ik-Soon Cho. „Extracting the Maritime Traffic Route in Korea Based on Probabilistic Approach Using Automatic Identification System Big Data“. Applied Sciences 12, Nr. 2 (10.01.2022): 635. http://dx.doi.org/10.3390/app12020635.
Der volle Inhalt der QuelleAnnotation:
To protect the environment around the world, we are actively developing ecofriendly energy. Offshore wind farm generation installed in the sea is extremely large among various energies, and friction with ships occurs regularly. Other than the traffic designated area and the traffic separate scheme, traffic routes in other sea areas are not protected in Korea. Furthermore, due to increased cargo volume and ship size, there is a risk of collisions with marine facilities and marine pollution. In this study, maritime safety traffic routes that must be preserved are created to ensure the safety of maritime traffic and to prevent accidents with ecofriendly energy projects. To construct maritime traffic routes, the analysis area is divided, and ships are classified using big data. These data are used to estimate density, and 50% maritime traffic is chosen. This result is obtained by categorizing the main route, inner branch route, and outer branch route. The Korean maritime traffic route is constructed, and the width of the route is indicated. Furthermore, this route can be applied as a navigation route for maritime autonomous surface ships.
25
Li, Hainan, Randall Guensler und Jennifer Ogle. „Analysis of Morning Commute Route Choice Patterns Using Global Positioning System–Based Vehicle Activity Data“. Transportation Research Record: Journal of the Transportation Research Board 1926, Nr. 1 (Januar 2005): 162–70. http://dx.doi.org/10.1177/0361198105192600119.
Der volle Inhalt der QuelleAnnotation:
This paper examines morning commute route choices of 182 drivers, with the use of disaggregated Global Positioning System–based vehicle activity data collected during a 10-day period. This paper attempts to describe how these commuters tend to behave in the real world. A binary logit model of morning commuters’ choice between a single commute route and multiple routes was established on the basis of evidence of drivers’ varying valuations of a number of route and trip characteristics as well as commuters’ sociodemographic characteristics. The research results of this paper indicate a strong relationship between the morning commute route choice decision (single versus multiple routes) and commuters’ work schedule flexibility, sociodemographic characteristics, and commute route attributes.
26
Adhikari, Ishwarmani. „Route Dominance on Symmetric Type Transit-based Evacuation Network“. Kanya Journal 4, Nr. 1 (03.08.2023): 51–61. http://dx.doi.org/10.3126/kanyaj.v4i1.57051.
Der volle Inhalt der QuelleAnnotation:
The selection of dominant routes for transit-based evacuation planning problems mainly depends upon the structure and nature of the available network. To achieve efficient evacuation planning, the problem is not only on the selection of a route and a shelter for each route on the available network topology but also on the route-to-vehicle assignment and vice versa, which is more complex and challenging in real practice. The evacuation network adds complexity to the solution and impacts the problem. In this paper, the transit-based evacuation network has been revised from different perspectives focusing on the symmetric type networks with their dominant evacuation planning routes to have the minimum evacuation cost.
27
Wang, Bo, Lin Guo, Jibiao Zhou, Josef Ristvej und Michaela Jánošíková. „Emergency Evacuation Route Choice Based on Improved Ant Colony Algorithm“. Logistics and Transport 44, Nr. 4 (2019): 33–40. http://dx.doi.org/10.26411/83-1734-2015-4-44-4-19.
Der volle Inhalt der QuelleAnnotation:
In order to explore the optimal route choice for emergency evacuation in the campus, we propose a novel route choice method based on brittle characteristics of campus system and improved ant colony algorithm. Both optimal and worst-case emergency evacuation routes are simulated in the campus of Ningbo University of Technology. From the simulation, the length of optimal and worse-case evacuation routes between the starting point and eight exits can be obtained by adjusting the importance value of trip distance and the degree of conformity, under the condition of static relative importance of pheromone concentration to graph G. The optimal route of emergency evacuation in the campus can be obtained when the importance of trip distance is above 5 and the degree of conformity is above 0.3; while the worse-case route is obtained with the importance of trip distance above 5 and the degree of conformity below 0.5.
28
Wang, Meng. „Research on vehicle scheduling based on C-W algorithm“. Journal of Physics: Conference Series 2083, Nr. 3 (01.11.2021): 032009. http://dx.doi.org/10.1088/1742-6596/2083/3/032009.
Der volle Inhalt der QuelleAnnotation:
Abstract Vehicle scheduling is one of the most important links in logistics distribution, a large number of demands also lead to logistics companies have to reasonably arrange the transportation of vehicle routes to save costs. By optimizing the distribution routes of vehicles, logistics companies can save transportation mileage and thus save transportation costs. In this paper,10 demand points of an agricultural products logistics company in Beijing are selected, and the location of the distribution center is obtained through the center of gravity method. Finally, the route allocation is completed by using the mileage saving algorithm, and the scheduling of transport vehicles is realized. The example shows that the mileage saving algorithm can optimize the vehicle route and realize route allocation.
29
Lv, Hengxiu. „A Design of the Ecotourism Individualized Route Planning System Based on the Ecological Footprint Model“. Computational Intelligence and Neuroscience 2022 (22.06.2022): 1–11. http://dx.doi.org/10.1155/2022/6342696.
Der volle Inhalt der QuelleAnnotation:
In this study, aiming at the huge amount of information in the tourism field, the pressure of ecological environment, and tedious personalized route planning, an ecotourism personalized route planning system based on the ecological footprint model is designed. In order to recommend routes that meet the time limit and the starting and ending points of the user’s choice, the tourist route recommendation problem is studied as a directional problem on the basis of comprehensively considering the popularity of scenic spots and the user’s interest preferences as the scenic spots score. The scenic spot scoring strategy is scenic spot scoring, and the iterative local search strategy is used to plan tourist routes according to the optimization goal with the largest route score, and improve the real tourist routes, food, and accommodation strategies. On the basis of launched tourist routes, they recommend tourists’ favorite food and accommodation. The model finally completes the fine arrangement of scenic spots, food, and accommodation in the whole tourist route. The system test results show that the system has obvious advantages in personalized path planning effect, excellent user feedback effect, and certain application value.
30
Hou, Guo Zhao, und Peng Wang. „Research on MANET-Based Reliable Zone Routing Protocol“. Applied Mechanics and Materials 519-520 (Februar 2014): 222–26. http://dx.doi.org/10.4028/www.scientific.net/amm.519-520.222.
Der volle Inhalt der QuelleAnnotation:
In MANET, the scheme for maintaining an inter-zone route in ZRP makes ZRP take more lost packets and more route re-discovering times; the former makes ZRP take lower delivery ratio of data packets, which makes ZRP take less reliability; the latter makes ZRP take more transmission delay and more routing overheads. Aiming at the problem above, a MANET-based reliable zone routing protocol (MRZRP) was proposed. In MRZRP, each node saved multiple backup routes from the node to each intra-zone node by maintaining an directed acyclic graph based on an intra-zone topology, and an inter-zone route was repaired by using backup segment routes as much as possible. The simulation results show that MRZRP improves delivery ratio of data packets, which shows that MRZRP improves the protocol reliability, and MRZRP also reduces the transmission delay and routing overheads.
31
Zhao, Lei, Hongzhi Guan, Junze Zhu und Yunfeng Wei. „A Reliability-Based Network Equilibrium Model with Adaptive Risk-Averse Travelers“. Journal of Advanced Transportation 2018 (27.12.2018): 1–13. http://dx.doi.org/10.1155/2018/5294185.
Der volle Inhalt der QuelleAnnotation:
In this paper, route free-flow travel time is taken as the lower bound of route travel time to examine its impacts on budget time and reliability for degradable transportation networks. A truncated probability density distribution with respect to route travel time is proposed and the corresponding travel time budget (TTB) model is derived. The budget time and reliability are compared between TTB models with and without truncated travel time distribution. Under truncated travel time distribution, the risk-averse levels of travelers are adaptive, which are affected by the characteristics of the used routes besides the confidence level of travelers. Then, a TTB-based stochastic user equilibrium (SUE) is developed to model travelers’ route choice behavior. Moreover, its equivalent variational inequality (VI) problem is formulated and a route-based algorithm is used to solve the proposed model. Numerical results indicate that route travel time boundary produces a great influence on decision cost and route choice behavior of travelers.
32
Ilfahmi, Yan Alamanda, und Arif Fadlan. „DIFFERENT ROUTES FOR THE SYNTHESIS OF BENZALDEHYDE-BASED DIHYDROPYIMIDINONES VIA BIGINELLI REACTION“. Jurnal Kimia Riset 8, Nr. 2 (08.12.2023): 124–30. http://dx.doi.org/10.20473/jkr.v8i2.45209.
Der volle Inhalt der QuelleAnnotation:
Multicomponent reactions involving three or more reactants are commonly used to prepare dihydropyrimidinone with various bioactivities. This study reports the different routes for the synthesis of benzaldehyde-based dihydropyrimidinone via the Biginelli reaction and investigates the yield of the obtained products. The synthesis was performed via routes A, B, C, D, and E based on the formation of iminium, enamine, and Knoevenagel intermediates between urea, benzaldehyde, and ethyl acetoacetate. Route A, through a one-pot reaction via iminium, produced dihydropyrimidinone with a yield of 58%. The product from route B via iminium was obtained in 62% yield. Route C and D occurred via enamine at room temperature, and reflux gave the product 31% and 40% yield, respectively. Route E involving Knoevenagel intermediate provided the product in a 38% yield. 1H NMR, FTIR, and MS spectroscopic techniques were used for structure elucidation.
33
Liu, Yuan, Heshan Zhang, Tao Xu und Yaping Chen. „A Heuristic Algorithm Based on Travel Demand for Transit Network Design“. Sustainability 14, Nr. 17 (05.09.2022): 11097. http://dx.doi.org/10.3390/su141711097.
Der volle Inhalt der QuelleAnnotation:
This study proposes a simultaneous optimization model that considers flow assignment and vehicle capacity for the problem of transit network design to determine the route structure and frequencies simultaneously. The problem is focused on reducing the total travel time and the number of transfers. A heuristic algorithm is developed to solve this problem. In the proposed algorithm, the initial routes are generated according to a changing demand matrix, which can reflect the real-time demand with transfers and ensure that the direction of route generation maximizes the percentage of direct service. A regulating method for a sequence of stops is used during route generation to guarantee the shortest trip time for a formed route. Vehicles are allocated to each route according to the flow share. The concept of vehicle difference is introduced to evaluate the distinction between actual allocated vehicles and required vehicles for each route. The optimization process of frequencies based on vehicle difference can ensure that the solution meets the constraints. Two scale networks are used to illustrate the performances of the proposed method. Results show that route structure and frequencies can be optimized simultaneously through the proposed method. Different scenarios are created to test the algorithm properties via various parameter values. The test result indicates that the upper bound is a key parameter to balance the proportion of direct service and average in-vehicle travel time (AIVTT), and the increased number of planning routes can improve the proportion of direct service.
34
Dhulipala, Sowjanya. „Multi-route choice modelling in a metropolitan context: A comparative analysis using Multinomial Logit and Fuzzy Logic based approaches“. European Transport/Trasporti Europei 79, ET.2020 (September 2020): 1–17. http://dx.doi.org/10.48295/et.2020.79.4.
Der volle Inhalt der QuelleAnnotation:
Route choice plays a vital role in the traffic assignment and network building, as it involves decision making on part of riders. The vagueness in travellers’ perceptions of attributes of the available routes between any two locations adds to the complexities in modelling the route choice behaviour. Conventional Logit models fail to address the uncertainty in travellers’ perceptions of route characteristics (especially qualitative attributes, such as environmental effects), which can be better addressed through the theory of fuzzy sets and linguistic variables. This study thus attempts to model travellers’ route choice behaviour, using a fuzzy logic approach that is based on simple and logical ‘if-then’ linguistic rules. This approach takes into consideration the uncertainty in travellers’ perceptions of route characteristics, resembling humans’ decision-making process. Three attributes – travel time, traffic congestion, and road-side environment are adopted as factors driving people’s choice of routes, and three alternative routes between two typical locations in an Indian metropolitan city, Surat, are considered in the study. The approach to deal with multiple routes is shown by analyzing two-wheeler riders’ (e.g. motorcyclists’ and scooter drivers’) route choice behaviour during the peak-traffic time. Further, a Multinomial Logit (MNL) model is estimated, to enable a comparison of the two modelling approaches. The estimated Fuzzy Rule-Based Route Choice Model outperformed the conventional MNL model, accounting for the uncertain behaviour of travellers.
35
Liu, Li, Huan Jin, Yangguang Liu und Xiaomin Zhang. „Intelligent Evacuation Route Planning Algorithm Based on Maximum Flow“. International Journal of Environmental Research and Public Health 19, Nr. 13 (27.06.2022): 7865. http://dx.doi.org/10.3390/ijerph19137865.
Der volle Inhalt der QuelleAnnotation:
This paper focuses on the problem of intelligent evacuation route planning for emergencies, including natural and human resource disasters and epidemic disasters, such as the COVID-19 pandemic. The goal of this study was to quickly generate an evacuation route for a community for victims to be evacuated to safe areas as soon as possible. The evacuation route planning problem needs to determine appropriate routes and allocate a specific number of victims to each route. This paper formulates the problem as a maximum flow problem and proposes a binary search algorithm based on a maximum flow algorithm, which is an intelligent optimization evacuation route planning algorithm for the community. Furthermore, the formulation is a nonlinear optimization problem because each route’s suggested evacuation time is a convex nonlinear function of the number of victims assigned to that route. Finally, numerical examples and Matlab simulations demonstrate not only the algorithm’s effectiveness, but also that the algorithm has low complexity and high precision. The study’s findings offer a practical solution for nonlinear models of evacuation route planning, which will be widely used in human society and robot path planning schemes.
36
Zheng, Lili, Tian Gao, Lin Meng, Tongqiang Ding und Wenhao Chen. „Research on the Route Choice Behavior of Urban Freight Vehicles Based on GPS Data“. Mathematics 12, Nr. 2 (16.01.2024): 291. http://dx.doi.org/10.3390/math12020291.
Der volle Inhalt der QuelleAnnotation:
In order to provide urban freight vehicles with navigation routes that better align with their travel preferences, it is necessary to analyze the patterns and characteristics of their route choices. This paper focuses on freight vehicles traveling within the city and examines their route selection behavior. Through an analysis of the GPS data collected from freight truck journeys in Changchun, China, this study outlines the characteristics of freight vehicle travel within the city. Variables that may influence their route selection behavior are defined as feature factors. The study employs the DBSCAN algorithm to identify the hotspots in origin–destination pairs for freight truck travel in Changchun. It also utilizes Breadth First Search Link Elimination to generate a set of route choices and constructs route selection behavior models based on Multinomial Logit and Path Size Logit. Based on the research findings, during navigation within the city road network, these vehicles exhibit a preference for side roads, a tendency to favor right turns at intersections, and a propensity to choose routes with lower duplication compared to alternative options. The study’s conclusions offer theoretical support for guiding urban freight vehicle routes and planning and managing freight traffic within the city.
37
Yang, Li. „Multicriteria Recommendation Method of Tourist Routes Based on Tourist Clustering“. Mobile Information Systems 2022 (10.10.2022): 1–8. http://dx.doi.org/10.1155/2022/9168899.
Der volle Inhalt der QuelleAnnotation:
A multicriteria recommendation algorithm for tourist routes under the multidimensional expanded spatial grid structure model based on fuzzy C-means clustering of tourist preferences is proposed. The purpose of the proposed structure is to improve the multicriteria intelligent recommendation ability of tourist routes under the multidimensional expanded spatial grid structure model of popular tourist core circle. The multidimensional enlarged spatial grid structure model of the well-known tourist core circle is used to develop the tourist correlation model of travel routes under the restricted sample training. Under the popular traveler core circle’s multidimensional enlarged spatial grid structure framework, the mixed kernel use and global kernel use are created to extract the correlation characteristics of tourist route recommendation. Under the multidimensional enlarged spatial grid structure model of the well-known tourist core circle, the adaptive learning of tourist route selection is carried out using the hybrid particle swarm algorithm. To manage the convergence of the suggestion process, maps of logistical chaos are employed, utilizing culture’s universalism and ergodicity resources and examining the aesthetic resources along tourism routes. The simulation results demonstrate that the multidimensional extended spatial grid structure model’s tourism route information recommendation accuracy is decent, and a solid swarm intelligence junction is observed in this analysis, preventing tourism route recommendations from settling for the local optimal solution and enhancing their intelligence and global stability.
38
Yang, Jie, und Yangsheng Jiang. „Application of Modified NSGA-II to the Transit Network Design Problem“. Journal of Advanced Transportation 2020 (01.08.2020): 1–24. http://dx.doi.org/10.1155/2020/3753601.
Der volle Inhalt der QuelleAnnotation:
The transit network design problem involves determining a certain number of routes to operate in an urban area to balance the costs of the passengers and the operator. In this paper, we simultaneously determine the route structure of each route and the number of routes in the final solution. A novel initial route set generation algorithm and a route set size alternating heuristic are embedded into a nondominated sorting genetic algorithm-II- (NSGA-II-) based solution framework to produce the approximate Pareto front. The initial route set generation algorithm aims to generate high-quality initial solutions for succeeding optimization procedures. To explore the solution space and to have solutions with a different number of routes, a route set size alternating heuristic is developed to change the number of routes in a solution by adding or deleting one route. Experiments were performed on Mandl’s network and four larger Mumford’s networks. Compared with a fixed route set size approach, the proposed NSGA-II-based solution method can produce an approximate Pareto front with much higher solution quality as well as improved computation efficiency.
39
Schmidl, Martin, Gerhard Navratil und Ioannis Giannopoulos. „An Approach to Assess the Effect of Currentness of Spatial Data on Routing Quality“. AGILE: GIScience Series 2 (04.06.2021): 1–12. http://dx.doi.org/10.5194/agile-giss-2-13-2021.
Der volle Inhalt der QuelleAnnotation:
Abstract. During spatial decision making, the quality of the utilized data is of high importance. During navigation these decisions are crucial for being routed to the desired destination (usually going by the shortest or fastest route). Road networks, the main data source for routing, are prone to changes which can have a big impact on the computed route and therefore on travel time. For instance, routes computed using an outdated street network can result in longer travel times, in longer distance, as well in cases where the desired destination might not be anymore reachable via the computed route. Data from OpenStreetMap with different timestamps allows us to download road network snapshots from different years, i.e., from 2014 to 2020. On each of those datasets the fastest route between 500 randomly chosen point pairs in Vienna, Austria, was computed. These routes were also reconstructed on the most recent dataset for evaluation reasons. The resulting travel times, travel length as well as feasibility of the route were compared with the most recent dataset. The results provide a first assessment of temporal quality based on the currentness of a dataset.
40
Yao, En Jian, Long Pan, Yang Yang und Yong Sheng Zhang. „Taxi Driver's Route Choice Behavior Analysis Based on Floating Car Data“. Applied Mechanics and Materials 361-363 (August 2013): 2036–39. http://dx.doi.org/10.4028/www.scientific.net/amm.361-363.2036.
Der volle Inhalt der QuelleAnnotation:
Taxi drivers are viewed having more driving experience, being more familiar with road traffic condition, and in turn having more rational route choice behaviors than ordinary drivers. Using floating car data (FCD) of Beijing taxi in 2010, this study discusses the influence of road network conditions and traffic status to taxi drivers route choice behaviors. First, trip information is extracted from FCD using trip-identification method; Second, map matching and K-shortest paths are used to construct the trajectories and the sets of alternate routes, and route similarity evaluation is conducted to build the sample data of route choice behavior analysis; Finally, route choice model for taxi drivers based on Multinomial Logit (MNL) Model is estimated. The result shows that taxi drivers tend to choose the route which has faster driving speed, less frequency of left turns, more proportion of express way and less proportion of minor road, and increasing a left-turn or decreasing travel speed by 2.12km/h has the same effect on route choice utility. This study is expected to be helpful to establish map-matching algorithm of FCD, route guidance scheme and traffic assignment model.
41
Baizal, Z. K. A., Kemas M. Lhaksmana, Aniq A. Rahmawati, Mizanul Kirom und Zidni Mubarok. „Travel route scheduling based on user’s preferences using simulated annealing“. International Journal of Electrical and Computer Engineering (IJECE) 9, Nr. 2 (01.04.2019): 1275. http://dx.doi.org/10.11591/ijece.v9i2.pp1275-1287.
Der volle Inhalt der QuelleAnnotation:
<p>Nowadays, traveling has become a routine activity for many people, so that many researchers have developed studies in the tourism domain, especially for the determination of tourist routes. Based on prior work, the problem of determining travel route is analogous to finding the solution for travelling salesman problem (TSP). However, the majority of works only dealt with generating the travel route within one day and also did not take into account several user’s preference criteria. This paper proposes a model for generating a travel route schedule within a few days, and considers some user needs criteria, so that the determination of a travel route can be considered as a multi-criteria issue. The travel route is generated based on several constraints, such as travel time limits per day, opening/closing hours and the average length of visit for each tourist destination. We use simulated annealing method to generate the optimum travel route. Based on evaluation result, the optimality of the travel route generated by the system is not significantly different with ant colony result. However, our model is far more superior in running time compared to Ant Colony method.</p>
42
Chen, Juanjuan, Liying Huang, Chengliang Wang und Nijia Zheng. „Discovering Travel Spatiotemporal Pattern Based on Sequential Events Similarity“. Complexity 2020 (28.12.2020): 1–10. http://dx.doi.org/10.1155/2020/6632956.
Der volle Inhalt der QuelleAnnotation:
Travel route preferences can strongly interact with the events that happened in networked traveling, and this coevolving phenomena are essential in providing theoretical foundations for travel route recommendation and predicting collective behaviour in social systems. While most literature puts the focus on route recommendation of individual scenic spots instead of city travel, we propose a novel approach named City Travel Route Recommendation based on Sequential Events Similarity (CTRR-SES) by applying the coevolving spreading dynamics of the city tour networks and mine the travel spatiotemporal patterns in the networks. First, we present the Event Sequence Similarity Measurement Method based on modelling tourists’ travel sequences. The method can help measure similarities in various city travel routes, which combine different scenic types, time slots, and relative locations. Second, by applying the user preference learning method based on scenic type, we learn from the user’s city travel historical data and compute the personalized travel preference. Finally, we verify our algorithm by collecting data of 54 city travellers of their historical spatiotemporal routes in the ten most popular cities from Mafeng.com. CTRR-SES shows better performance in predicting the user’s new city travel sequence fitting the user’s individual preference.
43
Liu, Xiaolin, Yuyang Qi, Xuecong Li und Jing Hai. „Optimization Study of Desert Traversing Routes Based on Floyd and Greedy Algorithms“. Journal of Computing and Electronic Information Management 11, Nr. 3 (21.11.2023): 29–33. http://dx.doi.org/10.54097/jceim.v11i3.07.
Der volle Inhalt der QuelleAnnotation:
This paper is based on a desert traversal game to reach the endpoint within the specified time and keep as much money as possible, so it is necessary to give a reasonable choice of routes and optimize the routes. This paper defines the adjacency matrix of the graph and borrows the Floyd algorithm to get the two shortest routes: "to mine" and "not to mine"; secondly, based on the basic assumption that "players will give priority to routes containing villages", the shortest routes are optimized and the shortest routes are optimized to be "to mine" and "not to mine". Secondly, based on the basic assumption that "players will prefer the route containing villages", the shortest route is optimized to the shortest route passing through villages; Thirdly, based on the objective of "retaining as much money as possible", mining in mines is divided into "continuous mining" and "non-continuous mining". "Finally, the greedy method is used to obtain the funds of the three cases of the two routes are 9410-yuan, 10430 yuan, and 9800 yuan, and the remaining funds are compared to obtain the optimal route for the player to pass the game. Afterward, the weather probability of each day is estimated and the weather sequence is randomly generated; secondly, combining the map information and the weather condition of the day, the dynamic strategy should be adopted by the player given; again, Monte Carlo simulation is used to simulate the whole decision-making process, and the performance of the model is optimized by adjusting the parameters of the model.
44
Tao, Yong Cai, Wei Wei Jia, Lei Shi, Lin Wei und Yang Jie Cao. „Traceroute-Based Route Gathering and Repairing Mechanism of Client-Independent IP Geolocation System“. Advanced Materials Research 756-759 (September 2013): 3728–34. http://dx.doi.org/10.4028/www.scientific.net/amr.756-759.3728.
Der volle Inhalt der QuelleAnnotation:
Delay measurement-based IP Geolocation can gain better IP geolocation performance. However, there are still some defects needed to be improved, including inaccurate landmark information, incomplete traceroute information and inaccurate traceroute repairing information. To address the issues, the paper proposes a traceroute-based route gathering and repairing mechanism of client-independent IP geolocation system. The contributions include: 1) a landmark information filtering mechanism is presented to filter the noise data; 2) an Improved TraceRoute Gathering algorithm (ITRG) is proposed to increase the integrity of route information; 3) a Reverse Route Delay Repairing algorithm (RRDR) is presented to solve the problem of route inflation, guaranteeing that the delay value of current router is smaller than that of its next router. The experimental results show that using the improved IP geolocation mechanism proposed in the paper, the median error distance of IP geolocation is reduced to 5.42km from 9.60km.
45
Jin, Wenquan, Azimbek Khudoyberdiev und Dohyeun Kim. „Visualization and Analysis of Safe Routes to School based on Risk Index using Student Survey Data for Safe Mobility“. JOIV : International Journal on Informatics Visualization 6, Nr. 3 (30.09.2022): 593. http://dx.doi.org/10.30630/joiv.6.3.1163.
Der volle Inhalt der QuelleAnnotation:
Risk analysis is important in heterogeneous industrial domains to enable sustainable development. Data is the basis for emphasizing the potential risk elements for improving efficiency, quality, and safety. For supplying safe routes to schools based on risk analysis, the risk assessment of routes is one of the widely used and very effective methodologies to filter the most dangerous roads, intersections, or specific points on roads. This paper presents a visualization and analysis of the risk assessment approach based on the risk index model using geographical information, including routes, danger points, and student survey data. The proposed risk index model is used for deriving a risk index based on geographical information, including danger points and a route's path. The model includes an equation to calculate the distance of danger points to the path using the coordinates of each location. The survey data is mainly comprised of route and survey information that is analyzed and preprocessed for the input data of the risk index model. The survey mainly consists of basic information on the route, survey participants, school route information, and school route coordinates. The data is classified into the school route data set and the school route danger points data set, and these values are applied to the analysis and the risk index model. Also, the risk index model is designed and developed through the analysis of routes.
46
Choi, Gwang-Hyeok, Wonhee Lee und Tae-wan Kim. „Voyage optimization using dynamic programming with initial quadtree based route“. Journal of Computational Design and Engineering 10, Nr. 3 (29.04.2023): 1185–203. http://dx.doi.org/10.1093/jcde/qwad055.
Der volle Inhalt der QuelleAnnotation:
Abstract This research proposes an integrated voyage optimization algorithm that combines quadtree graph generation, visibility graph simplification, Dijkstra’s algorithm, and a 3D dynamic programming (3DDP) method. This approach enables the determination of a minimum distance initial reference route and the creation of a 2D navigational graph for efficient route optimization. We effectively store and process complex terrain information by transforming the GEBCO uniform grid into a quadtree structure. By utilizing a nearest neighbour search algorithm, edges are connected between adjacent ocean nodes, facilitating the generation of a quadtree graph. Applying Dijkstra’s algorithm to the quadtree graph, we derive the shortest initial route and construct a visibility graph based on the waypoints. This results in a simplified reference route with reduced search distance, allowing for more efficient navigation. For each waypoint along the reference route, a boundary is defined angled at 90 degrees to the left and right, based on the waypoint’s reference bearing. A line segment formed by the waypoint and both boundaries is defined as a navigational stage. A navigational graph is defined by connecting adjacent stages. Employing a 3DDP method on the navigational graph, and incorporating weather forecasting data, including wind, wave, and currents, we search for a route that minimizes fuel oil consumption with estimated time of arrival restrictions. Our approach is tested on several shipping routes, demonstrating a fuel consumption reduction compared to other voyage optimization routes. This integrated algorithm offers a potential solution for tackling complex voyage optimization problems in marine environments while considering various weather factors.
47
Ischuk, Igor N. „Modeling of the Optimal Flight Route of Unmanned Aerial Vehicles Based on Infrared Video Navigation Data Based on the Upgraded Dijkstra Algorithm“. Journal of Siberian Federal University. Engineering & Technologies 14, Nr. 7 (November 2021): 788–802. http://dx.doi.org/10.17516/1999-494x-0356.
Der volle Inhalt der QuelleAnnotation:
The article presents a model for constructing the optimal flight route of unmanned aerial vehicles based on infrared video navigation data based on the upgraded Dijkstra algorithm. The method and algorithm for implementing the model for constructing the optimal flight route are considered. Numerical estimates of the frequency distribution of correlation values between reference (reference) and current images in the infrared wavelength range at different times of the day are obtained. The actual time period of the day is determined for the creation and further use of reference (reference) images with the longest possible use time during the next day. Optimal routes are constructed with the coordinates of the reference (reference) route, relative to the time of the formation of the reference route, taking into account the recognition of the zones of blocking flights of unmanned aerial vehicles according to the Dijkstra algorithm
48
Kinney, Mitchell. „Template matching route classification“. Journal of Quantitative Analysis in Sports 16, Nr. 2 (25.06.2020): 133–42. http://dx.doi.org/10.1515/jqas-2019-0051.
Der volle Inhalt der QuelleAnnotation:
AbstractThis paper details a route classification method for American football using a template matching scheme that is quick and does not require manual labeling. Pre-defined routes from a standard receiver route tree are aligned closely with game routes in order to determine the closest match. Based on a test game with manually labeled routes, the method achieves moderate success with an overall accuracy of 72% of the 232 routes labeled correctly.
49
Zhuang, Xinqing, Siqing Zhuang, Dongmei Su, Sheng Du und Yihua Liu. „TPS-Genetic Algorithm for Real-Time Sailing Route Planning based on Potential Field Theory“. European Journal of Engineering and Technology Research 8, Nr. 3 (28.06.2023): 86–99. http://dx.doi.org/10.24018/ejeng.2023.8.3.3061.
Der volle Inhalt der QuelleAnnotation:
Real-time route planning is always a difficulty in maritime traffic. Route planning must take into account the complex meteorological environment. Route planning based on meteorological environment real-time update is the basis of route feasibility. Based on potential field theory, this paper proposes a TPS - Genetic algorithm for real-time route planning of sailing ships. On the basis of genetic algorithm, combined with the characteristics of route planning, the turning point sorting operation is added to improve the calculation efficiency, and further improve the real-time performance of route planning. Simulation experiments are established and compared with A* algorithm. The experimental results show that the potential field theory can accurately express the dynamic changes of Marine meteorology, and the path planned by TPS - Genetic algorithm is more suitable for real-time navigation environment. TPS - Genetic algorithm can be applied to ship navigation system, which can further adjust the potential energy base and plan routes according to the needs of shipping companies.
50
Zhou, Xiao, Lingyu Chen, Mingzhan Su und Jiangpeng Tian. „Water Ecotourism Route Recommendation Model Based on an Improved Cockroach Optimization Algorithm“. Water 14, Nr. 13 (23.06.2022): 2014. http://dx.doi.org/10.3390/w14132014.
Der volle Inhalt der QuelleAnnotation:
Aiming to address the problems of the current research on water ecotourism routes, a water ecotourism route recommendation model based on an improved cockroach optimization algorithm is proposed. The aim is to recommend the tour routes with the lowest exhaust emissions. Firstly, depending on tourists’ once-visited water scenic spots, a scenic spot recommendation model based on the improved item-based collaborative filtering algorithm is set up. Then, by combining the recommended scenic spots and integrating the random transportation modes selected by tourists, a tour route recommendation model based on an improved cockroach optimization algorithm is constructed, which can output the tour route that produces the lowest exhaust emissions. Finally, The sample experiment shows that, on the basis of combining with the multivariate random transportation modes, the proposed algorithm has greater advantages than the tour routes planned by the traditional electronic maps, as it can output the tour routes with the lowest exhaust emissions, reduce the damage exhaust emissions cause in the urban water environments and to water resources, and effectively protect the urban water ecological environments.