JP2001312614A - System or method for bid handling process - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a method for handling bids made by plural bidding companies. SOLUTION: Carriers and recycle companies previously register filtering conditions on an agent server. A waste producing company sends desired disposal costs for wastes, weight, components, etc., (waste data) to the agent server. The agent server selects a carrier, etc., according to the filtering conditions and waste data and sends waste data to the selected carrier. The carrier estimates transportation cost and sends it to the agent server. The agent server sends the lowest sale price of the wastes and data on the wastes to a selected recycle company. The recycle company determines whether or not the wastes are purchased and presents and sends a purchase price to the agent server when deciding to buy them. The agent server specifies a combination of a carrier and a recycle company which minimizes the total disposal cost.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a bid processing system or a bid processing method in which a plurality of types of traders participate in a bid.

[0002]

2. Description of the Related Art A conventional bidding processing method will be described below.
A case where a used car is repaired will be described as an example with reference to FIG. The management server 91 (bid website)
Via the Internet, it is connected to a client terminal 92 and a plurality of repairers A to C terminals 93 to 95.

[0003] First, a client who wants to select a repair company that repairs a used car sends a desired repair cost (hereinafter referred to as a desired repair cost) to a management server 91 that manages the bidding process. Register the information of. For example,
The number of years of use of the used car, the damage status, etc.

[0004] Next, the management server 91 transmits the information on the used car and the desired repair cost to a plurality of repair agent terminals 93 to 95. The repairer considers whether or not the repair can be performed and how much the repair can be performed based on the information of the used car and the desired repair cost.

[0005] Next, among the repairers, those who can perform the repair within the desired repair cost enter an estimate of the repair cost into the terminal and transmit it to the management server 91. Thus, a plurality of repair cost estimates are registered in the management server 91.

[0006] Next, the management server 91 selects a repair agent presenting the lowest cost from among them, and transmits the selected repair agent and an estimate of the repair cost to the client terminal 92. Then, when the client approves the repair contractor and the estimate of the repair cost, the bidding process ends.

[0007] Therefore, if the client registers the used car information and the like in the management server 91, the bid is automatically performed by the repair company, and the repair company can find a repair company that can repair the product at a desired cost.

FIG. 39 shows an example in which there are two types of bidders who want to repair and sell a used car and select a repair trader and a used car dealer. Will be explained. The management server 91 communicates with the client terminal 92 and a plurality of repair agents A to C via the Internet.
Terminals 93 to 95, a plurality of used car dealers A to C terminals 96 to
98.

First, in the same manner as described above, the requester registers the desired repair cost and the information on the used car in the management server 91, thereby selecting a repair company that repairs the vehicle at a desired cost. Next, in the same manner, the information of the desired selling price and the used car is registered in the management server 91, and a used car dealer who purchases the car at a desired price is selected.

[0010] In this manner, the client can select a repair company and a used car dealer, and can select a repair company and a used car dealer who will repair and sell at a desired cost.

[0011]

However, the above-described bidding processing method has the following problems.

First, in the case where bidders span a plurality of types (for example, repair dealers and used car dealers), the requester divides information of the requested item into the management server 91 in a plurality of stages. You have to register and select each contractor, which is troublesome.

[0013] Second, when the bidders are of a plurality of types, the estimated prices of the respective traders may be different depending on the combination of the bidders. For example, in the case of selecting a transporter who has waste transported and a recycler who has a recycling process performed, the transport cost of the transporter differs depending on the transport destination (recycler).

[0014] In such a case, even if the client selects a recycler and then selects a transporter, the requester does not have to pay the total waste disposal cost (the transport cost minus the waste selling price to the recycler). ) May not be the combination of the cheapest recycler and carrier.

[0015] Third, when a bidder spans a plurality of types, depending on the selection result of another dealer,
There are times when it cannot be selected. For example, as described in the above example, if there is no carrier that can transport waste to a certain recycling company, or if the transportation cost is enormous, it is impossible to request the recycling company It is. In such a case, transmitting waste information and the like to such a recycler terminal is wasteful and troublesome for the recycler.

Accordingly, the present invention solves such a problem and provides a bidding processing method and a bidding processing system that can efficiently perform bidding processing even when a plurality of types of bidders are involved. The purpose is to:

[0017]

According to the first aspect of the present invention, at least one trader is selected from one or more first traders and one or more second traders. And a selection requester terminal, one or more first trader terminals, and one or more second trader terminals connected to the transfer server via the Internet. The mediation server receives the request information from the selection requester terminal, transmits the request information to the first trader terminal, and, based on the response status from one or more first trader terminals, Decide how to bid for,
It is characterized by soliciting bids from one or more second traders.

[0018] Therefore, by transmitting the request information to the mediation server, the selection requester can solicit bids from different types of traders. In addition, since a bid recruiting method for the second trader is determined, the efficiency and speed of the bidding process can be improved.

Further, the second trader can receive a bid request by an appropriate bid recruiting method.

According to a second aspect of the present invention, in the bid processing method, the mediation server receives request information from the selection requester terminal, transmits the request information to a first trader terminal, and transmits one or a plurality of first trader terminals.
A bid recruiting method for the second trader is determined based on the response status from the trader terminal of the second trader, bids are invited to one or more second trader terminals, and responses from one or more second trader terminals are made. A bid recruiting method for a third trader is determined based on the situation, and bids are recruited to one or a plurality of third trader terminals.

Therefore, the mediation server determines a bid solicitation method for a plurality of third traders according to the response status of the second trader, so that the bidding process can be made more efficient and faster.

According to a third aspect of the present invention, there is provided a bidding processing system comprising one or more first traders and one or more second traders.
An intermediary server for selecting a first agent and a second agent, a selection requester terminal connected to the agent server via the Internet, one or more first agent terminals, and one or more second agent terminals A first transmitting means for receiving the request information from the selection requester terminal and transmitting the request information to the first trader terminal; One or more first
, And based on the first decision answer selected from the one or more first answers in accordance with each second trader terminal and the request information from the selection requester terminal, The second request data is created according to the second trader, or the second request data is selected according to each of the selected second traders. And a second transmitting means for transmitting the second request data to the second trader terminal.

Therefore, based on the first decision answer and the request information, in order to select the second trader who requests the bidding,
The bidding process can be made more efficient and faster. Also,
The second trader can easily determine whether or not a bid can be made using the second request data.

According to a fourth aspect of the present invention, in the bid processing system, the mediation server may further include one or more second trader terminals.
Or receiving a plurality of second answers and receiving the one or more second
And a first selection unit for selecting a first trader and a second trader based on the first answer and the first decision reply.

Therefore, since the mediation server selects the first trader and the second trader, the selection requester does not need to make the selection.

According to a fifth aspect of the present invention, in the bid processing system, the mediation server receives request information from the selection requester terminal,
A first transmitting means for transmitting the request information to the first trader terminal, and receiving one or more first replies from one or more first trader terminals, Based on the first decision answer selected from the one or more first answers and the request information from the selection requester terminal, create second request data according to each second trader, or Selecting a second contractor to request a bid, creating second request data according to each of the selected second contractors, and transmitting the second request data to the second contractor terminal. 2 transmission means and one or more first trader terminals from one or more first trader terminals.
, And based on the first decision answer selected from the one or more first answers according to each third trader terminal and the request information from the selection requester terminal, The third request data is prepared according to the third trader, or the third trader requesting the bid is selected, and the third request data is prepared according to each selected third trader. Third transmission means for transmitting the third request data to the third trader terminal;
It is characterized by having.

Therefore, based on the first decision answer and the request information, in order to select a third trader to request a bid,
The bidding process can be made more efficient and faster. Also,
The third trader can easily examine whether or not to bid using the third request data.

According to a seventh aspect of the present invention, in the bid processing system according to the third aspect,
Means for transmitting the third request data based on the third request data.
If it is determined not to select the third trader, or if the second selecting means can select the first trader and the second trader, the third request data is transferred to all the third traders. It is not transmitted to the terminal.

Therefore, if the request data is not useful to the third trader, the third request data is not transmitted to the third trader, whereby the bidding process can be sped up.

