JPH0462588A - Electronic traffic guide device - Google Patents

Abstract

PURPOSE:To obtain the best course based on a numeral that a user selects by giving evaluation scores to necessary times, fares, and frequencies of transfer among plural courses between a departure station and a destination station which are obtained by an arithmetic means, and substituting the evaluation scores and weight that the user inputs previously in an evaluation function and thus finding an evaluation score. CONSTITUTION:A station name is inputted by a station name input means 1 and then an arithmetic means 3 calculates traffic guide information and plural courses by utilizing data in a station information data storage means 2, so that the results are displayed on a display means 4. An optimum path calculating means 6, on the other hand, calculates the best course among the courses obtained by the means 3 according to order weighted by a weighting means 5 and this course is displayed on a display means 4 similarly. The means 6 calculates the best course for the user among the courses found by the means 3. Namely, an optimum course calculating means gives the evaluation values A, B, and C to the necessary times, fares, and frequencies of transfer of the courses and substitutes values (a), (b), and (c) weighted by a means 5 in the evaluation function to find the evaluation scores of the courses, thereby calculating the best course according to whether the evaluation scores are large or small.

Description

DETAILED DESCRIPTION OF THE INVENTION [Industrial Field of Application] The present invention relates to a portable traffic guide device that can easily obtain various traffic information on transportation systems such as trains and subways.

[Prior art] In order to select the optimal route from a departure station to a destination station, the optimal route is calculated by using an electrical method to select the shortest time route, minimum fare route, or minimum number of transfers among multiple routes. An application for an electronic traffic guide device for display has already been filed by the present applicant (see Japanese Patent Application No. 2-41172).

[Problems to be Solved by the Invention] However, in the method for selecting an optimal route according to the invention, there are cases where the shortest route requires a long time but the fare is high and the number of transfers is large, or the route with the minimum fare costs but requires a very long time. The problem is that the route is long and requires many transfers, and does not necessarily match the optimal route desired by the user.

The present invention aims to solve the above-mentioned problems.
The object of the present invention is to provide a device that allows a user to obtain a route based on numerical values selected as desired.

[Means for Solving the Problems] In order to solve the above problems, the present invention provides input means for inputting departure station names and destination station names, and input means for inputting departure station names and destination station names, time required between each station, fare information, timetable information, station name and A station information data storage means that stores route names in advance, and a route between a departure station and a destination station, a transfer station name, and a transfer route input by the input means using the station information data stored in this storage means. A calculation means for calculating the name, transfer time, required time, and fare to obtain traffic guide information and multiple routes, and basic data for the user to select the optimal route from among the multiple routes obtained by this calculation means. weighting means that serves as a guideline for selecting the optimal route for each element of the required time, fare, and number of transfers; and the weighting of the required time, fare, number of transfers, and the weighting for each of the plurality of routes obtained by the calculation means. 1 weighted by means
an optimal route calculation means that gives an evaluation value to each of the elements described above, further substitutes this evaluation value into an evaluation function to obtain an evaluation score for each route, and determines the optimal route from this evaluation score; and an optimal route calculated thereby. and display means for displaying the traffic guide information obtained by the calculation means.

U Effect J The electronic traffic guide device based on the present invention calculates the required time for multiple routes between the departure station and the destination station obtained by the calculation means.
An evaluation point is given to the fare and the number of transfers, and this evaluation point and the weight input in advance by the user are substituted into the evaluation function to obtain the evaluation score.The ranking of this evaluation score is used to determine the optimal value based on the numerical value selected by the user. It's about getting directions.

[Example] Embodiments of the present invention will be described below based on the drawings.

FIG. 1 is a block diagram showing the configuration of an embodiment of the present invention.

That is, by inputting a station name by the station name manual means 1, the calculation means 3 uses data in the station information data storage means 2.
calculates the traffic guide information and multiple routes, and displays the results on the display means 4.

On the other hand, based on the ranking weighted by the weighting means 5, the optimal route calculation means 6 calculates the optimal route from among the plurality of routes obtained by the calculation means 3, and similarly displays this route on the display means 4.

FIG. 2 shows an electronic traffic guide device as an embodiment of the present invention, and is for explaining the station name manual means 1 including the weighting means 5 and the display means 4.

In this figure, the display means 4 is disposed on the upper part of the main body A, and is constituted by a display device 4a such as a liquid crystal display, and displays the traffic guide information and a plurality of routes.

The station name manual means 1 consists of a departure station key 1a, a destination station key 1b1, 10 dial keys 1c that display ``A, KA, SA, TA, NA, HA, MAYA, RA, WA'', and 10 dial keys 1c for up, down, left, and right. direction key 1d
It is composed of.

That is, the station name manual means 1 searches for a station name using the dial key IC and the up/down/left/right direction keys 1d, and registers the searched station name using the departure station key 1a and destination station key 1b or registers the station name in the main body A. This is used to store data in a memory device.

Next, the station information data storage means 2 stores the required time between each station, fare information, timetable information, station name, and route name, and the fare information may be the fare or business distance, and the station name is the name of the connecting route. is stored correspondingly.

