Study on Optimal Algorithm for Shipping Route Automatic-Generation Based on Electronic Chart

2011 ◽  
Vol 105-107 ◽  
pp. 2133-2139
Author(s):  
Jian Bo Xu ◽  
Zhi Kun Wang ◽  
Li Sheng Song
Keyword(s):  
Shortest Path ◽  
Optimal Algorithm ◽  
Turning Points ◽  
Route Planning ◽  
Automatic Generation ◽  
Rubber Band ◽  
Generation Algorithm ◽  
Shortest Route ◽  
Electronic Chart ◽  
Sea Area

For the traditional automatic-generation algorithm of electronic chart plan shipping route, it is difficult to achieve the shortest route and the least turning points at the same time. In this article, the optimal and planned shipping route automatic-generation method algorithm based on the rubber band algorithm was put forward. In this algorithm, the elasticity principle of rubber band was adopted to improve the original and basic path and the shortest path and the least turning points can be achieved at the same time. The experimental results showed that the algorithm can quickly and automatically generate an optimal and safe route with good stability and high searching efficiency and so it can be applied to shipping route planning in complicated and large sea area.

scholarly journals STANDARDISATION OF PLOTTING COURSES AND SELECTING TURN POINTS IN MARITIME NAVIGATION

2014 ◽  
Vol 26 (4) ◽  
pp. 313-322
Author(s):  
Zvonimir Lušić ◽  
Serđo Kos ◽  
Stipe Galić
Keyword(s):  
Information System ◽  
Turning Points ◽  
Route Planning ◽  
Subjective Assessment ◽  
Database Search ◽  
Data Recording ◽  
Automatic Selection ◽  
Electronic Chart ◽  
Maritime Navigation ◽  
Selection Of

Today's methods of plotting courses and selecting sailing routes and turn points in maritime navigation are still largely based on subjective assessment of the master or the officer in charge. This results in a great variety of course distribution and, accordingly, in various ship movements. Modern electronic aids, in particular ECDIS (Electronic Chart Display and Information System) can significantly facilitate maritime voyage planning, course plotting, selection of turning points, etc. In addition to displaying electronic charts, the specific feature of these systems is that they facilitate route planning, supervision of ship movements, data recording, database search, alarm setting, etc. However, these systems do not yet provide automatic selection of courses on user's request in a standardised form. Therefore, in most cases, the routes and turn points are selected empirically or because they have been previously defined and used. This paper shows the drawbacks of the existing methods of selecting routes and plotting courses in maritime navigation and gives recommendations how to improve them.

The Map-Based Shortest Route Selection by Using Ant Colony Optimization Algorithm

2018 ◽  
Vol 1 (1) ◽  
pp. 15
Author(s):  
Achmad Fanany Onnilita Gaffar ◽  
Agusma Wajiansyah ◽  
Supriadi Supriadi
Keyword(s):  
Ant Colony Optimization ◽  
Shortest Path ◽  
Optimization Algorithm ◽  
Optimization Problems ◽  
Google Earth ◽  
Ant Colony ◽  
Food Sources ◽  
Shortest Route ◽  
Study Results ◽  
Destination Point

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

scholarly journals An Optimal Algorithm to Find Next-to-Shortest Path between Two Vertices of Cactus Graphs

2019 ◽  
Vol 7 (4) ◽  
pp. 639-645
Author(s):  
Sambhu Charan Barman, ◽  
Madhumangal Pal ◽  
Sukumar Mondal
Keyword(s):  
Shortest Path ◽  
Optimal Algorithm ◽  
Cactus Graphs

scholarly journals Implementasi Honey Bee Mating Optimization Pada Vehicle Routing Problem With Time Windows Dalam Perencanaan Jalur Wisata Malang

Repositor ◽  
2020 ◽  
Vol 2 (4) ◽  
pp. 495
Author(s):  
M Syawaluddin Putra Jaya ◽  
Yufiz Azhar ◽  
Nur Hayatin
Keyword(s):  
Honey Bee ◽  
Royal Jelly ◽  
Time Windows ◽  
Route Planning ◽  
Routing Problem ◽  
Capacity Limit ◽  
Shortest Route ◽  
Mutation Ratio ◽  
Bee Colonies ◽  
Honey Bee Mating Optimization

Abstrak Vahicle Routing Problem adalah suatu masalah pencaian jalur yang akan dilalui dengan tujuan mencari rute yang paling cepat atau pendek. Vahicle Routing Problem with Time Windows (VRPTW) yang merupakan sebutan bagi VRP dengan kendala tambahan berupa adanya time windows pada masing-masing pelanggan yang dalam hal ini berupa destinasi wisata. Dalam penelitian ini diterapkan Honey Bee Mating Optimization (HBMO) dalam menyelesaikan VRPTW. HBMO sendiri terinspirasi oleh perilaku koloni lebah ketika bereproduksi. Algoritma tersebut bertujuan untuk mengevaluasi pencarian individu atau solusi terbaik. Tujuan dari penelitian ini adalah bagaimana mengimplementasikan Honey Bee Mating Optimization dalam menyelesaikan VRPTW pada perencanaan jalur wisata di Malang. Sehingga dapat meminimumkan waktu dan jarak tempuh perjalanan. Berdasarkan hasil pengujian, parameter yang optimal untuk optimasi VRPTW menggunakan HBMO pada kasus perencannan jalur wisata Malang yaitu dengan menggunakan 800 generasi, populasi lebah jantan sebesar 300, batas kapasitas spermatheca sejumlah 100, nilai mutation ratio (Pm) dan royal jelly masing-masing bernilai 0.5.Abstract Vahicle Routing Problem is a problem of finding the best route that will be passed with the purpose to finding the fastest or shortest route. Vahicle Routing Problem with Time Windows (VRPTW) is a part of VRP with additional obstacles in the form of time windows in each customer. In this research, Honey Bee Mating Optimization (HBMO) was applied to completing VRPTW. HBMO itself was inspired by the behavior of bee colonies when reproducing. The purpose of this algorithm is to evaluate the best individual or the best solutions. The purpose of this research is how to implement Honey Bee Mating Optimization to completing VRPTW in Malang tourism route planning. So that it can minimize travel time and distance. Based on the results of the testing, the optimal parameters for VRPTW optimization using HBMO in Malang tourism route planning case are using 800 generations, the male bee population is 300, the capacity limit of spermatheca is 100, the mutation ratio (Pm) and royal jelly are respectively 0.5.