[0030] In the bid processing system according to claim 8, the mediation server includes a filtering condition database storing a first filtering condition, a second filtering condition, or a third filtering condition, and the first transmitting means. Is the request information from the selection requester terminal and the first
Performing a first filtering process of selecting one or a plurality of first trader terminals that transmit the request information based on the filtering condition of
Based on the request information from the selection requester terminal and a second filtering condition, a second filtering process for selecting one or a plurality of second trader terminals transmitting the request information is performed, or The third transmitting means transmits one or a plurality of third information transmitting the request information based on the request information from the selection requester terminal and the third filtering condition.
A third filtering process for selecting a trader's terminal is performed.

Therefore, if appropriate filtering conditions are determined according to each trader, each trader does not send unnecessary request information to himself / herself by the filtering processing of the mediation server, and considers it. No need.

According to a ninth aspect of the present invention, in the bidding processing system, the mediation server may further create first accompanying information corresponding to each first trader based on a result of the first filtering processing. Based on the result of the second filtering process, the second associated information corresponding to each second trader is created, or the third associated information corresponding to the third trader is generated based on the result of the third filtering process. The first transmitting unit transmits the first accompanying information together with the request information to one or a plurality of first trader terminals, or (2) transmitting the second accompanying information together with the request information to one or a plurality of second
Or the third transmitting means transmits the third accompanying information together with the request information to one or a plurality of third trader terminals.

Therefore, since the accompanying information useful for each trader is transmitted to each trader terminal, each trader can refer to the information and examine whether or not to respond to the bid, and prepare a response.

According to a tenth aspect of the present invention, in the bid processing system, the mediation server includes an answer database for registering the first answer, the second answer, or the third answer, and the first trader terminal includes The first trader sends the determined or updated first reply to the mediation server based on the registered contents of the answer database, or the second trader terminal allows the second trader to register the answer database Based on the content, transmit the determined or updated second answer to the mediation server,
Alternatively, the third trader terminal is characterized in that the third trader transmits a third answer determined or updated based on the registered contents of the answer database to the mediation server.

Therefore, more useful answers can be prepared between the respective traders, and more useful answers for the selection requester can be obtained from the respective traders.

In the bid processing system according to the eleventh aspect, one or more of the first trader terminal, the second trader terminal, and the third trader terminal receive the request information from the mediation server and accept the request. It is characterized in that it is provided with an automatic bidding decision means for deciding whether or not to make a decision.

In the bid processing system according to the twelfth aspect, the automatic bidding determination means creates the first response, the second response, or the third response based on the request information from the mediation server. What is characterized by.

Therefore, if each trader terminal is provided with an automatic bidding determination means, each trader does not need to consider whether or not to bid and create a response according to the request information from the mediation server.

According to a fourteenth aspect of the present invention, in the bid processing system, the request information is a desired total price, and the first answer is a first
The second request data is a second price obtained by deducting the first price from the desired total price or subtracting the desired total price from the first price. The requested price, the second answer is a second price determined by a second trader, and the third requested data is the desired total price with the first price subtracted, or The third request price is a third request price obtained by subtracting the desired total price from the first price, and the third answer is a third price determined by a third trader.

Therefore, it is possible to select each trader corresponding to the price desired by the selection requester.

According to a fifteenth aspect of the present invention, the selection requester is a waste generation company that requests waste disposal, and the first company transports the waste to a recycling company or a disposal company. It is a carrier, wherein the second supplier is a recycler that performs waste recycling, and the third supplier is a disposal company that performs disposal.

According to a sixteenth aspect of the present invention, in the bid processing system, the request information includes a desired total processing cost required for all processing of the waste set by the waste generator, and the first answer is that the carrier has The second request data includes a price obtained by subtracting the transportation cost from the desired total processing cost, and the second request data includes the transportation cost of the determined waste to each recycler or disposal company. Answer includes the purchase price of the waste determined by the recycler,
The third request data includes a price obtained by subtracting the transportation cost from the desired total processing cost, and the third response includes a disposal cost of the waste determined by a disposal company. It is characterized by.

Therefore, the selection requester sends the waste information and the desired total processing cost to the intermediary server, and then the transporter, the recycler, and the disposal company that transport, recycle, and dispose of the waste. Can be selected.

The selection requester is a person who requests the selection of a trader by the mediation server, and corresponds to a waste generator in the following embodiment.

The first trader is a trader for whom a bid is requested, and corresponds to a carrier in the following embodiment.

The second trader is a trader for whom a bid is requested, and is of a different type from the first trader, and corresponds to a recycler in the following embodiment.

The third trader is a trader for whom a bid is requested, and is of a different type from the first trader and the second trader. In the following embodiment, the third trader corresponds to a disposal trader.

The request information is information transmitted from the selection requester to the mediation server and subjected to the bidding process, and corresponds to waste data A and B in the following embodiment.

The second request data is information for the second contractor created based on the first decision reply and the request information. In the following embodiment, the recycling request waste information corresponds to the second request data. I do.

The third request data is information for a third trader created based on the first decision reply and the request information. In the following embodiment, the disposal request waste information corresponds to the third request data. I do.

The first transmitting means is means for transmitting the request information to the first trader terminal. In the following embodiment, ST36 in FIG. 10a, ST106 in FIG. 29b, FIG.
This corresponds to 9d ST134.

[0052] The second transmitting means is provided to each second trader based on the first decision answer selected from one or a plurality of first answers according to each second trader terminal and the request information. Create the second request data according to the second or request the bid
This is a means for selecting a trader and creating second request data according to each selected second trader. In the following embodiment, ST45 in FIG. 10B and ST11 in FIG.
8 corresponds to this.

[0053] The third transmitting means is provided to each third trader based on the first decision answer selected from one or a plurality of second answers according to each third trader terminal and the request information. Create the second request data according to the third request to make a bid
This is a means for selecting third traders and creating third request data according to each of the selected third traders. In the following embodiment, ST146 in FIG. 29e corresponds.

The first selecting means means that the first trader and the second trader are made based on one or more second answers and the first decision answer.
In the following embodiment, ST51 in FIG. 10B corresponds to this means.

[0055] The second selecting means includes a first trader, at least a second trader or a third trader, based on one or more second or third reply and the first decision reply. This is a means for selecting a trader. In the following embodiment, FIG.
This corresponds to ST127 of FIG. 29C and ST155 of FIG. 29F.

The first response is a response from the first trader to the bid request, and corresponds to a transportation cost estimate response in the following embodiment.

The first decision answer may be one selected from one or a plurality of first answers according to each second trader terminal, or one or a plurality of first answers according to each third trader terminal. In the following embodiment,
The lowest transportation cost for each recycling company and each disposal company is applicable.

The second response is a response from the second trader terminal to the bid request, and corresponds to a recycling cost estimate response in the following embodiment.

The third response is a response from the third trader terminal to the bid request, and corresponds to a disposal cost estimate response in the following embodiment.

The first filtering condition is a condition for selecting the first trader terminal to which the request information is transmitted. In the following embodiment, the filtering condition of the carrier shown in FIGS. 6A and 27A is applicable.

The second filtering condition is a condition for selecting a second trader terminal that transmits request information. In the following embodiment, the filtering condition of the recycle trader shown in FIGS. 6B and 27B corresponds to the second filtering condition.

The third filtering condition is a condition for selecting a third trader terminal that transmits request information, and in the following embodiment, the filtering condition of the disposal trader shown in FIG. 27C is applicable.

The filtering condition database is a database that stores the first filtering condition, the second filtering condition, or the third filtering condition. In the following embodiment, the carrier filter condition database 35 and the recycler filter Condition database 36, disposal company filter condition database 62
Is applicable.

The first filtering process is a process of selecting one or a plurality of first trader terminals to which the request information is transmitted based on the request information and the first filtering conditions. , ST33 of FIG.
This corresponds to ST103 in FIG. 29b.

The second filtering process is a process of selecting one or a plurality of second trader terminals to which the request information is transmitted based on the request information and the second filtering condition. , ST31 of FIG.
This corresponds to ST101 and ST131 in FIG. 29B.

The third filtering process is a process of selecting one or a plurality of third trader terminals to which the request information is transmitted based on the request information and the third filtering condition. ST129 in FIG. 29d
Is applicable.

The first accompanying information is information for each first trader created on the basis of the result of the first filtering process. The operating distance to the recycler and the response deadline apply.

The second accompanying information is information for each second trader created based on the result of the second filtering process. In the following embodiment, the second accompanying information is Carriers offering low prices and deadlines for reply are applicable.

