JP2019211875A - Vehicle candidate display program, vehicle candidate display method, and vehicle candidate display system - Google Patents

Abstract

To provide a vehicle candidate display program, a vehicle candidate display method, and a vehicle candidate display system capable of providing a vehicle selection screen taking a desired place into consideration.SOLUTION: A vehicle candidate display program causes a computer to execute a process of receiving vehicle request information including a destination. The vehicle candidate display program causes the computer to execute a process of referring to a storage part stored with a desired place indicative of a desired direction for each vehicle, and then calculating, for the vehicle, a value from a time and/or a distance needed for a movement of the vehicle from an arrival place to a desired place. The vehicle candidate display program causes the computer to execute a process of determining a vehicle to be given priority according to the calculated value and then determining a display mode of the vehicle to be displayed on a screen.SELECTED DRAWING: Figure 2

Description

  The present invention relates to a vehicle candidate display program, a vehicle candidate display method, and a vehicle candidate display system.

  The transportation company's vehicle, which is responsible for logistics, may carry an empty vehicle to return to the company after transporting the package to the destination. On the other hand, the shipper may want to transport the luggage but there is no vacant vehicle. In recent years, there has been provided a car rental search service for matching such an empty car and a baggage.

Japanese Patent Application Laid-Open No. 2018-5856

  However, a vehicle that is scheduled to be an empty vehicle returns to the company (desired place) after transporting the matched luggage, but there are cases where the destination is difficult to stop when returning to the company. For this reason, when matching is performed, if a vehicle whose destination is far from the desired location is presented, a burden is imposed on the driver of the vehicle, and logistics productivity and safety may be reduced.

  One aspect is to provide a vehicle candidate display program, a vehicle candidate display method, and a vehicle candidate display system that can provide a vehicle selection screen in consideration of a desired location.

  In one aspect, the vehicle candidate display program causes a computer to execute a process of receiving vehicle search information including an arrival place. The vehicle candidate display program refers to a storage unit that stores a desired location that represents a desired direction for each vehicle, and is calculated for each vehicle from the time and / or distance required to move from the arrival location to the desired location of the vehicle. Causes the computer to execute the process of calculating. The vehicle candidate display program determines a vehicle to be prioritized according to the calculated value, and causes the computer to execute a process of determining a display mode of the vehicle to be displayed on the screen.

  A vehicle selection screen that takes into account the desired location can be provided.

