KR101878716B1

KR101878716B1 - Apparatus for selling product based on base stores, method thereof, and computer recordable medium storing the method

Info

Publication number: KR101878716B1
Application number: KR1020150084995A
Authority: KR
Inventors: 장영재; 성신웅
Original assignee: 코오롱인더스트리 주식회사; 한국과학기술원
Priority date: 2015-06-16
Filing date: 2015-06-16
Publication date: 2018-07-16
Also published as: KR20160148253A

Abstract

The present invention relates to a device for selling merchandise based on a storefront, a method for the same, and a computer-readable recording medium on which the method is recorded. The present invention relates to a prepackaging system comprising a preprocessing module for selecting a commodity from among a plurality of commodities, a minimum number of commodities to be included in the coverage that can deliver commodities within a predetermined maximum waiting time (T) And a base station selection module for selecting a base store of the base station, and a method for the same, and a computer readable recording medium on which the method is recorded. The present invention can efficiently select a base store where a general store can supply a corresponding product within a predetermined time to the demand for an unpaid product. Here, the predetermined time means a time limit that the customer can understand. In particular, the present invention can significantly reduce opportunity loss by supplying the merchandise from the store to the general store within a predetermined time.

Description

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a device for selling merchandise based on a store, a method for the same, and a computer-readable storage medium storing the method,

More particularly, the present invention relates to a merchandise selling technology, and more particularly, to a store where a general store can supply a merchandise not yet sold by a general store within a time period that the customer can wait, A method for the same, and a computer-readable recording medium on which the method is recorded.

In the fashion industry, the life cycle of fashion trends is gradually shortened, beginning with SPA (Specialty store retailer of Private label Apparel) like ZARA. The distribution innovation that grasps customer needs and provides products to the market promptly It is rising. In order to innovate this distribution, a strategy is needed to identify customers' needs through various data and apply algorithms to make quick and sophisticated decision making so that customers can quickly obtain products and sell them when they want. The distribution of logistics in the fashion industry is an important factor for the timely supply of the goods desired by the customers. However, the fashion industry is more difficult to predict in advance, especially in the case of special sized items such as very large (eg, XXL) or very small (eg, XXS) sizes, It is difficult to distribute logistics. Companies often distribute special size merchandise to stores with high sales ranks. There are regional deviations of stores receiving special sizes, because only those stores with high sales rank have special sizes. In such a case, there is a problem that there is no special size store in the area where only the stores with middle sales rank are crowded, and the opportunity loss is caused because the customer can not obtain the special size even when the customer is on time.

Japanese Patent Laid-Open Publication No. 1998-087036 Published Apr. 07, 1998 (Name: Inventory preparation method in logistics system, method of determining delivery form and inventory position)

An object of the present invention is to provide a device for selecting a base store capable of supplying an urgently generated demand for a product that is not possessed by a general store within a predetermined time, And a computer readable recording medium having recorded thereon.

According to another aspect of the present invention, there is provided an apparatus for selling a product based on a storefront, comprising: a preprocessing module for selecting one of a plurality of products; And a base selection module that selects a minimum number of base stores that can include the merchandise within the coverage that can be delivered within a predetermined maximum waiting time (T).

The base point selection module selects a base point store using the following equation,

I is a general store, j is a base store, P is a minimum number of stores, T is a maximum waiting time,

Is 1 if the store j is a store of bases, or 0 otherwise,

Is a set of stores that can be delivered within T hours to a general store i.

The base point selection module selects a store that satisfies the minimum number and can satisfy the largest demand within a predetermined maximum delivery time S as a base point store.

remind

Is the product demand at the store i,

Is 1 if the store j is a store of bases, or 0 otherwise,

Is 1 if there is a general store within the time S from the base store i, 0 if there is no store,

Is a set of stores that can be delivered within S hours to a general store i,

Is a set of stores that can deliver within T hours to a general store i, S is a maximum delivery time, and T is a maximum wait time.

remind

Is expressed by the following equation

