JP2008087872A - Server for searching cargo and vehicle, method and program for controlling server for searching cargo and vehicle, and recording medium - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To improve rate of matching of a system for searching cargo and vehicle and shorten processing hours by skipping processing partially when the number of candidates of empty vehicle information and cargo information to be matched is sufficient to reduce operation man-hours of a management company. <P>SOLUTION: This system for searching cargo and vehicle has a configuration that the cargo information including a loading place, an unloading place, date of loading, and date of unloading is registered in cargo searching DB, the empty vehicle information including a start place, an arrival place, date of start, and date of arrival is registered in vehicle searching DB per searching vehicle unit, and a CPU of the server 10 performs first retrieval processing for retrieving a candidate for matching the cargo information and the empty vehicle information mutually by comparing the loading and unloading places in the cargo information with the start and arrival places in the empty vehicle information and second retrieval processing for retrieving a candidate for matching the empty vehicle information and the cargo information mutually by expanding the loading and unloading places in the cargo information or the start and arrival places in the empty vehicle information and comparing the loading and unloading places in the cargo information with the start and arrival places in the empty vehicle information to complete the retrieval processings when the number of results of retrieval satisfying the retrieval conditions exceeds a predetermined number. <P>COPYRIGHT: (C)2008,JPO&INPIT

Description

  The present invention relates to a cargo search server and a cargo search server for connecting a shipper terminal used by a shipper and a vehicle owner terminal used by a vehicle owner via a communication line, and supporting a delivery request between the shipper and the vehicle owner. The present invention relates to a control method, a program, and a recording medium.