The third accompanying information is information for each third trader created based on the result of the third filtering process. In the following embodiment, the third accompanying information is the last information in the disposal request waste information. Carriers offering low prices and deadlines for reply are applicable.

The answer database includes the first answer, the second answer,
This is a database for registering the answer or the third answer, and corresponds to the cost selection database 38 in the following embodiment.

The automatic bidding determination means is means for receiving the request information from the mediation server and determining whether or not to accept the request. In the following embodiment, the transportation cost answering program 76, the dispatch table 77, Bidding price automatic update program 86, ingredient screening program 8
7. This corresponds to the component table 88.

The desired total price is the bidding price desired by the selection requester, and corresponds to the desired total processing cost in the following embodiment.

The first price is the bidding price of the first trader, and in the following embodiment, is the transportation cost determined by the carrier.

The second requested price is the first price from the desired total price.
Is the price obtained by subtracting or adding the price of the product, and in the following embodiment, it is the lowest selling price to a recycler.

The second price is the bid price of the second trader, and in the following embodiment, is the purchase price determined by the recycler.

The third requested price is the first price from the desired total price.
Is a price obtained by subtracting or adding the above-mentioned price, and in the following embodiment, the price is obtained by subtracting the transportation cost from the desired total processing cost.

The third price is the bid price of the third trader, and in the following embodiment, is the disposal cost determined by the disposal trader.

The recording medium on which the program is recorded is a concept including a flexible disk, a CD-ROM, a hard disk, a memory card, a ROM, a punch card, a tape, and the like. In addition to a recording medium on which a program that can be directly executed by a computer is recorded, a recording medium on which a program that can be executed once by being installed on another recording medium (such as a hard disk), or an encrypted or recorded medium is recorded. This is a concept including a recording medium on which a compressed program is recorded.

[0079]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS The following describes an example of a case where a carrier and a recycler are selected to carry and recycle waste. It should be noted that there is a case where the successful bidder is determined after the examination of the possibility of bidding by the carrier or the like and an answer is made (the first embodiment), and a case where the successful bidder is all automatically determined (the second embodiment). I will explain separately.

1. First Embodiment Hereinafter, a case will be described as an example where a carrier or a recycler examines whether a bid can be accepted, waits for a response, and determines a successful bidder. In this embodiment, the first trader corresponds to a carrier and the second trader corresponds to a recycler.

1.1 Overall Configuration FIG. 1 shows the overall configuration in this embodiment. The mediation server 12 is connected to the waste generator terminal 11, the carrier A to D terminals 13 to 16, and the recyclers A to D terminals 17 to 20 via the Internet. In this embodiment, the mediation server 12 has a function as an Internet bidding website.

A carrier and a recycler who use this system need to send in advance to the mediation server 12 the conditions for carrying or processing the waste (waste type, weight, components, etc.) (hereinafter referred to as filtering conditions). ) Is registered.

The waste generator using this system first inputs the desired total disposal cost, weight, components, etc. (hereinafter referred to as waste data) of the waste to the waste generator terminal 11 and sends it to the mediation server. 12 and the data is transmitted. This total treatment cost is the cost of processing the waste,
It is the cost of transporting the waste less the price sold to the recycler.

The mediation server 12 selects a carrier and a recycler based on the filtering conditions and the waste data, and transmits the waste data to the carrier terminal of the selected carrier.

The carrier estimates the transportation cost based on the waste data and sends it to the mediation server.

Upon receiving the estimate from the carrier terminal, the mediation server 12 sends the minimum selling price of the waste calculated based on the estimate to the recycler terminal selected based on the filtering conditions and the waste price. Send data such as weight and ingredients, and ask whether to purchase the waste.

The recycler has the minimum selling price,
Considering data such as the weight and composition of waste, when deciding whether to purchase the waste or not,
It presents the purchase price and transmits it to the mediation server 12.

The mediation server 12 specifies the combination of the transporter and the recycler whose total processing cost is the lowest based on the answers from the transporter's terminal and the recycler's terminal.

Therefore, if this system is used,
You can easily find carriers and recyclers who will dispose of the waste at the desired cost. In addition, the carrier / recycler can also consider whether to bid or not by looking at the waste data transmitted to each terminal and the price presentation of the waste generator.

1.2 Hardware Configuration of Mediation Server FIG. 2 shows a hardware configuration example of the mediation server 12 shown in FIG. The CPU 21 has an interface 22, a memory 23, and a hard disk 2 via a bus line.
4. The input device 25 is connected.

The hard disk 24 has a filtering condition registration program 31, a waste data registration program 32, a carrier selection program 33, a recycler selection program 34, a carrier filter condition database 35, a recycler filter condition database 36,
Waste information database 37, expense selection database 3
8, a re-registration advice program 39, a mail program 40, an operating system 41 (such as windows of Microsoft Corporation) and the like are registered.

The filtering condition registration program 31
Is to register filtering conditions in the carrier filter condition database 35 and the recycler filter condition database 36.

The waste data registration program 32 registers waste data in the waste information database 37.

The carrier selection program 33 compares the waste data with the filtering conditions of the carrier, creates transportation request waste information (see FIG. 11), and registers the transportation cost in the expense selection database 38. is there.

The recycler selection program 34
Comparison of the waste data with the filtering conditions of the recycler, creation of recycle-requested waste information (see FIG. 14), registration of the purchase price in the cost selection database 38, and identification of the transporter and recycler with the lowest total processing cost The combination is specified and the bidding result is transmitted to each carrier.

[0096] In the carrier filter condition database 35, filtering conditions transmitted from each carrier terminal are registered.

The filtering conditions transmitted from each recycling agent terminal are registered in the recycling agent filtering condition database 36.

[0098] In the waste information database 37, the waste data input by the waste generator to the waste data registration form (see FIG. 8) is registered. The bidding price (transportation cost, purchase price) is also registered.

In the cost selection database 38, an estimate of the transportation cost of each carrier for each recycling company, the purchase price of each recycling company, and the like are registered (see FIG. 16).

The re-registration advice program 39 is designed to select a recycler or the like based on the filtering conditions or the answer of the recycler when the appropriate recycler or the like cannot be specified based on the waste data. This is to create advice to waste generators.

The mail program 40 is for transmitting the transport request waste information and the like to the carrier and the recycling request waste information and the like to the recycler.

In this embodiment, a filtering condition registration program 31, a waste data registration program 32,
The carrier selection program 33, the recycler selection program 34, the re-registration advice program 39, and the mail program 40 execute the above functions in cooperation with the operating system 41.

1.3 Waste generator terminal, carrier A ~
FIG. 3 shows a waste generator terminal 11, a carrier A to D terminal 13 to 16, and a recycler A to D terminal 17 shown in FIG.
20 shows an example of the configuration of hardware Nos. An interface 52, a memory 53, a hard disk 54, and an input device 55 are connected to the CPU 51 via a bus line.

In the hard disk 54, a browser program 56 (such as Microsoft Internet Explorer), an operating system 57, and the like are registered.

[0105] The browser program 45
This is a program for browsing data such as 2.

In this embodiment, the browser program 4
5 performs the above functions in cooperation with the operating system 46.

1.4 Flowchart Processing for registering the filtering conditions of the transporters A to D and recyclers A to D (1.4.1) and registering the waste data of the waste generators (1.4.2) are described below. , Bidding process (1.4.
The explanation is divided into 3). The processing of the re-registration advice program 39 will be described in 1.4.4.

1.4.1 Processing for Registering Filtering Conditions of Carriers and Recyclers FIG. 4 shows a case where carriers A to D and recyclers A to D register filtering conditions in the mediation server 12.
The processing of the filtering condition registration program 31 and the browser program 56 is shown. This filtering condition is
This is a condition for transporters and recyclers to transport or recycle waste.

First, transporters A to D, recycler A
To D access the mediation server 12 and request a filtering condition registration form as shown in FIG. 5 (ST1).
1). When this is received from the mediation server 12 (ST1
2) Enter the type and weight of the waste that can be processed, the area where the processing is permitted (area where the transport of waste is permitted), and your own mail address (ST13, ST14). It is transmitted (ST15) and registered in the carrier filter condition database 35 or the recycler filter condition database 36 as shown in FIGS. 6A and 6B (ST16).

For example, the carrier A limits the type of waste that can be treated to “sludge only”, the weight to “100 tons or less”, and the component to “chlorine 1% or less”.