The calculation means 3 uses, for example, a microcomputer to calculate a plurality of possible routes between the departure station and the destination station registered by the station name manual means 1, as well as the name of the transfer station, name of the transfer route, transfer time, and travel time for each route. Traffic guide information such as time and fare is obtained from the station information data storage means 2.

The display means 4 displays information obtained from the calculation means 3, optimal route information, etc.

The weighting means 5 is arranged as a weighting key 5a on a part of various keys as a station name manual means of the main body, and is used to calculate each element of the information obtained from the calculation means 3, such as the required time, fare, and number of transfers for multiple routes. The user can arbitrarily set the weighting (ranking) desired by the user.

It should be noted that weighting is done by using a, b, and c as weight symbols for the required time, fare, and number of transfers, respectively, and the larger the numerical value, the higher the degree of importance placed on each of these.

For example, if the values of a, b, and c range from 0≦a, b, c≦3, and you want to weight them in the order of travel time, fare, and number of transfers, then If the fare is low and time is not important, set the weights as a = 1, b = 2, and c = 3.

If the user does not want these to be elements of the optimal route, the weight of that element is set to 0. Furthermore, by setting two of the three elements to O, it is possible to find the shortest time route, the minimum fare route, and the minimum number of transfer routes, respectively.

The optimum route calculation means 6 calculates the optimum route for the user from among the plurality of routes obtained by the calculation means 3.

That is, the optimal route calculation means gives evaluation values to be described later for each of the required time, fare, and number of transfers for multiple routes, and the values of a, b, and c weighted by the weighting means 5 and the evaluation values are calculated as described below. Substitute it into the evaluation function to find the evaluation scores of multiple routes, and calculate the optimal route based on the magnitude of the evaluation scores.

As for how to give the evaluation values, for example, let the evaluation values be A, B, and C for the required time, fare, and number of transfers, respectively, the number of multiple routes is n (n≧1 integer), and each route number is x (1). ≦X≦n integer), and each element A, B,
If the ranking of C is RA,, Rn, R6, the evaluation values at this time are AX=n-RA,+1 BX=nRRx+1 CX''n-R,,+1, respectively.

The ranking RA is the route with the shortest travel time ranked first.
A=1), and the following steps are performed sequentially. Similarly, for RB, the one with the least number of transfers is ranked first (RB=1), and for R, the one with the least number of transfers is ranked first (Rcl).

Furthermore, the evaluation values of A, B, and C may be determined by a method of giving absolute evaluation values instead of relative evaluation values based on the ranking. That is, this is a method in which each pre-ranked value is used as an evaluation value. For example, if the fare is ¥120 to ¥150, the evaluation value B = 10, ¥160.
In this method, the evaluation value is set such that if the amount is ¥210, the evaluation value B=9.

Further, the evaluation function is based on the weights a, b, c for each element calculated by the weighting means 5 and the evaluation value for each route, and the evaluation score Σ8 is Σ, = aAx + bB, +
cC.

The route X that maximizes Σ obtained by is calculated as the optimal route.

Flowcharts of the present invention are shown in FIGS. 3 to 8, and the operation of the present invention will be explained below.

FIG. 3 is a flowchart of the key human power detection process, and shows the station name human power means 1.
key operation of any one of the ten dial keys 1c displayed as ``RA・WA'', the up/down/left/right direction keys 1d, the departure station key 1a, the destination station key 1b, and the weighting key 5a as the weighting means 5. Steps 100 → 110 until
→ 120 → 130 → 140 → 100 and execute.

FIG. 4 is a flowchart of dial key manual processing, in which steps 100→20 are
Move the processing to 0 and say, “A, ka, sa, ta, na, ha, ma, ya.”
Search for station names whose initial letters are the input characters from RA・WA and display them in alphabetical order (steps 210 → 220
).

FIG. 5 is a flowchart of manual scroll key processing, in which the process moves from step 110 to step 300 by operating the up, down, left, and right direction keys 1d, and it is determined whether the display means 4 is in the search station name display state (step 300); If the searched station name is displayed, the execution moves to step 310, and if the up arrow key is manually operated, the station name currently displayed on the display 4 is scrolled and displayed in reverse alphabetical order.Step 31
0→320), the execution returns to the key human power detection process. If the down key is manually operated, the station names displayed on the display means 4 are scrolled and displayed in alphabetical order (steps 310→330→340), and the execution returns to the key detecting process.

If the left direction key is pressed manually, the first letter of the station name displayed on the display means 4, for example, ``Tokyo Station''.

If so, display on the display means 4 the station name with the initial letter ``Pa'' by scrolling ° and °゛ in reverse alphabetical order, such as °°Tennocho °''. Steps 310→33
0→350→360), the execution returns to the key input detection process. In addition, in the case of using the right direction key manually, the initials of the station name displayed on the display means 4, for example, ° "Tokyo", are the letters "°" and "°" scrolled in alphabetical order.
Steps 310 -> 330 -> 350 -> 37 to display the station name with the initials, for example "°Nakai", on the display means 4.
0→380), the execution returns to the key human power detection process.