The shipper inputs the type and quantity of the package, the loading / unloading date, the unloading / unloading date, the desired fare, etc. into the terminal and registers the car-seeking information. The so-called “carriage seeking” is to enter the land, loadable weight, vehicle classification, desired fare, etc. into the terminal, register the money seeking information (empty car information), and match the car seeking information with the money seeking information to conclude a contract. Car systems have been implemented in the past. For example, Patent Document 1 discloses a logistics service placement method in which information on a request for a logistics work carried by a freight vehicle and information on the contents of an empty freight vehicle are registered and the freight carrying work is arranged among the members. It is disclosed.
JP 2001-195469 A

  In the conventional car search system, at least the loading place and the desired departure place coincide, and the unloading place and the desired return place coincide, or at least one of them coincides, and the other is on the moving route of the vehicle. It was necessary to be.

  However, with such a matching method, the matching rate is not always sufficient, and from the shipper's side, it is difficult to find a shipping company that carries the luggage under the desired conditions even if the freight search system is used. From the perspective of (transport company), the actual vehicle rate will not increase. In addition, when the matching rate is low, there is a problem that the fee income is not increased from the operator of the car search system, which may lead to the separation of the members.

  When the matching rate is low under certain conditions as described above, the following operation is used.

  In other words, if the operator of the operating company that operates the system cannot match the car search information and the coin search information under a certain condition, it takes a lot of time and effort to change the condition many times.

  On the other hand, the demands of shippers (unloading by the designated date and time, high penalty charges, etc.) are becoming more and more strict, and the shipping company has been able to meet these requirements while increasing the actual vehicle rate to secure profits. It is becoming more difficult.

  The present invention has been made to solve the above-described problems, and the object of the present invention is to improve the matching rate of the freight search system and to have a sufficient number of candidates for matching empty vehicle information and baggage information. In such a case, the processing time can be shortened by skipping a part of the processing, and a mechanism that makes it possible to reduce the operation man-hours of the operating company is provided.

  The present invention is a freight search server that connects a shipper terminal used by a shipper and a vehicle owner terminal used by a vehicle owner via a communication line, and supports a delivery request between the shipper and the vehicle owner. Baggage information registration means for registering baggage information including landing, landing date and time, date and time of arrival, empty vehicle information registration means for registering empty vehicle information including departure, landing, departure date and arrival date, A first search process for searching for a matching candidate between the luggage information and the empty vehicle information by comparing the loading / unloading area with a departure / landing in the empty vehicle information; A search means for executing a second search process for searching for a matching candidate of the empty vehicle information and the luggage information by expanding and comparing the place of departure or landing in the empty vehicle information or the landing When the search result that matches the search condition exceeds a predetermined number, In, characterized in that to terminate the search process.

  According to the present invention, it is possible to improve the matching rate of the freight search system and to shorten the processing time by skipping some processes when the number of candidates for matching empty vehicle information and baggage information is sufficient. It is possible to reduce the operation man-hours of the operating company.

  FIG. 1 is a system configuration diagram showing a configuration of a coin search system showing one embodiment of the present invention.

  As shown in FIG. 1, the freight search system of the present invention has a configuration in which a server 10, a shipper terminal 20, a vehicle owner terminal 30, and an operating company terminal 40 are connected to each other via a network 50.

  Typically, the server 10 is managed by a company that operates the car search system, but the hardware is managed by a third party and may be used in a so-called ASP system.

  FIG. 2 is a simplified block diagram showing an outline of the hardware configuration of the server 10, the shipper terminal 20, the vehicle owner terminal 30, and the operating company terminal 40 shown in FIG. 1. Details will be described below using the server 10 as an example.

  As shown in FIG. 2, the server 10 includes a CPU 21, a RAM 22, a ROM 23, a LAN adapter 24, a video adapter 25, a keyboard 26, a pointing device such as a mouse 27, a hard disk 28, and a recording medium drive 29. Are connected to each other via a system bus 20. Actually, an interface circuit, a chip set, and the like exist between the CPU 21 or the recording medium drive 29 and the system bus, but are omitted in the drawing.

  The system bus 20 is a variety of system buses such as a PCI bus and an AGP bus, and a plurality of system buses are usually connected via so-called chip sets, but are omitted in FIG.

  The CPU 21 stores various programs stored in the ROM 23, the hard disk 28, or the CD-ROM drive 29 in the RAM 22 and sequentially reads them to execute various control processes described later.

  The RAM 22 is a memory for temporarily storing various data including an array and variables used when executing and executing a part of the OS and application programs under the control of the CPU 21. .

  The ROM 23 stores a control program (so-called BIOS) for each hardware. A part of the operating system (OS) can also be stored.

  The LAN adapter (network interface card) 24 is a communication interface for connecting to the network 50.

  The video adapter 25 is a so-called video graphic adapter (VGA), to which various displays such as a liquid crystal display are connected.

  The recording medium drive 29 is a drive device that can read data of various recording media such as a CD-ROM drive, a DVD-ROM drive, and a DVD-R drive.

  The hard disk 28 includes an operating system, a coin search DB, a car search DB, contract data, a member information DB, various tables (a place name table (FIG. 5), an adjacent prefecture table (FIG. 3), and a route table (FIG. 4) described later). ) And the like, and an application program for executing processing of each flowchart described later including screen information (information described in html, CGI, etc., for displaying the screen on the terminal display).

  In addition, a plurality of pieces of baggage information are stored in the car search DB, and the baggage information includes a requester name, a person in charge name, a telephone number, an e-mail address, a loading address and a landing address, a loading date and time, a falling date and time, Package type, quantity, temperature management necessity, and desired fare are included. This other package form and this package information are transmitted from the shipper terminal to the server and registered.

  When executing the registration process of the package information, the location name table shown in FIG. 5 is referred to, the name of the municipality is extracted from the loading address of the package information, the registered prefecture is specified, and the registered prefecture is also registered as one item of the package information. Similarly, the prefecture is identified from the land address, and the prefecture is registered as an item of baggage information. If a municipality with the same name exists, the server 10 may be configured to notify the terminal that is registering the fact and a candidate prefecture name to be selected and allow the operator to select it.

  In addition, a plurality of empty vehicle information is stored in the currency search DB. The empty vehicle information includes the name of the transportation company, the name of the person in charge, the telephone number, the e-mail address, the departure address and the arrival address, the departure date, the arrival date, It includes the type of load, loadable weight, temperature control availability (cooled car, freezer car, etc.), and the desired fare per ton. In addition, the driver name may be included. The empty vehicle information is transmitted from the owner terminal to the server and registered.

  When executing the registration process of the empty vehicle information, the name of the municipality is extracted from the origin address of the empty vehicle information with reference to the place name table shown in FIG. The destination prefecture is identified from the landing address, and the destination prefecture is also registered as an item of empty vehicle information.

  The hard disk 28 stores an adjacent prefecture table shown in FIG. 3, a route table shown in FIG. 4, and a place name table shown in FIG.

  FIG. 3 is a diagram illustrating an example of an adjacent prefecture table in the present embodiment.

  As shown in FIG. 3, the neighboring prefecture table stores the reference prefecture (standard prefecture), the neighboring prefecture code of the prefecture (specified in JISX0401; the same applies hereinafter) and the required time (h) between the neighboring prefectures. Has been.

  FIG. 4 is a diagram illustrating an example of a route table in the present embodiment.

  As shown in FIG. 4, the route table stores the prefecture (departure) of the departure place, the prefecture (arrival) of the arrival place, and the prefecture code of each prefecture that becomes the route.

  FIG. 5 is a diagram illustrating an example of a place name table in the present embodiment.

  As shown in FIG. 5, the place name table stores the name of the prefecture (affiliated prefecture) corresponding to the municipality name.

  In FIG. 5 to FIG. 4, the name of the prefecture is described instead of the prefecture code for easy understanding.

  Hereinafter, the search process and the matching process of the present invention for a car search system will be described with reference to the flowchart of FIG.

  FIG. 6 is a flowchart showing an example of a first control processing procedure according to the present invention, which corresponds to the search processing and matching processing of the coin search system. In the figure, S301 to S309 are realized by the CPU of the operating company terminal 40 shown in FIG. 1 reading out a program stored in a recording medium such as a hard disk to the RAM 22 and executing it. Further, S310 is realized by the CPU of the shipper terminal 20 or the vehicle owner terminal 30 shown in FIG. 1 reading out the program stored in the recording medium such as a hard disk to the RAM 22 and executing it. Further, S320 to S329 are realized by the CPU of the server 10 shown in FIG. 1 reading out a program stored in a recording medium such as a hard disk to the RAM 22 and executing it.

  Further, before the program of the flowchart of FIG. 6 is executed, the car seeking information is registered in the car seeking DB of the server 10 from the owner terminal 30, and the car seeking information is registered in the car seeking DB of the server 10 from the shipper terminal 20. It shall be.

  Then, the operating company terminal 40 connects to the server 10 to establish a session (acquires a session ID and stores it in the session information storage area of the RAM 22 of the server 10), and the authentication with the ID and password ends. The search condition of the package information is input from the server 10, the search condition is transmitted to the server 10, and the server 10 searches for the package information that matches the received search condition from the unsigned package information registered in the vehicle search DB. The search result list (package information list) is transmitted to the operating company terminal 40, the search result list is displayed on the operating company terminal 40, and an instruction to select specific package information from this list is transmitted to the server 10. From the state in which screen information for displaying FIG. 7 on the operating company terminal is generated in the server 10 based on the package information and stored in the RAM, the flow of FIG. Processing of the chart is started.

  First, in step S320, the CPU of the server 10 transmits screen information for displaying a search processing screen for matching on the operating company terminal 40 from the server 10 to the operating company terminal 40.

  Then, in step S301, the CPU of the operating company terminal 40 receives the screen information transmitted from the server 10, displays the search condition input screen shown in FIG. 7 on the display based on the received screen information, and step S302. , The input of the search condition is accepted.

  FIG. 7 is a diagram illustrating an example of a search condition input screen in the present embodiment. In FIG. 7, a “next detail button” 602 is displayed, and when the next detail button is pressed in step S302, instruction information for displaying the next unsigned package information from the operating company terminal 40 is displayed on the server 10. When the server 10 receives the instruction information in step S320, the server 10 generates screen information for displaying the next package information and transmits it to the operating company terminal 40.

  In the search condition input screen shown in FIG. 7, unsigned package information (requester name, name of person in charge, telephone number, e-mail address, loading address and landing address, loading date and time, downloading, registered in the vehicle search DB. Date and time, package type, quantity, necessity of temperature management, desired fare, etc.) are read out from the vehicle search DB of the server 10 and displayed as described above. It is possible to search. In this case, as the search condition, information on necessity / unnecessity of loading date or loading date / time, falling date / falling date / time, classification, loading point, landing point, fare, luggage name, weight, and temperature management can be used. It is also possible to relax the search conditions by relaxing some conditions, that is, by leaving certain items blank. The loading address and the falling address may include a city name and address information. In addition, the product date / time and the date / time may be specified as a range from From to To, and a specific vehicle owner company name or vehicle owner code may be additionally input as a search condition (not shown).

  And by instruct | indicating the search button 601, the search of corresponding empty vehicle information is performed based on the input search conditions.

  Returning to the flowchart of FIG.

  In step S302, the operating company terminal 40CPU proceeds to step S303 when detecting that the search condition is input from the search condition input screen and the search button 601 is instructed.

  In step S303, the operating company terminal 40CPU transmits the search condition information input in step S302 to the server 10 together with the session ID, and shifts to a reception waiting state for hit information.

  In step S <b> 321, the CPU of the server 10 receives the search condition information transmitted from the operating company terminal 40 and stores the received search condition information in the work area of the RAM 22 of the server 10.

  Next, in step S322, the CPU of the server 10 executes a search process. The details of this search process will be described in detail in the flowcharts of FIGS. This search result is stored in the work area array of the RAM 22 of the server 10.

  Next, in step S323, the CPU of the server 10 refers to the work area array in the RAM 22 of the server 10 and determines whether there is a hit as a result of the search processing in step S322.

  If it is determined in step S322 that there are no hits, the CPU of the server 10 advances the process to step S329.

  In step S329, the CPU of the server 10 transmits an error message indicating that there are no hits to the operating company terminal 40.

  Then, in step S306, the CPU of the operating company terminal 40 prompts the search condition to be changed because there is no hit on the display of the operating company terminal 40 based on the error message transmitted from the server 10. A dialog screen displaying an “OK” button is displayed. When the CPU of the operating company terminal 40 detects that the “OK” button has been pressed, the process returns to step S301.

  On the other hand, if the CPU of the server 10 determines in step S323 that there is a hit as a result of the search process in step S322, the process proceeds to step S324.

  In step S324, the CPU of the server 10 sorts the hits of the search process of step S322, deletes only one duplicate hit, and stores it in the RAM 22.

  In step S325, the CPU of the server 10 transmits the html screen format information read from the hard disk of the server 10 and the sorted hit information read from the RAM 22 to the operating company terminal 40.

  Then, in step S304, the CPU of the operating company terminal 40 receives the screen format information and hit information transmitted from the server 10, stores them in the RAM 22, and stores the stored html screen format information and sorted hit information. Based on the above, a list screen of hit cases as shown in FIG. 8 is displayed.

  FIG. 8 is a diagram showing an example of a hit list screen in the present embodiment.

  Reference numeral 802 denotes a detail line of hits, and a list of matching candidates is displayed. In this case, the display order is displayed in the order of the search steps II to IV, with the matching case of the search step I shown in FIG.

  Returning to the flowchart of FIG.

  Next, in step S305, when the CPU of the operating company terminal 40 detects that the check 803 of the detail line 802 of the hit case is input by the operating company terminal 40 and the matching button 801 is pressed, the operating company terminal 40 is detected. In step S305, the CPU transmits hit selection information to the server 10.

  Then, the CPU of the server 10 receives the hit selection information transmitted from the operating company terminal 40 in step S326, stores it in the RAM 22, and advances the process to step S327.

  In step S327, the CPU of the server 10 adds information on the pair of empty vehicle information matched with the target package information to the contract DB together with the provisional contract flag.

  Next, in step S328, the CPU of the server sends the contract information (currently only the provisional contract state) to the mail address of the vehicle owner terminal 30 of the empty vehicle information matched with the mail address of the shipper terminal 20 of the package information subject to the temporary contract. And the process returns to step S321.

  Then, within a predetermined time (for example, within 3 hours) after the e-mail transmission described above, the URL described in the text of this e-mail is accessed from both the shipper terminal and the car owner terminal, and at least from the shipper terminal. When information indicating that a contract is concluded is transmitted to the server 10 and the server 10 receives this information, the provisional contract flag in the contract DB is updated to the present contract flag and the contract is officially concluded (this part is the server 10 6 is not described in the flowchart of FIG.

  Hereinafter, the search process shown in step S322 of FIG. 6 will be described with reference to the flowcharts of FIGS.

  FIG. 9 is a flowchart showing an example of the second control processing procedure in the present invention, and corresponds to the search processing shown in step S322 of FIG. In the figure, S401 to S409 are realized by the CPU of the server 10 shown in FIG. 1 reading out a program stored in a recording medium such as a hard disk to the RAM 22 and executing it.

  FIG. 10 is a flowchart showing an example of the third control processing procedure according to the present invention. The server 10 includes a search step I (corresponding to step S401 in FIG. 9) to a search step IV (corresponding to step S404 in FIG. 9). Correspond to details. In the figure, S501 to S505 are realized by the CPU of the server 10 shown in FIG. 1 reading a program stored in a recording medium such as a hard disk into the RAM 22 and executing it.

  In the search process of the present invention, when there is no vacant vehicle information that matches the schedule / section desired by the condition entered by the shipper, the vacant vehicle information is expanded until the desired vacant vehicle information is found in order from the adjacent area. The present invention uses an empty vehicle information search method including a step of adding a range and searching again.

  For example, it is assumed that baggage information for carrying a baggage from “Kanagawa” on May 10 to “Gifu” on May 11 is registered. For example, there is a vehicle that carries luggage from "Nagoya" on May 8 to "Tokyo" on May 9, and there is information on the availability of information from "Tokyo" on May 10 to "Nagoya" on May 10. Suppose.

  In such a case, according to the prior art, the origin and the landing of the baggage information are not included in the route of the empty vehicle information because the baggage information and the empty vehicle information do not coincide with each other, and the route of the empty vehicle information is not included. It is not possible to make a match based on a simple match or pick a prefecture or city that passes through the route.

  The present invention proposes a method for greatly increasing the probability of matching by zone matching considering travel time. Note that the zone matching range may be set to one of two (in the adjacent prefecture or the same region) by the shipping company.

  Hereinafter, this will be described in detail with reference to FIG.

  First, the CPU of the server 10 executes a search step I (one of the origin and the landing coincides) in step S401 in FIG.

  In this search step I, the departure date and the loading date are the same, and the arrival date and the arrival date are the same, in the package information registered in the vehicle search DB from the shipper and the empty vehicle information registered in the coin search DB from the vehicle owner. In addition, when at least one of the origin and loading or landing and landing is the same and the other conditions are the same, the content of the empty vehicle information corresponding to the hit event is added to the hit event array. Do. In addition, the coincidence / non-coincidence between the origin and the loading place and the landing and the fall place shall be compared for each prefecture.

  If it demonstrates using the above-mentioned example, it will be judged whether there is the empty vehicle information from "Kanagawa" to "Gifu", and if there exists, it will add as a matching candidate. When there is no matching empty vehicle information, it is determined whether there is empty vehicle information whose origin is “Kanagawa” or landing is “Gifu”, and is added as a matching candidate.

  Specifically, in step S501 of FIG. 10, the CPU of the server 10 searches the package information registered in the vehicle search DB based on the condition information stored in the work area of the RAM 22, and the search is performed. Baggage DB package information (client name, person in charge name, telephone number, e-mail address, loading address and landing address, loading date / time, falling date / time, package type, quantity, temperature management necessity, desired fare, etc. ) And is stored in the work area of the RAM 22 of the server 10.

  Next, in step S502, the CPU of the server 10 uses the loading date, the falling date, the loading prefecture, and the falling prefecture as keys based on the loading information read in step S501, and uses the freight search DB (the empty vehicle information is the name of the shipping company, Name of person in charge, telephone number, e-mail address, departure address and landing address, departure date, arrival date, loadable package type, loadable weight, temperature control availability (cooled car, freezer car, etc., desired fare per ton) Search for. Then, all the empty vehicle information in which the departure date and the loading date are matched, the arrival date and the falling date are matched, and at least one of the departure location and the loading location or the landing location and the landing location is obtained is acquired from the currency search DB. The data is temporarily stored in the work area array in the RAM 22 of the server 10. However, if the number of hits exceeds a certain number (for example, 100), the search process is stopped at that point, and the process proceeds to step S503.

  Next, in step S503, the CPU of the server 10 determines whether the fare and other conditions match the package information for the empty vehicle information temporarily stored in the work area array of the RAM 22 of the server 10, If they match, they are added to the hit area array in the work area in the RAM 22 of the server 10. Each time one empty vehicle information is added to the hit case array, the counter is incremented by one.

  Next, in step S504, the CPU of the server 10 adds the counter value counted in step S503 to the variable for storing the number of hits in the work area of the RAM 22 of the server 10, and then resets the counter value and ends the process. (Return to the flowchart of FIG. 9).

  Next, in step S402 in FIG. 9, the CPU of the server 10 executes a search step II (a prefecture in the route matches one of departure and landing).

  In this search step II, it is searched whether there is unoccupied vehicle information starting from or arriving at the prefecture in the route, and if it is determined that there is, an array for hit cases in the work area in the RAM 22 of the server 10 as a matching candidate. Process to add to.

  To explain using the above example, the prefecture (Shizuoka Prefecture, Aichi Prefecture) in the route of the destination prefecture “Gifu Prefecture” is acquired at the departure prefecture “Kanagawa Prefecture”, and the prefectures in the route (Shizuoka Prefecture, Aichi Prefecture) If there is a search for empty vehicle information starting from or landing on, it is added as a matching candidate.

  Specifically, in step S501 of FIG. 10, the CPU of the server 10 searches the package information registered in the vehicle search DB based on the condition information stored in the work area of the RAM 22, and the search is performed. The package information of the car search DB is read out and stored in the work area of the RAM 22 of the server 10. Further, the CPU of the server 10 acquires the prefecture to which the loading site belongs and the prefecture to which the landing belongs in the package information using the place name table, and sets the prefecture to which the loading site belongs and the prefecture to which the landing belongs. , Each prefecture of each route (each prefecture of route 1 to route n) is acquired.

  Next, in step S502, the CPU of the server 10 uses the loading date and the falling date based on the loading information read out in step S501 and the prefectures of the route 1 to the route n as a key, and finds the currency search DB (empty vehicle information is Shipping company name, person in charge, telephone number, e-mail address, departure address and landing address, departure date, arrival date, loadable package type, loadable weight, temperature control availability (cooled car, freezer car, etc.), tons Search the desired fare). Then, all empty vehicle information in which the departure date and the loading date coincide, the arrival date and the falling date coincide, and at least one of the departure and the route prefecture or the landing and the route prefecture coincides is acquired from the currency search DB. The data is temporarily stored in the work area array in the RAM 22 of the server 10. However, if the number of hits exceeds a certain number (for example, 100), the search process is stopped at that time. Then, steps S503 and S504 are executed, and empty vehicle information that matches the other conditions is added to the hit area array in the work area in the RAM 22 of the server 10 (the details of steps S503 and S504 are the same as above). Will be omitted). Then, the process proceeds to step S403 in FIG. The desired fare per ton may be the desired fare per baggage.

  Next, in step S403, the CPU of the server 10 executes search step III (both departure and landing coincide with neighboring prefectures).

  In this search step III, the origin is the neighboring prefecture of Seki prefecture (for example, if Kanagawa is Kanagawa, the origin prefecture is Tokyo, Yamanashi or Shizuoka), and the landing is the neighboring prefecture of the descending prefecture (for example, Gifu is Gifu) If there is a vacant vehicle information of Mie Prefecture, Aichi Prefecture, Nagano Prefecture, or Shiga Prefecture), and if it is determined that there is, it is a matching candidate, an array for hits in the work area in the RAM 22 of the server 10 Process to add to.

  Using the example above, the origin is the neighboring prefecture of Kanagawa Prefecture (Tokyo, Yamanashi or Shizuoka) and the landing is the neighboring prefecture of Gifu Prefecture (Mie Prefecture, Aichi Prefecture, Nagano) Search for available car information for the prefecture, Shiga prefecture), and if so, add it to the matching candidates.

  Specifically, in step S501 of FIG. 10, the CPU of the server 10 searches the package information registered in the vehicle search DB based on the condition information stored in the work area of the RAM 22, and the search is performed. The package information of the car search DB is read out and stored in the work area of the RAM 22 of the server 10. Furthermore, the CPU of the server 10 acquires the prefecture to which the loading site belongs and the prefecture to which the landing belongs in the package information using the place name table, and sets the prefecture to which the loading site belongs and the prefecture to which the landing belongs as the reference prefecture. The adjacent prefectures (adjacent prefectures 1 to 8) are acquired.

  Next, in step S502, the CPU of the server 10 uses the loading date and the date of arrival based on the loading information read out in step S501 and the prefectures of the adjacent prefectures 1 to 8 as keys to find a coin search DB (empty vehicle). Information is the name of the shipping company, name of the person in charge, telephone number, e-mail address, departure address and landing address, departure date, arrival date, loadable package type, loadable weight, temperature control availability (cooled car, freezer car, etc.) , The desired fare per ton). Then, all the empty vehicle information in which the departure date and the loading date are matched, the arrival date and the falling date are matched, and both the departure and the neighboring prefectures and the landing and the neighboring prefectures are the same is acquired from the currency search DB, The data is temporarily stored in the work area array in the RAM 22 of the server 10. However, if the number of hits exceeds a certain number (for example, 100), the search process is stopped at that time. Then, Steps S503 and S504 are executed, and the empty vehicle information that matches the conditions is added to the hit area array in the work area in the RAM 22 of the server 10 (Note that Steps S503 and S504 are the same, so the description is omitted). To do). Then, the process proceeds to step S404 in FIG.

  Next, in step S404, the CPU of the server 10 executes a search step IV (one of the departure and landing coincides with the adjacent prefecture).

  In this search step IV, it is searched whether there is vacant vehicle information whose origin is the neighboring prefecture of the county prefecture or where the landing is the neighboring prefecture of the descending prefecture, and when there is a work area in the RAM 22 of the server 10 as a matching candidate. Perform processing to add to the hit record array.

  Explaining using the above example, the origin is the neighboring prefecture of Kanagawa (Tokyo, Yamanashi, Shizuoka), or the landing is the neighboring prefecture of Gifu prefecture (Mie Prefecture, Aichi Prefecture, Nagano Prefecture, Shiga Prefecture) It is searched whether there is empty vehicle information that is, and if there is, it is determined as a matching candidate.

  Specifically, in step S501 of FIG. 10, the CPU of the server 10 searches the package information registered in the vehicle search DB based on the condition information stored in the work area of the RAM 22, and the search is performed. The package information of the car search DB is read out and stored in the work area of the RAM 22 of the server 10. Furthermore, the CPU of the server 10 acquires the prefecture to which the loading site belongs and the prefecture to which the landing belongs in the package information using the place name table, and sets the prefecture to which the loading site belongs and the prefecture to which the landing belongs as the reference prefecture. The adjacent prefectures (adjacent prefectures 1 to 8) are acquired.

  Next, in step S502, the CPU of the server 10 uses the loading date and the falling date, the loading prefecture and the falling prefecture, and the neighboring prefectures 1 to 8 as the keys based on the loading information read in step S501. , Recruitment DB (empty vehicle information is the name of the shipping company, name of the person in charge, telephone number, e-mail address, departure address and landing address, departure date, arrival date, loadable package type, loadable weight, temperature management availability (cooling Cars, refrigerated vehicles, etc.) and desired fares per ton). Then, all empty vehicle information in which the departure date coincides with the loading date, the arrival date coincides with the falling date, and one of the origin and the adjacent prefecture or the landing and the adjacent prefecture coincides is acquired from the currency search DB, The data is temporarily stored in the work area array in the RAM 22 of the server 10. However, if the number of hits exceeds a certain number (for example, 100), the search process is stopped at that time. Then, Steps S503 and S504 are executed, and the empty vehicle information that matches the conditions is added to the hit area array in the work area in the RAM 22 of the server 10 (Note that Steps S503 and S504 are the same, so the description is omitted). To do). Then, the process proceeds to step S405 in FIG.

  In step S405 in FIG. 9, the CPU of the server 10 reads one hit from the hit area array in the work area in the RAM 22 of the server 10.

  Next, in step S <b> 406, the CPU of the server 10 determines whether or not the processing of steps S <b> 407 to S <b> 409 has been executed for all hit cases in the hit case array in the work area in the RAM 22 of the server 10. .

  If it is determined in step S406 that the processes in steps S407 to S409 have not been executed for all hits, the CPU of the server 10 advances the process to step S407.

  In step S407, the CPU of the server 10 calculates the travel time. Specifically, the CPU of the server 10 determines whether there is actual vehicle information of the same vehicle on the day before the departure date and the same vehicle on the day of arrival and the vehicle information of the same vehicle on the day of arrival or the next day. The travel time is calculated with reference to the adjacent prefecture table 3. The actual vehicle information reads the loading date / time of the contracted baggage information, but the actual loading date / time or falling date / time is sent to the server 10 from each vehicle using a mobile terminal or from the terminal of the shipping company. You may register. In this way, even when urgent package information is registered, it is possible to determine whether or not cargo can be received and unloaded more accurately.

  In step S <b> 408, the CPU of the server 10 determines whether or not it is possible to receive and unload at the arrival date / time and the date / time in the registered package information based on the travel time calculated in step S <b> 407.

  If it is determined in step S408 that the cargo can not be received or unloaded (received or unloadable), the CPU of the server 10 deletes the hit from the hit area array in the work area in the RAM 22 of the server 10. The process returns to step S406.

  On the other hand, if it is determined in step S408 that the cargo can be received and unloaded, the CPU of the server 10 returns the process to step S406 as it is.

  On the other hand, if it is determined in step S406 that the processes in steps S407 to S409 have been executed for all hits, the CPU of the server 10 ends the process (returns the process to the flowchart of FIG. 6). ).