As described above, if the filtering conditions are registered in the mediation server 12 in advance, the carrier and the recycling company receive the waste data received by the mediation server 12 that does not satisfy the filtering conditions. Never.

[0112] Therefore, the carrier can save the trouble of performing unnecessary processing on data unnecessary for itself.

The registration and updating of the filtering conditions can be performed at any time, and the filtering conditions need not be registered. If the filtering condition is not registered, all of the waste data received by the mediation server 12 is transmitted to the terminal such as a carrier.

1.4.2 Processing of Registering Waste Data of Waste Generation Company FIG. 7 shows a waste data registration program 3 in a case where the waste generation business registers waste data in the mediation server 12.
2 shows the processing of the browser program 45.

[0115] First, the waste generator is set up by the mediation server 12.
To request a waste data registration form as shown in FIG. 8 (ST21). When this is received from the mediation server 12 (ST22), basic information, component information (hereinafter, referred to as waste data A), and its own mail address are input (ST23, 24). This basic information is
It refers to the type of waste and the desired total disposal cost. The component information refers to the water content of the waste, the main component, and the like.

This is transmitted to the mediation server 12 (ST2
5), register it in the waste information database 37 as shown in FIG. 9 (ST26). The waste data A is a waste code “5-0012”, a waste type “sludge”, a generated amount “75 tons”, and a water content “45%”.

1.4.3 Bidding Process FIGS. 10A to 10C show, for waste data A, a carrier selection program 33 and a recycler selection program for specifying a combination of a carrier and a recycler with the lowest total processing cost. 34 shows the processing of the mail program 40.

First, the waste data A registered in the waste information database 37 and each of the recyclers A to D registered in the recycler filter condition database 36
Recycling company A
(ST31) (Since the type of waste that can be treated by the recycler D is "manure", it does not satisfy the waste type "sludge" (see FIGS. 6B and 9)). As a result of this filtering process, if no recycler is selected (ST32), the re-registration advice program 39 creates re-registration advice (see 1.4.4).

Next, the waste data A registered in the waste information database 37 is compared with the filtering conditions of the carriers A to D registered in the carrier filter condition database 35, and the carriers A to D are compared. Select C (S
T33) (The weight that can be handled by Carrier D is “70 tons”
Therefore, the amount of generated waste “75 tons” is not satisfied (see FIGS. 6A and 9). As a result of this selection process,
If no carrier is selected (ST34), the re-registration advice program 39 creates re-registration advice (see 1.4.4).

Next, based on the waste data A, FIG.
The transportation request waste information A is created as shown in FIG.
5). This is data such as the transport distance, the type of waste, the deadline for reply, etc. from the waste generation location to each of the recyclers A to C selected in ST31. Then, the transport request waste information A is mailed to each of the transporters A to C selected in ST33 (ST36). At this time, FIG.
Attach the transportation cost estimate response form shown in 2.

Next, the transporters A to C look at the transport request waste information A and confirm the place and amount of waste generated,
It is examined whether a truck for transporting the vehicle can be dispatched (ST37). If the vehicle can be dispatched, the mediation server 12
By accessing the cost selection database 38 shown below.
Estimating the transportation cost while viewing the registered contents (estimated price of transportation costs of other transportation companies) of FIG.
A response to the transportation cost estimate such as 2 is created (ST38).

Then, the transportation cost estimation response is transmitted to the mediation server 12 (ST39). If the answer period is not reached, the transportation cost estimate answer can be re-created and transmitted to the mediation server. In addition, even when the vehicle cannot be dispatched, the transportation cost estimation response to the effect that no bidding is made is transmitted to the mediation server 12.

Next, upon receiving the transportation cost estimate response from the carriers A to C terminals (ST40), the data is registered in the cost selection database 38 (see FIG. 13) (ST4).
1). For example, the carrier A sets the transportation cost to the recycler A to 30,000 yen. In addition, carrier C
States that recycler C will not be bidding.

When the transportation cost estimate response is received again from the same carrier by the response deadline, the registered contents of the cost selection database 38 are updated. If the transportation cost estimate response is not transmitted to the mediation server 12 by the response deadline, the transportation company determines that the bidding is not to be performed.

Next, when the answer deadline has elapsed, a recycler is further selected based on the data registered in the expense selection database 38 (ST42). At this time, if no estimation of the transportation cost for a certain recycler is made, the recycler is not selected. In this embodiment, the transportation costs are estimated for all of the recyclers A to C.
Select C. As a result of this selection processing, if no recycler is selected (ST43), the re-registration advice program 39 creates re-registration advice (see 1.4.4).

Next, based on the waste data A registered in the waste information database 37, recycle request waste information A as shown in FIG. 14 is created (ST44). This is data such as the lowest-priced carrier, the lowest selling price, etc., and the type of waste, component information, response deadline, and the like.

The minimum selling price is based on the desired total processing cost “29000 yen” of the waste data A registered in the waste information database 37 and the transportation cost registered in the cost selection database 38 as follows. Set forth in

First, the lowest transport cost for each recycler is determined (for example, the lowest transport cost for recycler A is "30000 yen"). Then, the lowest selling price of the waste is determined for each recycler (for example, the lowest selling price for the recycler A is “1000 yen”. This is based on the lowest transportation cost “30000 yen”. This is obtained by subtracting the desired total processing cost “29000 yen” of the product data A.)

The recycle request waste information A created in this way is transmitted to the recyclers A to C terminals (ST
45). At this time, a purchase estimate response form shown in FIG. 15 is attached.

Next, the recyclers A to C look at the recycle request waste information A, and check the data such as the lowest-priced carrier, the lowest selling price, and the type, amount of waste, and component information. Then, it is determined whether the recycling process is possible (ST46). If possible, access the mediation server 12 to access the cost selection database 38 (FIG. 1)
6) registration contents (purchase price of other recycling companies)
, The purchase price is estimated, and a purchase estimate response as shown in FIG. 15 is created (ST47).

Then, a reply to the purchase estimate is transmitted to the mediation server 12 (ST48). If the answer period is not reached, the purchase estimate answer can be re-created and transmitted to the mediation server. Further, even when the purchase is not made, the minimum purchase price is presented, or a purchase quote reply not to bid is transmitted to the mediation server 12.

Next, when the purchase estimate responses are received from the recycler terminals A to C (ST49), the data is registered in the expense selection database 38 (see FIG. 16) (ST49).
50). For example, recycler B sets the purchase price to 35
It is 00 yen. The recycler A does not bid ("NG" in the purchase price estimate column).
However, if it is 500 yen, waste is purchased ("500 yen" in the column of the minimum purchase price). If a recycle cost estimate response is received again from the same recycler by the response deadline, the cost selection database 3
8 is updated. If the purchase quote response is not transmitted to the mediation server 12 by the response deadline, the recycler determines that no bidding is performed.

Next, when the answer deadline has elapsed, a combination of a transporter and a recycler with the lowest “transportation cost-purchase price” is specified based on the data registered in the expense selection database 38 (ST51). In this case, the carrier C and the recycler B are specified. As a result of this specifying process, if the recycler cannot be specified (for example, no purchase price is presented from the recycler) (ST52), the re-registration advice program 3
8 creates re-registration advice (see 1.4.4).

Next, the carrier, recycler, total processing cost, etc. specified in ST51 are transmitted to the waste generator by e-mail (ST53). The waste generator checks the contents and sends a notice to approve (ST54). In response to this, the bidding price (transportation cost, purchase price) is registered in the waste information database 37 (see FIG. 17), and the specified transporter C and recycler B are registered in FIG.
A mail of the result of the bidding such as 8A is transmitted (ST5).
5). In addition, a bid result as shown in FIG.

Each carrier A to C, recycler A to C
Performs the final confirmation by browsing the bidding results.

Therefore, waste generators can easily
You can find haulers and recyclers who will dispose of your waste at the desired cost.

1.4.4 Processing of Re-Registration Advice Program FIG. 19 shows a case where a carrier and a recycler cannot be selected in the above processing (ST12, 14, 23, 32).
Of the re-registration advice program 39 of FIG.

When the recycler selection program 34 or the like receives information indicating that a recycler cannot be selected, it is first determined whether or not the “minimum purchase price” is registered in the expense selection database 38 (ST61).

If it is determined that the information is registered, the minimum price condition (“transportation cost” − “minimum purchase price”) is calculated based on the “transportation cost” and the “minimum purchase price”.
A re-registration advice like a is created (ST6
2), and sends it to the waste generator terminal 11 (ST
64).

