KR20090000070A - System for auto using the traffic information - Google Patents

Abstract

A system and a method of automatically allocating vehicles using traffic signal information are provided to dynamic speed report processing from a taxi, network distance-based taxi allocation, directional and non-directional routing considering a dynamic situation, and a planning function for the multiple destination, the efficient solution of a TSP problem by linux cluster-based parallel processing, the converting function of the additional locations, and the analysis function of a shape file through a wireless network consisting of a call control center, a telematics server, and a linux cluster. A tachometer(10) is installed within a taxi, measures the traffic information, and generates the measured traffic information to tacho data. A telematics(11) receives coordinate information measured in GPS(Global Positioning System) as location information, wirelessly receives the processed traffic information, and displays the processed traffic information in a screen. A call control server(20) receives the traffic information of the tachometer and the present position information and destination of the telematics through a mobile communications network, and receives the command of a driver or an operator to generate the location list of the taxi. A telematics server(30) transmits and receives data with the call control server through the Internet, matches the location list delivered from the call control serve, and computes each per link minimum distance matched through the cost information of each link. A linux cluster(40) computes the information transmitted from the telematics server or stores the information in a database.

Description

Automatic dispatch system and method using traffic signal information {SYSTEM FOR AUTO USING THE TRAFFIC INFORMATION}

1 is an overall system configuration of an automatic dispatch system using traffic signal information of the present invention,

2 is a flowchart of a method for maintaining dynamic speed information by an automatic dispatching system using traffic signal information according to the present invention;

3 is a flowchart of a route searching method using an automatic dispatch system using traffic signal information according to the present invention;

4 is a flowchart of a taxi allocation method using an automatic dispatch system using traffic signal information of the present invention;

5 is a flow chart of a multi-path planning method by an automatic dispatching system using traffic signal information of the present invention,

6 is a flow chart for performing an additional function by the automatic dispatch system using the traffic signal information of the present invention,

* Description of the main parts of the drawings *

10 tachometer 11: telematics

12: GPS 20: call control server

30: Telematics Server 40: Linux Cluster

41: first slave 42: second slave

The present invention relates to an automatic dispatch system using traffic signal information for efficiently operating a transportation means such as a taxi in a tourist complex in which tourist attractions are concentrated, such as Jeju Island.

In general, commercial vehicles including taxis, call taxis, etc. are difficult to manage because the transportation companies work remotely from the transportation companies.

The transportation company is also equipped with a wireless terminal that can transmit and receive wirelessly to exchange information with commercial vehicles.

Such a wireless terminal takes an inefficient method of directly exchanging information using a mobile phone or PCS phone using a mobile telephone communication network, a wireless terminal using a frequency common communication network (TRS), or a public telephone communication network (PSTN).

In particular, the transportation company collectively calls a number of unspecified commercial vehicles in operation, and noise in the vehicle caused by unnecessary calls is unpleasant to the driver and passengers. In addition, continuous call listening and response is an obstacle to safe driving.

In addition, there is little information or record on the operation of the commercial vehicle, so the vehicle cannot be operated irrationally, and the driving habits and working attitudes of the driver cannot be judged, which remains a big problem in the operation of the transportation company.

Thus, in the related art, the overall business management of a taxi receives data by connecting data of various vehicle operations and business conditions recorded in the taxi operation recording apparatus installed in the taxi with a computer installed in the taxi company. And by outputting the data, the operating condition of the taxi and the sales analysis of the driver have been performed.

The overall business management of these taxis requires a taxi to enter the taxi garage and connect a computer with a driving recorder in the taxi company, so a garage with a high value in the downtown area is required. There is a problem that must enter the garage one by one. In addition, the traffic around the garage is severe, especially after the sales of the taxi to obtain and manage the sales information data, there was a problem that the sales management is not quick.

In addition, there is a problem that the driver's shift is made only in the garage where the driver wants or does not want to increase the driver's discomfort and the driving efficiency is extremely reduced.