FIG. 1 is a block diagram illustrating an example of the configuration of the matching system according to the embodiment. FIG. 2 is a block diagram illustrating an example of the configuration of the information processing apparatus according to the embodiment. FIG. 3 is a diagram illustrating an example of the operation plan information storage unit. FIG. 4 is a diagram illustrating an example of a work time storage unit. FIG. 5 is a diagram illustrating an example of the required time storage unit. FIG. 6 is a diagram illustrating an example of required time calculation. FIG. 7 is a diagram illustrating an example of a candidate vehicle selection screen for the vehicle search information. FIG. 8 is a diagram illustrating an example of a candidate vehicle selection screen in consideration of the desired location. FIG. 9 is a flowchart illustrating an example of the required time calculation process according to the embodiment. FIG. 10 is a flowchart illustrating an example of the vehicle request reception process according to the embodiment. FIG. 11 is a diagram illustrating an example of a computer that executes a vehicle candidate display program.

  Embodiments of a vehicle candidate display program, a vehicle candidate display method, and a vehicle candidate display system disclosed in the present application will be described below in detail with reference to the drawings. The disclosed technology is not limited by the present embodiment. Further, the following embodiments may be appropriately combined within a consistent range.

  FIG. 1 is a block diagram illustrating an example of the configuration of the matching system according to the embodiment. A matching system 1 illustrated in FIG. 1 includes a vehicle 10, an operation management system 20, a coin search system 30, a berth reservation system 40, and an information processing device 100. In the matching system 1, the number of vehicles 10 is not limited, and an arbitrary number of vehicles 10 may be provided.

  There is a network N between the vehicle 10, the operation management system 20 and the information processing apparatus 100, and between the operation management system 20, the freight search system 30, the berth reservation system 40, and the information processing apparatus 100. And are connected to each other through communication.

  As such a network N, any type of communication network such as the Internet, a LAN (Local Area Network), and a VPN (Virtual Private Network) can be adopted regardless of wired or wireless. Communication via the network N may be encrypted by, for example, TLS (Transport Layer Security) / SSL (Secure Sockets Layer).

  The matching system 1 is a system that collects operation information transmitted from a plurality of vehicles 10 equipped with an operation recorder having a communication function (hereinafter referred to as a digital tachometer) and performs operation management. Moreover, the matching system 1 is a system that performs matching of a car seeking a car, management of a berth reservation, calculation of a required time, and the like.

  The vehicle 10 is, for example, a vehicle equipped with a digital octopus such as a truck. For example, the digital octopus mounted on the vehicle 10 can obtain operation information such as position and speed acquired by a satellite positioning system such as GPS (Global Positioning System), for example, via a base station (not shown) every 1 second. And transmitted to the information processing apparatus 100. The digital octopus has a wireless communication module corresponding to a mobile phone line such as 3G and LTE (Long Term Evolution) as a communication function. The operation information includes information such as a vehicle ID (IDentifier), date and time, acceleration, actual vehicle / empty vehicle, and vehicle type.

  The operation management system 20 provides a service that provides operation management support for the vehicle 10. The operation management system 20 manages a vehicle allocation plan and an operation plan for the plurality of vehicles 10. In addition, the operation management system 20 includes a dynamic management for managing the current position of the vehicle 10 and a matching engine for matching the vehicle 10 with a load.

  The vehicle allocation plan and the operation plan (hereinafter also referred to as operation plan information) are, for example, information on the vehicle ID, departure date / time, departure place, arrival date / time, arrival place, luggage, cargo handling, and the like. The operation management system 20 transmits operation plan information and a required time calculation request to the information processing apparatus 100, and receives required time information including the optimum route and required time based on the operation plan information from the information processing apparatus 100.

  The matching engine acquires the current position of each vehicle 10 from the dynamic management, and acquires information on the desired direction and the actual vehicle / empty vehicle from the allocation plan and the operation plan. In addition, the matching engine acquires the vehicle search information from the coin search system 30. The matching engine transmits the coin-seeking information and the car-seeking information based on the acquired various information to the information processing apparatus 100, and receives a candidate vehicle selection screen from the information processing apparatus 100. Further, the matching engine transmits the current position of each vehicle 10 to the information processing apparatus 100. The matching engine transmits a candidate vehicle selection screen to the coin search system 30 and receives the selected vehicle 10. In addition, the matching engine transmits a vehicle allocation result corresponding to the selected vehicle 10 to the currency search system 30.

  The coin-seeking system 30 receives the car-seeking information from the shipper and provides the ship-finding result to the shipper. The coin search system 30 transmits the received car search information to the operation management system 20. In addition, the coin search system 30 displays the candidate vehicle selection screen received from the operation management system 20 and transmits the selected vehicle 10 to the operation management system 20. Furthermore, the coin search system 30 displays the dispatch result received from the operation management system 20.

  The berth reservation system 40 receives a reservation for a berth. Reservation of a berth is performed using, for example, the target berth, date and time, luggage, loading / unloading information, and the like. The berth reservation system 40 transmits an estimated berth work time to the information processing apparatus 100 when an inquiry about the predicted work time (predicted required time) of loading and unloading work in the berth is received from the information processing apparatus 100. For example, if the berth is reserved, use the estimated work time corresponding to the reserved contents, and if the berth is not reserved, the predicted work time for the berth is estimated work time according to the package and quantity of the luggage. Is used.

  The information processing apparatus 100 is an example of a required time calculation system, and calculates an optimum route and required time based on operation information received from each vehicle 10, operation plan information received from the operation management system 20, and a required time calculation request. And transmitted to the operation management system 20. Further, the information processing apparatus 100 generates a selection screen for candidate vehicles based on the coin-seeking information and the car-seeking information received from the operation management system 20 and transmits them to the operation management system 20. Furthermore, the information processing apparatus 100 transmits an inquiry about the predicted work time to the berth reservation system 40 and receives the predicted work time of the berth.

  That is, the information processing apparatus 100 accepts the car search information including the arrival place. The information processing apparatus 100 refers to a storage unit that stores a desired location that represents a desired direction for each vehicle 10, and determines, for each vehicle 10, the time and / or distance required for movement from the arrival location to the desired location of the vehicle 10. Calculate the value. The information processing apparatus 100 determines the vehicle 10 to be prioritized according to the calculated value, and determines the display mode of the vehicle 10 to be displayed on the screen. Thereby, the information processing apparatus 100 can provide a vehicle selection screen in consideration of the desired location.

  Next, the configuration of the information processing apparatus 100 will be described. FIG. 2 is a block diagram illustrating an example of the configuration of the information processing apparatus according to the embodiment. As illustrated in FIG. 2, the information processing apparatus 100 includes a communication unit 110, a storage unit 120, and a control unit 130. Note that the information processing apparatus 100 may include various functional units included in known computers, for example, functional units such as various input devices and audio output devices, in addition to the functional units illustrated in FIG.

  The communication unit 110 is realized by, for example, a NIC (Network Interface Card). The communication unit 110 is connected to the vehicle 10, the operation management system 20, and the berth reservation system 40 via the network N in a wired or wireless manner, and communicates information between the vehicle 10, the operation management system 20, and the berth reservation system 40. It is the communication interface that governs it. The communication unit 110 receives operation information from the vehicle 10. The communication unit 110 receives from the operation management system 20 the operation plan information and the required time calculation request, the current position of each vehicle 10, the currency information and the vehicle information. The communication unit 110 receives the estimated berth work time from the berth reservation system 40. The communication unit 110 outputs the received operation information, operation plan information and required time calculation request, the current position of each vehicle 10, currency search information and vehicle search information, and the predicted work time of the berth to the control unit 130. To do. In addition, the communication unit 110 transmits the optimal route and the required time input from the control unit 130 and the candidate vehicle selection screen to the operation management system 20. The communication unit 110 transmits an inquiry about the predicted work time input from the control unit 130 to the berth reservation system 40.

  The storage unit 120 is realized by a storage device such as a RAM (Random Access Memory), a semiconductor memory element such as a flash memory, a hard disk, or an optical disk, for example. The storage unit 120 includes an operation plan information storage unit 121, a work time storage unit 122, a performance storage unit 123, and a required time storage unit 124. In addition, the storage unit 120 stores information used for processing in the control unit 130.

  The operation plan information storage unit 121 stores the operation plan information of each vehicle 10 received from the operation management system 20. FIG. 3 is a diagram illustrating an example of the operation plan information storage unit. As shown in FIG. 3, the operation plan information storage unit 121 includes “vehicle ID”, “vehicle information”, “fee”, “luggage”, “packing form”, “departure place”, “route place”, “purpose” It has items such as “Ground”.

  “Vehicle ID” is an identifier for identifying the vehicle 10. “Vehicle information” is information indicating the loading amount of the vehicle 10, the type of loading platform, and the like. “Charge” is information indicating a charge per ton kilometer. “Luggage” is information indicating the type of luggage to be transported in the operation plan. “Packing form” is information indicating the packing state of the package. “Packing” is, for example, a pallet, skid, case, carton, or the like. “Departure location” is information indicating the departure location of the vehicle 10. “Intermediate location” is information indicating a berth that performs operations such as loading and unloading on a route to a destination. In addition, although not shown in figure, it is assumed that the “route point” includes information on whether or not the berth reservation system 40 exists. “Destination” is information indicating a destination in the operation plan of the vehicle 10. Examples of the “destination” include a garage of a transportation company.

  Returning to the description of FIG. 2, the work time storage unit 122 stores work times such as loading and unloading in a berth not using the berth reservation system 40. FIG. 4 is a diagram illustrating an example of a work time storage unit. As illustrated in FIG. 4, the work time storage unit 122 includes items such as “berth”, “pallet”, “skid”, “case”, and “carton”.

  “Birth” is information indicating the name of the berth. “Pallet”, “skid”, “case”, and “carton” are information indicating the work time for each package. In the example of the first row in FIG. 4, the berth “B” indicates that it takes 30 minutes to load or unload the pallet.

  Returning to the description of FIG. 2, the record storage unit 123 stores the operation information received from each vehicle 10 as a past record. The results storage unit 123 stores the operation information as past results, for example, classified for each vehicle 10 or for each departure place and destination.

  The required time storage unit 124 stores required time information including the travel plan information received from the operation management system 20 and the travel time to the destination calculated based on the past results and the predicted work time in the berth. To do. FIG. 5 is a diagram illustrating an example of the required time storage unit. As illustrated in FIG. 5, the required time storage unit 124 includes items such as “vehicle ID”, “departure place”, “route”, and “destination”. “Departure point”, “route point”, and “destination” have items such as “scheduled arrival time”, “actual vehicle / empty car”, and “scheduled departure time”, respectively. “Departure” does not require “scheduled arrival time”, and “destination” does not require “scheduled departure time”. Here, the “departure place” includes the current location of the vehicle 10 and the position (garage or the like) of, for example, tomorrow morning.

  “Vehicle ID” is an identifier for identifying the vehicle 10. “Scheduled arrival time” is information indicating the time at which the vehicle 10 is scheduled to arrive at a transit point or destination. The “actual vehicle / empty vehicle” is information indicating whether or not there is a baggage at the time of departure from the departure point or waypoint, or whether or not there is a baggage at the time of arrival at the destination.

  Returning to the description of FIG. 2, the control unit 130 executes, for example, a program stored in an internal storage device using the RAM as a work area by a CPU (Central Processing Unit), an MPU (Micro Processing Unit), or the like. Is realized. Further, the control unit 130 may be realized by an integrated circuit such as an application specific integrated circuit (ASIC) or a field programmable gate array (FPGA). The control unit 130 includes a reception unit 131, a first determination unit 132, a second determination unit 133, an acquisition unit 134, a calculation unit 135, and an output control unit 136. Information processing described below is performed. Implement or execute a function or action. The internal configuration of the control unit 130 is not limited to the configuration illustrated in FIG. 2, and may be another configuration as long as the information processing described later is performed.

  The accepting unit 131 receives and accepts operation plan information and a required time calculation request from the operation management system 20 via the network N and the communication unit 110. The reception unit 131 stores the received operation plan information in the operation plan information storage unit 121. The reception unit 131 outputs a first determination instruction to the first determination unit 132 in response to the required time calculation request.

  The receiving unit 131 receives and receives the current position of each vehicle 10 from the operation management system 20 via the network N and the communication unit 110. In addition, the reception part 131 may receive each vehicle 10 operation information via the network N and the communication part 110, and may receive the present position of each vehicle. The accepting unit 131 outputs the accepted current position of each vehicle 10 to the calculating unit 135.

  Further, the accepting unit 131 receives and accepts the coin-seeking information and the car-seeking information from the operation management system 20 via the network N and the communication unit 110. The accepting unit 131 outputs the accepted currency seeking information and the car seeking information to the second determining unit 133.

  In other words, the reception unit 131 receives the operation plan information of the vehicle 10 and the required time calculation request of the vehicle 10 to the destination from the service (operation management system 20) that provides operation management support of the vehicle 10. That is, the accepting unit 131 accepts registration of information on one or a plurality of operations among loading and unloading operations for each vehicle 10. Moreover, the reception part 131 receives the present position of the vehicle 10 from the service which performs operation management support. In addition, the reception unit 131 receives vehicle search information for the vehicle 10. That is, the accepting unit 131 accepts the vehicle search information including the loading place and the arrival place (unloading place). Further, the vehicle search information includes information on loading and unloading times.

  When the first determination instruction is input from the reception unit 131, the first determination unit 132 refers to the operation plan information storage unit 121, and loads in the route to the destination of the vehicle 10 according to the first determination instruction. It is determined whether or not there is one or more of the unloading operations. That is, the first determination unit 132 determines whether there is work at the waypoint. If it is determined that there is work at the waypoint, the first determination unit 132 outputs a second determination instruction to the second determination unit 133. When it is determined that there is no work at the waypoint, the first determination unit 132 outputs a travel time calculation instruction to the calculation unit 135.

  When the second determination instruction is input from the first determination unit 132, the second determination unit 133 refers to the operation plan information storage unit 121 and acquires information on the berth that is a waypoint. The second determination unit 133 determines whether there is a berth reservation system 40 corresponding to the berth based on the acquired berth information. When it is determined that the berth reservation system 40 exists, the second determination unit 133 outputs an inquiry instruction for the berth reservation system 40 to the acquisition unit 134. When it is determined that the berth reservation system 40 does not exist, the second determination unit 133 outputs an acquisition instruction to the acquisition unit 134.

  The second determination unit 133 obtains berth information from the vehicle search information when the money collection information and the vehicle search information are input from the reception unit 131. The second determination unit 133 determines whether there is a berth reservation system 40 corresponding to the berth based on the acquired berth information. When it is determined that the berth reservation system 40 exists, the second determination unit 133 outputs an inquiry instruction for the berth reservation system 40 to the acquisition unit 134. When it is determined that the berth reservation system 40 does not exist, the second determination unit 133 outputs an acquisition instruction to the acquisition unit 134. In addition, the second determination unit 133 outputs the coin search information and the car search information to the acquisition unit 134.

  In other words, the 1st determination part 132 refers to the received operation plan information, and determines whether 1 or more work exists among the work of loading and unloading in the path | route to the destination. . In addition, when the first determination unit 132 determines that there is work, the second determination unit 133 determines whether there is a berth reservation system 40 corresponding to the berth on which the work is performed.

  When an inquiry instruction is input from the second determination unit 133, the acquisition unit 134 transmits an inquiry about the predicted work time to the berth reservation system 40 via the communication unit 110 and the network N. The acquisition unit 134 receives and acquires the predicted work time of the berth from the berth reservation system 40 via the network N and the communication unit 110.

  When the acquisition instruction is input from the second determination unit 133, the acquisition unit 134 refers to the operation plan information storage unit 121 and the work time storage unit 122 and based on information such as luggage, packing form, and quantity of the operation plan information. Thus, the predicted work time of the berth where the berth reservation system 40 does not exist is acquired.

  The acquisition unit 134 outputs the acquired predicted work time to the calculation unit 135 when the currency determination information and the vehicle search information are not input from the second determination unit 133, that is, when the reception unit 131 receives a required time calculation request. . On the other hand, the acquisition unit 134 acquires the current location and the operation plan for each vehicle 10 from the operation management system 20 when the currency determination information and the vehicle search information are input from the second determination unit 133. The acquisition unit 134 outputs the currency search information and the vehicle search information, the acquired predicted work time, the current location and the operation plan for each vehicle 10 to the calculation unit 135.

  In addition, the acquisition unit 134 may acquire a destination or a vehicle register for each vehicle 10 together with operation information from each vehicle 10. In this case, the destination is a desired destination representing the desired direction of the vehicle. That is, the desired place is, for example, a garage of a transportation company. Further, the vehicle registration location indicates a place name such as a land transportation branch office on the license plate of the vehicle 10. The acquisition unit 134 outputs the acquired destination or car register to the output control unit 136.

  In other words, when it is determined that the berth reservation system 40 exists, the acquisition unit 134 transmits a request for acquiring a predicted required time (predicted work time) in the berth and acquires the predicted required time. Further, when it is determined that the berth reservation system 40 does not exist, the acquisition unit 134 acquires a predicted required time (predicted work time) registered in advance. In addition, the acquisition unit 134 acquires the predicted required time (predicted work time) of the berth included in the received vehicle search information. In addition, the acquisition unit 134 acquires a desired place from the vehicle 10.

  The calculation unit 135 refers to the operation plan information storage unit 121 and the result storage unit 123 when the predicted work time is input without input of the coin search information and the vehicle search information from the acquisition unit 134, and based on the past results. Calculate the travel time to the destination. That is, when the reception unit 131 receives the required time calculation request and the predicted work time is input from the acquisition unit 134, the calculation unit 135 refers to the operation plan information storage unit 121 and the actual storage unit 123, and stores the past work time. The travel time to the destination is calculated based on the results. The calculation unit 135 calculates the required time to the berth and the destination based on the input predicted work time and the calculated travel time. That is, the calculation unit 135 calculates the required time from the departure place to the destination via one or more berths based on the past results. The departure place here includes both the current location of the vehicle 10 and the position (garage etc.) of tomorrow morning. Based on the calculated required time and the operation plan information, the calculation unit 135 obtains the required time information including the planned arrival time at the departure point, the waypoint and the destination, information on the actual vehicle / empty vehicle, and the planned departure time. Generate. The calculation unit 135 stores the generated required time information in the required time storage unit 124 and outputs it to the output control unit 136.

  When the travel time calculation instruction is input from the first determination unit 132, the calculation unit 135 refers to the operation plan information storage unit 121 and the result storage unit 123, and calculates the travel time to the destination based on the past results. . The calculation unit 135 calculates the required time to the destination based on the calculated travel time. The calculation unit 135 generates required time information in the same manner as when the predicted work time is input, stores the generated required time information in the required time storage unit 124, and outputs it to the output control unit 136. That is, the calculation unit 135 transmits the optimal route and the required time calculated based on the operation plan information and the required time calculation request received from the operation management system 20 to the operation management system 20 via the output control unit 136. Includes processing.

  When the calculation unit 135 receives from the acquisition unit 134 the coin-seeking information and the car-seeking information, the predicted work time, the current location and the operation plan for each vehicle 10, Calculate travel time. That is, based on the operation plan for each vehicle 10, the calculation unit 135 extracts the time and place (final cargo area) at which each vehicle 10 becomes empty. The calculation unit 135 calculates the time when the vehicle 10 becomes empty and the travel time from the place to the loading area. The calculation unit 135 calculates a required time to the loading place for each vehicle 10 based on the predicted work time and the calculated travel time.

  The calculation unit 135 calculates the arrival accuracy from the current position to the loading area for each vehicle 10. The calculation unit 135 calculates the arrival accuracy using, for example, whether or not the vehicle allocation plan process or the berth reservation system 40 is used. For the arrival accuracy, for example, a required time when the vehicle allocation planning process and the berth reservation system 40 are available is used as a baseline. For example, when the berth reservation system 40 is not used, the arrival accuracy is a required time obtained by increasing a predetermined time with respect to the baseline handling time. Further, the arrival accuracy is, for example, a required time obtained by increasing a predetermined ratio with respect to the required time of the baseline when the vehicle allocation plan process is not used. The required time of arrival accuracy is, for example, 60 minutes + 30 minutes = 90 minutes when the baseline is 60 minutes and the berth reservation system 40 is not used. Further, the required time for the arrival accuracy is, for example, 60 minutes + (60 minutes × 30%) = 78 minutes when the vehicle allocation plan process is not used. Further, the required time of arrival accuracy is, for example, 60 minutes + 30 minutes + (60 minutes × 30%) = 108 minutes when there is no use of the vehicle allocation planning process and the berth reservation system 40.

  In addition to displaying the required time, the arrival accuracy may be expressed in a plurality of stages using, for example, an asterisk. In this case, the higher the arrival accuracy, the greater the number of stars. The arrival accuracy is, for example, three stars in the baseline, two stars when any one of the operation management system 20 and the berth reservation system 40 is not used, and both the operation management system 20 and the berth reservation system 40. When there is no use, it can be expressed in the form of one star.

  Further, the calculation unit 135 calculates the arrival burden level. For example, for each vehicle 10, the calculation unit 135 can set a value obtained by multiplying the travel time by the distance from the final loading place on the existing operation plan to the loading place of the vehicle search information and the travel time. . Note that the degree of arrival burden may be expressed in a plurality of stages using stars or the like, as in the case of arrival accuracy. In this case, the number of stars increases as the arrival burden is lighter.

  The calculation unit 135 calculates the degree of burden from the arrival place to the desired place for each vehicle 10 based on the arrival place that is the unloading place of the vehicle search information and the desired place that is the destination of the operation plan of the vehicle 10. . For example, for each vehicle 10, the calculation unit 135 multiplies the value obtained by multiplying the distance from the arrival location that is the unloading location of the vehicle search information to the desired location that is the destination of the operation plan of the vehicle 10 by the travel time. It can be. Note that the degree of burden may be expressed in a plurality of stages using stars or the like, as with the arrival accuracy. In this case, the lighter the burden, the greater the number of stars. The arrival accuracy, the arrival burden degree, and the burden degree may be calculated for the vehicle 10 that can reach the loading place at the time of loading. Further, the calculation unit 135 may set the vehicle 10 for which work information is not registered after the loading or unloading time as a calculation target of the degree of burden. The calculation unit 135 outputs the calculated required time to the loading place for each vehicle 10, the arrival accuracy, the arrival burden degree, and the burden degree to the output control unit 136.

  In other words, the calculation unit 135 refers to the received operation plan information, and calculates the travel time from the departure point to the destination via one or more berths based on past results. In addition, the calculation unit 135 calculates the required time from the departure place to the destination based on the acquired predicted required time and the calculated travel time. In addition, the calculation unit 135 calculates the travel time based on the received current position and past results. Further, the calculation unit 135 refers to the operation plan information included in the received vehicle search information, and calculates the travel time to the destination based on the past results. Further, the calculation unit 135 corrects the required time to the destination based on the arrival accuracy according to the determination result of whether or not the berth reservation system 40 exists. In addition, the calculation unit 135 calculates the arrival accuracy for the loading area for each vehicle 10 from the time and distance required for the movement from the current position to the loading area. In addition, the calculation unit 135 refers to the operation plan information storage unit 121 that stores a desired place representing a desired direction for each vehicle 10, and the time required for the movement from the arrival place to the desired place of the vehicle 10 for each vehicle 10. And / or a value (degree of burden) is calculated from the distance. In addition, the calculation unit 135 sets a vehicle that can reach the loading place at the time of loading as a calculation target of a value (degree of burden). In addition, the calculation unit 135 sets the vehicle 10 in which work information is not registered after the loading time as a calculation target of a value (burden degree).

  When the required time information is input from the calculation unit 135, the output control unit 136 transmits the input required time information to the operation management system 20 via the communication unit 110 and the network N.

  When the required time, arrival accuracy, arrival burden degree, and burden degree from the calculation unit 135 to the loading place for each vehicle 10 are input, the output control unit 136 is a candidate according to the arrival accuracy, the arrival burden degree, and the burden degree. Generate a vehicle selection screen. The output control unit 136 determines a vehicle to be prioritized according to the arrival accuracy, the arrival burden degree, and the burden degree, and reflects them on the candidate vehicle selection screen. That is, the output control unit 136 is an example of a determination unit.

  When the destination or the vehicle registration location is input from the acquisition unit 134, the output control unit 136 reflects the input destination or vehicle registration location on the candidate vehicle selection screen. The output control unit 136 transmits the generated candidate vehicle selection screen to the coin search system 30 via the communication unit 110, the network N, and the operation management system 20.

  In other words, the output control unit 136 outputs the required time from the departure point to the destination based on the acquired predicted required time and the calculated travel time. Further, the output control unit 136 corrects and outputs the required time to the destination based on the arrival accuracy according to the determination result of whether or not the berth reservation system 40 exists. Further, the output control unit 136 determines the vehicle 10 to be prioritized according to the calculated value, and determines the display mode of the vehicle 10 to be displayed on the screen. Further, the output control unit 136 determines a vehicle to be prioritized according to the calculated arrival accuracy, and determines the display mode of the vehicle 10 to be displayed on the screen. Moreover, the output control part 136 makes the display mode of the vehicle 10 the display mode including the acquired desired place.

  Here, the required time calculation will be described with reference to FIG. FIG. 6 is a diagram illustrating an example of required time calculation. In the example of FIG. 6, the operation plan of the vehicle 10 (T01) goes from the departure place A to the garage L via berths B and C. Reservations for berths B and C are specified at 13:00 and 15:00, respectively. It is assumed that the berth B does not use the berth reservation system 40 and the berth C uses the berth reservation system 40. In the conventional operation plan 60, the vehicle 10 (T01) leaves the departure place A at 11:00 with a margin. That is, it can be said that the operation plan 60 has low time reliability. On the other hand, in the operation plan 61 using the operation management system 20 and the information processing apparatus 100, the vehicle 10 (T01) travels from the departure place A to the berth B for 60 minutes. Depart at 00. That is, it can be said that the operation plan 61 is an accurate operation plan.

  However, in berth B, work is delayed, and vehicle 10 (T01) is in a waiting state before berth B as of 13:30. For this reason, the vehicle 10 (T01) starts unloading work at 14:00 on the berth B. In operation plan 61, a 60-minute break was scheduled between berths B and C, but in order to recover the one hour delay at berth B, vehicle 10 (T01) placed a break before berth B. Arrive from berth B to berth C in 30 minutes.

  It is assumed that the car seeking system 30 receives the car seeking information K1 while the vehicle 10 (T01) is moving from the berth B to the berth C. Car search information K1 is loaded (apple) at berth X at 16:00, and arrives at berth Y at 17:00. It is assumed that the berths X and Y use the berth reservation system 40. The information processing apparatus 100 determines that the vehicle 10 (T01) becomes an empty vehicle when the unloading operation at the berth C ends based on the current location and the operation plan of the vehicle 10 (T01). In addition, since the berth C uses the berth reservation system 40, it shall be able to provide exact cargo handling time. Moreover, it can be said that the present location here is a departure place, when it sees from the vehicle-recruitment information K1.

  The information processing apparatus 100 calculates the travel times of the vehicle 10 (T01) from the berth C to the berth X, from the berth X to the berth Y, and from the berth Y to the garage L, based on the operation plan information of the vehicle waking information K1. . The information processing apparatus 100 acquires the predicted work time at the berths X and Y from the berth reservation system 40. In the example of FIG. 6, each movement time is calculated as 30 minutes, and 30 minutes is acquired as the predicted work time at the berths X and Y, respectively.

  The information processing apparatus 100 calculates the required time from the berth C of the vehicle 10 (T01) to the garage L via the berths X and Y based on the predicted work time and the travel time. The information processing apparatus 100 generates the required time information that is a new operation plan based on the existing operation plan of the vehicle 10 (T01), the operation plan information of the vehicle search information K1, and the calculated required time. The information processing apparatus 100 transmits the generated required time information to the operation management system 20, the coin search system 30 and the berth reservation system 40. That is, the information processing apparatus 100 can generate a new operation plan based on the accurate time including handling. At this time, the berth reservation system 40 reserves berths X and Y based on the received required time information. The berth reservation system 40 may contact the dispatcher or driver of the transportation company so as to make reservations for the berths X and Y based on the received required time information.

  Moreover, when the information processing apparatus 100 accepts the car seeking information K1, the information processing apparatus 100 analyzes the proximity between the berth Y and the garage L that is the desired direction of the vehicle 10 (T01). There may be no control. Thereby, the information processing apparatus 100 can improve physical distribution productivity and safety.

  Next, the candidate vehicle selection screen will be described with reference to FIGS. 7 and 8. FIG. 7 is a diagram illustrating an example of a candidate vehicle selection screen for the vehicle search information. On the selection screen 62, for example, icons of candidate vehicles 10 (T05 to T07) for the vehicle search information are displayed. In addition, on the selection screen 62, for each of the vehicles 10 (T05 to T07), the pick-up time, arrival accuracy, vehicle information, and fee when the vehicle 10 heads for the loading place 63 are displayed. In the example of the selection screen 62, the arrival accuracy of the vehicle 10 (T06) is the highest with three stars, and the required time is the shortest with 45 minutes, so it can be seen that the vehicle to be prioritized is the vehicle 10 (T06).

  FIG. 8 is a diagram illustrating an example of a candidate vehicle selection screen in consideration of the desired location. In the selection screen 64 shown in FIG. 8, for example, as with the selection screen 62, icons of candidate vehicles 10 (T05 to T07) for the vehicle search information are displayed. In addition, the selection screen 64 displays the unloading land 65 and destinations 66 to 68 which are respective desired directions or vehicle registration locations of the vehicle 10 (T05 to T07). Furthermore, the selection screen 64 displays the available time, desired direction and degree of burden, degree of arrival and degree of burden, vehicle information, and fee for the vehicle 10 (T05 to T07) when heading to the loading place 63, respectively. Is done.

  In the example of the selection screen 64, the vehicle 10 (T05) has an intermediate degree of burden from the unloading land 65 to the destination 66 out of the two stars 10 and the three candidate vehicles 10. In addition, the vehicle 10 (T05) has the lowest arrival accuracy from the current location to the loading location 63 with one star, the longest required time of 85 minutes, and the highest arrival burden of 3400. The degree of arrival burden is, for example, a value obtained by multiplying the distance 40 km from the current location of the vehicle 10 (T05) to the loading location 63 by 85 minutes. The vehicle 10 (T06) has the highest degree of burden from the unloading land 65 to the destination 67 with one star, but the arrival accuracy from the current location to the loading point 63 is the highest with three stars, and the time required is 45 minutes. It is short and the arrival burden is the lowest at 900. The degree of arrival burden is, for example, a value obtained by multiplying the distance 20 km from the current location of the vehicle 10 (T06) to the loading location 63 and the required time 45 minutes.

  The vehicle 10 (T07) has the lowest burden from the unloading land 65 to the destination 68 with 3 stars, the arrival accuracy from the current location to the loading site 63 is 2 stars, the required time is 65 minutes, and the arrival burden is 1950 and medium among the three candidate vehicles 10. In addition, the arrival burden degree is obtained by multiplying, for example, a distance of 30 km from the current location of the vehicle 10 (T07) to the loading place 63 by 65 minutes. In the example of the selection screen 64, the vehicle 10 (T07) with the lowest degree of burden on the desired direction and the medium reachability can be set as the vehicle 10 to be prioritized. When the degree of burden is the same, priority is given to the vehicle 10 with the shorter distance, and the priority is lowered for the vehicle 10 that becomes a route to return from the unloading place to the destination. In addition, when giving priority to the takeable time, the vehicle 10 (T06) may be the vehicle 10 that should be given priority. Furthermore, when giving priority to the charge, the vehicle 10 (T05) may be the vehicle 10 that should be given priority.

  Next, the operation of the information processing apparatus 100 according to the embodiment will be described. First, the required time calculation process will be described with reference to FIG. FIG. 9 is a flowchart illustrating an example of the required time calculation process according to the embodiment.

  The reception unit 131 receives operation plan information and a required time calculation request from the operation management system 20 and receives them (step S1). The reception unit 131 stores the received operation plan information in the operation plan information storage unit 121. The reception unit 131 outputs a first determination instruction to the first determination unit 132 in response to the required time calculation request.

  When the first determination instruction is input from the reception unit 131, the first determination unit 132 determines whether there is work at the waypoint (step S2). When it is determined that there is no work at the waypoint (No at Step S2), the first determination unit 132 outputs a travel time calculation instruction to the calculation unit 135, and the process proceeds to Step S6. When it is determined that there is work at the waypoint (step S2: affirmative), the first determination unit 132 outputs a second determination instruction to the second determination unit 133.

  When the second determination instruction is input from the first determination unit 132, the second determination unit 133 determines whether there is a berth reservation system 40 corresponding to the berth based on the acquired berth information. (Step S3). When it is determined that the berth reservation system 40 exists (Step S3: Yes), the second determination unit 133 outputs an inquiry instruction to the berth reservation system 40 to the acquisition unit 134.

  When the inquiry instruction is input from the second determination unit 133, the acquisition unit 134 transmits an inquiry about the predicted work time to the berth reservation system 40. The acquisition unit 134 receives and acquires the predicted work time of the berth from the berth reservation system 40 (step S4). The acquisition unit 134 outputs the acquired predicted work time to the calculation unit 135.

  On the other hand, when it is determined that the berth reservation system 40 does not exist (Step S3: No), the second determination unit 133 outputs an acquisition instruction to the acquisition unit 134. When the acquisition instruction is input from the second determination unit 133, the acquisition unit 134 refers to the operation plan information storage unit 121 and the work time storage unit 122, and acquires the predicted work time of the berth (Step S5). The acquisition unit 134 outputs the acquired predicted work time to the calculation unit 135.

  When the reception unit 131 receives a required time calculation request and the predicted work time is input from the acquisition unit 134, the calculation unit 135 refers to the operation plan information storage unit 121 and the actual storage unit 123 to obtain past results. Based on this, the travel time to the destination is calculated. In addition, when the travel time calculation instruction is input from the first determination unit 132, the calculation unit 135 refers to the operation plan information storage unit 121 and the result storage unit 123, and calculates the travel time to the destination based on the past results. Calculate (step S6).

  The calculation unit 135 calculates the required time to the berth and the destination based on the input predicted work time and the calculated travel time (step S7). The calculation unit 135 generates the required time information based on the calculated required time and the operation plan information. The calculation unit 135 stores the generated required time information in the required time storage unit 124 and outputs it to the output control unit 136.

  When the required time information is input from the calculation unit 135, the output control unit 136 transmits the input required time information to the operation management system 20 (step S8). Thereby, the information processing apparatus 100 can calculate the arrival time of the vehicle 10 more accurately. That is, the information processing apparatus 100 can more accurately calculate the arrival time of the vehicle 10 by taking into consideration the time required for berth (working time) in addition to the travel time of the vehicle 10.

  Next, the car search request process will be described with reference to FIG. FIG. 10 is a flowchart illustrating an example of the vehicle request reception process according to the embodiment.

  The accepting unit 131 receives and accepts the coin-seeking information and the car-seeking information from the operation management system 20 (step S11). The accepting unit 131 outputs the accepted currency seeking information and the car seeking information to the second determining unit 133.

  The second determination unit 133 obtains berth information from the vehicle search information when the money collection information and the vehicle search information are input from the reception unit 131. The second determination unit 133 determines whether there is a berth reservation system 40 corresponding to the berth based on the acquired berth information (step S12). When it is determined that the berth reservation system 40 exists (step S12: Yes), the second determination unit 133 outputs an inquiry instruction to the berth reservation system 40 to the acquisition unit 134. In addition, the second determination unit 133 outputs the coin search information and the car search information to the acquisition unit 134.

  When the inquiry instruction is input from the second determination unit 133, the acquisition unit 134 transmits an inquiry about the predicted work time to the berth reservation system 40. The acquisition unit 134 receives and acquires the predicted work time of the berth from the berth reservation system 40 (step S13). The acquisition unit 134 outputs the acquired predicted work time to the calculation unit 135.

  On the other hand, when it is determined that the berth reservation system 40 does not exist (No at Step S12), the second determination unit 133 outputs an acquisition instruction to the acquisition unit 134. In addition, the second determination unit 133 outputs the coin search information and the car search information to the acquisition unit 134. When the acquisition instruction is input from the second determination unit 133, the acquisition unit 134 refers to the operation plan information storage unit 121 and the work time storage unit 122, and acquires the predicted work time of the berth (Step S14). The acquisition unit 134 outputs the acquired predicted work time to the calculation unit 135.

  Moreover, the acquisition part 134 acquires the present location and operation plan for every vehicle 10 from the operation management system 20, when the money seeking information and the vehicle search information are input from the second determination unit 133 (step S15). The acquisition unit 134 outputs the currency search information and the vehicle search information, and the current location and operation plan for each vehicle 10 to the calculation unit 135.

  When the calculation unit 135 receives the currency search information and the vehicle search information, the predicted work time, the current location and the operation plan for each vehicle 10 from the acquisition unit 134, the calculation unit 135 The travel time for every 10 is calculated (step S16). The calculation unit 135 calculates the required time to the loading place for each vehicle 10 based on the predicted work time and the calculated travel time (step S17).

  The calculation unit 135 calculates the arrival accuracy and the arrival burden degree from the current location for the loading place for each vehicle 10 (step S18). Further, the calculation unit 135 calculates the degree of burden from the arrival place to the desired place for each vehicle 10 based on the vehicle search information and the operation plan of the vehicle 10 (step S19). The calculation unit 135 outputs the calculated required time to the loading place for each vehicle 10, the arrival accuracy, the arrival burden degree, and the burden degree to the output control unit 136.

  When the required time, arrival accuracy, arrival burden degree, and burden degree from the calculation unit 135 to the loading place for each vehicle 10 are input, the output control unit 136 is a candidate according to the arrival accuracy, the arrival burden degree, and the burden degree. A vehicle selection screen is generated (step S20). The output control unit 136 transmits the generated candidate vehicle selection screen to the coin search system 30 (step S21). Thereby, the information processing apparatus 100 can provide a vehicle selection screen in consideration of the desired location. In other words, the information processing apparatus 100 can provide a screen on which a transportation company can be selected in consideration of the destination of the vehicle 10.

  In the above-described embodiment, the car seeking information and the car seeking information are accepted in the car seeking acceptance process. However, the car seeking information may be accepted without accepting the coin seeking information.

  In this way, the information processing apparatus 100 receives the vehicle search information including the arrival place. In addition, the information processing apparatus 100 refers to the operation plan information storage unit 121 that stores a desired place representing a desired direction for each vehicle 10, and is required for moving from the arrival place to the desired place of the vehicle 10 for each vehicle 10. A value is calculated from time and / or distance. Further, the information processing apparatus 100 determines the vehicle 10 to be prioritized according to the calculated value, and determines the display mode of the vehicle 10 to be displayed on the screen. As a result, the information processing apparatus 100 can provide a vehicle selection screen in consideration of the desired location.

  In addition, the information processing apparatus 100 accepts vehicle search information including the loading area. Further, the information processing apparatus 100 calculates the arrival accuracy with respect to the loading area for each vehicle 10 from the time and distance required to move from the current position to the loading area. Further, the information processing apparatus 100 determines the vehicle 10 to be prioritized according to the calculated arrival accuracy, and determines the display mode of the vehicle 10 to be displayed on the screen. As a result, the information processing apparatus 100 can provide a vehicle selection screen that takes into account the arrival accuracy with which the vehicle 10 can arrive at the loading place at the time of loading.

  In the information processing apparatus 100, the desired place is acquired from the vehicle 10. Further, the information processing apparatus 100 sets the display mode of the vehicle 10 to the display mode including the acquired desired place. As a result, the information processing apparatus 100 can provide a vehicle selection screen in consideration of the desired location.

  Further, in the information processing apparatus 100, the vehicle search information includes information on the loading place and the loading time. In addition, the information processing apparatus 100 sets the vehicle 10 that can reach the loading place at the loading time as a value calculation target. As a result, the information processing apparatus 100 can provide a vehicle selection screen in consideration of the desired location for the vehicle 10 capable of transporting luggage.

  In addition, the information processing apparatus 100 accepts registration of information on one or a plurality of operations among loading and unloading operations for each vehicle 10. Further, the information processing apparatus 100 sets the vehicle 10 in which work information is not registered after the loading time as a value calculation target. As a result, the information processing apparatus 100 can provide a vehicle selection screen in consideration of a desired place for the vehicle 10 having a margin in the operation plan.

  In addition, each component of each part illustrated does not necessarily need to be physically configured as illustrated. In other words, the specific form of distribution / integration of each unit is not limited to that shown in the figure, and all or a part thereof may be functionally or physically distributed / integrated in arbitrary units according to various loads or usage conditions. Can be configured. For example, the calculation unit 135 and the output control unit 136 may be integrated. Further, the illustrated processes are not limited to the above-described order, and may be performed at the same time as long as the processing contents do not contradict each other, or may be performed by changing the order.

  Furthermore, various processing functions performed by each device may be executed entirely or arbitrarily on a CPU (or a microcomputer such as an MPU or MCU (Micro Controller Unit)). In addition, various processing functions may be executed in whole or in any part on a program that is analyzed and executed by a CPU (or a microcomputer such as an MPU or MCU) or on hardware based on wired logic. Needless to say, it is good.

  By the way, the various processes described in the above embodiments can be realized by executing a prepared program on a computer. Therefore, in the following, an example of a computer that executes a program having the same function as each of the above embodiments will be described. FIG. 11 is a diagram illustrating an example of a computer that executes a vehicle candidate display program.

  As illustrated in FIG. 11, the computer 200 includes a CPU 201 that executes various arithmetic processes, an input device 202 that receives data input, and a monitor 203. The computer 200 also includes a medium reading device 204 that reads a program and the like from a storage medium, an interface device 205 for connecting to various devices, and a communication device 206 for connecting to other information processing devices and the like by wire or wirelessly. Have The computer 200 also includes a RAM 207 that temporarily stores various types of information and a hard disk device 208. Each device 201 to 208 is connected to a bus 209.

  The hard disk device 208 includes a vehicle having the same functions as the processing units of the reception unit 131, the first determination unit 132, the second determination unit 133, the acquisition unit 134, the calculation unit 135, and the output control unit 136 illustrated in FIG. A candidate display program is stored. Further, the hard disk device 208 stores an operation plan information storage unit 121, a work time storage unit 122, a result storage unit 123, a required time storage unit 124, and various data for realizing a vehicle candidate display program. The input device 202 receives input of various information such as operation information from a user of the computer 200, for example. The monitor 203 displays various screens such as a display screen for the user of the computer 200, for example. The interface device 205 is connected to, for example, a printing device. The communication device 206 has, for example, the same function as the communication unit 110 shown in FIG. 2 and is connected to the network N. In addition to the vehicle 10, the operation management system 20, the coin search system 30, the berth reservation system 40, and the like. Various information is exchanged with the information processing apparatus.

  The CPU 201 reads out each program stored in the hard disk device 208, develops it in the RAM 207, and executes it to perform various processes. In addition, these programs can cause the computer 200 to function as the reception unit 131, the first determination unit 132, the second determination unit 133, the acquisition unit 134, the calculation unit 135, and the output control unit 136 illustrated in FIG.

  The vehicle candidate display program does not necessarily have to be stored in the hard disk device 208. For example, the computer 200 may read and execute a program stored in a storage medium readable by the computer 200. The storage medium readable by the computer 200 corresponds to, for example, a portable recording medium such as a CD-ROM, a DVD (Digital Versatile Disc), a USB (Universal Serial Bus) memory, a semiconductor memory such as a flash memory, a hard disk drive, and the like. . Alternatively, the vehicle candidate display program may be stored in a device connected to a public line, the Internet, a LAN, or the like, and the computer 200 may read and execute the vehicle candidate display program from these.

