Patent Application
20210319381
This application claims priority pursuant to 35 U.S.C. § 119 from Japanese Patent Application No. 2020-071857, filed on Apr. 13, 2020, the entire disclosure of which is incorporated herein by reference.
The present invention relates to a schedule mediation system and a schedule mediation method.
Discontinuance of business of shops is increasing with the growing number of users of Internet-order sales, and decrease in both the number of shops and the number of buyers at the shops under the effect of decrease in the birthrate. In such an environment, in recent years, the number of mobile shops utilizing movable bodies as shops is increasing.
For example, according to the service shown in The Internet <URL: https://www.mellow.jp/>[retrieved on Dec. 17, 2019], a mobile shop vehicle and an operating space for the mobile shop vehicle are provided to a shopkeeper of the mobile shop. Moreover, to the provider of the operating space, advertisement of the above operating space and a support for managing the place are given. Thus, an owner of the mobile shop can run the business at the shop while suppressing a commencement-of-business cost and personnel expenses, and open the shop in a popular area.
Moreover, according to the service shown in the Internet <URL: https://shop.aeon.com/netsuper/01050000060590/>[retrieved on Dec. 17, 2019], the same day delivery service at the existing supermarket is provided. This service enables the same-day delivery of perishable foods, such as rice and vegetables, besides the miscellaneous daily necessities, underwear, and electric appliances.
Further, a mobile shop system proposed in Japanese Unexamined Patent Application Publication No. 2019-139371 includes; a plurality of mobile shop vehicles and a server device. The server device has: a request acquiring means which acquires a visit request to the mobile shop vehicles from a user using the mobile shop system and which acquires, as the visit request, a shop of choice that the user wishes to visit among shops the mobile shop vehicles have; a positional information acquiring means which acquires positional information about the mobile shop vehicles and the user; an operation schedule creating means which creates operation schedule of the mobile shop vehicles based on the visit request acquired by the visit request acquiring means and the positional information acquired by the positional information acquiring means and which creates the operation schedule such that the user and the mobile shop vehicle equipped with the shop of choice can get together at a predetermined place; and a sending means which sends the operation schedule created by the operation schedule creating means to the mobile shop vehicles. Furthermore, each of the mobile shop vehicles has: a receiving means for receiving the operation schedule sent by the sending means; and an operation managing means which manages the operation of vehicles based on the operation schedule.
The patent publication described above discloses a technique, when many mobile sales vehicles gather at a large parking lot of a shopping mall, for dynamically allowing mobile sales vehicles to be automatically arranged in consideration of the purchase line of flow of the users using the mobile shops.
In the conventional technology described above, the shop hours and operating location of a mobile shop become restrictive, and there is a problem that the matching with a management person and a user of a mobile shop is difficult. Moreover, since the shop hours and the location are governed by the host system, there is also a problem that methods of doing business (example: at which location and when the mobile shop is opened) are uncontrollable for the management person of the mobile shop.
Moreover, although the base in which large allocation-of-vehicle space where mobile shop vehicles can park and operate, and people who become the customers gather will be requisite for the service, such an area is limited to specific facilities.
Moreover, the number of bases to which a mobile shop vehicle can move in a day is one place in principle, and the mobile shop cannot offer services at many locations. Furthermore, if a movement area and time are not mediated precisely in advance, there is also a possibility that what is called “a dispute over territory” may occur.
On the other hand, on the customers' side using the mobile shop vehicle, it is important whether or not a mobile shop vehicle comes to a convenient area and a date and time, and desired merchandise are in stock in the mobile shop.
However, in the conventional technology, mediation of schedules of mobile shop vehicles and meeting these customers' needs are not available. Therefore, for a certain customer, while his/her demand has hardly be fulfilled about a visit etc. of a mobile shop vehicle, only dissatisfaction grows every day, and there have been enough possibilities of coming to cancel the service concerned.
In view of the above, an object of the present invention is to provide a technology which can efficiently adjust profits of respective stakeholders related to business by mobile shop vehicles and preferable schedules for the mobile shops can be created.
A schedule mediation system of the present invention solving the above problems includes an in-vehicle server of a mobile sales vehicle having a storage unit configured to hold at least inventory information showing a merchandise stock on board, and an arithmetic unit configured to execute processing of receiving, from a user terminal of a customer, request information containing various information about merchandise and purchase conditions for which a customer asks, checking the inventory of the merchandise based on the inventory information and, based on a purchase place and a purchase date and time shown by the purchase conditions, creating an initial schedule for a mobile sales, processing of sending a mediation request including the initial schedule to a schedule mediation server and receiving, from the server, an after-correction schedule corrected according to a result of mediation between mediation requests in the server, processing of judging acceptance/rejection by a predetermined rule with respect to the after-correction schedule and giving a result of judgment to the server, and processing of correcting the request information according to the after-correction schedule accepted in the judgment and sending the corrected request information to the user terminal. The schedule mediation system of the present invention also includes a schedule mediation server having a storage unit configured to hold the mediation request received from the in-vehicle server of each mobile sales vehicle, and an arithmetic unit configured to execute, between the initial schedules shown by the held mediation request, in response to the competing situation concerning a purchase place and the purchase date and time, processing of mediation to settle the competing situation between the initial schedules and correcting the initial schedule based on a result of the meditation, processing of sending an after-correction schedule acquired in the correction to the in-vehicle server, and processing of receiving a judgment result of acceptance/rejection in the in-vehicle server with respect to the after-correction schedule from the in-vehicle server and, when the judgment result is a rejection, acquiring a newly corrected schedule by another correction to settle the competing situation and re-proposing the new after-correction schedule to the in-vehicle server. Also, according to a schedule mediation method of the present invention, an in-vehicle server of a mobile sales vehicle holds at least inventory information showing merchandise stock on board. Further, in the schedule mediation method of the present invention, the in-vehicle server of the mobile sales vehicle executes processing of receiving, from a user terminal of a customer, request information containing various information about merchandise and purchase conditions for which a customer asks, checking the inventory of the merchandise based on the inventory information and, based on purchase place and a purchase date and time shown by the purchase conditions, creating an initial schedule for a mobile sale, processing of sending a mediation request including the initial schedule to a schedule mediation server and receiving, from the server, an after-correction schedule corrected according to a result of mediation between mediation requests in the server, processing of judging acceptance/rejection according to a predetermined rule with respect to the after-correction schedule and giving a result of the judgment to the server, and processing of correcting the request information according to the after-correction schedule accepted in the judgment and sending the corrected request information to the user terminal. Still further, in the schedule mediation method of the present invention, the schedule mediation server holds the mediation request received from an in-vehicle server of each mobile sales vehicle, and executes processing of mediation to settle a competing situation between initial schedules indicated by the held mediation request according to the competing situation with respect to the purchase place and the purchase date and time, and correcting the initial schedule based on a result of the mediation, processing of sending an after-correction schedule acquired in the correction to the in-vehicle server, and processing of receiving, from the in-vehicle server, a judgment result concerning acceptance/rejection to the after-correction schedule in the in-vehicle server and, when the judgment result is a rejection, acquiring a new after-correction schedule from another correction for settling the competing situation and re-proposing the new after-correction schedule to the in-vehicle server.
According to the present invention, with respect to business by mobile shop vehicle, profits of a provider of an operating place, a shop owner, and customers can be efficiently adjusted and preferable schedules for the mobile shop can be created.
With reference to the drawings, embodiments of the present invention will be explained in detail below.
In the schedule mediation system 100 of the present embodiment, a ground server 1, an in-vehicle server 2, and a user terminal 4 are communicably connected through an appropriate network 5.
In addition, the in-vehicle server 2 is carried in each of a plurality of mobile sales vehicles 3. Therefore, an example is shown where mobile sales vehicles 3-1 and 3-2 exist as mobile sales vehicles 3, and in-vehicle servers 2-1 and 2-2 exist as the in-vehicle servers 2. However, such number is only an example and not limitative. Similarly, user terminals 4-1 and 4-2 also exist as the user terminals 4.
Moreover, types of the network 5 is not limited and it may be a cellular-phone carrier network, the Internet, a wireless LAN, a cable LAN, etc.
The above in-vehicle server 2 holds its own KPI (Key Performance Indicator: important performance evaluation indicator). This is called a “shop KPI” in the present embodiment. It is an object of the schedule mediation system 100 of the present embodiment to perform schedule mediation to achieve or maximize the shop KPI. Examples include the shop KPI, the number of shop visitors a day, sales amount a day, sales per unit time, etc.
The ground server 1 performs mediation of mobile shop sales schedules of the in-vehicle server 2. In addition, KPI exists also in the ground server 1 and, this is called a “whole KPI” in the present embodiment. It is an object of the ground server 1 to achieve or maximize the whole KPI. Examples of Whole KPI are the sum of business hours a day of the mobile sales vehicle carrying the in-vehicle server 2 and a moving distance, etc.
Thus, one object of the schedule mediation system 100 according to the present embodiment is to maximize the above whole KPI and, at the same time, to maximize the shop KPI of the in-vehicle server 2. Therefore, mediation messages shall be exchanged between the ground server 1 and the in-vehicle server 2, as well as between the in-vehicle server 2 and the user terminal 4. Hereafter, the exchange of the mediation messages is called “mediation.”
Further, a hardware configuration of devices included in the schedule mediation system 100 of the present embodiment will be explained.
In this case, the computer includes a CPU 101 (arithmetic unit), a memory 102 (storage unit), communication NIC 103 (communication unit), a hard disk drive (hereafter, called “HDD”) 104 (storage unit), the input controller 105, and a monitor controller 106 being connected through a bus 107 etc.
Among these, CPU 101 is an arithmetic unit which reads a program held in the HDD 104 into the memory 102 etc., executes it, and performs a general control of the unit itself. At the same time, it performs various judgments, calculation, and control processing.
Moreover, the memory 102 includes volatile memory elements, such as a RAM.
Further, the communication NIC 103 is a network interface card which connects with a network 5 and performs a communication processing with other units.
Still further, the HDD 104 is a storage means which includes a nonvolatile storage elements, and may be an SSD (Solid State Drive).
Still further, the input controller 105 is connected with input units, such as a keyboard and a mouse, and controls the user input of the data dealt in the computer.
Still further, the monitor controller 106 is connected with display units, such as a display, and the monitor controller 106 controls the output of the data dealt in the computer.
In addition to the program providing a function required for a device included in the schedule mediation system 100 of the present embodiment, at lease a data set for processing (see
Therefore, the customer 12-11 concerned manipulates the user terminal 4 and, with respect to desired conditions such as the above operating place and the date and time, requests as above to the in-vehicle server 2 of the mobile shop vehicle.
On the other hand, there may be a case where accepting the request of the above customer 12-11 may not be profitable for the mobile sales vehicle 3's operator. For example, there is a case where enough number of customers cannot be expected at position 12-2. Also, when position 12-2 is far from the base, excessive transit time and increased fuel charge are required. Moreover, the mobile sales vehicle 3 may compete with another mobile sales vehicle 3 with respect to the operating date and time (for a customer, a purchase date and time) and an operating place.
On the other hand, for the mobile sales vehicle 3 in this case, not the position 12-2 but the position 12-3 or position 12-4 may be more profitable for its business.
However, if the request from the customers 12-11 are continuously rejected, there is possibility that the customers 12-11 may stop using the mobile sales vehicles 3.
In view of the above, an object of the schedule mediation system 100 of the present embodiment is to preferably maintain the use of the mobile sales vehicle by the customer and business of the mobile sales vehicle by performing well-balanced mediation between requests of the respective customers and business restrictions etc. of the mobile sales vehicle 3.
The application field of
In addition, the mobile sales vehicle 3 shall park and operate only in these operating places. Moreover, in the operating places A1-A5, a maximum of two sets of mobile sales vehicles 3 can conduct business at the same time of the same day, and only one mobile sales vehicle 3 can conduct business at the same time of the same day at spots B1-B29.
According to the present embodiment, in order to facilitate the understanding of the mode for carrying out the invention, the example shows two mobile sales vehicles 3 carrying the in-vehicle servers 2. Moreover, the operating time is shown as seven hours from 13:00 to 20:00. Moreover, according to the present embodiment, a unit for performing the mediation is one day. However, actually, schedule mediation of a longer period (one month, six months) may be performed.
When performing such schedule mediation, it is desirable to perform schedule mediation which does not largely deviate from a schedule that the in-vehicle server 2 proposes at first (hereafter, called an “initial schedule”).
It is because an entrepreneur providing the mobile shop sales service or an operator of the mobile sales vehicles 3 makes a schedule to maximize the shop KPI from the beginning. The initial schedule reflects the date and time as well as an operating place convenient for the customer who does shopping at the mobile sales vehicle 3, a warehouse for storing the inventory merchandise of the mobile sales vehicle 3, and the operating place and a date and time for conducting business, etc. Therefore, when a schedule is mediated to be the one considerably deviated from the above, it may largely affect the sales profits and expenses on the side of the operator of the mobile sales vehicle 3.
It is because the quantity and freshness of the merchandise that can be loaded into the mobile sales vehicle 3 relate to the needs and degree of satisfaction of the customer, which affects the profit and expenses of the mobile sales vehicle 3.
According to the present embodiment, the initial schedule created in the in-vehicle server 2 is grasped as a “shop KPI.” Also, a “state where the maximization of the shop KPI is achieved” is a state where the schedule mediation in the ground server 1 is completed without changing the initial schedule at all.
In the initial schedules of the two or more mobile sales vehicles 3, when respective operating places and the time of day overlap, one of the operations at the operating places or time of the day in the mobile sales vehicles 3 has to be given up. In such a case, naturally, this means that an operator of each mobile sales vehicle has been unable to attain maximization of the shop KPI.
On the other hand, a “state where the whole KPI is maximized” in the ground server 1 is a state where, with respect to the number of initial schedules proposed from all the in-vehicle servers, mobile shop sales schedules adopted by schedule mediation are all adopted.
Therefore, an object of the present schedule mediation system 100 is to solve two problems of maximizing the KPI of the ground server 1 and, at the same time, maximizing the shop KPI of the in-vehicle server 2.
Hereafter, with reference to the drawings, steps of carrying out the schedule mediation method according to the present embodiment will be explained. Various operations corresponding to the schedule mediation method explained below are realized by a program which various units etc. included in the schedule mediation system 100 read to a memory etc., to be executed. Also, the program includes codes for performing various kinds of operations explained below.
The above information is inputted, through a keyboard, a mouse, etc., by a customer who manipulates the user terminal 4 (refer to a screen 600 of
In addition, the processing of s1 may be performed before the operation of the mobile sales vehicle 3 or during the operation.
Next, the in-vehicle server 2 receives request information from the above user terminal 4. Based on the request information, considering the quantity of merchandise that the mobile sales vehicle can load and a value of discontent of the above customer (referred to as a “user point”), the in-vehicle server 2 creates an initial schedule (s2) and sends it to the ground server 1 within a predetermined time period as a mediation request (s3). The initial schedule created as above may be called a “mobile shop sales schedule” including a sequence of a plurality of operating places and operating time at the operating places.
According to the present embodiment, for the sake of simplicity, the value of the above user point indicates the number of times of the rejection of the initial schedule (specifying operating place, date and time, and merchandise which can be provided) proposed by the in-vehicle server 2 to the request information from the user terminal 4.
The value of the user point is treated as a numerical value indicating the degree of dissatisfaction of the customer to the mobile shop sale. However, when the initial schedule is accepted even once, the degree of discontent shall be reset to zero. Further, the ground server 1 may manages the value of the degree of dissatisfaction for each customer or for each operator of the mobile sales vehicle 3 in the storage unit. Alternatively, each of the user terminals 4 or the in-vehicle server 2 may manage the information concerned. Therefore, when utilizing the value of the degree of dissatisfaction, the in-vehicle server 2 or the ground server 1 being the use subject shall refer to it from a unit performing the above management.
In addition, the user point indicating degree of dissatisfaction can be shown as numerical for walking time exceeding the time that that customer planned for reaching the operating place, a deviation time from the operating time which the customer planned at the beginning, and merchandise inventory/shortage in quantity/frequency that the customer planned initially.
Subsequently, the ground server 1 receives a mediation request from the in-vehicle server 2. When initial schedules compete among the mobile sales vehicles 3, that is, with respect to the parking location, i.e., the operating place in an operational field, when the mediation requests from the mobile sales vehicles 3 exceeding the upper limit number of stoppable vehicles overlap in the same time zone, in order to settle the competing situation, the ground server 1 performs mediation of the initial schedules so that the operations of the mobile shop sales in the operation place during the same time zone do not overlap, creates a mobile shop sales schedule (after-correction schedule) (s4), and proposes it to the in-vehicle server 2 (s5).
As a specific example, the ground server 1 gives priority to the mediation request with more shop points which the in-vehicle server 2 owns, and re-proposes the substitute mobile shop sales schedule to the mediation request with fewer shop points. The in-vehicle server 2 which received the substitute re-proposal from the ground server 1 may accept the proposal, or may propose another initial schedule again.
Incidentally, a shop point is value in which 1 point is added when the mediation request of the mobile sales vehicle 3 concerned loses the competing mediation with other mobile sales vehicles 3 in the ground server 1 and the correction proposal of the initial schedule is done. However, it is reset by zero when the competing mediation is won at least once (i.e., when the initial schedule passes as requested).
When all the in-vehicle servers 2 consented to the above re-proposal, mediation of the initial schedule is completed. The shop point of the in-vehicle server 2 which won the competition is reset by zero, and one point is added to the shop points of the in-vehicle server 2 lost in the competition.
The above shop point is dealt as a numerical value which indicates the dissatisfaction degree of the in-vehicle server 2 of the mobile sales vehicle 3 to the ground server 1. The shop point can also be used as a numerical value indicating time for a shop to exceed the business hours being planned at the beginning, the time of the gap from the operating time of day which the shop planned at the beginning, and the distance of gap from the operating place which the customer expected at the beginning.
Next, based on the mobile shop sales schedule agreed according to a proposal/re-proposal of the ground server 1, the in-vehicle server 2 corrects the initial request information of the user terminal 4 (s6), and distributes and proposes this to the user terminal 4 (s7).
On the other hand, with the user terminal 4, the customer can check the above proposal, and can accept/refuse it.
When the rejection sent from the user terminal 4 to an above proposal as described, the in-vehicle server 2 records the number of times of the rejection as a user point. The in-vehicle server 2 can treat the customer with a large value of this user point preferentially by the processing on and after next time.
Hereafter, together with description of the function of each unit, the details of the schedule mediation method will be explained.
These programs are deployed in the memory 102 of
First, in the initial request input unit 411 of the operation processing part 41, a customer specifies the in-vehicle server 2 (of the mobile sales vehicle 3 nearby or out of the list items held beforehand). Then, with respect to the mobile sales vehicle 3 carrying the in-vehicle server 2, the customer inputs the desired operating place and the date and time for the vehicle concerned to come, and merchandise to purchase (
The information inputted here is transmitted to the in-vehicle server 2 through a mediation message sending part 423 of the communication processing part 42.
Moreover, the mediation message sent from the in-vehicle server 2 (example: at the result of mediation in the ground server 1, the message notifying the necessary correction contents of the initial schedule, or the message notifying that the initial schedule has been accepted as it is) is received by the mediation message receiving part 421 of the communication processing part 42 and, then, transmitted to the message judgment part 422.
According to the contents, the message judgment part 422 transmits the mediation message concerned to a mediation contents display part 412, a mediation contents acceptance/rejection part 413, and an adjacency notification part 414 of the operation processing part 41.
On the mediation contents display part 412, with respect to the initial schedule corresponding to the request information of the customer, a mediation message being a correction proposal from the in-vehicle server 2 is shown. However, the message may not be a correction proposal but the one indicating that there is no correction (when the mediation competition is won).
Concerning the above correction proposal, the customer manipulates the mediation contents acceptance/rejection part 413, and shows the acceptance/rejection (
Moreover, the adjacency notification part 414 acquires the positional information of the mobile sales vehicle 3 from the mobile sales vehicle 3 and compares it with the own positional information, and judges whether the mobile sales vehicle 3 carrying the in-vehicle server 2 is within a predetermined distance from the present user terminal 4. When it is judged that the mobile sales vehicle is within the distance, the adjacency notification part 414 notifies the adjacency information. This notification may be done in a popup etc. on the display screen of the user terminal 4.
In addition, the mobile sales vehicle 3 detecting the adjacency is the one which issues the mediation message received by the user terminal 4, and is the mobile sales vehicle 3 which corresponds to the mediation case accepted by the customer.
Moreover, with respect to the above accepted mediation case, in the distance the user terminal 4 is judged to be close to the in-vehicle server 2, the claim input part 415 receives a claim message concerning the mobile sales vehicle 3 from the customer and sends it to the in-vehicle server 2. The claim message is a message relating to dissatisfaction which the customer concerned holds about the mobile sales vehicle 3.
Moreover, with respect to the accepted mediation case, in the distance that the user terminal 4 judges to be close to the in-vehicle server 2, a shop merchandise search part 416 searches the merchandise loaded in the mobile sales vehicle 3 of the in-vehicle server 2. The target to be searched is inventory information (inventory information 26 in
Moreover, after the acceptance of the mediation, the positional information acquiring part 431 of the positional information processing part 43 acquires own positional information with a proper positional information acquiring means, such as a GPS (Global Positioning System) unit which the user terminal 4 has, and keeps transmitting it to the in-vehicle server 2.
These programs are deployed in the memory 102 of
The positional information acquiring part 251 of the positional information processing part 25 acquires the positional information of its own with a proper positional information acquiring means, such as a GPS (Global Positioning System) unit, and continues transmitting this to the ground server 1.
Moreover, the initial schedule creating part 211 of the schedule creating part 21 creates an initial schedule. The creation of the initial schedule may be any of the cases where the operator who uses the display of
Here,
Moreover,
Clusters C-3 and C-5 are moved to reduce user points as a whole because the sum of the user points of the users included in the clusters C-3 and C-5 is smaller than the sum of the user points included in other clusters, and because it is judged that a transit time can be fully secured in the case of the initial schedule.
Now, returning to an illustration of
Moreover,
These programs are deployed in the memory 102 of
The mediation message (proposed mediation message) of the initial schedule created in the in-vehicle server 2 is received through a network 5 in the mediation message receiving part 121 of the communication processing part 12 of the ground server 1.
Further, the mediation message is transmitted to the mediation message confirming part 132 of the online processing part 13, and its style is checked, such as a format and, when there is a defect in the format, it is corrected according to a predetermined rule.
The mediation message is further sent to a deficit information estimating part 131. When there is no deficit information, it is again returned to the mediation message confirming part 132 as it is. The deficit information means a mediation message without a specification of a date and time, for example, although there is a specification of an operating place. In such a case, the deficit information estimating part 131 specifies time at which there is no competing situation with other schedules, appoints the time concerned, and compensates the deficit information.
When the mediation messages of the initial schedules from the in-vehicle server 2-1 and the in-vehicle server 2-2 are ready, the mediation message confirming part 132 of the online processing part 13 transmits them to the mismatching judgment part 133. The mismatching judgment part 133 checks whether or not there is a conflict (hereafter, called a “competing situation”) of the initial schedules.
Returning to the explanation of
According to the mobile shop sales schedule creation policy of the mobile shop sales schedule creation policy input part 111 of the operation processing part 11, the mismatching judgment part 133 in the online processing part 13 of the ground server 1 creates a new mobile shop sales schedule which avoids a schedule conflict, and gives it to the whole KPI arithmetic part 134.
The whole KPI arithmetic part 134 creates a newer mobile shop sales schedule on the basis of the new mobile shop sales schedule.
When a conflict occurs in a mobile shop sales schedule, the whole KPI arithmetic part 134 returns the mobile shop sales schedule to the mismatching judgment part 133. While the mismatching judgment part 133 and the whole KPI arithmetic part 134 repeat the above processing, they function to complete the mobile shop sales schedule.
The counter-proposal message 2000 is sent to the mediation message receiving part 221 of the communication processing part 22 of
In addition, a mediation information recording part 243 of the offline processing part 24 records a mediation message received in the mediation message receiving part 221 of the communication processing part 22 of
The mediation message from the ground server 1 is received in the mediation message receiving part 221 in the communication processing part 22 of the in-vehicle server 2 of
Further, the mediation message received in the mediation message receiving part 221 of the communication processing part 22 of
Moreover, the past history information part 244 of the offline processing part 24 and the reference mediation message recording part 241 are referred to from the practicability estimating part 236 of the online processing part 23, and are used as reference information when creating a mediation message.
Next,
The ground server 1 can hold data 21-01, data 21-02, data 21-03, data 21-04, data 21-05, data 21-06, data 21-07, data 21-08, data 21-09, data 21-10, and data 21-12.
Of the data described above, data 21-01 is the data related to an administrator of the ground server 1.
Moreover, data 21-02 is the data related to an operating place under the control of the ground server 1, namely, data related to a parking position of a mobile sales vehicle 3.
Moreover, data 21-03 is the data related to the mobile sales vehicle 3 under the control of the ground server 1.
Moreover, data 21-04 is the data related to the operating places which are currently available.
Moreover, data 21-05 is the data related to the sales schedule of the mobile sales vehicle 3.
Moreover, data 21-06 is the data related to the sales history of the mobile sales vehicle 3.
Moreover, data 21-07 is the data related to the sales status of the mobile sales vehicle 3.
Moreover, data 21-08 is the data related to a supply/shipment status of the mobile sales vehicle 3.
Moreover, data 21-09 is the data related to a history of a supply/shipment status of a mobile sales vehicle.
Moreover, data 21-10 is the data related to the operating places of the mobile sales vehicle 3.
Moreover, data 21-11 is the data related to the positional information on a map.
On the other hand, the in-vehicle server 2 holds the data 21-11 about customers. Moreover, the in-vehicle server 2 can hold data 21-04 of operating places which is related to a mobile sales vehicle 3 carrying the in-vehicle server 2 itself and which is in a currently available state, data 21-05 about a sales schedule of the mobile sales vehicle 3 concerned, the data 21-07 of the sales history of the mobile sales vehicle 3, data 21-06 of the operating standing of the mobile sales vehicle 3, data 21-08 of a supply/shipment status of the mobile sales vehicle 3, data 21-09 of the history of a supply/shipment status of the mobile sales vehicle 3, and data 21-10 of the operating position of the mobile sales vehicle 3.
In addition, data from data 21-13 to data 21-18 are the ones which manage the positional information of the place a high-order server controls. An example of data of an open street map (URL: https://www.openstreetmap.org/[online], retrieved on Dec. 17, 2019 retrieve]) is shown here.
The title of the data base corresponds to a description on its website (URL: https://wiki.openstreetmap.org/wiki/Elements [online], retrieved on Dec. 17, 2019).
Although the best mode etc. for carrying out the present invention has been specifically described as above, the present invention is not limited to this but can be variously modified within the scope not deviating from the spirit thereof.
According to the present embodiment described above, profits of respective stakeholders related to business by the mobile shop vehicles can be adjusted efficiently and to create preferable schedules for mobile shops can be created.
The followings are clarified at least by description of this written description. That is, the schedule mediation system may further include a user terminal having a communication unit and an arithmetic unit. The communication unit performs communication with the in-vehicle server. The arithmetic unit performs, with respect to the mobile sales, processing to acquire information about the merchandise for which the customer asks and purchase condition through the input unit, and sends request information including the merchandise and purchase conditions to the in-vehicle server through the communication unit, processing to receive the corrected request information from the in-vehicle server as a counter-proposal and display the counter-proposal on an output unit, and processing to accept the customer's intention of acceptance/rejection to the counter-proposal with the input unit and give the acceptance/rejection information to the in-vehicle server.
According to this, also about the customer of the mobile sales vehicle who is a stakeholder, his or her intention is respected more and it becomes possible to make it reflected in schedule mediation. Further, profits of respective stakeholders related to business by the mobile shop vehicles can be efficiently adjusted and more preferable schedules for mobile shops can be created.
Moreover, in the schedule mediation system of the present embodiment, the schedule mediation server may be the one which manages, with respect to each stakeholder who is one of an operator of the mobile sales vehicle, the customer, and a person who provides an operating place to the mobile sales vehicle, dissatisfaction information collected from the stakeholders in a series of processing accompanying the request information and, in correcting the initial schedule, judges the dissatisfaction value by performing numerical conversion of the dissatisfaction information with a predetermined rule. The schedule mediation server further performs, under the restriction where the dissatisfaction value of the stakeholder stays within a particular range during a predetermined period, correction of the initial schedule and creates the after-correction schedule.
Accordingly, not only acceptance or rejection of a proposed schedule determines the adoption or rejection of the proposal, by directivity to consider dissatisfied feelings accumulated in the person concerned with the background of the acceptance and rejection, schedule correction and the proposal become possible. Further, profits of respective stakeholders related to business by the mobile shop vehicles can be adjusted efficiently and more preferable schedules for mobile shops can be created.
Moreover, in the schedule mediation system of the present embodiment, the in-vehicle server may be the one which refers to, when creating the initial schedule, the dissatisfaction information of each customer from the schedule mediation server and, under the restriction where the customer having more number of times of rejection to the counter-proposal shown by the dissatisfaction information tends to accept the request information, and creates the initial schedule, and the schedule mediation server refers to, when correcting the initial schedule, the dissatisfaction information of the operator of each mobile sales vehicle from the storage unit and, under the restriction where an operator having more number of times of rejection to the corrected schedule shown by the dissatisfaction information tends to accept the initial schedule, performs correction of the initial schedule.
Accordingly, not only acceptance or rejection of the schedule proposal determines the adoption or rejection of the proposal, by directivity to consider dissatisfied feelings accumulated in the customers or the operators of the mobile sales vehicles with the background of the acceptance and rejection and to solve it, schedule correction and the proposal become possible. Further, profits of respective stakeholders related to business by mobile shop vehicles can be adjusted efficiently, and more preferable schedules for mobile shops can be created.
Moreover, in the schedule mediation system of the present embodiment, the in-vehicle server may be the one which performs, when creating the initial schedule, based on a purchase place and purchase date and time for which each of the customers asks indicated by the request information of each of the customers, clustering the request information, calculating the total value of the number of times of rejections by the customers included in each cluster, and creates the initial schedule under the restriction of accepting the request information according to the size of the total value.
As a result, according to the dissatisfaction size of the customer who desires to purchase in the area concerned, the significance of the cluster concerned, namely, the priority level of schedule control can be controlled. Further, profits of respective stakeholders related to business by a mobile shop vehicle can be adjusted efficiently, and more preferable schedules for the mobile shops can be created.
Moreover, in the schedule mediation system of the present embodiment, the in-vehicle server may be the one which creates, when creating the initial schedule, the initial schedule under the restriction where an operating place of the mobile sales vehicle carrying the in-vehicle server belongs to the purchase place and the purchase date and time included in the cluster, and the mobile sales vehicle performs business while moving between the clusters within a predetermined time period.
As a result, for example, it becomes possible to properly create a schedule which includes operating places that the mobile vehicle can visit in a day (time-wise and cost-wise). Further, profits of respective stakeholders related to business by mobile shop vehicles can be adjusted efficiently, and more preferable schedules for the mobile shops can be created.
| Number | Date | Country | Kind |
|---|---|---|---|
| 2020-071857 | Apr 2020 | JP | national |