, &Lt; / RTI >

Is a weight,

.

The apparatus for selling merchandise according to an embodiment of the present invention receives a point-to-point movement request message from a first store terminal of a general store of any one of the plurality of stores from a first store terminal of a first store, And a second store, which is a base store for storing the first store in the sphere according to the point-to-point move request, so that the goods are delivered from the second store to the first store And a sales processing module for transmitting the delivery information to the delivery company server through the interface module.

And the delivery information includes an address of the first store, an address of the base store, and information on a delivery commodity.

According to another aspect of the present invention, there is provided a method for selling a merchandise on a basis of a store, comprising: selecting one of a plurality of merchandise; To a predetermined maximum waiting time (T) within the coverage that can deliver the goods.

In the step of selecting the base store, a base store is selected using the following equation,

Is 1 if the store j is a store of bases, or 0 otherwise,

Is a set of stores that can be delivered within T hours to a general store i.

The step of selecting the base stores is characterized by selecting a store as a base store that satisfies the minimum number and can satisfy the largest demand within a predetermined maximum delivery time (S).

remind

Is the product demand at the store i,

Is 1 if the store j is a store of bases, or 0 otherwise,

Is 1 if there is a general store at a distance that can be reached within a time S from the base store i, 0 if there is no store,

Is a set of stores that can be delivered within S hours to a general store i,

remind

Is expressed by the following equation

, &Lt; / RTI >

Is a weight,

.

A method for selling a commodity according to an embodiment of the present invention includes receiving a point-to-point move request message from a first store terminal of a general store of any one of the plurality of stores from a first store terminal of a first store, Selecting a second store that is a base store for storing the first store in the region in the base store according to the point-to-point movement request; and transmitting the goods from the second store to the first store And transmitting the delivery information to the shipping company server through the interface module.

According to another aspect of the present invention, there is provided a computer-readable recording medium having recorded thereon a method for selling a merchandise based on the above-mentioned store of base stores.

As described above, according to the present invention, it is possible to efficiently select a base store where a general store can supply a corresponding product within a predetermined time to a demand for an unpaid product. Here, the predetermined time means a time limit that the customer can understand. In particular, the present invention can significantly reduce opportunity loss by supplying the merchandise from the store to the general store within a predetermined time.

1 to 6 are views for explaining a concept for explaining a sales method using a base store according to an embodiment of the present invention.
7 is a diagram for explaining a configuration of a goods selling system according to an embodiment of the present invention.
8 is a block diagram illustrating a configuration of a management server according to an embodiment of the present invention.
9 is a flowchart illustrating a method for selecting a base store of a management server according to an embodiment of the present invention.
FIG. 10 is a flowchart illustrating a method for selling a merchandise based on a storefront store according to an embodiment of the present invention.

Prior to the detailed description of the present invention, the terms or words used in the present specification and claims should not be construed as limited to ordinary or preliminary meaning, and the inventor may designate his own invention in the best way It should be construed in accordance with the technical idea of the present invention based on the principle that it can be appropriately defined as a concept of a term to describe it. Therefore, the embodiments described in the present specification and the configurations shown in the drawings are merely the most preferred embodiments of the present invention, and are not intended to represent all of the technical ideas of the present invention. Therefore, various equivalents It should be understood that water and variations may be present.

Hereinafter, preferred embodiments of the present invention will be described in detail with reference to the accompanying drawings. Note that, in the drawings, the same components are denoted by the same reference symbols as possible. Further, the detailed description of known functions and configurations that may obscure the gist of the present invention will be omitted. For the same reason, some of the elements in the accompanying drawings are exaggerated, omitted, or schematically shown, and the size of each element does not entirely reflect the actual size.