Thus, there was a system in which information exchange between transportation companies and commercial vehicles was replaced by wireless.

That is, in order to record the information about the operation of the vehicle, the commercial vehicle has a driving recorder for collecting and recording the information about the operation of the vehicle, a device for converting the recorded driving record into radio data for transmitting and transmitting the same; And exchange information remotely.

In the conventional communication method for driving records, in order to transmit the stored driving record, the commercial vehicle can transmit the driving record only in a specific region, and there is a problem in that it is impossible to transmit the driving record in real time. .

In addition, the time required to drive a vacant car to transmit the driving record becomes longer, which causes the unreasonable operation of the commercial vehicle, the driving income and the quality of service to the consumer.

Accordingly, an object of the present invention for solving the above problems, the dynamic speed report processing from the taxi, the network distance based taxi allocation, the dynamic situation through the wireless network network consisting of call control center, telematics server, Linux cluster Consideration of directional and non-directional routing, planning for multiple destinations, efficient solution of TSP problem by Linux cluster-based parallel processing, additional location conversion function, automatic dispatching using traffic signal information for shape file analysis To provide a system.

In order to achieve the above object, the present invention, in the traffic information providing system using telematics, is installed in the taxi, the tachometer (10) for measuring the traffic information and generating it as taco data; Telematics (11) for receiving coordinate information measured by GPS as position information, and receiving the processed traffic information wirelessly and displaying it on the screen; The server is built in a call control center, the traffic of the tachometer (10) A call control server 20 which receives information and current location information and a destination of the telematics 11 through a mobile communication network, and generates a location list of a taxi in response to a driver or operator's command; Send and receive data with the call control server 20 through an internet network, match the location list received from the call control server 20, and calculate the shortest distance for each matched link through cost information of each link. A telematics server 30; The telematics server 30 is connected to the Internet, and is composed of a Linux cluster 40 that calculates or stores information transmitted from the telematics server 30 in a DB, and is designated through speed information and location information of a taxi. It is achieved by an automatic dispatch system using traffic signal information, characterized in that it is possible to reach from the starting point to the destination at a minimum cost.

In addition, the present invention, when the call control server 20 receives the taxi call information through the telephone or kiosk at the control center, the taxi call information is generated and the taxi list within 10km from the location to query the The result is transmitted to the telematics server 30, and through this, it is preferable to request the telematics 11 of the corresponding taxi to receive the taxi ID of the shortest distance retrieved from the telematics server 30 to perform a taxi dispatch.

In addition, in the present invention, when an operator receives a request of a driver or a user and transmits a list of specific points of a tourism complex to the telematics server 30, the telematics server 30 is based on the longitude and latitude coordinates of the list. It is desirable to convert to a format usable in either software.

In addition, in the present invention, the telematics server 30 constructs a coordinate utility, which is a utility for handling the update problem of the map, and receives an ESRI shape file related to a node, a link, and a POI, and generates the data structure in the form of a multiple neighbor list. It is a good idea to structure it in memory DB or save it to a Graph.txt file.

In addition, the present invention the Linux cluster 40 is a DB for further storing the record transmitted from the telematics server 30; A slave which instructs the node list transmitted from the telematics server 30 to obtain a cost matrix in a MPI manner through a private network; It is preferable that it is composed of a master that calculates the cost matrix given to them in parallel, receives the partial result again through MPI, performs the Lin-Kernighan heuristic method, and determines the order of visits and returns to the control server.

In another aspect, the present invention provides a method for providing traffic information using telematics, the telematics 11 transmits the position information measured by the received GPS and the speed information measured by the tachometer at a set time interval to the call control server 20 (S21); The call control server 20 transmitting the position information and the speed information to the telematics server 30, and the telematics server matching the corresponding section based on the latitude and longitude coordinates of the received position information (S22); Updating the graph cost after performing the matching (S23); Calculating a time required to update the graph cost (S24); Preferably, the telematics server 30 is configured to add a traffic information record including the time information and graph cost to a database in a Linux master using a mysql client library (S25).