DESCRIPTION OF SYMBOLS 1 Matching system 10 Vehicle 20 Operation management system 30 Cargo seeking system 40 Berth reservation system 100 Information processing apparatus 110 Communication part 120 Storage part 121 Operation plan information storage part 122 Work time storage part 123 Result storage part 124 Required time storage part 130 Control unit 131 Reception unit 132 First determination unit 133 Second determination unit 134 Acquisition unit 135 Calculation unit 136 Output control unit N network

Claims (7)

Accepts vehicle-seeking information including arrival location,
With reference to a storage unit that stores a desired location representing a desired direction for each vehicle, for each vehicle, a value is calculated from the time and / or distance required to move from the arrival location to the desired location of the vehicle,
The vehicle to be prioritized is determined according to the calculated value, and the display mode of the vehicle to be displayed on the screen is determined.
A vehicle candidate display program for causing a computer to execute processing. Accepts vehicle-seeking information including loading area,
For each vehicle, calculate the arrival accuracy for the loading area from the time and distance required to move from the current location to the loading area,
Determining a vehicle to be prioritized according to the calculated arrival accuracy, and determining a display mode of the vehicle to be displayed on the screen;
A vehicle candidate display program for causing a computer to execute processing. The desired location is obtained from the vehicle,
The determining process is performed such that the display mode of the vehicle includes the acquired desired location.
The vehicle candidate display program according to claim 1. The vehicle search information includes information on a loading place and a loading time,
In the calculation process, a vehicle that can reach the loading area at the time of loading is set as a calculation target of the value.
The vehicle candidate display program according to claim 1 or 3, characterized in that. The accepting process accepts registration of information on one or a plurality of work among loading and unloading work for each vehicle.
In the calculation process, a vehicle in which the work information is not registered after the loading time is set as the calculation target of the value.
The vehicle candidate display program according to claim 4, wherein: Accepts vehicle-seeking information including arrival location,
Referring to a storage unit that stores a desired location that represents a desired direction for each vehicle, a vehicle to be prioritized is determined for each vehicle based on the time and / or distance required to travel from the arrival location to the desired location of the vehicle. Determining and determining the display mode of the vehicle to be displayed on the screen;
A vehicle candidate display method characterized in that a computer executes the process. A reception unit that accepts vehicle-seeking information including the arrival place;
A calculation unit that calculates a value from time and / or distance required for movement from the arrival point to the desired point of the vehicle for each vehicle with reference to a storage unit that stores a desired point representing a desired direction for each vehicle; ,
Determining a vehicle to be prioritized according to the calculated value, and determining a display mode of the vehicle to be displayed on the screen;
A vehicle candidate display system comprising:

Images