[Other embodiment 1]
In the above embodiment, the empty vehicle information that matches the condition is searched based on the baggage information, but the baggage information that matches the condition may be searched based on the empty vehicle information.

[Other embodiment 2]
In steps S401 to S403 in FIG. 9, the cumulative number of empty vehicle information stored in the hit case array (or baggage information when searching for baggage information that matches conditions based on empty vehicle information) is a fixed number (for example, 10). If the number exceeds (15 cases), the remaining search processing may be stopped, and the process may immediately proceed to step S405. By controlling in this way, when the number of matching empty vehicle information and baggage information candidates is sufficient, a part of the processing can be skipped and the processing time can be shortened.

  Further, in step S502, the configuration has been described in which the CPU of the server 10 stops the search process at that point when the number of hits exceeds a certain number (for example, 100). However, the search process may be executed until all the search processes are completed.

  That is, the search process in step S322 in FIG. 6 has a configuration in which the search process is terminated when the search result exceeds a predetermined number, or a configuration in which the search process is executed until all the search processes are completed. It is included in the present invention.

  Note that the setting of whether to end the search process when the search result exceeds a predetermined number or whether to execute the search process until all the search processes are stored in the hard disk of the server 10, and The CPU of the server 10 may be configured to select and control whether to end the search process when the search result exceeds a predetermined number or to execute the search process until all the search processes are completed. . Thereby, a part of processing can be skipped and processing time can be shortened, or all the search results can be obtained and the range of matching can be expanded.