In another aspect, the present invention provides a traffic information providing method using telematics, the call control server 20 to set the starting point and destination by the driver or the operator of the control center (S31); The call control server 20 transmitting the longitude and latitude coordinates corresponding to the origin and destination to the telematics server 30 and determining the direction at the same time (S32); If the directionality is not considered, the telematics server 30 finds the nearest node in the telematics server 30 for these two points, performs an A * algorithm to find a path between the two nodes, and then selects a node list. Generating (S33); Calculating a final distance by adding a section length from a current taxi position to a departure point (S34); Preferably, the step 35 determines the time required by calculating the distance of each link with the most recently received speed information.

In addition, the step of determining the direction (S32), the step of obtaining a node to reach based on the current position of the starting point and the progress direction received from the GPS when the path search considering the direction (S36); Determining an attribute of the node to determine whether the U-turn is allowed (S37); If the U-turn is not allowed in the node, making an infinite cost of the currently passed link and performing an A * algorithm (S38); After performing the algorithm, it is preferable to return to the node list generation step S33.

In another aspect, the present invention provides a method for providing traffic information using telematics, comprising: generating a taxi call to a control center operator through a kiosk or a telephone (S41); Transmitting, by the operator, the call control server 20 to a telematics server a current taxi call location and a result of inquiring a taxi list within a radius of 10 km from the call (S42); The telematics server 30 receiving the request and converting each position indicated by the longitude and latitude coordinate system into a node position on a graph (S43); The telematics server 30 performing a breadth-first search Dijkstra algorithm toward each taxi location from a call origination point through the converted node location (S44); Judging the first taxi found as the nearest taxi on the network distance and informing the control server of the ID of the taxi (S45); It is preferable that the call control server 20 is configured to perform a taxi dispatch based on this (S46).

In addition, the present invention is a method for providing traffic information using telematics, the method comprising: transmitting a list of each destination including a latitude and longitude coordinate system of each destination by a call in the telematics 11 or an operator of a control system to the telematics server; S51); Generating, by the telematics server 30, the longitude and latitude coordinates to the node, and generating a node list to the master of the Linux cluster (S52); Instructing, by the master, each slave node to obtain a cost matrix in a MPI manner through a private network (S53); Each of the slaves and the master calculates the cost matrix given to them in parallel and transfers the partial result back to the master through the MPI, and the master performs the Lin-Kernighan heuristic method to determine the order of visits (S54); Accordingly, the visit procedure result is preferably configured to return to the control server (S55).

Hereinafter, the automatic dispatch system and method using the traffic signal information of the present invention will be described in more detail with reference to the accompanying drawings.

As shown in Figure 1, the automatic dispatch system using the traffic signal information of the present invention is a call control system for transmitting and receiving information from the tachometer 10 and the telematics 11, the tachometer and telematics 11 mounted on the taxi 100, the GPS 12 for providing location information to the telematics (11).

The tachometer 10 is installed in a vehicle, and is a general tachometer that measures ride information, mileage information, fare information, location information, and the like and generates the tacho data.

The tachometer 10 has a wireless communication function and transmits the tachometer data to the call control system 100.

The telematics 11 receives coordinate information measured by the GPS 12 and transmits the location information to the call control system 100 and processes it in the call control system 100 through the location information. It is a general telematics device that receives the graphic information (current position, shortest path, call occurrence, etc.) and displays it on the screen.

In addition, the GPS 12 is a general GPS 12 that transmits coordinate information of the taxi mounted with the telematics 11 to the telematics 11 through wireless communication with the telematics 11.

The tachometer 10 and the telematics 11 transmit the location information and taco data to the call control system 100 through a CDMA mobile communication network.

The call control system 100 includes a call control server 20, a telematics server 30, and a Linux cluster 40.