Special sizes of apparel (XXS, XXL, etc.) are not in high demand because of low demand. Therefore, special size merchandise is not distributed to all stores, and sales are distributed when considering relatively large stores or all merchandise. However, the demand for special-size products is not limited to large-sized stores. In other words, demand for special sizes often arises in smaller stores. Accordingly, the present invention provides a sales method in which, when there is a demand for a particular commodity that is not possessed by one of the stores, other stores having the commodity provide the commodity to sell the commodity. In the present invention, this sales method will be referred to as " point-to-point sales ". In the present invention, a store that does not have a specific product is called a 'general store', and a store that holds a specific product and provides the specific product to a general store is referred to as a 'base store'. The present invention firstly proposes a method for selecting an optimal base store among a plurality of stores. A base store according to an embodiment of the present invention will now be described. FIGS. 1 to 6 are views for explaining a base store according to an embodiment of the present invention.

1 to 6 show a base store according to an embodiment of the present invention and a general store receiving a specific product from the base store. As a criterion for selecting a base store, the present invention may consider the following items.

The present invention assumes a situation where there is no stock of a particular commodity in a general store. In order to make sales in such a situation, it is necessary to receive the goods from the base store and provide them to the customer within the time that the customer can wait in the general store. Therefore, the present invention basically considers the time that the customer can wait without complaint. In the present invention, the maximum time that such a customer can wait without complaint is referred to as a 'maximum waiting time (T)'. This maximum waiting time (T) can be calculated by gathering data based on statistical surveys, questionnaires, and actual experience of store sellers.

Next, since the maximum waiting time (T) may be different depending on the customer tendency, setting the maximum waiting time (T) as a time limit is a risk factor when the product is received from the base store in the general store. Therefore, further consideration can be given to delivering within an earlier time. In the present invention, this time is referred to as 'maximum delivery time (S)'. In this way, the maximum delivery time (S) to be determined politically must be considered, which can be determined politely through several pre-simulations depending on the distance between the store and the store. It is desirable that the maximum delivery time S is shorter than the maximum wait time T (maximum wait time T> maximum delivery time S) since the product must arrive before the customer gives up the purchase.

2 and FIG. 5 indicate that the corresponding time, that is, the maximum waiting time T or the maximum delivery time S, is required for delivery. That is, the range included in the radius of the reference symbol T is a range in which the maximum waiting time T is required for the delivery of goods, and the range within the radius of the reference symbol S is a range in which the maximum delivery time S to be. The maximum waiting time (T) or the maximum delivery time (S) is calculated not by simply considering the distance but by taking into consideration the terrain and the object, the road condition, the traffic situation, . The maximum waiting time T or the maximum delivery time S is represented by a radius in order to simplify the understanding of the present invention. Should not be understood as a simple distance and should be understood as the range of time taken to deliver the actual product.

In addition, the present invention contemplates meeting the most demand with a minimum base store. For this purpose, the demand forecast of each store for a specific product can be performed. To estimate the demand for a specific product for each store, a weighted average based on sales data of a specific product for each store and data on the number of times a particular product is requested to be sold between stores can be used. Accordingly, the demand of a specific commodity of each store can be obtained by using the following equation (1).

here,

Is a weight,

Lt; / RTI > Such

Is set differently according to the product.

As shown, the number of sales of specific products by each store was calculated, and the number of sales of point-to-point sales for each specific product was calculated and a weighted average of the number of sales was obtained. In Equation (1), i represents a store, and accordingly,

Represents the demand for a particular product in store i.

With reference to the foregoing, according to one embodiment of the present invention, a base store is selected with a minimum number of products that can provide a specific product to all general stores within a maximum waiting time (T). Fig. 1 shows the store of the base which was selected as the base store in the nationwide store. FIG. 2 is an enlarged view of FIG. 1. As shown in the figure, there are a plurality of stores in the whole country, and a minimum number of stores that can deliver goods to all general stores within a maximum waiting time T is selected as a base store. This is called the "minimum number of store locations". The minimum number of store stores, which is the minimum number of store stores that can deliver goods within the maximum waiting time (T) to all general stores, can be calculated by the following equation (2).

Here, i is a general store, j is a base store, and P is a minimum base store number (the minimum number of stores designated as a base store). T is the maximum time the customer can wait to receive the goods, i.e., the maximum waiting time. Also,

