scholarly journals Semantic-Aware Top-k Multirequest Optimal Route

Complexity ◽  
2019 ◽  
Vol 2019 ◽  
pp. 1-15
Author(s):  
Shuang Wang ◽  
Yingchun Xu ◽  
Yinzhe Wang ◽  
Hezhi Liu ◽  
Qiaoqiao Zhang ◽  
...  
Keyword(s):  
Semantic Similarity ◽  
Route Planning ◽  
Location Based Services ◽  
Optimal Route ◽  
Wide Range ◽  
Potential Applications ◽  
Planning Algorithm ◽  
Keyword Searching ◽  
Path Queries ◽  
Indexing Technique

In recent years, research on location-based services has received a lot of interest, in both industry and academic aspects, due to a wide range of potential applications. Among them, one of the active topic areas is the route planning on a point-of-interest (POI) network. We study the top-k optimal routes querying on large, general graphs where the edge weights may not satisfy the triangle inequality. The query strives to find the top-k optimal routes from a given source, which must visit a number of vertices with all the services that the user needs. Existing POI query methods mainly focus on the textual similarities and ignore the semantic understanding of keywords in spatial objects and queries. To address this problem, this paper studies the semantic similarity of POI keyword searching in the route. Another problem is that most of the previous studies consider that a POI belongs to a category, and they do not consider that a POI may provide various kinds of services even in the same category. So, we propose a novel top-k optimal route planning algorithm based on semantic perception (KOR-SP). In KOR-SP, we define a dominance relationship between two partially explored routes which leads to a smaller searching space and consider the semantic similarity of keywords and the number of single POI’s services. We use an efficient label indexing technique for the shortest path queries to further improve efficiency. Finally, we perform an extensive experimental evaluation on multiple real-world graphs to demonstrate that the proposed methods deliver excellent performance.

PARP: A Parallel Traffic Condition Driven Route Planning Model on Dynamic Road Networks

2021 ◽  
Vol 12 (6) ◽  
pp. 1-24
Author(s):  
Tianlun Dai ◽  
Bohan Li ◽  
Ziqiang Yu ◽  
Xiangrong Tong ◽  
Meng Chen ◽  
...  
Keyword(s):  
Response Time ◽  
Road Networks ◽  
Route Planning ◽  
Location Based Services ◽  
Route Optimization ◽  
Planning Model ◽  
Traffic Condition ◽  
Traffic Conditions ◽  
Skeleton Graph ◽  
Planning Algorithm

The problem of route planning on road network is essential to many Location-Based Services (LBSs). Road networks are dynamic in the sense that the weights of the edges in the corresponding graph constantly change over time, representing evolving traffic conditions. Thus, a practical route planning strategy is required to supply the continuous route optimization considering the historic, current, and future traffic condition. However, few existing works comprehensively take into account these various traffic conditions during the route planning. Moreover, the LBSs usually suffer from extensive concurrent route planning requests in rush hours, which imposes a pressing need to handle numerous queries in parallel for reducing the response time of each query. However, this issue is also not involved by most existing solutions. We therefore investigate a parallel traffic condition driven route planning model on a cluster of processors. To embed the future traffic condition into the route planning, we employ a GCN model to periodically predict the travel costs of roads within a specified time period, which facilitates the robustness of the route planning model against the varying traffic condition. To reduce the response time, a Dual-Level Path (DLP) index is proposed to support a parallel route planning algorithm with the filter-and-refine principle. The bottom level of DLP partitions the entire graph into different subgraphs, and the top level is a skeleton graph that consists of all border vertices in all subgraphs. The filter step identifies a global directional path for a given query based on the skeleton graph. In the refine step, the overall route planning for this query is decomposed into multiple sub-optimizations in the subgraphs passed through by the directional path. Since the subgraphs are independently maintained by different processors, the sub-optimizations of extensive queries can be operated in parallel. Finally, extensive evaluations are conducted to confirm the effectiveness and superiority of the proposal.

Optimal Route Planning Algorithm Based on Real Traffic Network

2005 ◽  
Author(s):  
Nae-Seung Kang ◽  
Byung-Sung Kim ◽  
Ho-Joong Kim
Keyword(s):  
Route Planning ◽  
Traffic Network ◽  
Optimal Route ◽  
Planning Algorithm ◽  
Real Traffic

A novel optimal route planning algorithm for searching on the sea