The call control server 20 is a server built in a call control center, and receives information from the telematics 11 and transmits the information to the telematics server 30 through an internet network of TCP / IP.

More specifically, the call control server 20 receives a plurality of taxi position information transmitted from the telematics 11 in units of 1 minute and transfers all of them to the telematics server 30.

In addition, when a taxi call (taxi request) information is received through a telephone or a kiosk at the control center, the call control server 20 inquires a location of the taxi call information and a taxi list within a radius of 10 km from the location. The result is transmitted to the telematics server 30, through which the taxi ID of the shortest distance retrieved from the telematics server 30 is transmitted to request the telematics 11 of the corresponding taxi to perform a taxi dispatch.

In addition, a command for determining the order of multiple destinations or a command requiring additional functions is received from the telematics 11 of the driver or received by the operator's operation of the control center and transmitted to the telematics server 30, and the telematics server ( Via 30), the result value calculated by the Linux cluster 40 is returned and transmitted to the telematics 11.

The telematics server 30 transmits and receives data with the call control server 20 through an internet network.

The telematics server 30 matches the traffic information corresponding to the corresponding section (link) based on the location information of the taxi transmitted from the call control server 20 or the latitude and longitude coordinates of the destination and the starting location.

More specifically, the telematics server 30 matches which section the coordinates belong to based on location information (longitude and latitude coordinates) of each taxi transmitted from the call control server 20 in units of 1 minute, and with the tachometer The graph cost is updated by receiving the velocity information measured at.

In the general description of the present invention, the term "expense" is a term that includes a distance in a corresponding section, a time according to a distance, an energy according to time and distance, etc. It means the weight for.

In addition, the update of the graph cost is to take up-to-date speed information and discard past speed information in order to express the speed information by time zone and date of each section as statistics.

The required time is calculated by calculating the speed and distance through the speed information and the location information. The My SQL client library records records consisting of the latest speed information for each section and traffic information such as required time. Store it in a database built on the Linux cluster (40).

(My SQL provides a client library written in the c programming language that you can use to write client programs that access MySQL databases.)

It also receives location information (longitude and latitude coordinates) of the starting point and destination set by the driver or operator of the control center, and finds the nearest node in its graph for these two points and calculates the path between the two nodes. An algorithm is performed, where the cost of each link (meaning as described above) uses the latest information collected so far. That is, information on the speed for each distance according to the traffic situation and the energy required for the movement in each link is calculated through the recently updated information.

Here, the A * algorithm is a graph search algorithm for finding a path from an initial node to a target node. The A * algorithm is an algorithm for finding the lowest cost path from a starting state to a target state while examining adjacent states in a specific state in space. To estimate the best route to the target nodes, use a "heuristic estimate" that gives each node a ranking and in that order Visit the node.

The node list is generated based on the route calculated in A *, and the final distance is calculated by adding the length of the pre-established link (current taxi position). In this process, the distance of each link is determined by calculating the distance with the most recently received speed information.

In addition, the node to be reached is obtained based on the current position and the heading of the starting point received by the GPS 12 for the path search considering the direction.

In addition, based on the latitude and longitude coordinate information of the currently located taxi list received from the call control server 20 to convert the node position and the Dijkstra algorithm which is a breadth-first search toward each taxi position from the call origination point. Notifies the call control server 20 after performing.

The Dijkstra algorithm is an algorithm for solving the shortest path problem between a given starting point and a destination point in a direction graph in which no edge has a negative value.

In the multipath planning, the latitude and longitude coordinates of each destination transmitted from the call control server 20 are mapped to nodes to generate a node list, and then the node list is transmitted to the Linux cluster 40.

In addition, it receives a list of specific points in response to an operator's or user's request. In this case, the latitude and longitude coordinates are converted into a format usable by software such as Concorde or Matlab, and saved and sent to the user whenever requested. To be possible.

Each file is used as input to Concorde or Matlab's TSP solver program, respectively.