Is 1 if store j is a store of bases, or 0 otherwise. And

Represents the set of stores that can go within T hours to the general store i. That is, according to one embodiment of the present invention, the base store is selected as the minimum number that can be included in the coverage that can deliver goods within the maximum waiting time (T) to all general stores.

According to another embodiment of the present invention, as described above, when the minimum number of stores is obtained, a base store is selected so as to satisfy the minimum number of stores previously obtained and further satisfy the largest demand within the maximum delivery time (S) do.

In order to explain another embodiment, the first to ninth stores B1 to B9 are shown in Figs. 3 to 6. According to Figs. 3 and 5, the first store B1 is a base store, and according to Fig. 4, the second store B2 is a base store. It is assumed that both the first and second stores B1 and B2 are base stores satisfying the requirements according to an embodiment. According to Fig. 3 and Fig. 5, the first store B1 is located at a distance from the second to ninth stores B2 to B9 so as to be able to deliver the goods within the maximum waiting time T. However, the first store B1 can not deliver goods within the maximum delivery time S to the second store, the third store, the sixth through ninth stores B2, B3, B6, B7, B8, However, the merchandise can not be delivered within the maximum delivery time S to the fourth and fifth stores B4 and B5. 4 and 6, the second store B2 stores the distance to which the goods can be delivered within the maximum waiting time T to the first store and the third to ninth stores B1 and B3 to B9, . However, the second store B2 can deliver the goods within the maximum delivery time S to the first store, the third store to the fifth store B1, B3, B4, and B5, The goods can not be delivered within the maximum delivery time S to the stores B6, B7, B8, and B9. According to another embodiment of the present invention, a store which can satisfy the largest demand within the maximum delivery time S among the first and second stores B1 and B2 is selected as the base store.

For example, referring to FIG. 3 and FIG. 4, if a specific product is clothing of XXL size and the demand predicted by Equation (1) based on the past sales amount of the product is 1 The fourth and fifth stores are respectively five and four, and the sixth to ninth stores are respectively one. 3, when the first store B1 is selected as the base store, the base store stores the first to third stores within the maximum delivery time S, and the sixth to ninth stores B1 , B2, B3, B6, B7, B8 and B9). On the other hand, if the second store B2 is selected as the base store, as shown in FIG. 4, the base store stores three pieces of demand for the first to third stores B1, B2, and B3 within the maximum delivery time S, And the demand for the fourth and fifth stores (B4, B5). In this case, according to another embodiment of the present invention, the second store B2 should be selected as the base store. This is because the second store B2 can satisfy more demand at the maximum delivery distance S than the first store B1.

As another example, referring to FIGS. 5 and 6, when the specific product is XXL size clothes, it can be set that demand for all stores is one without demand forecast. 5, when the first store B1 is selected as the base store, the base store stores the first to third stores within the maximum delivery time S, and the sixth to ninth stores B1 , B2, B3, B6, B7, B8 and B9). 6, when the second store B2 is selected as the base store, the base store stores three pieces of demand for the first to third stores B1, B2 and B3 within the maximum delivery time S, , And two in the fourth and fifth stores B4 and B5. In such a case, according to another embodiment of the present invention, the first store B1 should be selected as a base store. This is because the first store B1 can meet the higher demand within the maximum delivery distance S to the second store B2.

As described above, the base store selection satisfying the minimum base store number of the base store and satisfying the greatest demand within the maximum delivery distance S can be obtained by using the following Equation (3).

here,

Is the demand for goods in store i. Here, the demand for goods can be obtained through demand forecasting, or simply by setting values. If the value obtained through the demand forecast is used, it can be obtained according to the above-mentioned equation (1), though it is not limited thereto.

Is 1 if store j is a store of bases, or 0 otherwise.

Is 1 if there is a general store within the time S from the base store i, and 0 otherwise.

Is a set of stores that can be shipped within S hours to general store i,

