Search results
1 – 10 of 100This research has developed a one-stop service supply chain mobile application for the purpose of marketing, product distribution and location-based logistics for elderly farmers…
Abstract
This research has developed a one-stop service supply chain mobile application for the purpose of marketing, product distribution and location-based logistics for elderly farmers and consumers in accordance with the Thailand 4.0 economic model. This is an investigation into the agricultural product distribution supply chain which focuses on marketing, distribution and logistics using the Dijkstra’s and Ant Colony Algorithms to respectively explore the major and minor product transport routes. The accuracy rate was determined to be 97%. The application is congruent with the product distribution, supply chain, in a value-based economy. The effectiveness of the mobile application was indicated to be at the highest level of results of learning outcomes, user comprehension and user experience of users. That is, the developed mobile application could be effectively used as a tool to support elderly farmers to distribute their agricultural products in the one-stop service supply chain which emphasizes marketing, distribution and location-based logistics for elderly farmers and consumers with respect to Thailand 4.0.
Details
Keywords
Taiguo Qu and Zixing Cai
Isometric feature mapping (Isomap) is a very popular manifold learning method and is widely used in dimensionality reduction and data visualization. The most time-consuming step…
Abstract
Purpose
Isometric feature mapping (Isomap) is a very popular manifold learning method and is widely used in dimensionality reduction and data visualization. The most time-consuming step in Isomap is to compute the shortest paths between all pairs of data points based on a neighbourhood graph. The classical Isomap (C-Isomap) is very slow, due to the use of Floyd’s algorithm to compute the shortest paths. The purpose of this paper is to speed up Isomap.
Design/methodology/approach
Through theoretical analysis, it is found that the neighbourhood graph in Isomap is sparse. In this case, the Dijkstra’s algorithm with Fibonacci heap (Fib-Dij) is faster than Floyd’s algorithm. In this paper, an improved Isomap method based on Fib-Dij is proposed. By using Fib-Dij to replace Floyd’s algorithm, an improved Isomap method is presented in this paper.
Findings
Using the S-curve, the Swiss-roll, the Frey face database, the mixed national institute of standards and technology database of handwritten digits and a face image database, the performance of the proposed method is compared with C-Isomap, showing the consistency with C-Isomap and marked improvements in terms of the high speed. Simulations also demonstrate that Fib-Dij reduces the computation time of the shortest paths from O(N3) to O(N2lgN).
Research limitations/implications
Due to the limitations of the computer, the sizes of the data sets in this paper are all smaller than 3,000. Therefore, researchers are encouraged to test the proposed algorithm on larger data sets.
Originality/value
The new method based on Fib-Dij can greatly improve the speed of Isomap.
Details
Keywords
Tanvir Habib Sardar and Ahmed Rimaz Faizabadi
In recent years, there is a gradual shift from sequential computing to parallel computing. Nowadays, nearly all computers are of multicore processors. To exploit the available…
Abstract
Purpose
In recent years, there is a gradual shift from sequential computing to parallel computing. Nowadays, nearly all computers are of multicore processors. To exploit the available cores, parallel computing becomes necessary. It increases speed by processing huge amount of data in real time. The purpose of this paper is to parallelize a set of well-known programs using different techniques to determine best way to parallelize a program experimented.
Design/methodology/approach
A set of numeric algorithms are parallelized using hand parallelization using OpenMP and auto parallelization using Pluto tool.
Findings
The work discovers that few of the algorithms are well suited in auto parallelization using Pluto tool but many of the algorithms execute more efficiently using OpenMP hand parallelization.
Originality/value
The work provides an original work on parallelization using OpenMP programming paradigm and Pluto tool.
Details
Keywords
Jiansen Zhao, Xin Ma, Bing Yang, Yanjun Chen, Zhenzhen Zhou and Pangyi Xiao
Since many global path planning algorithms cannot achieve the planned path with both safety and economy, this study aims to propose a path planning method for unmanned vehicles…
Abstract
Purpose
Since many global path planning algorithms cannot achieve the planned path with both safety and economy, this study aims to propose a path planning method for unmanned vehicles with a controllable distance from obstacles.
Design/methodology/approach
First, combining satellite image and the Voronoi field algorithm (VFA) generates rasterized environmental information and establishes navigation area boundary. Second, establishing a hazard function associated with navigation area boundary improves the evaluation function of the A* algorithm and uses the improved A* algorithm for global path planning. Finally, to reduce the number of redundant nodes in the planned path and smooth the path, node optimization and gradient descent method (GDM) are used. Then, a continuous smooth path that meets the actual navigation requirements of unmanned vehicle is obtained.
Findings
The simulation experiment proved that the proposed global path planning method can realize the control of the distance between the planned path and the obstacle by setting different navigation area boundaries. The node reduction rate is between 33.52% and 73.15%, and the smoothness meets the navigation requirements. This method is reasonable and effective in the global path planning process of unmanned vehicle and can provide reference to unmanned vehicles’ autonomous obstacle avoidance decision-making.
Originality/value
This study establishes navigation area boundary for the environment based on the VFA and uses the improved A* algorithm to generate a navigation path that takes into account both safety and economy. This study also proposes a method to solve the redundancy of grid environment path nodes and large-angle steering and to smooth the path to improve the applicability of the proposed global path planning method. The proposed global path planning method solves the requirements of path safety and smoothness.
Details
Keywords
Anisa Azharunnisa, Sumana Gupta and Sudha Panda
The purpose of this paper is to create optimally located Facilitation Centers on this tourist circuit, evaluated through network analysis, thus creating an effective linkage…
Abstract
Purpose
The purpose of this paper is to create optimally located Facilitation Centers on this tourist circuit, evaluated through network analysis, thus creating an effective linkage between tourism and economic activities of the craftsmen who are the custodians of the cultural heritage of Puri.
Design/methodology/approach
The craft villages lying in and around this tourist circuit are surveyed to establish socio-economic condition of artisans, significance of the craft and spatial distribution of craft villages and the willingness of artisans to travel closer to the transport spine. Network analysis is used to assess the suitability of Facilitation Center location using travel time and distance as parameters. Finally, the sustainability of the Facilitation Centers is evaluated using a cost-benefit analysis (CBA).
Findings
The Facilitation Centers can be spatially developed at the strategic locations to expand tourist market. This will help in leveraging the economic benefits of tourism to a marginalized rural artisan community by creating a sustainable model.
Originality/value
The focus on festival can help to protect local cultural traditions, develop tourism and promote the economic, social and cultural developments of the destination. Dispersal strategies adopted aim to increase visitors' satisfaction with the product and thus entice them to stay longer in the destination.
Details
Keywords
Boris Mitavskiy, Jonathan Rowe and Chris Cannings
A variety of phenomena such as world wide web, social or business networks, interactions are modelled by various kinds of networks (such as the scale free or preferential…
Abstract
Purpose
A variety of phenomena such as world wide web, social or business networks, interactions are modelled by various kinds of networks (such as the scale free or preferential attachment networks). However, due to the model‐specific requirements one may want to rewire the network to optimize the communication among the various nodes while not overloading the number of channels (i.e. preserving the number of edges). The purpose of this paper is to present a formal framework for this problem and to examine a family of local search strategies to cope with it.
Design/methodology/approach
This is mostly theoretical work. The authors use rigorous mathematical framework to set‐up the model and then we prove some interesting theorems about it which pertain to various local search algorithms that work by rerouting the network.
Findings
This paper proves that in cases when every pair of nodes is sampled with non‐zero probability then the algorithm is ergodic in the sense that it samples every possible network on the specified set of nodes and having a specified number of edges with nonzero probability. Incidentally, the ergodicity result led to the construction of a class of algorithms for sampling graphs with a specified number of edges over a specified set of nodes uniformly at random and opened some other challenging and important questions for future considerations.
Originality/value
The measure‐theoretic framework presented in the current paper is original and rather general. It allows one to obtain new points of view on the problem.
Details
Keywords
The purpose of this paper is to present a new approach for finding a minimum-length trajectory for an autonomous unmanned air vehicle or a long-range missile from a release point…
Abstract
Purpose
The purpose of this paper is to present a new approach for finding a minimum-length trajectory for an autonomous unmanned air vehicle or a long-range missile from a release point with specified release conditions to a destination with specified approach conditions. The trajectory has to avoid obstacles and no-fly zones and must take into account the kinematic constraints of the air vehicle.
Design/methodology/approach
A discrete routing model is proposed that represents the airspace by a sophisticated network. The problem is then solved by applying standard shortest-path algorithms.
Findings
In contrast to the most widely used grids, the generated networks allow arbitrary flight directions and turn angles, as well as maneuvers of different strengths, thus fully exploiting the flight capabilities of the aircraft. Moreover, the networks are resolution-independent and provide high flexibility by the option to adapt density.
Practical implications
As an application, a concept for in-flight replanning of flight paths to changing destinations is proposed. All computationally intensive tasks are performed in a pre-flight planning prior to the launch of the mission. The in-flight planning is based entirely on precalculated data, which are stored in the onboard computer of the air vehicle. In particular, no path finding algorithms with high or unpredictable running time and uncertain outcome have to be applied during flight.
Originality/value
The paper presents a new network-based algorithm for flight path optimization that overcomes weaknesses of grid-based approaches and allows high-quality solutions. The method can be applied for quick in-flight replanning of flight paths.
Details
Keywords
Thomas Fridolin Iversen and Lars-Peter Ellekilde
For robot motion planning there exists a large number of different algorithms, each appropriate for a certain domain, and the right choice of planner depends on the specific use…
Abstract
Purpose
For robot motion planning there exists a large number of different algorithms, each appropriate for a certain domain, and the right choice of planner depends on the specific use case. The purpose of this paper is to consider the application of bin picking and benchmark a set of motion planning algorithms to identify which are most suited in the given context.
Design/methodology/approach
The paper presents a selection of motion planning algorithms and defines benchmarks based on three different bin-picking scenarios. The evaluation is done based on a fixed set of tasks, which are planned and executed on a real and a simulated robot.
Findings
The benchmarking shows a clear difference between the planners and generally indicates that algorithms integrating optimization, despite longer planning time, perform better due to a faster execution.
Originality/value
The originality of this work lies in the selected set of planners and the specific choice of application. Most new planners are only compared to existing methods for specific applications chosen to demonstrate the advantages. However, with the specifics of another application, such as bin picking, it is not obvious which planner to choose.
Details
Keywords
Ishita Seth, Kalpna Guleria and Surya Narayan Panda
The internet of vehicles (IoV) communication has recently become a popular research topic in the automotive industry. The growth in the automotive sector has resulted in…
Abstract
Purpose
The internet of vehicles (IoV) communication has recently become a popular research topic in the automotive industry. The growth in the automotive sector has resulted in significant standards and guidelines that have engaged various researchers and companies. In IoV, routing protocols play a significant role in enhancing communication safety for the transportation system. The high mobility of nodes in IoV and inconsistent network coverage in different areas make routing challenging. This paper aims to provide a lane-based advanced forwarding protocol for internet of vehicles (LAFP-IoV) for efficient data distribution in IoV. The proposed protocol’s main feature is that it can identify the destination zone by using position coordinates and broadcasting the packets toward the direction of destination. The novel suppression technique is used in the broadcast method to reduce the network routing overhead.
Design/methodology/approach
The proposed protocol considers the interferences between different road segments, and a novel lane-based forwarding model is presented. The greedy forwarding notion, the broadcasting mechanism, and the suppression approach are used in this protocol to reduce the overhead generated by standard beacon forwarding procedures. The SUMO tool and NS-2 simulator are used for the vehicle's movement pattern and to simulate LAFP-IoV.
Findings
The simulation results show that the proposed LAFP-IoV protocol performs better than its peer protocols. It uses a greedy method for forwarding data packets and a carry-and-forward strategy to recover from the local maximum stage. This protocol's low latency and good PDR make it ideal for congested networks.
Originality/value
The proposed paper provides a unique lane-based forwarding for IoV. The proposed work achieves a higher delivery ratio than its peer protocols. The proposed protocol considers the lanes while forwarding the data packets applicable to the highly dense scenarios.
Details
Keywords