If it is determined that the information is not registered, the minimum price condition is determined based on the price of the filtering condition registered in the recycler filter condition database 36 (or the carrier filter condition database 35). Create registration advice (ST
63), and sends it to the waste generator terminal 11 (S)
T64).

When the waste generator receives the re-registration advice (ST65), it takes into account the re-registration advice and re-enters it again.
The requested total processing cost change form as shown in FIG. 20B is requested from the mediation server 12, and the desired total processing cost is increased. Based on the changed waste data, the mediation server 12 performs the bidding process of 1.4.3 again.

1.5 In this embodiment, after selecting a transporter, a recycler is selected. However, the present invention is not limited to this, and after selecting a recycler, a carrier may be selected.

In addition, the carrier may be asked about the transportation cost for each recycler, and the recycler may be asked about the purchase price of the waste.

Further, in this embodiment, the recycler selection program 36 transmits the bidding result to each carrier terminal or the like after finally confirming the waste generator. However, the present invention is not limited to this, and the bid result may be transmitted to each carrier terminal without obtaining the confirmation of the waste generator. Also, after obtaining the final confirmation of the carrier or the like specified in ST51, the bidding result may be transmitted to the waste generator or each carrier.

In this embodiment, waste is sold to a recycler. However, a recycling company may be paid for the recycling process.

Further, when a certain trader changes the estimated price registered in the cost selection database 38, the change may be notified to the trader who has already made the estimate.

Also, in this embodiment, the carrier browses the transport request waste information A at the carrier terminal,
By inputting the transportation cost, etc., a response to the transportation cost estimate is created. However, the transportation cost response program may be stored in the carrier terminal, and may create the transportation cost estimation response based on the transportation request waste information A (see the second embodiment).

Further, in this embodiment, the recycler browses the recycle request waste information A at the recycler terminal and inputs a purchase price or the like, thereby creating a recycle cost estimate response. However, the automatic bidding price update program may be stored in the recycler terminal, and may generate a recycle cost estimate response based on the recycle request waste information A (second example).
Of the embodiment).

[0149] 2 Second Embodiment [0149] In the following, when selecting a transporter who has a transport of waste, a recycler who has a recycling process or disposal, and a disposal company, all are automatically selected. The case where a successful bidder is determined first (automatic bidding process) will be described as an example. In this embodiment, the first trader corresponds to a carrier, the second trader corresponds to a recycling trader, and the third trader corresponds to a disposal trader.

2.1 Overall Configuration FIG. 21 shows the overall configuration in this embodiment. The mediation server 12 is connected to the waste generator terminal 11, the transporter A to D terminals 13 to 16, the recycler A to D terminals 17 to 20, and the disposal agent terminals A to C terminals 21 to 23 via the Internet. ing. In this embodiment, the mediation server 12 has a function as a bidding website on the Internet.

The carrier, recycler, and disposal company that use this system are required
, A filtering condition is registered in advance.

The waste generator first inputs waste data to the waste generator terminal 11 and transmits the data to the mediation server 12.

The mediation server 12 selects a carrier and a recycler based on the filtering conditions and the waste data, and transmits the waste data to the carrier terminal of the selected carrier.

The carrier terminal creates an estimate of the transportation cost to each recycler / disposer based on the waste data and transmits the estimate to the mediation server 12.

When the mediation server 12 receives the estimate from the carrier terminal, the recycler terminal selected based on the filtering condition sends the minimum selling price of waste and the weight of waste calculated based on the estimate to the recycler terminal selected based on the filtering condition. Etc., and ask whether or not to purchase the waste.

The recycler terminal determines whether or not to purchase the waste based on the minimum selling price and the data such as the weight of the waste, and presents the purchase price when attempting to purchase the waste. And sends it to the mediation server 12.

The mediation server 12 specifies the combination of the carrier and the recycler with the lowest total processing cost based on the answer from the carrier and the recycler terminals.

However, if a recycler cannot be selected, the mediation server 12 selects a recycler based on the filtering conditions of the disposal company and the waste data, and specifies the disposal company in the same manner as described above. In addition, the total treatment cost is a value obtained by subtracting a price to be sold to a recycler from a cost of transporting waste, or a value obtained by adding a disposal cost to a disposal company to a transport cost. Accordingly, the waste generator can automatically select a transporter that handles the waste and a recycler or a disposal company just by registering the waste data in the mediation server. In addition, the transporter, the recycler, and the disposal company can automatically participate in the bidding without considering the waste data.

2.2 Hardware Configuration of Mediation Server FIG. 22 shows a hardware configuration example of the mediation server 12 shown in FIG. The hard disk 24 further stores a disposal company selection program 61 and a disposal company filter condition database 62.

The disposal contractor selection program 61 compares the waste data with the filtering conditions of the disposal contractor, creates disposal request waste information (see FIG. 33), registers disposal costs in the cost selection database 38, and processes all processing costs. This is to specify the combination of the carrier and the disposal company with the lowest transportation cost plus the disposal cost, and transmit the bidding result to each carrier and disposal company.

In the disposal company filter condition database 62, the filtering conditions transmitted from the disposal company terminal are registered.

2.3 Hardware Configuration of Waste Generation Company Terminal This is the same as that shown in 1.3 above.

2.4 Hardware Configuration of Carrier Terminals FIG. 23 shows the carrier A to D terminals 13 to 16 shown in FIG.
2 shows an example of the hardware configuration. The CPU 71 has an interface 72, a memory 73,
A hard disk 74 and an input device 75 are connected.

The hard disk 74 has a transportation cost answering program 76, a dispatch table 77, and a transportation cost table 7.
8. The operating system 79 and the like are registered.

The transportation cost answering program 76, when estimating the transportation cost, checks whether or not the vehicle can be actually dispatched in the dispatch table 77, calculates the transportation cost based on the transportation cost table 78, and calculates the transportation server. 1
2 to send it. The dispatch table 77 is a dispatch date and time, a car number, a vehicle type, and other information (loading amount, etc.).
Are registered (see FIG. 24A).

In the transportation cost table 78, transportation distance unit prices and the like are registered, and are used for calculating transportation costs (see FIG. 24b).

In this embodiment, the transportation cost answering program 76 cooperates with the operating system 79 to
Perform the above functions.

2.5 Hardware Configuration of Recycler Terminal and Disposer Terminal FIG. 25 shows the recycler A to D terminals 17 shown in FIG.
20 to 20 and hardware configuration examples of disposal companies A to C terminals 21 to 23. An interface 82, a memory 83, a hard disk 84, and an input device 85 are connected to the CPU 81 via a bus line.

The hard disk 84 has an automatic bidding price update program 86 and a component screening program 8
7. Component table 88, operating system 89
Are registered.

The automatic bidding price update program 86 determines the purchase price of waste based on the recycling request waste information, or determines the waste disposal cost based on the disposal request waste information. It is.

The component screening program 87 determines whether or not to perform processing based on the component information of the recycling request waste information (or disposal request waste information) and the data of the component table 88.

The component table 88 is a component data table that can be processed by a recycling company or a disposal company (see FIG. 26).

In this embodiment, the automatic bidding price update program 86 and the component screening program 87 execute the above functions in cooperation with the operating system 89.

2.6 Flowchart The following is a process for registering the filtering conditions of the carriers A to D, the recyclers A to D, and the disposal companies A to C (2.6.1).
And registration processing of waste data of waste generators (see 2.6.
2) and the automatic bidding process (2.6.3).

2.6.1 Registration of Filtering Conditions for Carriers, Recyclers, and Disposers This is the same as in 1.4.1 above (see FIG. 4). FIGS. 27A-C
9 shows registered contents of the carrier filter condition database 35, the recycler filter condition database 36, and the disposal company filter condition database 62.

2.6.2 Waste data B of waste generators
Registration processing is the same as 1.4.2 above (see FIG. 29a). In FIG.
The registration contents of the waste information database 37 are shown. In addition,
The waste code of the waste data B is “5-0013”.

2.6.3 Automatic Bidding Processing Referring to FIGS. 29B to 29E, regarding the waste data B, when specifying a combination of a transporter and a recycler or a disposal company whose total processing cost is the lowest, The hauler selection program 33, the recycler selection program 34, the disposal company selection program 61, the "hauling cost response program 76" of the haulers A to C terminals, and the "automatic bidding price update program 86,
The process of the "component screening program 87" is shown.