Is a set of stores that can be delivered within T hours to a general store i. Here, S is the predetermined maximum delivery time, and T is the maximum waiting time that the customer can wait for the receipt of the goods.

As described above, the selected base store according to one embodiment or another embodiment is used to provide the point-to-point sales method of the present invention. Hereinafter, a more specific embodiment will be described in which the above-mentioned base store is more specifically selected and the product is sold through the selected base store. First, the configuration of a goods sales system according to an embodiment of the present invention will be described. 7 is a diagram for explaining a configuration of a goods selling system according to an embodiment of the present invention. 7, the merchandise sales system according to the embodiment of the present invention includes a management server 100, a plurality of store terminals 200, and a shipment company server 300.

The management server 100 plays a role of managing a base store and a general store. In particular, the management server 100 may select a base store according to one embodiment or another embodiment described above. In addition, the management server 100 performs various kinds of processes related to point-to-point sales according to the embodiment of the present invention by using the selected base stores.

The store terminal 200 is a terminal disposed in a store according to an embodiment of the present invention. The store terminal 200 is a device connected to the management server 100 through a network and exchanging various kinds of information, data, messages and the like through communication. When there is a demand for an unprecedented commodity, the store terminal 200 of the general store can request the management server 100 to perform point-to-point mobile sales according to the input of the clerk. Then, the management server 100 can select a base store corresponding to the general store requesting point-to-point sales. Then, the management server 100 can interoperate with the store terminal 200 through the network to check whether or not the inventory exists. At this time, the store terminal 200 of the base store can provide information related to inventory of goods for point-to-point sales. When there is the corresponding inventory, the management server 100 can send a message to stop the sale because the product is the object of point-to-point sales in the store terminal 200 of the base store. In this case, the store terminal 200 of the base store can display a screen such that the store owner or the shop clerk can confirm the store.

The shipping company server 300 is a server operated by the shipping company for delivering the merchandise at the point-of-sale. According to one embodiment, the management server 100 provides the shipping company server 300 with information necessary for shipping, such as addresses of general shops and stores, product information, etc., and requests the shipping company to deliver the goods .

