Calculator for shortest distance, shortest time and lowest transportaion charge

Abstract

Abstract PURPOSE: To realize circulation without the waste of time, labor, energy and cost with a suitable route by obtaining the optimum solution of a place visiting order by which a distance becomes the shortest, time becomes shortest and transportation cost becomes the most inexpensive, when all places are visited based on the method of a neural network. CONSTITUTION: A selection means M4 selects data on the shortest distance, shortest time and the most inexpensive cost of the inputted places from data stored in a storage means M3. A user only touches the visiting places on a map and gives an indication. Thus, data based on the actual route is automatically prepared and an operation means M5 speedily obtains the optimum solution of the place visiting order by which the distance, and time become the shortest and transportation cost becomes the most inexpensive based on the method of the neural network. Thus, the economic and power saving route based on the actual route can automatically be obtained and the suitable visiting order can be obtained by using data.

Inventors

• 👤 Kenji Kurono
• 👤 黒野　健治

Bibliographic Details