A parametric total order on fuzzy numbers and a fuzzy shortest route problem

Optimization ◽  
1994 ◽  
Vol 30 (4) ◽  
pp. 367-377 ◽  
Author(s):  
N. Furukawa
Keyword(s):  
Fuzzy Numbers ◽  
Total Order ◽  
Route Problem ◽  
Shortest Route

Solutions of the Shortest-Route Problem—A Review

1960 ◽  
Vol 8 (2) ◽  
pp. 224-230 ◽  
Author(s):  
Maurice Pollack ◽  
Walter Wiebenson
Keyword(s):  
Route Problem ◽  
Shortest Route

How Ants Can Efficiently Solve Generalized Watchman Route Problem

2011 ◽  
Vol 2 (3) ◽  
pp. 1-15 ◽  
Author(s):  
Pawel Paduch ◽  
Krzysztof Sapiecha
Keyword(s):  
Mobile Robot ◽  
Ant Algorithm ◽  
Route Problem ◽  
Shortest Route

This paper presents a new algorithm for solving the generalized watchman problem. It is the problem of mobile robot operators that must find the shortest route for the robot to see the whole area with many obstructions. The algorithm adapts the well-known ant algorithm to the new problem. An experiment where the algorithm is applied to an area containing more than 10 obstructions is described. It proves that efficiency and accuracy of the algorithm are high.

scholarly journals REVIEW ON SHORTEST ROUTE PROBLEM IN URBAN NETWORK SYSTEM

2019 ◽  
Vol 4 (3) ◽  
pp. 149-152
Author(s):  
K. M. Roopa ◽  
Vishwanath M. C. ◽  
Srinivasu V. K. ◽  
V. G. Umesh
Keyword(s):  
Network System ◽  
Urban Network ◽  
Route Problem ◽  
Shortest Route

How Ants Can Efficiently Solve the Generalized Watchman Route Problem

2013 ◽  
pp. 193-208
Author(s):  
Pawel Paduch ◽  
Krzysztof Sapiecha
Keyword(s):  
Mobile Robot ◽  
Ant Algorithm ◽  
Route Problem ◽  
Shortest Route

This paper presents a new algorithm for solving the generalized watchman problem. It is the problem of mobile robot operators that must find the shortest route for the robot to see the whole area with many obstructions. The algorithm adapts the well-known ant algorithm to the new problem. An experiment where the algorithm is applied to an area containing more than 10 obstructions is described. It proves that efficiency and accuracy of the algorithm are high.

Sign in / Sign up

Export Citation Format

Share Document