In addition, as shown in FIG. 6, when the operator receives a request from a driver or a special user (traffic information service company) and transmits a list of specific points of the tourism complex to the telematics server 30, the telematics server 30 Based on the latitude and longitude coordinates of this list, it is converted into a format usable by software such as Concorde or Matlab.

The converted file is primarily stored on the server computer and delivered to the user on request.

These files are then used as input to Concorde or Matlab's TSP solver program, respectively.

In addition, as shown in FIG. 7, the telematics server 30 constructs a Cordinate utility, which is a utility for handling the updating problem of the map, and is performed when necessary within the telematics server 30 itself in an offline state. .

The telematics server 30 receives an ESRI shape file related to a node (section), a link (point), and a point of interest (POI), and generates the data structure in the form of a multi-adjacent list, which is structured as a memory DB data structure or Graph.txt. Save to a file to simplify future map loading.

ESRI Shapefile is a non-phase data format that stores and provides geometric position and attribute information about geospatial data.

Here, the Coordinate utility receives the node information, extracts the latitude and longitude coordinates, and assigns the node number. At this time, the node information determines whether or not U-turn can be used for directional path allocation. It also finds both endpoints by receiving link information and maps them to the nodes corresponding to the endpoints. Again, links are automatically numbered.

Later, when creating a map from a shape file, a pack function is provided to remove error-redundant nodes and redundant links. When extracting the link-related information, the distance according to the difference in the longitude and latitude is calculated so that the distance of each link is stored together and combined with the speed collected later to calculate the time required. POI information reads the latitude and longitude coordinates of each POI point based on the DBF file attached to the shape file and maps it to the corresponding node.

The Linux cluster 40 is connected to the telematics server 30 through the Internet, so that the information transmitted from the telematics server 30 is calculated or stored in a DB.

More specifically, in the maintenance of the dynamic speed information, the record transmitted from the telematics server 30 is added to the DB and stored.

In multipath planning, the node list transmitted from the telematics server 30 is instructed to obtain a cost matrix to each slave (first slave, second slave) node through the private network in an MPI manner.

Each slave 41, 41 and master 43 calculates the cost matrix given to them in parallel, and transfers the partial result back to the master through MPI, and the master 43 performs the Lin-Kernighan heuristic method. Is determined and returned to the control server.

2 is a flowchart illustrating a dynamic speed maintaining method using an automatic dispatch system using traffic signal information according to the present invention.

As shown in the figure, the telematics 11 transmits the received GPS data (location information) and the speed information measured by the tachometer to the call control server 20 once per minute (S21).

The call control server 20 transmits it to the telematics server 30, and the telematics server matches with which section (link) it belongs based on the latitude and longitude coordinates of the received data (S22).

After the matching is performed, the graph cost is updated (S23), and time information according to the update of the graph cost is calculated (S24).

The telematics server 30 adds traffic information records such as time information, graph cost, etc. to the database in the Linux master using the mysql client library (S25).

3 is a flowchart illustrating a method for searching a route using an automatic dispatch system using traffic signal information according to the present invention.

As shown in the figure, the call control server 20 sets the starting point and the destination by the driver or the operator of the control center (S31).

The call control server 20 transmits their latitude and longitude coordinates to the telematics server 30. At this time, the direction is considered (S32). This is the case.

If the directionality is not taken into consideration, the telematics server 30 finds the nearest node in its graph for these two points, performs an A * algorithm to find a path between the two nodes, and then generates a node list. (S33).

At this time, the cost of each link uses the latest information collected so far, and the node list is generated based on the path calculated in A *.

The final distance is calculated by adding the section length from the current taxi position to the starting point (S34).

In this process, the required time is determined by calculating the distance of each link with the speed information most recently received (35).

In addition, the node to be reached is calculated based on the current position of the starting point and the progress direction received from the GPS for the path search considering the direction (S36).