2021 ◽  
pp. 1-19
Author(s):  
Y. Yang ◽  
Y. Mao ◽  
R. Xie ◽  
Y. Hu ◽  
Y. Nan
Keyword(s):  
Optimal Algorithm ◽  
Route Planning ◽  
Search And Rescue ◽  
Search Rate ◽  
Planning Problem ◽  
Optimal Route ◽  
Planning Algorithm ◽  
Discrete Programming ◽  
Maritime Search And Rescue ◽  
National Emergency

ABSTRACT Emergency search and rescue on the sea is an important part of national emergency response for marine perils. Optimal route planning for maritime search and rescue is the key capability to reduce the searching time, improve the rescue efficiency, as well as guarantee the rescue target’s safety of life and property. The main scope of the searching route planning is to optimise the searching time and voyage within the constraints of missing search rate and duplicate search rate. This paper proposes an optimal algorithm for searching routes of large amphibious aircraft corresponding to its flight characteristics and sea rescue capability. This algorithm transforms the search route planning problem into a discrete programming problem and applies the route traceback indexes to satisfy the duplicate search rate and missing search rate.

Time optimal route planning algorithm of LBS online navigation

2011 ◽  
Author(s):  
Yong Li ◽  
Shitai Bao ◽  
Kui Su ◽  
Qiushui Fang ◽  
Jingfeng Yang
Keyword(s):  
Route Planning ◽  
Optimal Route ◽  
Time Optimal ◽  
Planning Algorithm

scholarly journals The Gradational Route Planning for Aircraft Stealth Penetration Based on Genetic Algorithm and Sparse A-Star Algorithm

2018 ◽  
Vol 151 ◽  
pp. 04001 ◽  
Author(s):  
Li Maoquan ◽  
Zhang Yunfei ◽  
Li Shihao
Keyword(s):  
Genetic Algorithm ◽  
Detection Probability ◽  
Optimal Path ◽  
Route Planning ◽  
Goal Function ◽  
Optimal Route ◽  
Optimal Path Planning ◽  
Planning Algorithm ◽  
Global Optimal ◽  
The Cost

It is established for a gradational route planning algorithm which includes two layers. The first layer makes use of genetic algorithm to obtain the global optimal path by its global optimal characteristics. The second layer makes use of A* algorithm to obtain the local optimal path by its dynamic characteristic. When flying along the global optimal path, locating the new threat and confirming its performance, the aircraft can plan the local optimal path timely by A* algorithm. It is constructed for the cost function with two goals of the range and the average detection probability, which is used as the goal function for optimal path planning. Two paths that obtained from two optimal methods are merged to construct the optimal route comprehensively considering the threats and range. The simulation result shows that the cost of new optimal route is lower than the original optimal path obtained only by the genetic algorithm.It revealed that our algorithm could obtain an optimal path when a new radar threas occured.

scholarly journals A Slot-Die Technique for the Preparation of Continuous, High-Area, Chitosan-Based Thin Films

Polymers ◽  
2021 ◽  
Vol 13 (10) ◽  
pp. 1566
Author(s):  
Oliver J. Pemble ◽  
Maria Bardosova ◽  
Ian M. Povey ◽  
Martyn E. Pemble
Keyword(s):  
Thin Films ◽  
Mechanical Properties ◽  
High Volume ◽  
Mechanical Anisotropy ◽  
Diverse Range ◽  
Direction Parallel ◽  
High Area ◽  
Wide Range ◽  
Slot Die ◽  
Potential Applications

Chitosan-based films have a diverse range of potential applications but are currently limited in terms of commercial use due to a lack of methods specifically designed to produce thin films in high volumes. To address this limitation directly, hydrogels prepared from chitosan, chitosan-tetraethoxy silane, also known as tetraethyl orthosilicate (TEOS) and chitosan-glutaraldehyde have been used to prepare continuous thin films using a slot-die technique which is described in detail. By way of preliminary analysis of the resulting films for comparison purposes with films made by other methods, the mechanical strength of the films produced was assessed. It was found that as expected, the hybrid films made with TEOS and glutaraldehyde both show a higher yield strength than the films made with chitosan alone. In all cases, the mechanical properties of the films were found to compare very favorably with similar measurements reported in the literature. In order to assess the possible influence of the direction in which the hydrogel passes through the slot-die on the mechanical properties of the films, testing was performed on plain chitosan samples cut in a direction parallel to the direction of travel and perpendicular to this direction. It was found that there was no evidence of any mechanical anisotropy induced by the slot die process. The examples presented here serve to illustrate how the slot-die approach may be used to create high-volume, high-area chitosan-based films cheaply and rapidly. It is suggested that an approach of the type described here may facilitate the use of chitosan-based films for a wide range of important applications.