Further, in step 300, if the searched station name is not displayed, the process moves from step 300 to step 390, and the guide information displayed on the display means 4 is scrolled up and down using the up or down key.

FIG. 6 is a flowchart of the departure station key manual processing, in which step 120 → 4 is executed by operating the departure station key 1a.
00, it is determined whether the display means 4 is in the searched station name display state (station name selection state) (step 400), and the departure station is registered or stored (steps 400→410).

FIG. 7 is a flowchart of the destination station key manual processing, in which step 130→
500 and register the destination station (step 500→
510) and selects the optimal route between the departure station and the destination station. The departure station and destination station are registered in Japanese Patent Application No. 2-41172 filed by the same applicant as the above-mentioned conventional example.
By operating as shown in the figure, the dial keys of the station name manual means 1, the up/down/left/right direction keys 1d, and the departure station key 1a are pressed.

The station name is searched and registered using the destination station key 1b.

In executing the optimal route selection, multiple possible routes between the departure station and the destination station, and the required time, fare, and number of transfers for each of the multiple routes are calculated (step 520
), the above-mentioned evaluation values A, B, and C are given to the required time, fare, and number of transfers (step 530).

These evaluation values A, B, and C are substituted into the evaluation function described above to obtain an evaluation score Σ8 for each route. Mo and Σ.

calculates the maximum value (step 540), the route for which Σ8 has the maximum value is displayed on the display means 4 as the optimal route (step 550), and the process returns to the key input detection process.

FIG. 8 is a flowchart of the weighting key manual process, which is a process in which the weighting desired (intended) by the user is arbitrarily set by operating the weighting key 5a.

By operating the weight key 5a of the weighting means 5, the weighting items (required time, fare, number of transfers) and the corresponding weights currently being set are displayed on the display device 4a as the display means 4 (step 600). .

Then, until the up/down/left/right direction keys 1d and the weighting key 5a are operated, the steps 600→610→630→
Repeat 650 → 670 → 690 → 600.

At this time, the cursor can be moved to the item whose weighting value is desired to be changed using the up and down keys of the direction key 1d, and the weight value of the item at the cursor position can be changed using the left and right keys of the direction key 1d.

For example, when the down arrow key is input, the cursor can be moved one item per operation from the required time → fare → number of transfers (steps 610 → 620).
When the up arrow key is input, the cursor can be moved from the number of transfers to the fare to the required time (step 6).
30→640) Furthermore, by inputting the left direction key, the weight of the item to which the cursor was moved in steps 620 and 640 can be increased by 1 (step 650).
→660), and when the right arrow key is input, the weight of the item to which the cursor has been moved can be subtracted by 1 (steps 670 →680).

When the weighting setting is completed, the weighting key is inputted again (step 590), and the process returns to the key human power detection process.

As described above, the user can obtain the desired optimal route by setting the weight (desired ranking) of the desired route using the weighting means 5 and inputting the departure station and destination station.

[Effects of the Invention] As described above, according to the present invention, the user can easily know the route according to each element such as the required time, fare, and number of transfers as needed. By inputting the route weighting order arbitrarily in advance, you can automatically and quickly find out the route between the desired departure station and destination station, and the operation method is extremely simple. Anyone can use it easily.

[Brief explanation of the drawing]

FIG. 1 is a block diagram showing the configuration of an embodiment of the present invention, and FIG. 2 is an external view of the embodiment of the present invention. FIG. 3 is a flowchart of key human power detection processing. Figure 4 is a flowchart of dial key manual processing, Figure 5 is a flowchart of scroll key manual processing, Figure 6 is a flowchart of departure station key manual processing, Figure 7 is a flowchart of destination station key manual processing, and Figure 8 is a flowchart of manual processing of destination station keys. The figure is a flowchart of weighting key manual processing. l...Station name manual means 2...Station information data storage means 3...Calculation means 4...Display means 5
... Weighting means 6 ... Optimal route calculation means Fig. 1

Claims (1)

[Claims] an input means for inputting a departure station name and a destination station name;
A station information data storage means pre-stores the required time between each station, fare information, timetable information, station name, and route name, and the station information data stored in this storage means is inputted by the input means. a calculation means for calculating the route between the departure station and the destination station, transfer station name, transfer route name, transfer time, required time, and fare to obtain traffic guide information and multiple routes; Weighting means that serves as a guide for selecting the optimal route for each element of travel time, fare, and number of transfers as basic data for the user to select the optimal route from among them, and multiple routes obtained by the calculation means. For each route, an evaluation value is given for the required time, fare, number of transfers, and each of the aforementioned factors weighted by the weighting means.Furthermore, this evaluation value is substituted into an evaluation function to obtain an evaluation score for each route, and this evaluation is performed. An electronic traffic guide device comprising an optimal route calculation means for determining the optimal route from scores, and a display means for displaying the optimal route calculated thereby and traffic guide information obtained by the calculation means.