[Other embodiment 3]
In other embodiment 2, the priority is specified in the search condition, the matching candidates are searched according to the priority order, and when the priority condition is specified in the specific search condition, the matching candidates are sorted in that order. A different part from said embodiment is demonstrated in detail.

  In the search condition input screen on the upper side of FIG. 7, a radio button or the like is provided in front of the name of each search item (for example, loading date, fare, temperature, etc.) so that the condition that should be given the highest priority can be specified. Further, one or more priority condition classifications are further stored in the package information registered in the car search DB. That is, when registering the package information, for example, it is possible to specify priority conditions such as the fare is first priority and the landing is second priority. In the search process of step S322, the search is continued without being terminated with a predetermined number of hits. In S324, sorting is performed based on these priority condition designations. If a priority condition is specified for a landing or a loading place, the corresponding part is not processed in the search step or search step of steps S402 to S404 in FIG. For example, when priority is given to a landing, empty information that matches the landing is a matching candidate, and empty information that is the neighboring prefecture is not a matching candidate (that is, empty information that is a neighboring prefecture is not Do not search for it). If there is both the radio button and the priority condition specification of the package information in FIG. 7, the specification of the package information is given priority, but the reverse is also possible. When the fare is designated as a priority condition, the matching candidates are sorted in ascending order of the fare. When the weight is specified as a priority condition, the matching candidates are sorted in descending order of the loadable weight.