scholarly journals Health Benefits of Uses and Applications of Moringa oleifera in Bakery Products

Plants ◽  
2021 ◽  
Vol 10 (2) ◽  
pp. 318
Author(s):  
Paula García Milla ◽  
Rocío Peñalver ◽  
Gema Nieto
Keyword(s):  
Moringa Oleifera ◽  
Essential Amino Acids ◽  
Bakery Products ◽  
Unani Medicine ◽  
Functional Value ◽  
Organoleptic Characteristics ◽  
Wide Range ◽  
Potential Applications ◽  
Medicinal Properties ◽  
Excellent Source

Moringa oleifera belongs to the Moringaceae family and is the best known of the native Moringa oleifera genus. For centuries, it has been used as a system of Ayurvedic and Unani medicine and has a wide range of nutritional and bioactive compounds, including proteins, essential amino acids, carbohydrates, lipids, fibre, vitamins, minerals, phenolic compounds, phytosterols and others. These characteristics allow it to have pharmacological properties, including anti-diabetic, anti-inflammatory, anticarcinogenic, antioxidant, cardioprotective, antimicrobial and hepatoprotective properties. The entire Moringa oleifera plant is edible, including its flowers, however, it is not entirely safe, because of compounds that have been found mainly in the root and bark, so the leaf was identified as the safest. Moringa oleifera is recognised as an excellent source of phytochemicals, with potential applications in functional and medicinal food preparations due to its nutritional and medicinal properties; many authors have experimented with incorporating it mainly in biscuits, cakes, brownies, meats, juices and sandwiches. The results are fascinating, as the products increase their nutritional value; however, the concentrations cannot be high, as this affects the organoleptic characteristics of the supplemented products. The aim of this study is to review the application of Moringa oleifera in bakery products, which will allow the creation of new products that improve their nutritional and functional value.

scholarly journals Sporulation in solventogenic and acetogenic clostridia

2021 ◽  
Author(s):  
Mamou Diallo ◽  
Servé W. M. Kengen ◽  
Ana M. López-Contreras
Keyword(s):  
Current Knowledge ◽  
Carbon Sources ◽  
Cost Effective ◽  
Biotechnological Production ◽  
Key Points ◽  
Wide Range ◽  
Potential Applications ◽  
A Cell ◽  
Sporulation Initiation ◽  
Solventogenic Clostridia

AbstractThe Clostridium genus harbors compelling organisms for biotechnological production processes; while acetogenic clostridia can fix C1-compounds to produce acetate and ethanol, solventogenic clostridia can utilize a wide range of carbon sources to produce commercially valuable carboxylic acids, alcohols, and ketones by fermentation. Despite their potential, the conversion by these bacteria of carbohydrates or C1 compounds to alcohols is not cost-effective enough to result in economically viable processes. Engineering solventogenic clostridia by impairing sporulation is one of the investigated approaches to improve solvent productivity. Sporulation is a cell differentiation process triggered in bacteria in response to exposure to environmental stressors. The generated spores are metabolically inactive but resistant to harsh conditions (UV, chemicals, heat, oxygen). In Firmicutes, sporulation has been mainly studied in bacilli and pathogenic clostridia, and our knowledge of sporulation in solvent-producing or acetogenic clostridia is limited. Still, sporulation is an integral part of the cellular physiology of clostridia; thus, understanding the regulation of sporulation and its connection to solvent production may give clues to improve the performance of solventogenic clostridia. This review aims to provide an overview of the triggers, characteristics, and regulatory mechanism of sporulation in solventogenic clostridia. Those are further compared to the current knowledge on sporulation in the industrially relevant acetogenic clostridia. Finally, the potential applications of spores for process improvement are discussed.Key Points• The regulatory network governing sporulation initiation varies in solventogenic clostridia.• Media composition and cell density are the main triggers of sporulation.• Spores can be used to improve the fermentation process.

Sign in / Sign up

Export Citation Format

Share Document