If the U-turn is not determined by determining the property of the node (S37), after making the cost of the currently passed link to infinity and performing the A * algorithm (S38), the process returns to the node list generating step (S33) again. The final distance is calculated and the time required is determined. (S34-35).

4 is a flowchart illustrating a table allocation method using an automatic dispatch system using traffic signal information according to the present invention.

As shown in the figure, a taxi call is generated to the control center operator via a kiosk or telephone (S41).

By the operation of the operator, the call control server 20 transmits the location where the current taxi call is generated and the result of inquiring a taxi list within a radius of 10 km from the call to the telematics server (S42).

The telematics server 30 receives this request and converts each position indicated by the longitude and latitude coordinate system into a node position on the graph (S43).

The telematics server 30 performs a breadth-first search Dijkstra algorithm toward each taxi location from the call generation point through the converted node location (S44).

At this time, the first taxi found is the nearest taxi on the network street and informs the control server of the ID of the taxi (S45).

The call control server 20 performs a taxi dispatch based on this (S46).

5 is a flowchart illustrating a method for multipath planning using an automatic dispatch system using traffic signal information according to the present invention.

As shown in the figure, the list of each destination including the longitude and latitude coordinate system of each destination is transmitted to the telematics server by the call in the telematics 11 or by the operator of the control system. (S51)

This is based on a service that allows passengers to set a number of destinations and a taxi driver can make a daily visit plan based on the daily rental, which is a form of taxi service in Jeju Island.

The telematics server 30 generates a node list by mapping the latitude and longitude coordinates to the node and transmits the node list to the master of the Linux cluster (S52).

The master instructs each slave node to obtain a cost matrix in a MPI manner through a private network (S53).

At this time, each slave and master calculate their cost matrix in parallel. This partial result is delivered back to the master through the MPI, the master performs the Lin-Kernighan heuristic method to determine the order of visits (S54), and returns the result to the control server (S55).

As described in detail above, the automatic dispatching system and method using the traffic signal information of the present invention more efficiently operate and operate taxis according to the characteristics of the tourism complex through a wireless network consisting of a call control center, a telematics server, and a Linux cluster. It can be done.

The technical idea of the automatic dispatch system using the traffic signal information of the present invention has been described above with the accompanying drawings, but this is only illustrative of the best embodiments of the present invention and is not intended to limit the present invention. In addition, it is obvious that any person skilled in the art can make various modifications and imitations without departing from the scope of the technical idea of the present invention.

Claims (10)