By configuring in this way, for example, when priority conditions such as a first priority for a landfall and a second priority for a fare are specified, the matching candidate is displayed with priority on empty vehicle information that matches the ground and has a low fare. Is done. For example, when registering fresh foods that you want to sell in the morning market the next day as baggage information, delays in baggage due to movement between landfalls by designating landfall (the municipality where the market is located) as the first priority and fare as the second priority It will be easier to get your luggage carried at a lower fare while reducing risk.

  As described above, it is possible to improve the matching rate of the coin search system and to reduce the operation man-hours of the operating company. It should be noted that the configuration and contents of the various data described above are not limited to this, and it goes without saying that the various data and configurations are configured according to the application and purpose.

[Other embodiment 4]
As described above, each embodiment has been described. However, the present invention can take an embodiment as a system, apparatus, method, program, recording medium, or the like, and specifically includes a plurality of devices. The present invention may be applied to a system including a single device.

  Hereinafter, with reference to the memory map shown in FIG. 11, a data processing program readable by a computer (server 10, shipper terminal 20, vehicle owner terminal 30, operating company terminal 40) constituting the coin search system according to the present invention. The configuration will be described.

  FIG. 11 is a diagram illustrating a memory map of a recording medium (storage medium) that stores various data processing programs that can be read by the computer (server 10, shipper terminal 20, vehicle owner terminal 30, operating company terminal 40) according to the present invention. It is.

  Although not specifically shown, information for managing a program group stored in the recording medium, for example, version information, creator, etc. is also stored, and information depending on the OS on the program reading side, for example, a program is identified and displayed. Icons may also be stored.

  Further, data depending on various programs is also managed in the directory. In addition, when a program or data to be installed is compressed, a program to be decompressed may be stored.

  The functions shown in FIGS. 6, 9, and 10 in this embodiment may be performed by a host computer by a program installed from the outside. In this case, the present invention is applied even when an information group including a program is supplied to the output device from a recording medium such as a CD-ROM, a flash memory, or an FD, or from an external recording medium via a network. Is.

  As described above, a recording medium in which a program code of software for realizing the functions of the above-described embodiments is recorded is supplied to the system or apparatus, and the computer (or CPU or MPU) of the system or apparatus is stored in the recording medium. It goes without saying that the object of the present invention can also be achieved by reading and executing the program code.

  In this case, the program code itself read from the recording medium realizes the novel function of the present invention, and the recording medium storing the program code constitutes the present invention.

  As a recording medium for supplying the program code, for example, a flexible disk, hard disk, optical disk, magneto-optical disk, CD-ROM, CD-R, DVD-ROM, magnetic tape, nonvolatile memory card, ROM, EEPROM, A silicon disk or the like can be used.

  Further, by executing the program code read by the computer, not only the functions of the above-described embodiments are realized, but also an OS (operating system) or the like running on the computer based on the instruction of the program code. It goes without saying that a case where the function of the above-described embodiment is realized by performing part or all of the actual processing and the processing is included.

  Furthermore, after the program code read from the recording medium is written in a memory provided in a function expansion board inserted in the computer or a function expansion unit connected to the computer, the function expansion is performed based on the instruction of the program code. It goes without saying that the case where the CPU or the like provided in the board or the function expansion unit performs part or all of the actual processing and the functions of the above-described embodiments are realized by the processing.

  Further, the present invention may be applied to a system composed of a plurality of devices or an apparatus composed of a single device. Needless to say, the present invention can be applied to a case where the present invention is achieved by supplying a program to a system or apparatus. In this case, by reading a recording medium storing a program represented by software for achieving the present invention into the system or apparatus, the system or apparatus can enjoy the effects of the present invention.

  Furthermore, by downloading and reading out a program represented by software for achieving the present invention from a server, database, etc. on a network using a communication program, the system or apparatus can enjoy the effects of the present invention. It becomes.

  In addition, all the structures which combined each embodiment mentioned above and its modification are also included in this invention.