First, the waste data B registered in the waste information database 37 and each of the recyclers A to D registered in the recycler filter condition database 36
(ST101). It is determined that there is no recycler that can process the waste data B (ST102). If there is a recycler, follow ST103 to ST128 (see 1.4.3 above).

Next, the waste data B registered in the waste information database 37 is compared with the filtering conditions of the disposal companies A to C registered in the disposal company filter condition database 62, and the disposal companies A to C are compared. Select (ST
129, 130). As a result of this selection process, if no disposal company is selected, the re-registration advice program 39 creates re-registration advice (see 1.4.4).

Next, the waste data B registered in the waste information database 37 and the filtering conditions of the carriers A to D registered in the carrier filter condition database 35 are compared, and the carriers A to D are compared. Select C (S
T131, 132). As a result of this selection processing, if no carrier is selected, the re-registration advice program 39 creates re-registration advice (1.4.4
reference).

Next, based on the waste data B, FIG.
The transport request waste information B as described above is created (ST13).
3). This is data such as the transport distance, the type of waste, and the response deadline from the waste generation location to each of the disposal companies A to C selected in ST129. Then, the transport request waste information B is transmitted to each of the disposal companies A to C selected in ST129 (ST134). At this time, a transportation cost estimate response form shown in FIG. 31 is attached.

Next, upon receiving the transportation request waste information B (ST135), the transportation cost answering program 76 of the carrier terminals A to C creates a transportation cost estimation response as follows. First, it is determined whether or not a truck can be dispatched based on the generated amount of the transport request waste information B, the operating distance, and the like, and the dispatch table 77 (ST136, 137). When the vehicle allocation is determined, the transportation cost is calculated based on the “operating distance” of the transportation request waste information B and the transportation cost table 78 (ST138), and a transportation cost estimation response as shown in FIG. 31 is created (ST139). ). Then, the mediation server 12
(ST140). If it is determined that transport is impossible, a response to that effect is created and transmitted to the mediation server 12.

Next, when receiving the transportation cost estimate response from the carriers A to C terminals (ST141), the data is registered in the cost selection database 38 (see FIG. 32) (ST41).
142).

Next, a disposal company is further selected based on the data registered in the cost selection database 38 (S
T143). In this embodiment, the estimate of the transportation cost for the disposal company A is already the desired total processing cost “2900”.
Since it exceeds "0 yen", disposal companies B and C are selected (ST144). As a result of this selection process, if no disposal company is selected, the re-registration advice program 39 creates re-registration advice (see 1.4.4).

Next, disposal request waste information B as shown in FIG. 33 is created based on the waste data B registered in the waste information database 37 (ST145). this is,
This is data such as the lowest-priced carrier, the lowest selling price, etc., the type of waste, the component information, and the response deadline.

The minimum selling price is calculated based on the desired total processing cost “29000 yen” of the waste data B registered in the waste information database 37 and the transportation cost registered in the cost selection database 38 as follows. Set forth in

First, the lowest transportation cost for each disposal company is determined (for example, the lowest transportation cost for disposal company B is “28,000 yen”). Then, the minimum disposal cost of the waste is calculated for each disposal company (for example, the minimum disposal cost for disposal company B is “1000 yen”).
It is. This is the desired total processing cost of waste data B “2
9000 yen "minus the lowest transportation cost" 28,000 yen ").

The disposal request waste information B thus created
Are transmitted to the disposal companies B and C terminals (ST146). At this time, a purchase estimate response form shown in FIG. 34 is attached.

Next, the component screening program 87 for the disposal company terminals B and C, the automatic bidding price update program 8
6 prepares the disposal cost estimate response as follows. First, the component screening program 87 compares the component information of the disposal request waste information B with the component conditions registered in the component table 88 to determine whether or not disposal is possible (S).
T148). If it is determined that disposal is possible (ST149), the automatic bidding price update program 86 calculates the disposal cost based on, for example, the following disposal cost calculation formula (ST150).

Disposal cost (yen) = weight (ton) x coefficient 1 + Mg
O content (%) × coefficient 2 + Cl content (%) × coefficient 3 Then, a disposal cost estimate response as shown in FIG. 34 is created (S
T151), and transmits it to the mediation server 12 (ST1)
52). If it is determined that disposal is impossible, a response to that effect is created and transmitted to the mediation server 12.

Next, when the disposal company selection program 61 of the mediation server 12 receives the disposal cost estimation response from the disposal companies B and C terminals (ST153), the data is registered in the cost selection database 38 (see FIG. 35). (ST15
4). Then, the combination of the transporter B and the disposal company C in which “transportation cost + disposal cost” is less than or equal to the desired total processing cost and which is the lowest is specified (ST155). If no disposal contractor is selected as a result of this selection processing (ST156), the re-registration advice program 39
Create re-registration advice (see 1.4.4).

Next, the bidding result is transmitted to the waste generator terminal 11, each carrier A to C terminal, and each disposal company B and C terminal (ST157).

[0193] Therefore, only when the waste generating company registers the waste data in the mediation server 12, each of the above programs automatically executes the bidding process.

2.7 In this embodiment, as a result of the filtering process,
When no recycler is selected (ST10
In 2), a disposal company is selected. However, the present invention is not limited to this.
If no recycler is selected at 28 or if the recycler cannot process the entire amount of waste, a process for selecting a disposal company may be performed.

In this embodiment, a disposal company is selected without obtaining approval from a waste generation company.
However, the present invention is not limited to this, and when no recycler is selected (ST102), it may be asked whether or not to perform a process for selecting a disposal company. Also,
In the waste data registration form, it may be inquired whether or not to select a disposal company.

In ST115, “Transportation cost +
Although the combination of a carrier and a disposal company with the lowest "disposal cost" is specified, if there are two or more combinations, the transportation carrier and the disposal company should be re-estimated for the transportation and disposal costs. Inquire. As a result, the combination of the transporter and the disposal company that minimizes the “transportation cost + disposal cost” is specified. Further, a waste generation company may specify the combination.

Further, the transportation cost answering program 76 used in this embodiment may be set such that a discount can be set according to the type of waste.

In this embodiment, the case where two types of contractors are selected is described as an example. However, the present invention is not limited to this, and one company or a plurality of companies may be selected. Further, when a suitable one of the first traders cannot be selected, a second trader may be selected. Also,
If the first trader does not respond within a predetermined period, a second trader may be selected.

When the recycler / disposer cannot process the entire amount of waste, the re-registration program 39 notifies the waste generator of the unprocessable quantity as shown in FIG. , And instruct the user to reset. 2.8 The automatic bidding price update program 86 may reduce the disposal cost based on the registered contents of the cost selection database 37 of the mediation server 12. As an example of this, FIG. 37 shows the processing of the automatic bidding price update program 86 of the disposal company terminal.

First, of all the processing costs (transportation costs + disposal costs) registered in the cost selection database 37, the lowest price A is obtained (ST201). Next, the sum of the estimated disposal price B calculated in ST150 and the transportation cost for the disposal contractor is compared with the lowest price A (ST150).
202).

If the price is less than the lowest price A, a response to the disposal cost estimate is prepared using the price B as the disposal cost (ST20).
5). If it is equal to or higher than the lowest price A, the transportation cost for the disposal company is deducted from the lowest price A, and a value (price C) obtained by further deducting 1000 yen is calculated (ST203).

Next, if the price C is equal to or more than the minimum price D predetermined by the disposal company, the price C is set as a disposal cost.
A disposal cost estimate response is created (ST204, ST205).
If the price is lower than the minimum price D, a disposal cost estimate response not to bid is prepared (ST204, ST206).

[0203] The automatic bidding price updating program 86 is executed by the cost selection database 3 of the mediation server 12.
The above-described processing may be performed a plurality of times by repeatedly checking the registered contents of No. 8.

Therefore, the use of the automatic bidding price update program 86 causes a reduction in the estimated price of each trader, and the waste generation trader can request waste disposal at a lower price. Also, each trader can automatically compete for a quoted price between each trader.

2.9 In this embodiment, the bidding process by a carrier, a recycler, or a disposal company when performing waste disposal is described as an example. However, the present invention is not limited to this, and may be as follows.

(1) A person who wants to purchase an A component, a B component, and a C component requests the mediation server, and each component maker participates in the bidding.