scholarly journals Intelligent Policy Framework for Georouting Using Spatial Database

2018 ◽  
Vol 7 (3.6) ◽  
pp. 5
Author(s):  
Swasti Saxena ◽  
B Amutha ◽  
Abhinaba Das
Keyword(s):  
Climate Change ◽  
Carbon Footprint ◽  
Shortest Path ◽  
Policy Framework ◽  
Energy Sources ◽  
Tourist Attraction ◽  
Android Application ◽  
Shortest Route ◽  
The Right ◽  
Day By Day

In today’s world of time effectiveness and climate change it is a necessity to take the right decision at the right time and act responsibly! Our carbon footprint is increasing day by day and our injudicious use of non-renewable sources of energy are posing a threat to get these energy sources exhausted soon! It is our responsibility to take an initiative towards it from our end.In this paper I am going to discuss about an Android Application which I have developed that will solve the problem of finding the shortest route from source to destination. This will lead to less wastage of car fuel and time to find the shortest path!This application has a two fold benefit  i.e. one of finding the shortest path from source and destination and second is acting as a world tour guide. It will not only show you the places of tourist attraction in that place but will also facilitate in providing suggestions for the cheapest means of transport that should be taken in order reach destination in minimum possible time and by spending minimum amount of money on travel!

Optimal and Conforming Motion of a Point in a Constrained Plane

1989 ◽  
Author(s):  
C. Ahrikencheikh ◽  
A. A. Seireg ◽  
B. Ravani
Keyword(s):  
Free Space ◽  
Time Complexity ◽  
Velocity Vector ◽  
Automatic Generation ◽  
Geometric Constraints ◽  
Computational Time ◽  
Motion Generation ◽  
Optimal Point ◽  
Generation Algorithm

Abstract This paper deals with automatic generation of motion of a point under both geometric and non-geometric constraints. Optimal point paths are generated which are not only free of collisions with polygonal obstacles representing geometric constraints but also conform to non-geometric constraints such as speed of the motion, a maximum allowable change in the velocity vector and a minimum clearance from the obstacle boundaries. The concept of passage networks and conforming paths on the network are introduced. These are used to provide a new representation of the free space as well as a motion generation algorithm with a computational time complexity of only O(n3.log(n)), where n designates the total number of obstacle vertices. The algorithm finds the shortest or fastest (curved) path that also conforms with preset constraints on the motion of the point. The point paths generated are proved to be optimal while conforming to the constraints.

A New Algorithm for Euclidean Shortest Path of Visiting Segments in a Polygon

2014 ◽  
Vol 644-650 ◽  
pp. 1891-1894
Author(s):  
Li Juan Wang ◽  
An Sheng Deng ◽  
Bo Jiang ◽  
Qi Wei
Keyword(s):  
Test Data ◽  
Shortest Path ◽  
Time Complexity ◽  
Simple Polygon ◽  
Rubber Band ◽  
Crossing Over ◽  
Euclidean Shortest Path ◽  
Adjacent Segments ◽  
Improved Algorithm

Let s and t be two points on the boundary of a simple polygon, how to compute the Euclidean shortest path between s and t which visits a sequence of segments given in the simple polygon is the problem to be discussed, especially, the situation of the adjacent segments intersect is the focus of our study. In this paper, we first analyze the degeneration applying rubber-band algorithm to solve the problem. Then based on rubber-band algorithm, we present an improved algorithm which can solve the degeneration by the method of crossing over two segments to deal with intersection and in our algorithm the adjacent segments order can be changed when they intersect. Particularly, we have implemented the algorithm and have applied a large of test data to test it. The experiments demonstrate that our algorithm is correct and efficient, and it has the same time complexity as the rubber-band algorithm.

scholarly journals Cairo Public Transport Route Finder – A Pilot System

2016 ◽  
Vol 4 (4) ◽  
pp. 26
Author(s):  
Khaled Ahmed Ahmed Mohamed Hassan ◽  
Ghada Nasr Hassan
Keyword(s):  
Shortest Path ◽  
Public Transport ◽  
Public Transportation ◽  
Transportation Network ◽  
Android Application ◽  
Network Graph ◽  
The Public ◽  
Shortest Route ◽  
Greater Cairo ◽  
Starting Location

Aiming to facilitate the choice of transport links leading from a starting location to a destination in greater Cairo, we propose in this work a public transportation mobile (android) application to assist users of public transport. The system is a pilot application that considers the public mini-buses network in three areas of Cairo, and builds the database of the mini-bus network verified on the ground. From this database, the transportation network graph consisting of nodes and possible links between them is constructed. Upon request, the system then identifies the series of public transport possible, calculates the shortest path between the two chosen locations, and displays the bus, or series of buses, and the routes to the user, ordered by distance. The specialized algorithm Dijkstra was implemented to find the shortest route.

Sign in / Sign up

Export Citation Format

Share Document