It is a system configuration figure showing the composition of the coin search system showing one embodiment of the present invention. It is the simplified block diagram which shows the outline | summary of the hardware constitutions of the server 10, the consignor terminal 20, the vehicle owner terminal 30, and the management company terminal 40 which were shown in FIG. It is a figure which shows an example of the adjacent prefecture table in this embodiment. It is a figure which shows an example of the path | route table in this embodiment. It is a figure which shows an example of the place name table in this embodiment. It is a flowchart which shows an example of the 1st control processing procedure in this invention. It is a figure which shows an example of the search condition input screen in this embodiment. It is a figure which shows an example of the list screen of hit cases in this embodiment. It is a flowchart which shows an example of the 2nd control processing procedure in this invention. It is a flowchart which shows an example of the 3rd control processing procedure in this invention. It is a figure explaining the memory map of the recording medium (storage medium) which stores the various data processing program which can be read with the computer (The server 10, the shipper terminal 20, the vehicle owner terminal 30, the operating company terminal 40) concerning this invention.

Explanation of symbols

10 Server 20 Shipper terminal 30 Business owner terminal 40 Operating company terminal 5 Network

Claims (7)

A cargo search server that connects a shipper terminal used by a shipper and a car owner terminal used by a vehicle owner via a communication line, and supports a delivery request between the shipper and the vehicle owner,
Baggage information registration means for registering baggage information including loading point, landing point, loading date and time, and falling date and time;
Empty vehicle information registration means for registering empty vehicle information including departure, landing, departure date, arrival date,
A first search process for searching for a matching candidate between the luggage information and the empty vehicle information by comparing a loading / unloading area in the luggage information with a departure / landing in the empty vehicle information; Search means for executing a second search process for searching for a matching candidate of the empty vehicle information and the baggage information by expanding and comparing the loading / unloading area or the departure / landing in the empty vehicle information And having
The search means ends the search processing when the search result that matches the search condition exceeds a predetermined number, and the search for a car seeking a car.   According to the setting, the search means is configured to selectively control whether to end the search process or to execute the search process until all search processes are completed when the search result exceeds a predetermined number. The coin search server according to claim 1. The second search process includes:
Search for matching candidates for the empty vehicle information and the baggage information by expanding and comparing the loading / departure in the baggage information or the origin / landing in the empty vehicle information to a route based on the two points. Search process,
A search process for searching for a matching candidate for the empty vehicle information and the baggage information by expanding and comparing the loading / departure in the baggage information or the origin / landing in the empty vehicle information to an adjacent land,
The car claim server according to claim 1 or 2, characterized by comprising:   2. The search apparatus according to claim 1, further comprising priority condition means for designating a condition to be prioritized in the search for the matching candidate, wherein the second search process performs retrieval while fixing the designated priority condition. 4. A vehicle search server according to 3. It is a control method of a freight search server that connects a shipper terminal used by a shipper and a car owner terminal used by a vehicle owner via a communication line, and supports a delivery request between the shipper and the vehicle owner,
A package information registration step for registering package information including a loading site, a landing site, a loading date and time, and a falling date and time in a storage means;
An empty vehicle information registration step for registering empty vehicle information including departure, landing, departure date, arrival date in the storage means;
A first search process for searching for a matching candidate between the luggage information and the empty vehicle information by comparing a loading / unloading area in the luggage information with a departure / landing in the empty vehicle information; A search step for executing a second search process of searching for a matching candidate for the empty vehicle information and the baggage information by expanding and comparing the loading / unloading area or the departure / landing in the empty vehicle information And having
The search step ends the search process when a search result that matches the search condition exceeds a predetermined number of cases, and the search method of the freight search server is characterized by:   A computer for causing the computer to function as the freight search server according to any one of claims 1 to 4, or a computer for executing the control method for the freight cart server according to claim 5. Program.   To make a computer function as the freight search server described in any one of claims 1 to 4, or to cause a computer to execute the control method for the freight search server described in claim 5. The recording medium which memorize | stored the program of computer readable.

Images