(2) A system in which a person who intends to repair and sell a used car requests a mediation server, and a used car dealer and an automobile repair company participate in the bidding.

(3) An airline company, a railway company, and an inn facility participate in a bid by a person who intends to travel to a mediation server.

As described above, by using this bidding processing system, bidding processing can be performed at one time even if the bidding business spans a plurality of classes.

[Brief description of the drawings]

FIG. 1 is a diagram illustrating an overall configuration according to a first embodiment.

FIG. 2 is a diagram illustrating a hardware configuration of a mediation server 12 according to the first embodiment.

FIG. 3 is a waste generator terminal 1 according to the first embodiment;
FIG. 1 is a diagram illustrating a hardware configuration of a carrier terminal and a recycler terminal.

FIG. 4 is a flowchart illustrating a registration process of a filtering condition of a carrier / recycler in the first embodiment.

FIG. 5 is a filtering condition registration form according to the first embodiment.

FIG. 6 shows a carrier filter condition database 35 and a recycler filter condition database 36 in the first embodiment.

FIG. 7 is a flowchart illustrating a process of registering waste data of a waste generator in the first embodiment.

FIG. 8 is a waste data registration form according to the first embodiment.

FIG. 9 is a waste information database 37 according to the first embodiment.

FIG. 10A is a flowchart showing processing of a carrier selection program 33, a recycler selection program 34, and a mail program 40 in the first embodiment.

FIG. 10B is a flowchart showing processing of a carrier selection program 33, a recycler selection program 34, and a mail program 40 in the first embodiment.

FIG. 10C is a flowchart showing processing of a carrier selection program 33, a recycler selection program 34, and a mail program 40 in the first embodiment.

FIG. 11 is transportation request waste information in the first embodiment.

FIG. 12 is a reply to the transportation cost estimate in the first embodiment.

FIG. 13 is a cost selection database 38 according to the first embodiment.

FIG. 14 shows recycling request waste information in the first embodiment.

FIG. 15 is a purchase quote response in the first embodiment.

FIG. 16 is a cost selection database 38 according to the first embodiment.

FIG. 17 is a waste information database 37 according to the first embodiment.

FIG. 18 is a bidding result in the first embodiment.

FIG. 19 is a flowchart illustrating processing of a re-registration advice program 39 according to the first embodiment.

FIG. 20A is a re-registration advice in the first embodiment.

FIG. 20b is a desired total processing cost change form in the first embodiment.

FIG. 21 is a diagram illustrating an overall configuration according to a second embodiment.

FIG. 22 is a diagram illustrating a hardware configuration of a mediation server 12 according to the second embodiment.

FIG. 23 is a diagram illustrating a hardware configuration of a carrier terminal according to the second embodiment.

FIG. 24a is a dispatch table 77 of the carrier terminal in the second embodiment.

FIG. 24B is a transportation cost table 78 of the transportation company terminal in the second embodiment.

FIG. 25 is a diagram illustrating a hardware configuration of a recycling company terminal and a disposal company terminal according to the second embodiment.

FIG. 26 is a component table 88 of the disposal company terminal in the second embodiment.

FIG. 27 shows a carrier filter condition database 35, a recycler filter condition database 36, and a disposal company filter condition database 62 in the second embodiment.
It is the registered contents of.

FIG. 28 shows registered contents of a waste information database 37 in the second embodiment.

FIG. 29a is a flowchart showing a process of registering waste data of a waste generator in the second embodiment.

FIG. 29b is a diagram illustrating a “transporter selection program 33, a recycler selection program 34” of the intermediary server 12, a “transportation cost response program 76” of a transporter terminal, and a “bidding” of a recycler / disposal terminal in the second embodiment. It is a flowchart which shows the process of "price automatic update program 86, component screening program 87".

FIG. 29c shows the “transporter selection program 33, recycler selection program 34” of the mediation server 12, the “transportation cost response program 76” of the transporter terminal, and the “bid” of the recycler / disposer terminal in the second embodiment. It is a flowchart which shows the process of "price automatic update program 86, component screening program 87".

FIG. 29d is a diagram illustrating the “transporter selection program 33 and the recycler selection program 34” of the intermediary server 12, the “transportation cost response program 76” of the transporter terminal, and the “bidding” of the recycler / disposer terminal in the second embodiment. It is a flowchart which shows the process of "price automatic update program 86, component screening program 87".

FIG. 29e shows the “transporter selection program 33, recycler selection program 34” of the intermediary server 12, the “transportation cost response program 76” of the transporter terminal, and the “bid” of the recycler / disposer terminal in the second embodiment. It is a flowchart which shows the process of "price automatic update program 86, component screening program 87".

FIG. 29f: “Transporter selection program 33, recycler selection program 34” of mediation server 12, “transportation cost answer program 76” of transporter terminal, and “bidding” of recycler / disposer terminal in the second embodiment. It is a flowchart which shows the process of "price automatic update program 86, component screening program 87".

FIG. 30 is transportation request waste information in the second embodiment.

FIG. 31 is a transportation cost estimate response in the second embodiment.

FIG. 32 shows registered contents of a cost selection database 38 in the second embodiment.

FIG. 33 shows disposal request waste information in the second embodiment.

FIG. 34 is a disposal cost estimate response in the second embodiment.

FIG. 35 shows registered contents of a cost selection database 38 in the second embodiment.

FIG. 36 is a diagram showing a notification of an unprocessable quantity according to another embodiment.

FIG. 37 is a flowchart showing the processing of the automatic bidding price update program 86 in another embodiment.

FIG. 38 is a diagram showing a bid processing system according to a conventional technique.

FIG. 39 is a diagram showing a bidding processing system according to a conventional technique.

[Explanation of symbols]

 35 ... carrier filter condition database 36 ... recycler filter condition database 38 ... cost selection database 62 ... disposal company filter condition database 76 ... transportation cost answer program 77 ... dispatch table 86 ..Automatic bidding price update program 87 ... Component screening program 88 ... Component table

Claims (20)

