WO2010035494A1 - 配送コース数算出システムおよび配送コース数算出方法 - Google Patents
配送コース数算出システムおよび配送コース数算出方法 Download PDFInfo
- Publication number
- WO2010035494A1 WO2010035494A1 PCT/JP2009/004924 JP2009004924W WO2010035494A1 WO 2010035494 A1 WO2010035494 A1 WO 2010035494A1 JP 2009004924 W JP2009004924 W JP 2009004924W WO 2010035494 A1 WO2010035494 A1 WO 2010035494A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- traveling
- delivery
- points
- average value
- base
- Prior art date
Links
- 238000000034 method Methods 0.000 title claims description 25
- 238000012384 transportation and delivery Methods 0.000 claims description 176
- 238000004364 calculation method Methods 0.000 claims description 76
- 235000019504 cigarettes Nutrition 0.000 description 7
- 238000010586 diagram Methods 0.000 description 7
- 241000208125 Nicotiana Species 0.000 description 6
- 235000002637 Nicotiana tabacum Nutrition 0.000 description 6
- 238000012986 modification Methods 0.000 description 3
- 230000004048 modification Effects 0.000 description 3
- 230000004044 response Effects 0.000 description 3
- 238000007781 pre-processing Methods 0.000 description 2
- 238000004422 calculation algorithm Methods 0.000 description 1
- 238000006243 chemical reaction Methods 0.000 description 1
- 238000004590 computer program Methods 0.000 description 1
- 239000000470 constituent Substances 0.000 description 1
- 230000007717 exclusion Effects 0.000 description 1
- PCHJSUWPFVWCPO-UHFFFAOYSA-N gold Chemical compound [Au] PCHJSUWPFVWCPO-UHFFFAOYSA-N 0.000 description 1
- 239000010931 gold Substances 0.000 description 1
- 229910052737 gold Inorganic materials 0.000 description 1
- 238000004088 simulation Methods 0.000 description 1
- 239000002689 soil Substances 0.000 description 1
- -1 tree Substances 0.000 description 1
- XLYOFNOQVPJJNP-UHFFFAOYSA-N water Substances O XLYOFNOQVPJJNP-UHFFFAOYSA-N 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q30/00—Commerce
- G06Q30/02—Marketing; Price estimation or determination; Fundraising
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q10/083—Shipping
- G06Q10/0835—Relationships between shipper or supplier and carriers
- G06Q10/08355—Routing methods
Definitions
- the present invention relates to a delivery course number calculation system and a delivery course number calculation method.
- Patent Document 1 Japanese Patent Application Laid-Open No. 2004-127038 describes a system that divides an area where a plurality of vending machines are installed into areas in charge of workers who perform patrol work of vending machines.
- the system includes an initial setting unit for setting a plurality of areas including at least one vending machine in accordance with the number of persons in charge in a region where a plurality of vending machines are installed, and vending machines included in each area.
- a calculation unit that calculates a statistic determined by the characteristics of the image, and after selecting a specific area in consideration of the statistic, a process of adding a vending machine to the specific area and expanding the area is repeatedly executed.
- a processing unit that terminates the process when the condition is satisfied, and determines the obtained area as a responsible area of the plurality of responsible persons. Thereby, the area in which a plurality of vending machines are installed can be divided into areas in charge so that each worker can patrol efficiently.
- a course that can be visited efficiently is calculated by calculating a patrol order in which a store included in the course can be visited on the shortest route using an approximation algorithm.
- the number of delivery courses is estimated in order to prepare the number of delivery courses and to prepare delivery workers and trucks used for delivery. It is desirable to predict accurately.
- the present invention has been made in view of the above circumstances, and an object of the present invention is to provide a technique for accurately calculating the required number of delivery courses according to area characteristics.
- a delivery course that calculates the number of delivery courses required when creating a plurality of delivery courses that sequentially deliver articles from the base to the traveling points and return to the base within an area that includes the base and a plurality of traveling points.
- a number calculation system Information that can be used to calculate the travel time between the base and each traveling point and the travel time between each traveling point and each of the other traveling points, the work time A per delivery course,
- a storage unit for storing information capable of calculating an average value C of the working time at the traveling point, and the number of delivery days per week and the day of the week that can be delivered to each of the traveling points; Based on the information capable of calculating the travel time, the average value D of the round trip travel time between the base and each traveling point, and the average travel time between the traveling points of the plurality of traveling points included in the area
- An average value calculation unit for calculating the value E;
- the computer system includes: Information that can be used to calculate the travel time between the base and each traveling point and the travel time between each traveling point and each of the other traveling points, the work time A per delivery course, A storage unit for storing information capable of calculating an average value C of the working time at the traveling point, and the number of delivery days per week and the day of the week that can be delivered to each of the traveling points; An average value calculator; A traveling point number calculation unit; A delivery course number calculator, Including Based on the information for which the average value calculation unit can calculate the travel time, the average value D of the round-trip travel time between the base and each of the tour points, and the tour of the plurality of tour points included in the area Calculating an average value E of travel time between points;
- the traveling point can be, for example, a store such as a convenience store or a supermarket, or a vending machine.
- working time A per delivery course refers to the total work time per day of the workers of each delivery course, the loading time of goods at the base before the delivery start, the rest time, and the post-delivery base. The time that can be used for actual delivery work, excluding work time.
- the required number of delivery courses can be accurately calculated according to the characteristics of the area.
- the traveling point is a store.
- the store can be, for example, a convenience store or a supermarket. These stores include stores having different delivery days per week and deliverable days of the week.
- the delivery course number calculation system calculates the necessary number of delivery courses when creating a plurality of delivery courses that deliver articles from a base to a plurality of stores (travel points) and return to the base within the area. calculate.
- the required number of delivery courses P is calculated from the following equation.
- the weighted store number M can be the number of stores weighted according to the number of deliveries per week for each store. For example, the number of weighted stores of a store whose delivery number per week is “3” is “3”.
- Number of delivery courses P weighted number of stores M / number of stores per delivery course N (Expression 1)
- working time A per delivery course refers to the total work time per day of the workers of each delivery course, the loading time of goods at the base before the delivery start, the rest time, and the post-delivery base. The time that can be used for actual delivery work, excluding work time.
- N (Work time per delivery course A ⁇ Average value of round trip travel time between base and store D + Average value E of travel time between stores) / (Average value of work time at store) Average value of travel time between C + stores E) (Equation 2)
- FIG. 1 is a block diagram showing a configuration of a delivery course number calculation system 100 in the present embodiment.
- the delivery course number calculation system 100 includes a display processing unit 102, a condition setting reception unit 104, a necessary number calculation processing unit 124, a map information storage unit T1, a base information storage unit T2, a store information storage unit T3, a condition setting storage unit T4, A logic storage unit T6 and a temporary storage unit T7 are included.
- the required number calculation processing unit 124 includes a preprocessing unit 308, a first average value calculation unit 310, a second average value calculation unit 312, a store number calculation unit 314, and a delivery course number calculation unit 316.
- the display processing unit 102 performs processing for displaying various data to be processed by the delivery course number calculation system 100 on a screen (not shown) such as a display.
- the condition setting accepting unit 104 accepts input of various condition settings necessary for calculating the number of delivery courses from the user.
- information about the base is stored in the base information storage unit T2
- information about the store is stored in the store information storage unit T3
- other information is stored in the condition setting storage unit T4.
- the map information storage unit T1 stores map information data of a region for which a course is to be created.
- the logic storage unit T6 stores logic relating to various processing procedures.
- the site information storage unit T2 stores site information data.
- the base information data includes the base identification code, the base name, the base position (latitude and longitude, or X coordinate and Y coordinate), the total work time for each delivery course, and the loading time of goods on each truck at the base. , Information about the base such as break time, working time of the worker after returning to the base, reference loading capacity on each truck, and the like.
- the base is a delivery base such as a distribution center in the area.
- the store information storage unit T3 stores store information data.
- the store information data includes a base identification code, a store identification code, a store name, a store location (latitude, longitude and height, or X coordinate, Y coordinate and Z coordinate), delivery days per day (days), Delivery days, designated delivery time, storefront work time (minutes), delivery amount per time (t), round-trip travel time between bases and stores (minutes), travel time between stores (stores) (minutes), month It contains information about stores such as sales (yen) and monthly sales (items) for each product.
- FIG. 2 is a diagram showing a part of the data structure of the delivery information storage unit 326 included in the store information storage unit T3 in the present embodiment.
- the delivery information storage unit 326 includes a base code field, a store code field, a position field, a work time (minutes) field, a delivery amount (t / time) field, a delivery days (weeks) field, between the base and the store. Includes a reciprocal travel time (minutes) field, a deliverable day field, and the like.
- the store information storage unit T3 uses the travel time between the base and each store as information that can calculate the travel time between the base and each store. Is remembered.
- the maximum number of delivery days can be 6 days.
- the number of delivery days “n” means that delivery is performed n days a week.
- the number of delivery days is “6”, it indicates that 6-day delivery is required per week. Therefore, a store with a delivery date of 6 days needs to be delivered daily from Monday to Saturday.
- the number of delivery days is “0.5”, it indicates that one-day delivery is required in two weeks. The day of the week that can be delivered to each store is stored in the deliverable day column.
- a configuration is shown in which a deliverable day of the week column is provided, but when a delivery day of the week is designated, a configuration of a delivery designated day of the week column for storing the day of the week may be provided. Moreover, it can also be set as the structure which provided the non-delivery day column which stored the day of the week which cannot deliver to each store instead of the deliverable day column.
- the store with the store code “a” belongs to the base with the base code “1000”, the position is “(X 1 , Y 1 , Z 1 )”, and the working time at this store is “5 minutes”, delivery amount per delivery is “0.001t”, delivery days is “6”, round-trip travel time between bases and stores is “40 minutes”, and delivery days are “Monday Tuesday Wednesday Thursday “Sat”.
- the store with the store code “b” has a delivery time of “5”, a round-trip travel time between the base and the store of “60 minutes”, and a deliverable day of the week is “Monday, Wednesday, Thursday, and Friday”.
- the store with the store code “c” has a delivery date of “5”, a round-trip travel time between the base and the store of “40 minutes”, and a deliverable day of the week is “Monday, Wednesday, Friday and Saturday”.
- the store with the store code “d” has a delivery date of “4”, a round-trip travel time between the base and the store of “60 minutes”, and a deliverable day of the week is “Monday, Tuesday, Wednesday, Friday and Friday”.
- the store with the store code “e” has a delivery date of “4”, a round-trip travel time between the base and the store of “40 minutes”, and a deliverable day of the week is “Monday, Wednesday, Friday and Saturday”.
- FIG. 3 is a diagram showing a part of the data structure of the inter-store travel time storage unit 328 included in the store information storage unit T3 in the present embodiment.
- the store-to-store travel time storage unit 328 stores store-to-store travel time between other stores for each store. That is, in this embodiment, the store information storage unit T3 (inter-store travel time storage unit 328) uses each store and another store as information that can calculate the travel time between each store and each other store. It remembers the actual travel time between them.
- the travel time between the store with the store code “b” is “20 minutes”
- the travel time with the store with the store code “c” is “30 minutes”.
- ”And the travel time between the store with the store code“ d ” is“ 20 minutes ”.
- FIG. 4 is a flowchart showing a procedure by which the delivery course number calculation system 100 according to the present embodiment calculates the number of delivery courses.
- description will be made with reference to FIGS.
- the pre-processing unit 308 calculates the number of stores, the number of weighted stores M, and the average value C of work hours in the stores (step S400).
- the average value C of the work time in the store can be calculated in advance, and the average value C of the work time in the store can be stored in the store information storage unit T3.
- the first average value calculation unit 310 calculates the average value D of the round trip time between the base and the store (step S402).
- the first average value calculation unit 310 considers only the stores that are included in the area, and the stores that are within a predetermined ratio in the shortest round trip time with respect to the base, After the exclusion, the average value D of the round trip time between the base and the store is calculated.
- the average value D an approximate value of the round trip time between the base and the store in each delivery course when actually creating the delivery course can be obtained, and the number of delivery courses can be calculated accurately. It is possible to obtain an average value D of the reciprocating travel time between the base and the store.
- the first average value calculation unit 310 weights each store according to the number of delivery days per week when detecting a predetermined ratio of stores to be considered. The procedure is shown below.
- the first average value calculation unit 310 refers to the store information storage unit T3, and for a store having a plurality of delivery days per week, the first average value calculation unit 310 reciprocates between a plurality of bases and stores for the delivery days. Prepare a set of hours.
- FIG. 5 is a diagram showing a set of reciprocating travel times between the base and the store prepared by the first average value calculation unit 310.
- the store with the store code “a” has six sets because the number of delivery days per week is six.
- two sets of stores with the store code “g” are prepared because the number of delivery days per week is two.
- the first average value calculation unit 310 arranges the set of reciprocating time between the base and the store prepared in this way in the order of short reciprocating time between the base and the store.
- the first average value calculation unit 310 detects a set boundary that is within a predetermined ratio with respect to the total number of sets in the order of short reciprocation time between the base and the store.
- the predetermined ratio can be set to 80%, for example.
- the set boundary within 80% is between the store with the store code “i” and the store with the store code “j”. That is, in this case, the average value D of the round-trip travel time between the base and the store is calculated considering only the stores within 60 minutes of the round-trip travel time between the bases among the stores included in the area. Will be.
- the first average value calculation unit 310 divides the total value of the round-trip travel time between each set of bases and stores at a predetermined ratio to be considered by the number of sets at a predetermined ratio to be considered. The average value D of the reciprocation time between them is calculated.
- FIG. 6 is a flowchart illustrating a procedure in which the second average value calculation unit 312 calculates an average value E of travel time between stores.
- the second average value calculation unit 312 calculates the average value of the travel time between stores of each store for each store.
- one of the stores in the area is selected as a target store (step S450).
- one of the deliverable days of the target store is selected (step S452).
- a predetermined number of stores are selected in the order of shorter travel time from the target store selected in step S450 (step S454).
- the predetermined number can be set to “6”, for example. If the number of other stores that can be delivered on the day of the week selected in step S452 is less than the predetermined number, only the stores that can be delivered on the day of the week selected in step S452 are selected.
- the second average value calculation unit 312 calculates the total travel time of the target store selected in step S450 and the store selected in step S454, and is selected in step S454.
- the number of stores in the store is temporarily stored in the temporary storage unit T7 (step S456).
- step S458 it is determined whether or not the processing is completed for all deliverable days of the target store. If there is a day of the week that has not been processed (NO in step S458), the process returns to step S452, and the same Repeat the process. On the other hand, if the processing is completed for all the deliverable days of the target store in step S458 (YES in step S458), the total travel time is divided by the number of stores, and the travel time between stores of the target store Is calculated and stored in the temporary storage unit T7 (step S460).
- FIG. 7 is a diagram illustrating an example of an internal configuration of the temporary storage unit T7.
- the target store is a store having the store code “a”
- the process described with reference to steps S452 to S456 is performed for each of the month, fire, water, tree, gold, and soil.
- the second average value calculation unit 312 calculates the total time of the total time of each day of the week and the total number of stores. As a result, the total time is 900 minutes and the number of stores is 35.
- step S462 it is then determined whether or not the processing has been completed for all stores in the area (step S462). If there is a store that has not yet been processed (YES in step S462), the processing returns to step S450. Repeat the same process. On the other hand, if the processing is completed for all stores in step S462 (NO in step S462), the total time of the average value Q of travel times between stores of all stores is divided by the number of stores in the area. The average value E of the travel time between the stores in this area is calculated (step S464).
- the average value Q of the travel time between each store and other stores can be accurately calculated according to the characteristics of the stores included in this area. It is possible to calculate the average value E of the travel time between them with high accuracy.
- the store number calculation unit 314 calculates the number N of stores per delivery course according to the above-described (Equation 2) (step S406).
- the delivery course number calculation unit 316 calculates the delivery course number P according to (Equation 1) described above (step S408).
- the required number of delivery courses can be accurately calculated according to the characteristics of the area.
- the delivery course number calculation unit 316 calculates the delivery course number P, it does not target all stores in the area but actually sells products at a predetermined time among the stores. This is different from the first embodiment in that the number of delivery courses P is calculated only for the store that performs the service.
- the delivery information storage unit 326 includes a store type column, a related column, a start date column, an abolition date column, etc. in addition to the configuration of the delivery information storage unit 326 shown in FIG. It further includes an application date column.
- FIG. 8 is a diagram showing an example of the configuration of the delivery information storage unit 326 of the store information storage unit T3 in the present embodiment.
- the delivery information storage unit 326 further includes a store type column, a related column, a start date column, and an abolition date column in addition to the configuration of the delivery information storage unit 326 shown in FIG. Also in the present embodiment, the delivery information storage unit 326 includes other fields similar to those shown in FIG. 2, but the description is omitted here.
- a store that has received a sales permit sells tobacco at a permitted store and a store at a destination (hereinafter referred to as “destination store”). May be sold.
- permitted store a sales permit
- destination store a destination
- tobacco is delivered directly to a branch store.
- cigarettes are delivered from an authorized store to a destination store, it is necessary to add the amount of articles (cigarettes) to the authorized store to the amount of articles (cigarettes) delivered to the authorized store and deliver it to the authorized store.
- the “store type” column a code indicating whether each store is a permitted store or a branch store, and if the store is a branch store, whether the cigarette is delivered from the permitted store or directly to the store is stored. Is done.
- the symbol “1” indicates that the store is a permitted store
- the symbol “2” indicates that the store is a branch store
- articles are delivered directly to the store.
- “3” indicates that the store is a branch store and goods are delivered from the authorized store to the store.
- a store with a store code “a” is a permitted store for stores with store codes “b” and “c”.
- the amount of articles to the store with the store code “c” that is to be delivered from the authorized store among the outlet stores It is necessary to consider.
- the store code “b” since the goods are delivered directly to this store, when considering the amount of goods to the store with the store code “a”, the store code “b” is sent to the store. There is no need to consider the amount of goods.
- the application date of the store code “b” to the store depends on the application date of the store of the store code “a”.
- the condition setting receiving unit 104 can receive an input of conditions of a store to be processed for performing a process of calculating the number of delivery courses.
- the condition setting reception unit 104 can receive, for example, input of the start date and the abolition date, and the store type of the target store.
- the condition setting reception unit 104 inputs the store type of the target store. , “1” and “2” can be received.
- the necessary number calculation processing unit 124 has extracted the stores that meet the conditions for which the condition setting receiving unit 104 has received the input, and has been described in the first embodiment for only the stores. The same processing is performed to calculate the required number of delivery courses in this area.
- the required number of delivery courses can be accurately calculated according to the characteristics of the area when actual delivery is performed.
- the number of delivery destination stores is enormous when considered at the national level. For example, taking an example of plotting a delivery destination store on a digital map, if the number of stores is enormous, the response of the process will be very poor. Therefore, in order to improve processing response, it is preferable not to read store data that is not required for processing.
- the licensing business related to certain products such as cigarettes it is considered that the replacement of stores that are started and abolished will become even more intense in the future. Therefore, it is not necessary to read the data of the abolished store, but it is not preferable to delete the abolished store as a physical record.
- the delivery information storage unit 326 has a start date field and an abolition date field, so that logical records can be read without reading all physical records. Can lead. Thereby, in the process of combining the basic technology (platform: digital map, for example) and the application, only the logical record can be sequentially read while considering the physical record, and the response can be improved.
- Each component of the delivery course number calculation system 100 shown in FIG. 1 is not a hardware unit configuration but a functional unit block.
- Each component of the delivery course number calculating system 100 includes a CPU of a computer, a memory, a program for realizing the components shown in the figure loaded in the memory, a storage unit such as a hard disk for storing the program, and a network connection interface. It is realized by any combination of hardware and software. It will be understood by those skilled in the art that there are various modifications to the implementation method and apparatus.
- the store information storage unit T3 can calculate the travel time between the base and each store, and the travel time itself between the base and each store, and each store and others.
- the case where the travel time itself between each store and each of the other stores is stored as information that can calculate the travel time between each store has been described as an example.
- store information storage part T3 can memorize the position information on a base and each store as information which can compute the movement time between a base and each store.
- the delivery course number calculation system 100 can further include a travel time calculation unit that calculates the travel time between the base and each store based on the position information.
- the map information storage unit T1 can store road information such as the speed limit of the road between the stores and the shortest route.
- the travel time calculation unit can calculate the travel time between the base and each store based on position information and road information between the base and each store.
- the travel time calculation unit can also calculate the travel time between stores based on the location information and road information of each store. For example, when calculating the travel time between one store and another store, the travel time calculation unit first determines which road to use based on the location information and road information of these stores. To detect. Next, the travel time calculation unit calculates the travel time between stores based on the speed limit of the road to be used and the travel distance.
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Strategic Management (AREA)
- Economics (AREA)
- Development Economics (AREA)
- Entrepreneurship & Innovation (AREA)
- General Physics & Mathematics (AREA)
- Finance (AREA)
- Accounting & Taxation (AREA)
- Marketing (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- Theoretical Computer Science (AREA)
- Game Theory and Decision Science (AREA)
- Human Resources & Organizations (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
Description
拠点と複数の巡回ポイントとを含むエリア内で、前記拠点から各前記巡回ポイントに順次物品を配送して前記拠点に戻る配送コースを複数作成する際に、必要な配送コース数を算出する配送コース数算出システムであって、
前記拠点と各前記巡回ポイントそれぞれとの間の移動時間および各前記巡回ポイントと他の前記巡回ポイントそれぞれとの間の移動時間を算出可能な情報と、前記配送コースあたりの作業時間Aと、各前記巡回ポイントでの作業時間の平均値Cを算出可能な情報と、ならびに各前記巡回ポイントそれぞれへの1週間あたりの配送日数および配送可能曜日と、を記憶する記憶部と、
前記移動時間を算出可能な情報に基づき、前記拠点と各前記巡回ポイントとの間の往復移動時間の平均値D、および前記エリアに含まれる前記複数の巡回ポイントの巡回ポイント間の移動時間の平均値Eを算出する平均値算出部と、
前記配送コースあたりの前記作業時間A、前記巡回ポイントでの前記作業時間の平均値C、前記拠点と各前記巡回ポイントとの間の往復移動時間の平均値D、および前記巡回ポイント間の移動時間の平均値Eに基づき、前記エリアにおいて、配送コースあたりに含まれる巡回ポイント数Nを算出する巡回ポイント数算出部と、
各前記複数の巡回ポイントへの1週間あたりの配送日数を考慮した加重巡回ポイント数Mを前記巡回ポイント数Nで除すことにより、前記エリアに必要な配送コース数Pを算出する配送コース数算出部と、
を含み、
前記平均値算出部は、前記拠点と各前記巡回ポイントとの間の往復移動時間が短い順に所定割合以内となる前記巡回ポイントのみを考慮して、それ以外の巡回ポイントは除外して、前記平均値Dを算出する配送コース数算出システムが提供される。
コンピュータシステムにより、拠点と複数の巡回ポイントとを含むエリア内で、前記拠点から各前記巡回ポイントに順次物品を配送して前記拠点に戻る配送コースを複数作成する際に、必要な配送コース数を算出する配送コース数算出方法であって、
前記コンピュータシステムは、
前記拠点と各前記巡回ポイントそれぞれとの間の移動時間および各前記巡回ポイントと他の前記巡回ポイントそれぞれとの間の移動時間を算出可能な情報と、前記配送コースあたりの作業時間Aと、各前記巡回ポイントでの作業時間の平均値Cを算出可能な情報と、ならびに各前記巡回ポイントそれぞれへの1週間あたりの配送日数および配送可能曜日と、を記憶する記憶部と、
平均値算出部と、
巡回ポイント数算出部と、
配送コース数算出部と、
を含み、
前記平均値算出部が、前記移動時間を算出可能な情報に基づき、前記拠点と各前記巡回ポイントとの間の往復移動時間の平均値D、および前記エリアに含まれる前記複数の巡回ポイントの巡回ポイント間の移動時間の平均値Eを算出するステップと、
前記配送コースあたりの前記作業時間A、前記巡回ポイントでの前記作業時間の平均値C、前記拠点と各前記巡回ポイントとの間の往復移動時間の平均値D、および前記巡回ポイント間の移動時間の平均値Eに基づき、前記エリアにおいて、配送コースあたりに含まれる巡回ポイント数Nを算出するステップと、
各前記複数の巡回ポイントへの1週間あたりの配送日数を考慮した加重巡回ポイント数Mを前記巡回ポイント数Nで除すことにより、前記エリアに必要な配送コース数Pを算出するステップと、
を含み、
前記平均値算出部が、前記平均値Dを算出するステップにおいて、前記拠点と各前記巡回ポイントとの間の往復移動時間が短い順に所定割合以内となる前記巡回ポイントのみを考慮して、それ以外の巡回ポイントは除外して、前記平均値Dを算出する配送コース数算出方法が提供される。
図1は、本実施の形態における配送コース数算出システム100の構成を示すブロック図である。
配送コース数算出システム100は、表示処理部102、条件設定受付部104、必要数算出処理部124、地図情報記憶部T1、拠点情報記憶部T2、店舗情報記憶部T3、条件設定記憶部T4、ロジック記憶部T6、および一時記憶部T7を含む。必要数算出処理部124は、前処理部308、第1の平均値算出部310、第2の平均値算出部312、店舗数算出部314、および配送コース数算出部316を含む。
ここでは、配送情報記憶部326は、拠点コード欄、店舗コード欄、位置欄、作業時間(分)欄、配送量(t/回)欄、配送日数(週)欄、拠点と店舗との間の往復移動時間(分)欄、および配送可能曜日欄等を含む。
ここで、対象店舗が店舗コード「a」の店舗である場合を例として説明する。
店舗コード「a」の店舗は、図2に示した例によると、配送可能曜日が「月火水木金土」となっている。よって、月、火、水、木、金、土のそれぞれについて、ステップS452からステップS456を参照して説明した処理を行う。その結果、各曜日の移動時間の合計時間および店舗数が図7に示したようになったとする。第2の平均値算出部312は、これらの各曜日の合計時間の総合計時間と、店舗数の合計数とを算出する。この結果、合計時間が900分、店舗数が35となる。第2の平均値算出部312は、ステップS460の処理において、店舗コード「a」の店舗の店舗間の移動時間の平均値Q=900分/35=25.71分と算出することができる。
本実施の形態において、配送コース数算出部316が配送コース数Pを算出する際に、エリア内のすべての店舗を対象とするのではなく、店舗のうち、所定の時期に実際に商品の販売を行っている店舗のみを対象として配送コース数Pを算出する点で、第1の実施の形態と異なる。
配送情報記憶部326は、図2に示した配送情報記憶部326の構成に加えて、店舗種類欄、関連欄、開始年月日欄および廃止年月日欄をさらに含む。本実施の形態においても、配送情報記憶部326は、図2に示したのと同様のその他の欄をも含むが、ここでは記載を省略している。
Claims (8)
- 拠点と複数の巡回ポイントとを含むエリア内で、前記拠点から各前記巡回ポイントに順次物品を配送して前記拠点に戻る配送コースを複数作成する際に、必要な配送コース数を算出する配送コース数算出システムであって、
前記拠点と各前記巡回ポイントそれぞれとの間の移動時間および各前記巡回ポイントと他の前記巡回ポイントそれぞれとの間の移動時間を算出可能な情報と、前記配送コースあたりの作業時間Aと、各前記巡回ポイントでの作業時間の平均値Cを算出可能な情報と、ならびに各前記巡回ポイントそれぞれへの1週間あたりの配送日数および配送可能曜日と、を記憶する記憶部と、
前記移動時間を算出可能な情報に基づき、前記拠点と各前記巡回ポイントとの間の往復移動時間の平均値D、および前記エリアに含まれる前記複数の巡回ポイントの巡回ポイント間の移動時間の平均値Eを算出する平均値算出部と、
前記配送コースあたりの前記作業時間A、前記巡回ポイントでの前記作業時間の平均値C、前記拠点と各前記巡回ポイントとの間の往復移動時間の平均値D、および前記巡回ポイント間の移動時間の平均値Eに基づき、前記エリアにおいて、配送コースあたりに含まれる巡回ポイント数Nを算出する巡回ポイント数算出部と、
各前記複数の巡回ポイントへの1週間あたりの配送日数を考慮した加重巡回ポイント数Mを前記巡回ポイント数Nで除すことにより、前記エリアに必要な配送コース数Pを算出する配送コース数算出部と、
を含み、
前記平均値算出部は、前記拠点と各前記巡回ポイントとの間の往復移動時間が短い順に所定割合以内となる前記巡回ポイントのみを考慮して、それ以外の巡回ポイントは除外して、前記平均値Dを算出する配送コース数算出システム。 - 請求項1に記載の配送コース数算出システムにおいて、
前記平均値算出部は、各前記巡回ポイントへの1週間あたりの配送日数に応じて前記拠点と各前記巡回ポイントとの間の往復移動時間に重み付けを行い、当該重み付けを行った状態で前記所定割合以内となる前記巡回ポイントを検出し、当該巡回ポイントのみを考慮して前記平均値Dを算出する配送コース数算出システム。 - 請求項2に記載の配送コース数算出システムにおいて、
前記平均値算出部は、前記拠点と各前記巡回ポイントとの間の往復移動時間につき、各前記巡回ポイントへの1週間あたりの配送日数に対応する数のセットを準備し、前記拠点と各前記巡回ポイントとの間の往復移動時間が短い順に所定割合以内となる前記セットを検出し、当該セットのみを考慮して前記平均値Dを算出する配送コース数算出システム。 - 請求項1から3いずれかに記載の配送コース数算出システムにおいて、
前記平均値算出部は、
各前記巡回ポイント毎に、当該巡回ポイントと他の前記巡回ポイントとの間の移動時間の平均値を算出するステップと、
各前記巡回ポイント毎に算出した前記平均値に基づき、前記平均値Eを算出するステップと、
を実行する配送コース数算出システム。 - 請求項4に記載の配送コース数算出システムにおいて、
各前記巡回ポイント毎に、当該巡回ポイントと他の前記巡回ポイントとの間の移動時間の平均値を算出するステップは、
当該巡回ポイントを対象巡回ポイントとして選択し、当該巡回ポイントへの配送可能曜日を順に選択して、各配送可能曜日毎に、当該曜日に配送可能な他の前記巡回ポイントの中で、前記対象巡回ポイントとの間の移動時間が短い順に所定数の巡回ポイントを選択し、当該選択した巡回ポイントと前記対象巡回ポイントとの間の移動時間の平均時間を算出し、当該各配送可能曜日毎の平均時間の平均値を当該巡回ポイントと他の前記巡回ポイントとの間の移動時間の平均値とする配送コース数算出システム。 - 請求項1から5いずれかに記載の配送コース数算出システムにおいて、
前記移動時間を算出可能な情報は、前記拠点および各前記巡回ポイントそれぞれの位置情報であって、
当該システムは、
前記位置情報に基づき、前記拠点と各前記巡回ポイントそれぞれとの間の移動時間を算出する移動時間算出部をさらに含む配送コース数算出システム。 - コンピュータシステムにより、拠点と複数の巡回ポイントとを含むエリア内で、前記拠点から各前記巡回ポイントに順次物品を配送して前記拠点に戻る配送コースを複数作成する際に、必要な配送コース数を算出する配送コース数算出方法であって、
前記コンピュータシステムは、
前記拠点と各前記巡回ポイントそれぞれとの間の移動時間および各前記巡回ポイントと他の前記巡回ポイントそれぞれとの間の移動時間を算出可能な情報と、前記配送コースあたりの作業時間Aと、各前記巡回ポイントでの作業時間の平均値Cを算出可能な情報と、ならびに各前記巡回ポイントそれぞれへの1週間あたりの配送日数および配送可能曜日と、を記憶する記憶部と、
平均値算出部と、
巡回ポイント数算出部と、
配送コース数算出部と、
を含み、
前記平均値算出部が、前記移動時間を算出可能な情報に基づき、前記拠点と各前記巡回ポイントとの間の往復移動時間の平均値D、および前記エリアに含まれる前記複数の巡回ポイントの巡回ポイント間の移動時間の平均値Eを算出するステップと、
前記配送コースあたりの前記作業時間A、前記巡回ポイントでの前記作業時間の平均値C、前記拠点と各前記巡回ポイントとの間の往復移動時間の平均値D、および前記巡回ポイント間の移動時間の平均値Eに基づき、前記エリアにおいて、配送コースあたりに含まれる巡回ポイント数Nを算出するステップと、
各前記複数の巡回ポイントへの1週間あたりの配送日数を考慮した加重巡回ポイント数Mを前記巡回ポイント数Nで除すことにより、前記エリアに必要な配送コース数Pを算出するステップと、
を含み、
前記平均値算出部が、前記平均値Dを算出するステップにおいて、前記拠点と各前記巡回ポイントとの間の往復移動時間が短い順に所定割合以内となる前記巡回ポイントのみを考慮して、それ以外の巡回ポイントは除外して、前記平均値Dを算出する配送コース数算出方法。 - 拠点と複数の巡回ポイントとを含むエリア内で、前記拠点から各前記巡回ポイントに順次物品を配送して前記拠点に戻る配送コースを複数作成する際に、必要な配送コース数を算出するためのプログラムであって、
コンピュータを、
前記拠点と各前記巡回ポイントそれぞれとの間の移動時間および各前記巡回ポイントと他の前記巡回ポイントそれぞれとの間の移動時間を算出可能な情報と、前記配送コースあたりの作業時間Aと、各前記巡回ポイントでの作業時間の平均値Cを算出可能な情報と、ならびに各前記巡回ポイントそれぞれへの1週間あたりの配送日数および配送可能曜日と、を記憶する記憶手段、
前記移動時間を算出可能な情報に基づき、前記拠点と各前記巡回ポイントとの間の往復移動時間の平均値D、および前記エリアに含まれる前記複数の巡回ポイントの巡回ポイント間の移動時間の平均値Eを算出する平均値算出手段、
前記配送コースあたりの前記作業時間A、前記巡回ポイントでの前記作業時間の平均値C、前記拠点と各前記巡回ポイントとの間の往復移動時間の平均値D、および前記巡回ポイント間の移動時間の平均値Eに基づき、前記エリアにおいて、配送コースあたりに含まれる巡回ポイント数Nを算出する巡回ポイント数算出手段、
各前記複数の巡回ポイントへの1週間あたりの配送日数を考慮した加重巡回ポイント数Mを前記巡回ポイント数Nで除すことにより、前記エリアに必要な配送コース数Pを算出する配送コース数算出手段、
として機能させ、
前記平均値算出手段は、前記拠点と各前記巡回ポイントとの間の往復移動時間が短い順に所定割合以内となる前記巡回ポイントのみを考慮して、それ以外の巡回ポイントは除外して、前記平均値Dを算出するプログラム。
Priority Applications (4)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN2009801385314A CN102165482A (zh) | 2008-09-29 | 2009-09-28 | 配送路线数目计算系统及配送路线数目计算方法 |
US13/121,370 US20110178944A1 (en) | 2008-09-29 | 2009-09-28 | System for calculating the number of delivery routes, and method for calculating the number of delivery routes |
JP2010530740A JP5016115B2 (ja) | 2008-09-29 | 2009-09-28 | 配送コース数算出システムおよび配送コース数算出方法 |
EP09815913A EP2333716A1 (en) | 2008-09-29 | 2009-09-28 | System for calculating the number of distribution courses and method for calculating the number of distribution courses |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP2008250023 | 2008-09-29 | ||
JP2008-250023 | 2008-09-29 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2010035494A1 true WO2010035494A1 (ja) | 2010-04-01 |
Family
ID=42059506
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/JP2009/004924 WO2010035494A1 (ja) | 2008-09-29 | 2009-09-28 | 配送コース数算出システムおよび配送コース数算出方法 |
Country Status (5)
Country | Link |
---|---|
US (1) | US20110178944A1 (ja) |
EP (1) | EP2333716A1 (ja) |
JP (1) | JP5016115B2 (ja) |
CN (1) | CN102165482A (ja) |
WO (1) | WO2010035494A1 (ja) |
Families Citing this family (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN105447995B (zh) * | 2014-08-27 | 2018-05-15 | 日立金融设备系统(深圳)有限公司 | 装填现金自动计划装置及方法 |
US10467563B1 (en) | 2019-02-18 | 2019-11-05 | Coupang, Corp. | Systems and methods for computerized balanced delivery route pre-assignment |
US10467562B1 (en) * | 2019-02-18 | 2019-11-05 | Coupang, Corp. | Systems and methods for computerized balanced delivery route assignment |
CN110851755B (zh) * | 2019-09-29 | 2022-11-11 | 口碑(上海)信息技术有限公司 | 一种送达路径信息的获取方法、装置以及电子设备 |
Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2004127038A (ja) | 2002-10-03 | 2004-04-22 | Japan Tobacco Inc | エリア分割システム |
JP2004213068A (ja) * | 2002-12-26 | 2004-07-29 | Japan Tobacco Inc | コース作成システムおよびコース作成方法 |
JP2004213161A (ja) * | 2002-12-27 | 2004-07-29 | Japan Tobacco Inc | 配達エリアシミュレーションシステムおよびその方法とプログラム |
WO2009119040A1 (ja) * | 2008-03-28 | 2009-10-01 | 日本たばこ産業株式会社 | コース作成システムおよびコース作成方法 |
-
2009
- 2009-09-28 JP JP2010530740A patent/JP5016115B2/ja not_active Expired - Fee Related
- 2009-09-28 WO PCT/JP2009/004924 patent/WO2010035494A1/ja active Application Filing
- 2009-09-28 EP EP09815913A patent/EP2333716A1/en not_active Withdrawn
- 2009-09-28 CN CN2009801385314A patent/CN102165482A/zh active Pending
- 2009-09-28 US US13/121,370 patent/US20110178944A1/en not_active Abandoned
Patent Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2004127038A (ja) | 2002-10-03 | 2004-04-22 | Japan Tobacco Inc | エリア分割システム |
JP2004213068A (ja) * | 2002-12-26 | 2004-07-29 | Japan Tobacco Inc | コース作成システムおよびコース作成方法 |
JP2004213161A (ja) * | 2002-12-27 | 2004-07-29 | Japan Tobacco Inc | 配達エリアシミュレーションシステムおよびその方法とプログラム |
WO2009119040A1 (ja) * | 2008-03-28 | 2009-10-01 | 日本たばこ産業株式会社 | コース作成システムおよびコース作成方法 |
Also Published As
Publication number | Publication date |
---|---|
EP2333716A1 (en) | 2011-06-15 |
CN102165482A (zh) | 2011-08-24 |
US20110178944A1 (en) | 2011-07-21 |
JP5016115B2 (ja) | 2012-09-05 |
JPWO2010035494A1 (ja) | 2012-02-16 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Ghosh et al. | Dynamic repositioning to reduce lost demand in bike sharing systems | |
Archetti et al. | Chapter 10: Vehicle routing problems with profits | |
JP5044699B2 (ja) | 配送方式決定支援システム、コース作成システム、配送方式決定支援方法、およびコース作成方法 | |
Feng et al. | Perishable asset revenue management with Markovian time dependent demand intensities | |
CN110046749B (zh) | 一种基于实时路况的电商包裹与同城o2o包裹共同配送系统 | |
CN109074620A (zh) | 配送计划制定系统和配送计划制定方法 | |
KR102664364B1 (ko) | 배송 과정을 지원하는 시스템 | |
US20150339595A1 (en) | Method and system for balancing rental fleet of movable asset | |
JP6082074B1 (ja) | 配車方法及び配車システム | |
JP5016115B2 (ja) | 配送コース数算出システムおよび配送コース数算出方法 | |
CN111260164A (zh) | 一种运力调度方法以及装置 | |
WO2009119040A1 (ja) | コース作成システムおよびコース作成方法 | |
JP5625160B2 (ja) | シティサイクルシステムの運営方法 | |
Xue et al. | Order acceptance and scheduling in the instant delivery system | |
JP2017167757A (ja) | 配送計画システム、配送計画方法及びプログラム | |
CN111489214A (zh) | 订单分配方法、条件设置方法、装置及电子设备 | |
JP5155081B2 (ja) | 巡回ポイント分類システムおよび巡回ポイント分類方法 | |
Jalilipour Alishah et al. | Inventory fulfillment strategies for an omni-channel retailer | |
JP4610161B2 (ja) | コース作成システムおよびコース作成方法 | |
WO2013114883A1 (ja) | フライトプラン作成装置 | |
Li et al. | Integrated production and distribution schedule problem with a perishable product | |
Klapp | Dynamic optimization for same-day delivery operations | |
WO2004071910A1 (ja) | コース作成システム | |
Cavagnini | Stochastic programming models for distribution logistics, bikesharing and production management | |
JPH09134391A (ja) | Lpガス配送システム |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
WWE | Wipo information: entry into national phase |
Ref document number: 200980138531.4 Country of ref document: CN |
|
121 | Ep: the epo has been informed by wipo that ep was designated in this application |
Ref document number: 09815913 Country of ref document: EP Kind code of ref document: A1 |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2010530740 Country of ref document: JP |
|
WWE | Wipo information: entry into national phase |
Ref document number: 13121370 Country of ref document: US |
|
NENP | Non-entry into the national phase |
Ref country code: DE |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2009815913 Country of ref document: EP |