In the traffic information providing system using telematics, A tachometer 10 installed in the taxi to measure traffic information and generate the taco data; A telematics 11 for receiving coordinate information measured by GPS as position information and receiving the processed traffic information wirelessly and displaying it on a screen; It is a server built in the call control center, and receives the traffic information of the tachometer 10, the current location information and the destination of the telematics 11 through a mobile communication network, and receives a command of the driver or operator to list the location of the taxi A call control server 20 to generate; Send and receive data with the call control server 20 through an internet network, match the location list received from the call control server 20, and calculate the shortest distance for each matched link through cost information of each link. A telematics server 30; The telematics server 30 is connected to the Internet, and is composed of a Linux cluster 40 that calculates or stores information transmitted from the telematics server 30 in a DB, and is designated through speed information and location information of a taxi. Automatic dispatch system using traffic signal information, characterized in that to reach the minimum from the starting point to the destination. The method of claim 1, When the call control server 20 receives taxi call information through a telephone or a kiosk at a control center, the call list is searched for a location of the taxi call information and a taxi list within a radius of 10 km from the location, and the result of the telematics server ( 30), and by using the traffic signal information, characterized in that by requesting the telematics (11) of the corresponding taxi to receive the taxi ID received the shortest distance retrieved by the telematics server 30 through this taxi dispatch Dispatching system. The method of claim 1, When the operator transmits a list of specific points of the tourism complex to the telematics server 30 at the request of the driver or the user, the telematics server 30 uses either Concorde or Matlab software based on the latitude and longitude coordinates of the list. Automatic dispatching system using the traffic signal information, characterized in that for converting to a format usable in. The method of claim 1, The telematics server 30 constructs a Cordinate utility, which is a utility for processing the update problem of the map, receives an ESRI shape file related to nodes, links, and POIs, and generates the data structure in the form of a multi-neighbor list. Automated dispatch system using traffic signal information, which is structured or saved in Graph.txt file. The method of claim 1, The Linux cluster 40 further includes a DB for storing the record transmitted from the telematics server 30; A slave which instructs the node list transmitted from the telematics server 30 to obtain a cost matrix in a MPI manner through a private network; Traffic signal information comprising a master that calculates the cost matrix given to them in parallel and receives the partial result again through MPI and performs Lin-Kernighan heuristic method to determine the visit order and return to the control server Automatic dispatch system using the. In the traffic information providing method using telematics, Transmitting, by the telematics 11, the position information measured by the received GPS and the speed information measured by the tachometer at a predetermined time interval to the call control server 20 (S21); The call control server 20 transmitting the position information and the speed information to the telematics server 30, and the telematics server matching the corresponding section based on the latitude and longitude coordinates of the received position information (S22); Updating the graph cost after performing the matching (S23); Calculating a time required to update the graph cost (S24); The traffic information information is configured by the telematics server 30 to add a traffic information record including the time information and graph cost to a database in a Linux master using a mysql client library. Auto dispatch method used. In the traffic information providing method using telematics, Setting a starting point and a destination by the call control server 20 by a driver or an operator of a control center (S31); The call control server 20 transmitting the longitude and latitude coordinates corresponding to the origin and destination to the telematics server 30 and determining the direction at the same time (S32); If the directionality is not considered, the telematics server 30 finds the nearest node in the telematics server 30 for these two points, performs an A * algorithm to find a path between the two nodes, and then selects a node list. Generating (S33); Calculating a final distance by adding a section length from a current taxi position to a departure point (S34); And determining (35) the time required by calculating the distance of each link with the speed information most recently received. The method of claim 7, wherein Determining the direction (S32), when performing a route search in consideration of the direction to obtain a node to reach based on the current position of the starting point and the progress direction received from the GPS (S36); Determining an attribute of the node to determine whether the U-turn is allowed (S37); If the U-turn is not allowed in the node, making an infinite cost of the currently passed link and performing an A * algorithm (S38); Automatic distribution system using the traffic signal information, characterized in that back to the node list generation step (S33) after the execution of the algorithm. In the traffic information providing method using telematics, Generating a taxi call to a control center operator through a kiosk or a telephone (S41); Transmitting, by the operator, the call control server 20 to a telematics server a current taxi call location and a result of inquiring a taxi list within a radius of 10 km from the call (S42); The telematics server 30 receiving the request and converting each position indicated by the longitude and latitude coordinate system into a node position on a graph (S43); The telematics server 30 performing a breadth-first search Dijkstra algorithm toward each taxi location from a call origination point through the converted node location (S44); Judging the first taxi found as the nearest taxi on the network distance and informing the control server of the ID of the taxi (S45); The call control server 20 is an automatic dispatch method using traffic signal information, characterized in that configured to perform a taxi dispatch based on this (S46). In the traffic information providing method using telematics, Transmitting a list of each destination including a latitude and longitude coordinate system of each destination by a call in the telematics 11 or an operator of a control system (S51); Generating, by the telematics server 30, the longitude and latitude coordinates to the node, and generating a node list to the master of the Linux cluster (S52); Instructing, by the master, each slave node to obtain a cost matrix in a MPI manner through a private network (S53); Each of the slaves and the master calculates the cost matrix given to them in parallel and transfers the partial result back to the master through the MPI, and the master performs the Lin-Kernighan heuristic method to determine the order of visits (S54); And returning the result of the visit order to the control server (S55) according to the above.

Images