[Claims] An intermediary server for selecting at least one of one or a plurality of first agents, one or a plurality of second agents, and an intermediary server connected to the intermediary server via the Internet. A bid requester terminal, one or a plurality of first trader terminals, and one or a plurality of second trader terminals. Receiving the request information, transmitting the request information to the first trader terminal, determining a bid recruiting method for the second trader based on the response status from the one or more first trader terminals, A bidding processing method, wherein bids are invited from a plurality of second traders. 2. An intermediary server for selecting at least one from among one or more first agents, one or more second agents, and one or more third agents, A selection requester terminal, one or more first trader terminals, one or more second trader terminals, and one or more third trader terminals connected to the mediation server via the Internet. A bidding processing method to be implemented, wherein the intermediary server receives request information from the selection requester terminal, transmits the request information to a first trader terminal, and receives a request from one or more first trader terminals. Based on the response status, a bid recruitment method for the second vendor is determined, a bid is recruited to one or more second vendor terminals, and based on the response status from the one or more second vendor terminals, Determine the bid recruitment method for the third trader and Bidding process wherein the to recruit bid third skill terminal. 3. An intermediary server for selecting one or a plurality of first agents and one or a plurality of second agents from a first agent and a second agent. A bidding processing system comprising: a selection requester terminal, one or more first trader terminals, and one or more second trader terminals connected via Receiving first request information from the third party terminal, transmitting the request information to the first trader terminal, receiving one or more first answers from one or more first trader terminals, Based on one or more first decision answers selected from the one or more first answers according to each second trader terminal and request information from the selection requester terminal, each second trader The second request data according to the second request data or the second request data A second transmission means for selecting a trader, creating second request data according to each of the selected second traders, and transmitting the second request data to the second trader terminal. Bidding processing system characterized by the following. 4. The bid processing system according to claim 3, wherein the mediation server further receives one or a plurality of second replies from one or a plurality of second trader terminals and receives the one or a plurality of second replies. And a first selection means for selecting a first trader and a second trader based on the one or more first decision answers. 5. The method according to claim 1, wherein said first or plurality of first contractors, one or more second contractors, and one or more third contractors include a first contractor.
And a mediation server for selecting at least a second vendor or a third vendor, a selection client terminal connected to the mediation server via the Internet, one or more first vendor terminals, Or a plurality of second trader terminals, and one or more third trader terminals, wherein the mediation server receives request information from the selection requester terminal and receives the request information. A first transmitting means for transmitting to the first trader terminal, one or more first replies from one or more first trader terminals, and Based on one or more first decision answers selected from the plurality of first answers and request information from the selection requester terminal, create second request data according to each second trader, Alternatively, select a second supplier to request a bid and select Second transmission means for generating second request data according to each of the second contractors, and transmitting the second request data to the second contractor terminal; and one or more first contractor terminals Receiving one or a plurality of first answers from one or more, and one or a plurality of first decision answers selected from the one or a plurality of first answers according to each third trader terminal; and the selection requester terminal The third request data is created according to each third trader based on the request information from the third trader, or the third trader requesting the bid is selected, and the third trader is selected according to each selected third trader. And a third transmitting means for generating the third request data and transmitting the third request data to the third trader terminal. 6. The bid processing system according to claim 5, wherein the mediation server further receives one or a plurality of second answers from one or a plurality of second trader terminals, or receives one or a plurality of third Receiving one or a plurality of third answers from the trader terminal of the first trader, and based on the one or more second or third answers and the one or more first decision answers, the first trader And at least a second selecting means for selecting a second trader or a third trader. 7. The bidding processing system according to claim 5, wherein the third transmitting means decides not to select a third trader based on the third request data, or When the second selecting means can select the first trader and the second trader, the third request data is not transmitted to all the third trader terminals. 8. The bid processing system according to claim 3, wherein the mediation server includes a filtering condition database that stores a first filtering condition, a second filtering condition, or a third filtering condition. The first transmitting means, based on request information from the selection requester terminal and a first filtering condition, selects one or a plurality of first trader terminals transmitting the request information. Performing the processing, or the second transmitting means, based on request information from the selection requester terminal and a second filtering condition,
Performing a second filtering process for selecting one or a plurality of second trader terminals to which the request information is transmitted; or, the third transmitting means transmits request information from the selection requester terminal to a third Based on the filtering criteria,
A third filtering process for selecting one or a plurality of third trader terminals transmitting the request information. 9. The bidding processing system according to claim 3, wherein the mediation server further includes a first associated information corresponding to each first trader based on a result of the first filtering process. Or, based on the result of the second filtering process, creates the second accompanying information corresponding to each second trader, or based on the result of the third filtering process, An additional information creating unit that creates third additional information according to a trader, wherein the first transmitting unit includes the first information together with the request information.
Or the second transmitting means transmits the second incidental information together with the request information to one or more second agent terminals. Transmitting, or the third transmitting means transmits the third accompanying information together with the request information to one or a plurality of third trader terminals. 10. The bid processing system according to claim 3, wherein the mediation server includes an answer database for registering the first answer, the second answer, or the third answer, and The first trader terminal sends the first answer determined or updated by the first trader based on the registered contents of the answer database to the mediation server, or the second trader terminal Transmitting the determined or updated second answer to the mediation server based on the registered contents of the answer database, or the third trader terminal allows the third trader terminal to execute the third reply based on the registered contents of the answer database. Transmitting the determined or updated third answer to the mediation server. 11. A bid processing system according to claim 3, wherein one or a plurality of first trader terminals, second trader terminals, or third trader terminals.
Is characterized in that it has an automatic bidding determination means for receiving the request information from the mediation server and determining whether or not to accept the request. 12. The bidding processing system according to claim 11, wherein said automatic bidding determination means creates said first response, second response or third response based on said request information from said mediation server. What is characterized by doing. 13. The bidding processing system according to claim 12, wherein the first bidding terminal includes an automatic bidding determining means of the first bidding terminal, which determines or updates the first response determined or updated based on the response database. Transmitting to the mediation server, or the second trader terminal, the automatic bidding determination means of the second trader terminal, based on the answer database, transmits the determined or updated second answer to the mediation server, Alternatively, the third trader terminal is characterized in that the automatic bidding determination means of the third trader terminal transmits the determined or updated third answer to the mediation server based on the answer database. 14. The bidding system according to claim 3, wherein said request information is a desired total price, said first answer is a first price determined by a first trader, The second request data is based on the desired total price and the first request data.
Or a second requested price obtained by deducting the desired total price from the first price, the second answer is a second price determined by a second trader, The request data of 3 is based on the desired total price
Or a third requested price obtained by subtracting the desired total price from the first price, and the third answer is a third price determined by a third trader. What to do. 15. The bidding processing system according to claim 3, wherein the selection requester is a waste generator that requests waste processing, and the first supplier is a waste recycling company. Or a carrier for transporting to a disposal company; the second company is a recycling company that performs waste recycling; and the third company is a disposal company that performs disposal. thing. 16. The bid processing system according to claim 15, wherein the request information includes a desired total processing cost required for all processing of waste set by a waste generator, and the first answer is a transportation. The second request data includes a price obtained by subtracting the transportation cost from the desired total processing cost, wherein the transportation cost includes a transportation cost to each recycler or a disposal company determined by the vendor. A second answer includes a purchase price of the waste determined by a recycler; the third request data includes a price obtained by subtracting the transportation cost from the desired total processing cost; The answer 3 is characterized in that it includes the disposal cost of the waste determined by the disposal company. 17. A mediation server for selecting a first vendor and a second vendor from one or a plurality of first vendors and one or a plurality of second vendors, the mediation server comprising: Is a selection requester terminal, one or more first trader terminals, and one or more second
A first transmission means for receiving request information from the selection requester terminal and transmitting the request information to the first trader terminal; and one or more first trader terminals Upon receiving one or a plurality of first answers, a first decision answer selected from the one or a plurality of first answers according to each second trader terminal and request information from the selection requester terminal A second transmission means for generating second request data according to each second contractor based on the second request data, and transmitting the second request data to the second trader terminal; and one or more second traders Receiving one or more second answers from the terminal, the one or more second answers and the first
And a first selecting means for selecting a first trader and a second trader based on the answer to the decision. 18. One or more first contractors, one or more second contractors, and one or more third contractors, a first contractor, at least a second contractor or a third contractor. 3. An intermediary server for selecting a third agent, wherein the intermediary server is a terminal of a selection requester, one or more first agent terminals, and one or more second terminals via the Internet.
A first transmission unit connected to one or more third trader terminals, receiving request information from the selection requester terminal, and transmitting the request information to the first trader terminal; Receiving one or more first answers from one or more first dealer terminals, and a first decision answer selected from the one or more first answers according to each second dealer terminal; A second transmission unit that creates second request data according to each second trader based on the request information from the selection requester terminal and transmits the second request data to the second trader terminal And a first decision answer selected from the one or more first answers in response to each of the third dealer terminals, receiving one or more first answers from the one or more first dealer terminals And a third request data according to each third trader based on the request information from the selection requester terminal. A third transmission means for generating a third request data to the third trader terminal, receiving one or more second answers from one or more second trader terminals, or Upon receiving one or more third answers from one or more third trader terminals,
Or a plurality of second answers or third answers, and a first trader, and at least a second selecting means for selecting at least a second trader or a third trader based on the first decision reply; An intermediary server comprising: 19. The mediation server according to claim 17 or 18, further comprising a filtering condition database storing a first filtering condition, a second filtering condition, or a third filtering condition, The transmitting unit performs a first filtering process of selecting one or a plurality of first trader terminals to which the request information is transmitted, based on the request information from the selection requester terminal and a first filtering condition, Or, the second transmitting means, based on request information from the selection requester terminal and a second filtering condition,
Performing a second filtering process for selecting one or a plurality of second trader terminals to which the request information is transmitted; or, the third transmitting means transmits request information from the selection requester terminal to a third Based on the filtering criteria,
A third filtering process for selecting one or a plurality of third trader terminals transmitting the request information. 20. A mediation server connected to the selection requester terminal, one or more first trader terminals, one or more second trader terminals via the Internet, and one or more first traders. A recording medium storing a program for controlling at least one of the second or third vendors to be selected, receiving request information from the selection requester terminal, and Sent to one trader terminal, receives one or more first answers from one or more first trader terminals, and selects from the one or more first answers according to each second trader terminal Based on the first decision reply made and the request information from the selection requester terminal, second request data is created for each second trader, and the second request data is stored in the second trader terminal. Transmitted from one or more second trader terminals to one or more Receiving second answer, and the one or more second reply, said first
Recording medium for recording a program for controlling the selection of a first trader and a second trader based on the answer to the decision of (1).