Next, the configuration of the management server 100 among the goods sale systems according to the embodiment of the present invention described above will be described in more detail. 8 is a block diagram illustrating a configuration of a management server according to an embodiment of the present invention. The management server 100 includes an interface unit 110, an input unit 120, a display unit 130, a storage unit 140, and a control unit 150. [

The interface unit 110 is a network interface for communicating with a plurality of store terminals 200 or a shipping company server 300. The interface unit 110 may include a modem, an interface card, a wired / wireless LAN card, a USB port, a serial port, a parallel port, and a data bus. The interface unit 110 may receive various messages, information, data and the like from the control unit 150 and transmit the received messages, information, and data to the store terminal 200 or the delivery company server 300. The interface unit 110 may receive various messages, information, data, and the like from the store terminal 200 or the delivery company server 300, and may transmit the messages, information, and data to the controller 150.

The input unit 120 receives a user's key operation for controlling various functions, operations, and the like of the management server 100, generates an input signal, and transmits the generated input signal to the controller 150. The input unit 120 may be a keyboard, a mouse, or the like. The input unit 120 may include at least one of a power key, a character key, a number key, and a direction key for power on / off. The function of the input unit 120 may be performed in the display unit 130 when the display unit 130 is implemented as a touch screen and may be omitted if the display unit 130 can perform all functions only have.

The display unit 130 may receive data for screen display from the control unit 150 and display the received data on a screen. In particular, the information related to the store according to the embodiment of the present invention can be displayed on the screen. Also, the display unit 130 can visually provide menus, data, function setting information, and various other information of the management server 100 to the user. When the display unit 130 is formed by a touch screen, some or all of the functions of the input unit 120 may be performed instead. The display unit 130 may include a liquid crystal display (LCD), an organic light emitting diode (OLED), and an active matrix organic light emitting diode (AMOLED).

The storage unit 140 stores each kind of data required for the operation of the management server 100, each application, and each kind of data generated according to the operation of the management server 100. The storage unit 140 may include a program area and a data area. The program area is used to select an operating system (OS) for booting and operation of the management server 100, a base store according to an embodiment of the present invention, An application program for processing, and the like. The data area can select a base store and store various kinds of data for processing mobile sales. Each kind of data stored in the storage unit 140 can be deleted, changed or added according to a user's operation.

The control unit 150 may control the overall operation of the management server 100 and the signal flow between the internal blocks of the management server 100 and may perform a data processing function of processing the data. The controller 150 may be a central processing unit (CPU), an application processor, a GPU (Graphic Processing Unit), or the like. The control unit 150 includes a preprocessing module 151, a base point selection module 153, and a sales processing module 155. In the embodiment of the present invention, the preprocessing module 151, the base point selection module 153, and the sales processing module 155 will be described as being implemented by hardware, but the present invention is not limited thereto. The module 153 and the sales processing module 155 may be implemented in software (application) stored in the storage unit 140 and executed in the control unit 150. [

The preprocessing module 151 collects various kinds of information necessary for selecting a base store according to an embodiment of the present invention. The base point selection module 153 plays a role of selecting a base point store according to the embodiment of the present invention. The sales processing module 155 performs the process for point-to-point sales using the selected store stores according to the embodiment of the present invention. The operation of the control unit 150 including the preprocessing module 151, the base selection module 153 and the sales processing module 155 will be described in more detail below.

Next, a method for selecting a base store of the management server 100 according to an embodiment of the present invention will be described. 9 is a flowchart illustrating a method for selecting a base store of a management server according to an embodiment of the present invention.

Referring to FIG. 9, the preprocessing module 151 of the controller 150 selects a product to be subjected to point-to-point sales, which is a sales method using a store in step S110. In the embodiment of the present invention, the kind of the commodity is not limited, but it is preferable that the commodity is the commodity whose production amount and demand are below the average. For example, in this embodiment, the article may be a special size garment. Therefore, the selection of these products can use the statistics of the sales volume data.

Once the product is selected, the preprocessing module 151 optionally determines the demand for each of the selected products in step S120. Demand decisions for these stores are made through demand forecasting. That is, the demand forecast value is determined as demand for each store. This demand forecast can use historical data. To this end, the preprocessing module 151 receives sales data of a specific commodity for each store from the store terminal 200 of each store through the interface unit 110, and data on the number of times a specific commodity is requested between the stores and sold do. Based on the received data, the demand for each store can be predicted according to Equation (1). And the predicted demand is determined by the demand for each store for the product.

Next, the preprocessing module 151 collects data necessary for selecting a base store in step S130. Such data may be loaded from the storage unit 140 in which the data is stored in advance, or input by the user through the input unit 120. Here, the data includes at least one of the maximum waiting time (T), the maximum delivery time (S), and the location information of each store in Japan and the demand for goods in each store.

Next, the base point selection module 153 of the control unit 150 selects a base point store for the product determined in step S140.

According to one embodiment, the base store is selected as the minimum number of deliverable items to all general stores within the maximum waiting time (T). In other words, the base selection module 153 selects, as a base store, the minimum number of stores that allow each of the plurality of stores to deliver goods within a predetermined maximum waiting time T, when a plurality of stores exist. At this time, the base point selection module 153 can calculate the minimum base point store number through Equation (2).

According to another embodiment, the base store selects a base store that satisfies the minimum base store number according to one embodiment, but can satisfy the largest demand within the maximum delivery time S. That is, as shown in FIG. 3 and FIG. 4, the number of stores of the minimum number of stores is maintained as it is, and the store stores the largest demand within the maximum delivery time (S) . In other words, the base selection module 153 is able to deliver goods to all the stores within a predetermined maximum waiting time T, and to store the demand of the most general stores within the predetermined maximum delivery time S, . That is, the base store selection module 153 can select the base store using Equation (3). In Equation (3)

Is the demand for goods in store i. Here, product demand can be obtained through demand forecasting. And, although not limited thereto, the demand forecast can be obtained according to the above-described equation (1).

When a store is selected according to one embodiment or another embodiment, the product is distributed to the selected store, and the store can be sold at a selected store. This sales method will be described below. FIG. 10 is a flowchart illustrating a method for selling a merchandise based on a storefront store according to an embodiment of the present invention.

In Fig. 10, it is assumed that a demand for a commodity has occurred in the first store. This product may be a product selected in step S110. For example, the product may be a garment of a special size (XXL, XXS).

The staff of the first store can request point-to-point sales to the management server 100 through the first store terminal 210. That is, the employee of the first store can input product information (size, color, quantity, and the like) and request point-to-point mobile sales. Then, the first store terminal 210 transmits the point-of-movement request message including the goods information to the management server 100 in step S210. Here, the point-to-point movement request message includes identification information for identifying the first store in which demand is generated and product information for requesting point-to-point mobile sales. Then, the management server 100 receives it. At this time, the sales processing module 155 of the control unit 150 can receive the point-to-point movement request message through the interface unit 110.

Accordingly, in step S220, the management server 100 selects a base store to provide the corresponding merchandise to the first store according to the point-to-point move request message. At this time, the sales processing module 155 of the control unit 150 can select the base store in which the first store among the base stores selected in step S140 is included in the area. If the first store belongs to a plurality of base stores, it is possible to select a closer base store. Based on this selection, the base store is assumed to be the second store.

Next, in step S230, the management server 100 confirms the inventory at the previously selected base store (the second store). At this time, the sales processing module 155 of the control unit 150 connects with the second store terminal 220 of the second base store through the network via the interface unit 110 to store the inventory of the corresponding goods in the second store Can be confirmed. At this time, the management server 100 may transmit a message requesting the second store terminal 220 to suspend sales because the merchandise is subject to point-to-point sales. In this case, the second store terminal 220 may display a message on the screen to request the salesperson of the shop or the salesperson to confirm the salesperson.

After checking the inventory, the management server 100 transmits a delivery request message to the delivery company server 300 in step S240 so that the delivery is performed. The delivery request message includes the address of the first store and the second store since the delivery company must receive the goods from the base store and deliver them to the general store. Further, it further includes information on the product to be delivered. That is, the sales processing module 155 of the control unit 150 generates a delivery request message including the address and the product information of the first store and the second store, and then transmits the delivery request message to the delivery company server 300 through the interface unit 110. [ Lt; / RTI > Accordingly, the delivery company confirming the delivery request message through the delivery company server 300 confirms the delivery request and receives the product from the second store (base store) and delivers it to the first store (general store) .

Meanwhile, the method for selling merchandise based on a base store including a method for selecting a store base of the management server according to the embodiment of the present invention is implemented in a form of a program readable by various computer means, And can be recorded on a readable recording medium. Here, the recording medium may include program commands, data files, data structures, and the like, alone or in combination. Program instructions to be recorded on a recording medium may be those specially designed and constructed for the present invention or may be available to those skilled in the art of computer software. For example, the recording medium may be a magnetic medium such as a hard disk, a floppy disk and a magnetic tape, an optical medium such as a CD-ROM or a DVD, a magneto-optical medium such as a floppy disk magneto-optical media) and ROMs, RAMs, flash memory, and the like. Examples of program instructions may include machine language wires such as those produced by a compiler, as well as high-level language wires that may be executed by a computer using an interpreter or the like. Such a hardware device may be configured to operate as one or more software modules to perform the operations of the present invention, and vice versa.

While the present invention has been described with reference to several preferred embodiments, these embodiments are illustrative and not restrictive. It will be understood by those skilled in the art that various changes and modifications may be made without departing from the spirit of the invention and the scope of the appended claims.

100: management server 110:
120: input unit 130: display unit
140: storage unit 150: control unit
151: preprocessing module 153: base point selection module
155: Sales Processing Module 200: Store Terminal
210: first store terminal 220: second store terminal
300: Shippers server

Claims

A preprocessing module for selecting one of the plurality of commodities; And
And a base point selection module for selecting a minimum number of base point stores that can include all of the general stores among the plurality of stores within the coverage capable of delivering the products within a predetermined maximum waiting time T. [ A device for selling merchandise based on a store.

The method according to claim 1,
The base point selection module
The store is selected by using the following equation,

I is a general store,
J is a base store,
P is the minimum number of stores,
T is the maximum waiting time,
remind

Is 1 if the store j is the base store or 0 otherwise,
remind

Is a set of stores that can be delivered within T hours to a general store i.

The method according to claim 1,
The base point selection module
Wherein said minimum number satisfies said minimum number,
Wherein the store which can satisfy the most demand within the predetermined maximum delivery time (S) is selected as the base store.

The method of claim 3,
The base point selection module
The store is selected by using the following equation,

remind

Is the demand for goods in store i,
remind

Is 1 if the store j is the base store or 0 otherwise,
remind

Is 1 if there is a general store within the time S from the base store i, 0 if there is no store,
remind

Is a set of stores that can be shipped within S hours to general store i,
remind

Is a set of stores that can be delivered within T hours to a general store i,
S is the maximum delivery time,
And T is a maximum waiting time. &Lt; RTI ID = 0.0 > 11. < / RTI >

5. The method of claim 4,
remind

Is expressed by the following equation

Lt; / RTI >
remind

Is a weight,

And a device for selling a product based on a store base.

6. The method according to any one of claims 1 to 5,
An interface unit for receiving a point-to-point movement request message from a first store terminal of the first store, which is one of the general stores; And
Wherein the control unit selects a second store as a base store to store the first store in the region according to the point-to-point movement request, and transmits the delivery information to the interface unit so that the product is delivered from the second store to the first store. And a sales processing module for transferring the merchandise to the delivery server through the delivery server.

The method according to claim 6,
The delivery information
The address of the first store, the address of the base store, and the information about the delivery product.

The preprocessing module selecting any one of the plurality of commodities;
And a base point selection module selecting a minimum number of base points that can include all of the general stores among the plurality of stores within the coverage capable of delivering the goods within a predetermined maximum waiting time (T) A method for selling merchandise based on a store base.

9. The method of claim 8,
The step of selecting the base store
The base point selection module selects a base point store using the following equation,

Is 1 if the store j is the base store or 0 otherwise,
remind

Is a set of stores that can be delivered within T hours to a general store i.

9. The method of claim 8,
The step of selecting the base store
Wherein the base point selection module selects a shop that satisfies the minimum number and can satisfy the largest demand within a predetermined maximum delivery time (S) as a base point store. Way.

11. The method of claim 10,
The step of selecting the base store
The base point selection module selects a base point store using the following equation,

remind

Is the demand for goods in store i,
remind

Is 1 if the store j is the base store or 0 otherwise,
remind

Is a set of stores that can be delivered within T hours to a general store i,
S is the maximum delivery time,
Wherein T is a maximum waiting time. &Lt; Desc / Clms Page number 19 >

12. The method of claim 11,
remind

Is expressed by the following equation

Lt; / RTI >
remind

Is a weight,

A method for selling a product based on a base store.

9. The method of claim 8,
Receiving a point-to-point move request message from a first store terminal of a first store, the interface being one of the general stores;
Selecting a second store that is a base store where the sales processing module includes the first store in the region in the base store according to the point-to-point movement request; And
And transmitting the delivery information to the delivery company server through the interface unit so that the sales processing module delivers the goods from the second store to the first store. Method for sale.

14. The method of claim 13,
The delivery information
The address of the first store, the address of the base store, and the information about the delivery product.

14. A computer-readable recording medium on which a method for selling a merchandise based on a store of a base according to any one of claims 8 to 14 is recorded.