WO2013183294A1 - 配送エリア管理方法 - Google Patents
配送エリア管理方法 Download PDFInfo
- Publication number
- WO2013183294A1 WO2013183294A1 PCT/JP2013/003541 JP2013003541W WO2013183294A1 WO 2013183294 A1 WO2013183294 A1 WO 2013183294A1 JP 2013003541 W JP2013003541 W JP 2013003541W WO 2013183294 A1 WO2013183294 A1 WO 2013183294A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- delivery
- data
- person
- total
- deliverable
- Prior art date
Links
- 238000012384 transportation and delivery Methods 0.000 title claims abstract description 842
- 238000007726 management method Methods 0.000 title claims abstract description 42
- 238000013500 data storage Methods 0.000 claims description 67
- 238000000034 method Methods 0.000 claims description 26
- 238000009826 distribution Methods 0.000 claims description 23
- 239000000284 extract Substances 0.000 claims description 12
- 238000003860 storage Methods 0.000 claims description 10
- 230000008569 process Effects 0.000 description 18
- 238000012545 processing Methods 0.000 description 8
- 230000015556 catabolic process Effects 0.000 description 6
- 238000010586 diagram Methods 0.000 description 4
- 238000004364 calculation method Methods 0.000 description 3
- 238000004891 communication Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 230000008676 import Effects 0.000 description 2
- 238000004519 manufacturing process Methods 0.000 description 2
- 235000013361 beverage Nutrition 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000012790 confirmation Methods 0.000 description 1
- 238000012217 deletion Methods 0.000 description 1
- 230000037430 deletion Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000007689 inspection Methods 0.000 description 1
- 238000009434 installation Methods 0.000 description 1
- 239000003208 petroleum Substances 0.000 description 1
- 239000003209 petroleum derivative Substances 0.000 description 1
- 238000002360 preparation method Methods 0.000 description 1
- 230000009467 reduction Effects 0.000 description 1
- 238000007670 refining Methods 0.000 description 1
- 230000004044 response Effects 0.000 description 1
- 238000012552 review Methods 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
- G06Q10/00—Administration; Management
- G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q10/083—Shipping
- G06Q10/0834—Choice of carriers
-
- 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/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06311—Scheduling, planning or task assignment for a person or group
-
- 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/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06311—Scheduling, planning or task assignment for a person or group
- G06Q10/063116—Schedule adjustment for a person or group
-
- 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
-
- 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
-
- 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
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/06—Energy or water supply
Definitions
- the present invention relates to a delivery area management method for a liquefied petroleum (LP) gas cylinder. More specifically, the present invention relates to a delivery area management method for LP gas cylinders that is assigned to each delivery person in charge of delivery by grouping delivery areas managed by a delivery base.
- LP liquefied petroleum
- LP gas supply can be divided into imports from gas producing countries and domestic production by-produced in the production process of petroleum products.
- the import base that stores LP gas transported by tankers from gas producing countries and the oil refining base are called primary bases.
- LP gas is loaded from a primary base into a coastal ship or tank truck and shipped to a secondary base that is a relay base for transporting LP gas on the coast or inland.
- LP gas transported to the secondary base is transported to LP gas filling stations in various places, packed in LP gas cylinders at the filling stations, and delivered to homes and factories.
- a delivery area is set for each filling station serving as a delivery base.
- an administrator of a delivery base divides a delivery area into fixed subareas and assigns a delivery person in charge of the subarea to each subarea.
- the timing of delivering LP gas cylinders to customers (such as homes or factories) existing in the delivery area is determined based on the past gas consumption results, meter reading data, cylinder delivery results, etc. of each customer. It is determined by predicting the amount of gas.
- Patent Document 1 discloses a technology for setting a delivery schedule date by subtracting the number of days for ensuring safety for preventing gas shortage calculated based on the average daily usage of each customer for the current month from the gas deadline scheduled date. ing. With such a technique, it is possible to reduce the residual gas amount of the gas cylinder to be replaced while reducing the gas exhaustion rate.
- LP gas cylinders are composed of one line only on the use side and one composed of two lines on the use side and the spare side. In the two lines of LP gas cylinders, even if the LP gas on the use side is consumed, the LP gas is provided from the line on the backup side.
- a certain number of delivery personnel belong to each delivery base.
- the manager of the delivery base divides the delivery area into fixed subareas and assigns a delivery person in charge of the subarea to each subarea. For example, when a total of five delivery personnel 1, 2, 3, 4, 5 belong to the delivery base A, the administrator assigns the delivery area to five sub-areas a, b, c, d, e.
- the delivery person 1 is assigned to the sub area a
- the delivery person 2 is assigned to the sub area b
- the delivery person 5 is assigned to the sub area e.
- the delivery area management method provides a delivery base code for identifying a delivery base to which a delivery person belongs, a delivery person code for identifying a delivery person, and a delivery person can deliver a day.
- a delivery data storage unit for storing a rank indicating the number of gas cylinders and an excess allocation coefficient, and a delivery data storage for storing a delivery base code for uniquely identifying a delivery base, a customer ID, a zip code, a scheduled delivery date, and the number of exchanges
- a delivery area management system comprising: a delivery area management system for assigning delivery data indicating that a gas cylinder should be delivered to a delivery person on a predetermined delivery scheduled date at a specific delivery base, wherein the delivery area management system obtains data Delivery means belonging to the specific delivery base from the delivery person data storage unit based on a delivery base code for identifying the specific delivery base
- a step of extracting data and a step of acquiring the number of deliverables and the number of deliverables of each delivery person based on the extracted delivery person data, wherein the data obtaining means is the delivery data
- the data acquisition means calculates the total number of deliverables and the total number that can be exceeded at the specific delivery base, wherein the total number of deliverables is the deliverable of each delivery person
- the area management according to the delivery capability of the delivery person can be performed by dividing the delivery area of the delivery base into sub-areas according to the rank of the delivery person.
- Such area management can solve the conventional problem that the delivery of the gas cylinder is biased to a specific sub-area.
- secondary problems such as unsatisfied delivery schedules caused by exceeding the delivery capacity of delivery personnel can be solved, and the amount of work between subareas is different. Secondary problems such as dissatisfaction of delivery persons that have occurred can also be solved.
- the delivery area of the delivery base is divided into sub-areas, so that the sub-area can be determined in consideration of load distribution within the area.
- area management it is possible to solve the conventional problem of how to allocate the sub-areas that are handled by the holiday delivery personnel.
- secondary problems such as the inability to take free leave due to the influence of the delivery person's leave can be solved.
- FIG. 9A It is a figure which shows an example of the information stored in the delivery data storage part which concerns on one Embodiment of this invention. It is a figure which shows an example of the information stored in the vacation data storage part which concerns on one Embodiment of this invention. It is a figure which shows the relationship between FIG. 9A and FIG. 9B. It is a flowchart which shows the process which groups the delivery area which concerns on one Embodiment of this invention, and assigns it to a delivery person. It is a flowchart which shows the process which groups the delivery area which concerns on one Embodiment of this invention, and assigns it to a delivery person.
- FIG. 1 is a diagram showing a network configuration according to an embodiment of the present invention.
- a delivery server 101 installed in the head office has a plurality of client computers 103a, 103b,..., 103n (installed in a delivery center that manages delivery of each delivery base through the network 102 in a unified manner.
- client computers 103a, 103b,..., 103n installed in a delivery center that manages delivery of each delivery base through the network 102 in a unified manner.
- the delivery server 101 is configured to communicate with a plurality of mobile terminals 105 a, 105 b,..., 105 n (hereinafter referred to as mobile terminals 105) via the network 104.
- mobile terminals 105 a plurality of mobile terminals 105 a, 105 b,..., 105 n
- the mobile terminal 105 is connected to a plurality of car navigation systems 106a, 106b,..., 106n (hereinafter referred to as a car navigation system 106) mounted on a delivery vehicle via a short-range wireless communication technology (for example, Bluetooth (registered trademark)).
- a short-range wireless communication technology for example, Bluetooth (registered trademark)
- the delivery server 101 generates the delivery data for each delivery base by adding the data of the gas cylinders to be delivered from the delivery base the next day and the data of the gas cylinders that should have been delivered today but could not be delivered. Thereafter, the delivery server 101 assigns the generated delivery data to each delivery person belonging to the delivery base, and generates delivery data for each delivery person.
- the delivery server 101 also transmits delivery data for each delivery person corresponding to the delivery person via the network 104 in response to a delivery data request from the delivery person's mobile terminal 105. Further, the delivery server 101 receives delivery work data or delivery residual data from the delivery person from the mobile terminal 105, and updates the storage unit of the delivery server 101 using the received data.
- the client computer 103 is a terminal used by a delivery center user.
- the user connects to the delivery server 101 via the client computer 103, and performs delivery work exclusively, such as confirmation of delivery status and instructions for creating delivery data.
- the client computer 103 is installed in the distribution center, but it can be installed in the head office as well as the distribution server 101, or can be arranged in the distribution base.
- the mobile terminal 105 is a terminal owned by each delivery person at the delivery base.
- the delivery person connects to the delivery server 101 via the mobile terminal 105 and transmits a delivery data request.
- the delivery person transmits the address data (postal code, address, latitude / longitude information, etc.) of the customer included in the delivery data from the mobile terminal 105 to the car navigation system 106.
- the car navigation system 106 is mounted on a delivery vehicle and used by delivery personnel.
- a plurality of corresponding points can be recognized and used as data for supporting delivery of the delivery person.
- the user of the delivery center connects to the delivery server 101 via the client computer 103 and sends a delivery data creation instruction.
- the delivery server 101 predicts the remaining amount of the gas cylinder based on the customer's data (past gas consumption record, meter reading data, cylinder delivery record) for the customer under the jurisdiction of each delivery base.
- the next scheduled delivery date is determined (S201).
- the delivery server 101 has not been able to deliver the customer data (customer ID, number of gas cylinders, address data, etc.) that is scheduled to be delivered next day, and the delivery data that should have been delivered today.
- the data (customer ID, number of gas cylinders, address data, etc.) are added together to generate delivery data for each delivery base (S202).
- the generated delivery data is stored in the delivery server 101 for a certain period, and based on the delivery work data transmitted from the mobile terminal 105, it can be managed that the delivery by the delivery person is completed.
- the delivery server 101 assigns the delivery data generated for each delivery base to delivery persons belonging to the delivery base, and generates delivery data for each delivery person (S203).
- the delivery server 101 extracts delivery person data belonging to the base, and assigns delivery data based on a predetermined standard.
- preparation for responding to the delivery data request from the mobile terminal 105 is completed.
- the delivery server 101 can send a message to that effect to the mobile terminal 105.
- the delivery server 101 When the delivery person connects to the delivery server 101 via the mobile terminal 105 owned by the delivery person and transmits a delivery data request, the delivery server 101 performs an authentication process for confirming the identification information of the delivery person. Thereafter, the delivery server 101 transmits delivery data by delivery person corresponding to the authenticated delivery person to the mobile terminal 105 (S204).
- the delivery person transmits the customer address data (such as zip code, address, and latitude / longitude information) included in the delivery data for each delivery person from the mobile terminal 105 to the car navigation system 106 ( S205).
- the car navigation system 106 receives the address data from the mobile terminal 105, the car navigation system 106 can recognize a plurality of corresponding points and determine a standard delivery route that passes through the plurality of points.
- the delivery person delivers to the customer based on the delivery data for each delivery person with the assistance of the car navigation system 106.
- the delivery person At the time of delivery, the delivery person generates delivery work data via the mobile terminal 105 and transmits it to the delivery server 101 (S206).
- the delivery work data includes the customer ID and the container barcode of the replaced gas cylinder.
- the container barcode can be read by using the barcode reader function of the mobile terminal 105.
- the delivery person can perform additional operations such as gas meter guidelines and inspection of gas supply equipment in addition to replacing the gas cylinder. In this case, the delivery person can generate delivery work data including additional work data via the mobile terminal 105 and transmit the delivery work data to the delivery server 101.
- the delivery server 101 When the delivery server 101 receives the delivery work data, the delivery server 101 sets the delivery data, which has been delivered by the delivery person, to delivered based on the received delivery work data (S207). When the delivery work data includes additional work data, the delivery server 101 updates the storage unit included in the delivery server 101 using the additional work data.
- the delivery person If some of the customers included in the delivery data for each delivery person cannot be delivered during the day, the delivery person generates the delivery residual data via the mobile terminal 105 and sends it to the delivery server 101. Transmit (S208).
- the undelivered data can be configured to include a customer ID that could not be delivered.
- the delivery server 101 Upon receiving the remaining delivery data, the delivery server 101 updates the delivery data stored in S202 based on the received remaining delivery data (S209).
- the delivery residual data includes a customer ID that could not be delivered
- the customer ID included in the delivery residual data in the delivery data is set as undelivered using this customer ID.
- undelivered data can be created the next day in S202.
- the configuration of the delivery server 101 described above will be described in detail with reference to the block diagram of FIG. In FIG. 3, only a necessary functional configuration is shown assuming a single computer system, but the delivery server 101 may be configured as a part of a multi-functional distributed system including a plurality of computer systems. .
- a RAM 303 In the delivery server 101, a RAM 303, an input device 304, an output device 305, a communication control device 306, and a storage device 307 including a nonvolatile storage medium (ROM, HDD, etc.) are connected to a CPU 301 via a system bus 302. It has a configuration.
- the storage device 307 includes a program storage area for storing a software program for performing the above-described functions, and a data storage area for storing data acquired at any time, data as a processing result, and the like.
- Each means in the program storage area described below is actually an independent software program, its routines, components, and the like, which are called from the storage device 307 by the CPU 301 and expanded in the work area of the RAM 303 while appropriately referring to the database and the like. Each function is performed by being executed sequentially.
- the data storage area includes a delivery person data storage unit 311, an area data storage unit 312, a customer data storage unit 313, a delivery data storage unit 314, and a vacation data storage unit 315.
- Each is a certain storage area secured in the storage device 307.
- the delivery person data storage unit 311 stores information on delivery persons.
- the delivery person data storage unit 311 has a delivery base code for identifying a delivery base to which the delivery person belongs, a delivery person code for identifying the delivery person, a name, a rank, and an overallocation.
- the rank represents the number of gas cylinders that a delivery person can deliver per day.
- the excess allocation coefficient is a coefficient used to allocate an excess to each delivery person when the number of gas cylinders contained in the delivery data of the delivery base exceeds the total rank of delivery persons belonging to the delivery base.
- the area data storage unit 312 stores information related to the delivery area.
- the area data storage unit 312 stores a zip code, a delivery base code, and an area name, and identifies a delivery base that has jurisdiction over the area identified by the zip code.
- a zip code is used as the minimum unit for identifying an area.
- a unique identifier may be assigned to other units (city, ward, town, etc.) for management.
- the delivery personnel to which it belongs may be divided into several groups and managed.
- the delivery base that controls the area identified by the zip code is specified.
- the group that controls the area identified by the zip code is specified. Can be identified.
- the customer data storage unit 313 stores information about customers.
- the customer data storage unit 313 stores a customer ID, name, zip code, address, scheduled delivery date, number of installations, delivery base code, latitude, and longitude that uniquely identify the customer. including.
- the scheduled delivery date the scheduled delivery date determined in step S201 of FIG. 2 is stored.
- the delivery base code the delivery base code in the area data storage unit 312 is stored, and the delivery base having jurisdiction over the area identified by the customer's zip code is specified.
- the delivery data storage unit 314 stores information related to delivery. As shown in FIG. 7, the delivery data storage unit 314 has a slip ID for uniquely identifying a delivery slip, a delivery base code, a customer ID, a zip code, an address, a scheduled delivery date, the number of replacements, and delivery by a delivery person. A delivery completion flag (“0” if not delivered, “1” if delivered) indicating whether or not completed is included. For the delivery target customer, the customer ID, postal code, address, scheduled delivery date, number of exchanges (number of customer data storage unit 313 installed), and delivery base code are acquired from the customer data storage unit 313 for the customer to be delivered. Stored.
- the vacation data storage unit 315 stores information on the delivery person's vacation.
- the vacation data storage unit 315 has a delivery base code, a delivery person code, a date, and a vacation type (“0” for all holidays, “1” for half holidays). )including.
- the vacation data storage unit 315 can acquire and set the delivery person's vacation information from another server having attendance management data, for example.
- the software programs stored in the program storage area are only those related to the present invention, and the data acquisition unit 316, the number allocation unit 317, the postponed delivery data selection unit 318, the delivery data allocation unit 319, and the vacation management unit 320 are listed. It has.
- the data acquisition unit 316 acquires predetermined data from the storage unit of the data storage area. First, based on the delivery base code, the delivery person data belonging to the delivery base is extracted from the delivery person data storage unit 311. When the delivery person data is extracted, the data obtaining unit 316 obtains the number of deliverables and the number that can be exceeded by the delivery person. When the number of deliverables and the number that can be exceeded are acquired for the extracted delivery personnel, the total number of deliverables and the total number that can be exceeded are calculated. In addition, the data acquisition unit 316 searches the delivery data storage unit 314 using the delivery base code and the scheduled delivery date, extracts delivery data to be delivered by the delivery base on the next day, and calculates the total number of delivery of the delivery data. get.
- the number allocation means 317 allocates the number of deliveries to the delivery person according to a predetermined calculation formula.
- the total number of deliverables acquired by the data acquisition unit 316 is compared with the total number of deliveries, and the total number of deliveries is equal to or less than the total number of deliverables, and the total number of deliveries is greater than the total number of deliverables. Different allocation processing is performed depending on the case.
- the postponed delivery data selection means 318 selects postponed delivery data for postponing the next day delivery from the delivery data when the total number of deliveries is greater than the total number of deliverers assigned.
- null indicating a null value is set in the delivery completion flag of the delivery data storage unit corresponding to the selected postponed delivery data.
- Delivery data assigning means 319 assigns delivery data to the delivery person.
- the delivery data allocation unit 319 sorts the delivery data extracted by the data acquisition unit and to be delivered by the delivery base on the next day based on the postal code of the delivery data. Then, the delivery data assigning means 319 assigns the sorted delivery data to the delivery person based on the assigned number of delivery persons assigned by the number assignment means 317.
- the vacation management means 320 searches the vacation data storage unit 315 using the delivery base code and the delivery person code, and extracts the vacation data of the delivery person scheduled for the next day vacation.
- the vacation management means 320 determines the vacation type of the extracted vacation data and performs a predetermined process according to the vacation type.
- the vacation management means 320 deletes the delivery person data of the delivery person identified by the delivery person code included in the vacation data from the delivery person data extracted by the data acquisition means 316.
- the vacation management unit 320 temporarily determines the rank of the delivery person data of the delivery person identified by the delivery person code included in the vacation data in the delivery person data extracted by the data acquisition means 316. Halved.
- the delivery data allocation process according to the embodiment shown in step S203 of FIG. 2 will be described in detail.
- the postal codes 1234001 to 1234020 have jurisdiction as delivery areas, and it is assumed that a total of five persons, delivery persons A, B, C, D, and E, belong.
- delivery data including 100 gas cylinders as shown in FIG.
- the data acquisition unit 316 of the delivery server 101 extracts delivery person data belonging to the delivery base from the delivery person data storage unit 311 based on the delivery base code for identifying the delivery base (S901).
- the delivery person data of the delivery persons A, B, C, D, and E is extracted from the delivery person data storage unit 311.
- the data acquisition unit 316 acquires the deliverable number and the excess number of delivery persons (S902).
- the number of deliverables of the delivery person is indicated by the rank included in the delivery person data.
- the number of deliverables A, B, C, D, and E that can be exceeded is 6, 4, 4, 4, and 2, respectively.
- the data acquisition unit 316 calculates the total number of deliverables and the total number that can be exceeded at the delivery base (S903).
- the ranks included in the delivery person data of delivery persons A, B, C, D, and E are added to calculate 100 as the total number of deliverables, and the number of delivery persons that can be exceeded calculated in S902 As a result, 20 are calculated as the total number that can be exceeded.
- the data acquisition unit 316 searches the delivery data storage unit 314 using the delivery base code, extracts delivery data to be delivered by the delivery base on the next day, and adds the number of exchanges of the delivery data to be added.
- the total number is acquired (S904). In this embodiment, it is assumed that the processing is executed on April 1, 2012, and the delivery base X is 100 based on the delivery base code (18) as the total number of deliveries to be delivered on April 2, 2012. Is acquired.
- the number allocation means 317 of the delivery server 101 compares the total number of deliverables acquired in step S903 with the total number of deliveries acquired in step S904 (S905). If the total number of deliverables is equal to or less than the total deliverable number, the process proceeds to step S906. If the total number of deliverables is greater than the total deliverable number, the process proceeds to step S907. In the present embodiment, since the total number of deliveries is 100 and the total deliverable number is also 100, the process proceeds to step S906.
- step S906 the number allocation unit 317 allocates the number of deliveries to the delivery person according to the following calculation formula.
- Number of allotted items total number of deliveries ⁇ total number of deliverables ⁇ number of deliverables of delivery personnel Formula 2
- the total number of deliveries (100) divided by the total number of deliverables (100) x the deliverable number of deliverers, and the deliverers are assigned the same number as their ranks.
- the number of deliverers equal to or less than their rank is assigned to the delivery personnel. If the number of allocations does not become an integer value, rounding up processing is performed to obtain an integer value.
- step S907 the number assignment unit 317 assigns a provisional delivery number to the delivery person according to the following calculation formula.
- Temporary allocation number (Total number of delivery-Total number of deliverables) / Total number that can be exceeded x Number of deliverers that can be exceeded + Number of deliverers that can be delivered Formula 3
- the number allocation means 317 compares the provisional allocation number with the number of deliverers that can be exceeded + the number that can be delivered (S908). If the provisionally allocated number is larger than the number of deliverable excesses + the number of deliverables, the number of assignments is set to the number of deliverable excesses + the number of deliverables (S909). If the temporary allocation number is equal to or less than the number of deliverers that can be exceeded plus the number of deliverables, the allocation number is equal to the temporary allocation number (S910).
- the postponed delivery data selection means 318 of the delivery server 101 compares the total number of deliveries with the total number of deliverers assigned (S911). If the total number of deliveries is greater than the total number of deliverers assigned, postponed delivery data for postponing the next day delivery can be selected from the delivery data (S912). In the present embodiment, the postponed delivery data selection means 318 sets null indicating a null value in the delivered flag of the delivery data storage unit 314 corresponding to the selected postponed delivery data.
- the customer data storage unit 313 and the delivery data storage unit 314 store a flag (not shown) indicating whether or not there are two gas cylinders installed by the customer. Can be selected as postponed delivery data.
- the remaining amount of the gas cylinder predicted in step S201 in FIG. 2 is stored in the customer data storage unit 313 and the delivery data storage unit 314, and the customer data with a large estimated remaining amount of the gas cylinder is postponed. It can also be selected as data.
- deferred delivery data may be selected according to other criteria (such as the next scheduled delivery date) or a combination of these.
- the delivery data allocation unit 319 of the delivery server 101 sorts the delivery data extracted by the data acquisition unit 316 based on the zip code of the delivery data (S913). By assigning delivery data sorted in this way to delivery persons, customers who are close together geographically can be assigned to each delivery person.
- the delivery data assigning means 319 assigns the sorted delivery data to the delivery person based on the assigned number of delivery persons (S914). It should be noted that the delivery person is not assigned to the postponed delivery data by skipping the data for which the delivery flag is set to null and making the assignment.
- FIGS. 10A to 10D show the relationship between the breakdown of the total number of deliveries for each zip code and the delivery personnel assigned to the delivery area identified by the zip code in this embodiment.
- FIG. 10A shows an example in which the total number of deliveries is evenly distributed over the delivery areas of each zip code.
- FIG. 10B shows an example in which the total number of deliveries is scattered in the delivery area of the delivery base.
- subarea a (poster 123A is responsible for postal codes 1234001 to 1234006) and subarea b (poster 123B is responsible for postal codes 1234007 to 1234010).
- Subarea c from postal code 1234011 to 1234014 (in charge of delivery person C), subarea d from postal code 1234015 to 1234018 (in charge of delivery person D), subarea e from postal code 1234019 to 1234020 (delivery person) E is responsible).
- the delivery areas of the delivery bases are subarea a (poster 123A) in charge of postal codes 1234001 to 1234008 and subarea b (poster of postal code 1234009 to 1234010) ), Subarea c from postal codes 1234011 to 1234012 (in charge of delivery person C), subarea d from postal codes 1234013 to 1234019 (in charge of delivery person D), subarea e of postal code 1234020 (delivery person E in charge) ).
- the delivery area of the delivery base X is sub-area a (delivered by delivery person A) from zip code 1234001 to 1234006, sub-area b (post-delivery person) from zip code 1234007 to 1234010, regardless of the total number of deliveries.
- subarea c from postal codes 1234011 to 1234014 (responsible for deliveryman C), subarea d from postal codes 1234015 to 1234018 (responsible for deliveryman D), subarea e of postal codes 1234019 to 1234020 It is assumed that it is divided into sub-areas (with delivery person E in charge).
- the delivery staff A (rank 30), B (rank 20), C (rank 20), D (rank 20), and E (rank 10) are respectively 15, 35, 27, 13, 10 and 10 respectively. Will face the various challenges described above.
- the present invention it is possible to perform area management according to the delivery capability of the delivery person by dividing the delivery area of the delivery base into sub-areas according to the rank of the delivery person.
- Such area management can solve the conventional problem that the delivery of the gas cylinder is biased to a specific sub-area.
- secondary problems such as unsuccessful delivery schedules caused by exceeding the delivery capability of the delivery person.
- secondary problems such as dissatisfaction of delivery persons caused by the difference in work volume between sub-areas can be solved.
- the delivery base X has the postal code 1234001 to 1234020 as the delivery area, and a total of five persons A, B, C, D, E Shall belong. Further, it is assumed that delivery data including 100 gas cylinders as shown in FIG. 7 is generated as delivery data for the next day (April 2, 2012) of the delivery base X. Here, in this embodiment, the delivery person A is scheduled to take a full rest on the next day. In the following description, the same parts as those in the first embodiment are omitted.
- the data acquisition unit 316 extracts the delivery person data of delivery persons A, B, C, D, and E from the delivery person data storage unit 311 based on the delivery place code (18) for identifying the delivery place X (S901). .
- the vacation management unit 320 searches the vacation data storage unit 315 using the delivery base code, and extracts the vacation data of the delivery person scheduled for vacation the next day (S1101). In the present embodiment, the leave data of the delivery person A is extracted.
- the vacation management means 320 determines whether or not vacation data exists (S1102). If vacation data exists, the process proceeds to step S1103. If there is no vacation data, the process proceeds to step S902. In the present embodiment, the process proceeds to step S1103.
- step S1103 the vacation management unit 320 determines the vacation type of the extracted vacation data, and proceeds to step S1104 if it indicates a full vacation, and proceeds to step S1105 if it is a value indicating a half vacation.
- step S1104 the vacation manager 320 deletes the delivery person data of the delivery person identified by the delivery person code included in the vacation data from the delivery person data extracted in step S901. In the present embodiment, the delivery person data of the delivery person A identified by the delivery person code (3) included in the vacation data is deleted.
- step S1105 the vacation manager 320 temporarily halves the rank of the delivery person data of the delivery person identified by the delivery person code included in the vacation data in the delivery person data extracted in step S1101. For example, when the delivery person A having rank 30 takes a half-off, this rank is temporarily set to 15.
- steps S1103 to 1105 are performed for each vacation data. It should be noted that the deletion of the delivery person data and the halving of the rank in steps S1104 and 1105 are not performed permanently on the delivery person data storage unit 311 but are acquired from the delivery person data storage unit 311 and expanded in the RAM 303. Processing performed on data.
- step S902 the data acquisition unit 316 acquires the number of deliverables and the number that can be exceeded using the ranks of the delivery person data determined through the above steps.
- the data acquisition unit 316 calculates the total number of deliveries and the total number of deliverables at the delivery base (S903).
- the data acquisition unit 316 searches the delivery data storage unit 314 using the delivery base code (18), and acquires 100 as the total number of deliveries that the delivery base should deliver on the next day (S904).
- the number allocation unit 317 compares the total number of deliverables (70) calculated in step S903 with the total number of deliveries (100) acquired in step S904 (S905), and proceeds to step S907.
- step S907 the number allocation means 317 allocates the temporary allocation numbers 29, 29, 29, and 15 to the delivery personnel B, C, D, and E, respectively. Subsequently, the number allocation unit 317 compares the provisional allocation number with the number of deliverers that can be exceeded + the number of deliverables (S908), and since the number of provisional allocations is large, the process proceeds to S909 and the delivery personnel B, C, D, 24, 24, 24, and 12 are allocated to E, respectively.
- the postponed delivery data selection means 318 compares the total number of deliveries (100) with the total number of deliverers assigned (84) (S911), and since the total number of deliveries is large, the process proceeds to S912. Select postponed delivery data to postpone delivery the next day.
- the postponed delivery data selection means 318 sets null indicating a null value in the delivery completed flag of the delivery data storage unit 314 corresponding to the selected postponed delivery data.
- the delivery data allocation unit 319 sorts the delivery data extracted by the data acquisition unit 316 in step S904 to be delivered the next day based on the postal code of the delivery data (S913). Finally, the delivery data assigning means 319 assigns the sorted delivery data to the delivery person based on the number of delivery persons assigned (S914). Note that data with nll set in the delivered flag is skipped and assigned.
- FIG. 10C shows the relationship between the breakdown of the total number of deliveries for each zip code and the courier assigned to the delivery area identified by the zip code in the second embodiment.
- the delivery area of the delivery base is sub-area a (poster B is responsible) for postal codes 1234001 to 1234006, and subarea b (delivery) for postal codes 1234007 to 1234012 Clerk C), sub-area c of postal codes 1234013 to 1234017 (deliverer D), and subarea d of postal codes 1234018 to 1234020 (deliverer E).
- the sub-area (postal code 1234001) in charge of delivery person A is assigned. ⁇ 1234006), there arises a problem of how to allocate the 30 pieces of delivery data to be delivered. For example, if all are assigned to a delivery person B who is in charge of a neighboring sub-area, the number of delivery persons B assigned is 50, which greatly exceeds the delivery capacity of the delivery person B. Further, if all of the portion handled by the delivery person A is postponed from the next day, the allocation number of the delivery person A on the postponement date is highly likely to greatly exceed the delivery ability of the delivery person A.
- the sub-areas can be determined while considering the load distribution within the area.
- area management it is possible to solve the conventional problem of how to assign the sub-areas that are handled by the holiday delivery personnel.
- secondary problems such as the inability to take free leave due to the influence of the delivery person's leave can be solved.
- the delivery base X has the postal code 1234001-1234020 as the delivery area, and a total of five people, delivery personnel A, B, C, D, and E. Shall belong. Further, it is assumed that delivery data including 100 gas cylinders as shown in FIG. 7 is generated as delivery data for the next day (April 2, 2012) of the delivery base X.
- the delivery person data storage unit 311 further stores the distribution order in addition to the data shown in FIG. The distribution order indicates the order in which the delivery data is assigned to the delivery person belonging to the delivery base.
- the delivery server 101 performs processing according to the flowcharts of FIGS. 9A and 9B.
- step S906 as in the first embodiment, 30, 20, 20, 20, and 10 are assigned to the deliverers A, B, C, D, and E, respectively.
- step S913 when the delivery data assigning means 319 assigns delivery data to a delivery person (S914), in this embodiment, delivery person A, B, C, D, E as of April 1, 2012. 1, 2, 3, 4, and 5 are set in the distribution order. Further, it is assumed that the total number of deliveries is evenly distributed over the delivery areas of the respective postal codes as shown in FIG. 10A.
- the delivery data assigning means 319 sorts delivery person data using the delivery person's distribution order, and assigns delivery data to the delivery person in descending order of the distribution order. The result of the assignment is as shown in FIG. 10A.
- the delivery data allocation unit 319 updates the distribution order of the delivery person data storage unit 311.
- the distribution order of the delivery person who is the first in the distribution order is made the lowest, and the distribution order of other delivery persons is decremented by one.
- delivery data including 100 gas cylinders is generated as delivery data for the next day (April 3, 2012) of delivery base X on April 2, 2012. .
- the delivery server 101 performs processing according to the flowcharts of FIGS. 9A and 9B.
- step S906 as in the first embodiment, 30, 20, 20, 20, and 10 are assigned to the deliverers A, B, C, D, and E, respectively.
- step S913 when the delivery data assigning means 319 assigns delivery data to a delivery person (S914), as of April 2, 2012, the delivery order of delivery persons A, B, C, D, E is 5, 1, 2, 3, 4 are set. Further, it is assumed that the total number of deliveries is evenly distributed over the delivery areas of the respective postal codes as shown in FIG. 10D.
- delivery data is assigned to the delivery person as shown in FIG. 10D.
- the sub-area for grouping the delivery areas is dynamically changed.
- the delivery person A is always in charge of an area having a small postal code
- the delivery person E is always in charge of an area having a large postal code
- the delivery person A has no opportunity to take charge of an area having a large postal code.
- each delivery worker in addition to dynamically determining subareas, by changing the order in which delivery data is assigned to delivery personnel, each delivery worker has the opportunity to take charge of the entire delivery area of the delivery base. You will get
- each delivery person belonging to the delivery base is given an opportunity to take charge of the entire delivery area of the delivery base. be able to.
- area management it is possible to solve the conventional problem of a decrease in delivery efficiency caused by assigning a sub-area handled by a vacation delivery person to a substitute delivery person who does not understand the land.
- secondary problems such as dissatisfaction of delivery persons that may occur due to different conditions between subareas, such as the distance from the delivery base to the subarea, can be solved.
- a fixed delivery vehicle is assigned to the delivery person as shown in FIG.
- delivery vehicles can be assigned based on the delivery data assigned by implementation of the present invention. For example, a delivery vehicle having an optimum loadable number can be assigned based on the assigned number.
- a delivery vehicle having a narrow vehicle width can be assigned to a delivery person in charge of a subarea having many narrow alleys.
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Entrepreneurship & Innovation (AREA)
- Tourism & Hospitality (AREA)
- Marketing (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Development Economics (AREA)
- Educational Administration (AREA)
- Game Theory and Decision Science (AREA)
- Health & Medical Sciences (AREA)
- Public Health (AREA)
- Water Supply & Treatment (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
Description
次に、図9Aおよび図9Bのフローチャートを参照して、図2のステップS203で示される、一実施形態に係る配送データ割り当て処理を詳細に説明する。配送拠点Xでは、郵便番号1234001~1234020を配送エリアとして管轄しており、配送員A、B、C、D、Eの計5人が所属するものとする。また、配送拠点Xの翌日の配送データとして、図7に示すような、100本のガスボンベを含む配送データが生成されているものとする。
超過可能本数=(超過可能係数-1)×ランク 式1
割当本数=配送本数合計÷配送可能本数合計×配送員の配送可能本数 式2
仮割当本数=(配送本数合計-配送可能本数合計)÷超過可能本数合計×配送員の超過可能本数+配送員の配送可能本数 式3
次に、図9A、図9Bおよび図11のフローチャートを参照して、配送データ割り当て処理の第2の実施形態を説明する。第2の実施形態においても、第1の実施形態と同様、配送拠点Xでは、郵便番号1234001~1234020を配送エリアとして管轄しており、配送員A、B、C、D、Eの計5人が所属するものとする。また、配送拠点Xの翌日(2012年4月2日)の配送データとして、図7に示すような、100本のガスボンベを含む配送データが生成されているものとする。ここで、本実施形態では、配送員Aが翌日に全休をとる予定になっている。以下、第1の実施形態と同一の部分は省略して説明する。
次に、図9Aおよび図9Bのフローチャートならびに図10A乃至図10Dの図を参照して、配送データ割り当て処理の第3の実施形態を説明する。第3の実施形態においても、第1の実施形態と同様、配送拠点Xでは、郵便番号1234001~1234020を配送エリアとして管轄しており、配送員A、B、C、D、Eの計5人が所属するものとする。また、配送拠点Xの翌日(2012年4月2日)の配送データとして、図7に示すような、100本のガスボンベを含む配送データが生成されているものとする。ここで、本実施形態では、配送員データ記憶部311は、図4に示すデータに加えて、さらに配分順位を格納する。配分順位は、配送拠点に所属する配送員に配送データを割り当てる際の順序を示す。
なお、上述の実施形態では、図4に示すように配送員には固定の配送車が割り当てられている。別の実施形態では、本願発明の実施により割り当てられた配送データに基づいて、配送車を割り当てることができる。例えば、割当本数に基づいて、最適な積載可能本数を有する配送車を割り当てることができる。また、割り当てられたサブエリアに基づいて、例えば、細い路地が多いサブエリアを担当する配送員には、車幅の狭い配送車を割り当てることもできる。
Claims (6)
- 配送員が所属する配送拠点を識別する配送拠点コード、配送員を識別する配送員コード、配送員が一日に配送可能なガスボンベの本数を表すランク、超過割当係数を格納する配送員データ記憶部と、配送拠点を一意に識別する配送拠点コード、顧客ID、郵便番号、配送予定日、交換本数を格納する配送データ記憶部とを備えた配送エリア管理システムにおいて、特定の配送拠点において所定の配送予定日にガスボンベを配送すべきことを示す配送データを配送員に割り当てる方法であって、
前記配送エリア管理システムのデータ取得手段が、前記特定の配送拠点を識別する配送拠点コードに基づいて、前記配送員データ記憶部から、前記特定の配送拠点に所属する配送員データを抽出するステップと、
前記データ取得手段が、前記抽出した配送員データに基づいて、各配送員の配送可能本数および超過可能本数を取得するステップであって、前記配送可能本数は前記配送データに含まれるランクにより示され、前記超過可能本数は、第1の式
超過可能本数=(超過可能係数-1)×ランク
に従って、前記配送員データに含まれる超過可能係数およびランクを用いて計算される、ステップと、
前記データ取得手段が、前記特定の配送拠点の配送可能本数合計および超過可能本数合計を計算するステップであって、前記配送可能本数合計は、前記各配送員の配送可能本数を加算して計算され、前記超過可能本数合計は、前記各配送員の超過可能本数を加算して計算される、ステップと、
前記データ取得手段が、前記配送拠点コードおよび前記所定の配送予定日を用いて前記配送データ記憶部から配送データを抽出して、当該配送データの交換本数を加算した配送本数合計を取得するステップと、
前記配送エリア管理システムの本数割当手段が、前記配送可能本数合計と前記配送本数合計とを比較するステップと、
前記配送本数合計が前記配送可能本数合計以下である場合、前記本数割当手段が、第2の式
割当本数=配送本数合計÷配送可能本数合計×配送員の配送可能本数
に従って、前記抽出した配送員データにより識別される各配送員に、配送本数を割り当てるステップと、
前記配送本数合計が前記配送可能本数合計より多い場合、前記本数割当手段が、第3の式
仮割当本数=(配送本数合計-配送可能本数合計)÷超過可能本数合計×配送員の超過可能本数+配送員の配送可能本数
に従って、前記抽出した配送員データにより識別される各配送員に、仮の配送本数を割り当てるステップと、
前記本数割当手段が、前記仮割当本数と前記配送員の超過可能本数+配送可能本数とを比較するステップと、
前記仮割当本数が前記配送員の超過可能本数+配送可能本数より多い場合、前記本数割当手段が、前記配送員の割当本数を前記配送員の超過可能本数+配送可能本数とするステップと、
前記仮割当本数が前記配送員の超過可能本数+配送可能本数以下である場合、前記本数割当手段が、前記配送員の割当本数を前記仮割当本数とするステップと、
前記配送エリア管理システムの配送データ割当手段が、前記データ取得手段により抽出された配送データを、当該配送データの郵便番号に基づいてソートするステップと、
前記配送データ割当手段が、前記配送員の割当本数に応じて、前記配送データを配送員に割り当てるステップと
を含むことを特徴とする方法。 - 前記配送エリア管理システムは、配送拠点コード、配送員コード、休暇予定の日付示す年月日、および全休か半休かを示す休暇種別を格納する休暇データ記憶部をさらに備え、前記方法は、
前記配送エリア管理システムの休暇管理手段が、前記特定の配送拠点コードおよび前記所定の配送予定日を用いて、前記休暇データ記憶部から休暇データを抽出するステップと、
前記休暇データが存在する場合に、前記休暇管理手段が、前記抽出した休暇データの休暇種別を判定するステップと、
前記休暇種別が全休を示す場合、休暇管理手段が、前記抽出した配送員データから当該休暇データに含まれる配送員コードで識別される配送員の配送員データを削除するステップと、
前記休暇種別が半休を示す場合、休暇管理手段が、前記抽出した配送員データにおいて、当該休暇データに含まれる配送員コードで識別される配送員の配送員データのランクを半減するステップと
をさらに含むことを特徴とする請求項1に記載の方法。 - 前記配送データ記憶部は、配送員による配送が完了したか否かを示す配送済フラグをさらに格納し、
前記配送本数合計が前記配送員の割当本数合計より多い場合、前記配送エリア管理システムの延期配送データ選定手段が、前記配送データの中から配送を延期する延期配送データを選定して、当該選定した延期配送データに対応する前記配送データの配送済フラグに、空値を示すnullを設定するステップ
をさらに含むことを特徴とする請求項1に記載の方法。 - 前記配送員データ記憶部は、配送拠点に所属する配送員に配送データを割り当てる際の順序を示す配分順位をさらに格納し、
前記配送データ割当手段は、前記配分順位を用いて、前記配送データを配送員に割り当てることを特徴とする請求項1に記載の方法。 - 配送員が所属する配送拠点を識別する配送拠点コード、配送員を識別する配送員コード、配送員が一日に配送可能なガスボンベの本数を表すランク、超過割当係数を格納する配送員データ記憶部と、配送拠点を一意に識別する配送拠点コード、顧客ID、郵便番号、配送予定日、交換本数を格納する配送データ記憶部とを備えたコンピューターに、特定の配送拠点において所定の配送予定日にガスボンベを配送すべきことを示す配送データを配送員に割り当てる方法を実行させる、コンピューター実行可能命令を有するコンピューター可読記憶媒体であって、前記方法は、
前記配送エリア管理システムのデータ取得手段が、特定の配送拠点を識別する配送拠点コードに基づいて、前記配送員データ記憶部から、前記特定の配送拠点に所属する配送員データを抽出するステップと、
前記データ取得手段が、前記抽出した配送員データに基づいて、各配送員の配送可能本数および超過可能本数を取得するステップであって、前記配送可能本数は前記配送データに含まれるランクにより示され、前記超過可能本数は、第1の式
超過可能本数=(超過可能係数-1)×ランク
に従って、前記配送員データに含まれる超過可能係数およびランクを用いて計算される、ステップと、
前記データ取得手段が、前記特定の配送拠点の配送可能本数合計および超過可能本数合計を計算するステップであって、前記配送可能本数合計は、前記各配送員の配送可能本数を加算して計算され、前記超過可能本数合計は、前記各配送員の超過可能本数を加算して計算される、ステップと、
前記データ取得手段が、前記配送拠点コードおよび所定の配送予定日を用いて前記配送データ記憶部から配送データを抽出して、当該配送データの交換本数を加算した配送本数合計を取得するステップと、
前記配送エリア管理システムの本数割当手段が、前記配送可能本数合計と前記配送本数合計とを比較するステップと、
前記配送本数合計が前記配送可能本数合計以下である場合、前記本数割当手段が、第2の式
割当本数=配送本数合計÷配送可能本数合計×配送員の配送可能本数
に従って、前記抽出した配送員データにより識別される各配送員に、配送本数を割り当てるステップと、
前記配送本数合計が前記配送可能本数合計より多い場合、前記本数割当手段が、第3の式
仮割当本数=(配送本数合計-配送可能本数合計)÷超過可能本数合計×配送員の超過可能本数+配送員の配送可能本数
に従って、前記抽出した配送員データにより識別される各配送員に、仮の配送本数を割り当てるステップと、
前記本数割当手段が、前記仮割当本数と前記配送員の超過可能本数+配送可能本数とを比較するステップと、
前記仮割当本数が前記配送員の超過可能本数+配送可能本数より多い場合、前記本数割当手段が、前記配送員の割当本数を前記配送員の超過可能本数+配送可能本数とするステップと、
前記仮割当本数が前記配送員の超過可能本数+配送可能本数以下である場合、前記本数割当手段が、前記配送員の割当本数を前記仮割当本数とするステップと、
前記配送エリア管理システムの配送データ割当手段が、前記データ取得手段により抽出された配送データを、当該配送データの郵便番号に基づいてソートするステップと、
前記配送データ割当手段が、前記配送員の割当本数に応じて、前記配送データを配送員に割り当てるステップと
を含むことを特徴とするコンピューター可読記憶媒体。 - 特定の配送拠点において所定の配送予定日に配送すべきことを示す配送データを配送員に割り当てるための配送エリア管理システムであって、
配送員が所属する配送拠点を識別する配送拠点コード、配送員を識別する配送員コード、配送員が一日に配送可能なガスボンベの本数を表すランク、超過割当係数を格納する配送員データ記憶部と、
配送拠点を一意に識別する配送拠点コード、顧客ID、郵便番号、配送予定日、交換本数を格納する配送データ記憶部と、
前記特定の配送拠点を識別する配送拠点コードに基づいて、前記配送員データ記憶部から前記特定の配送拠点に所属する配送員データを抽出し、
前記配送データに含まれるランクにより示される各配送員の配送可能本数を取得し、
前記配送員データに含まれる超過可能係数およびランクを用いて、第1の式
超過可能本数=(超過可能係数-1)×ランク
に従って、各配送員の超過可能本数を計算し、
前記各配送員の配送可能本数を加算して、前記特定の配送拠点の配送可能本数合計を計算し、
前記各配送員の超過可能本数を加算して、前記特定の配送拠点の超過可能本数合計を計算し、
前記配送拠点コードおよび前記所定の配送予定日を用いて前記配送データ記憶部から配送データを抽出して、当該配送データの交換本数を加算した配送本数合計を取得する
データ取得手段と、
前記配送可能本数合計と前記配送本数合計とを比較し、
前記配送本数合計が前記配送可能本数合計以下である場合、第2の式
割当本数=配送本数合計÷配送可能本数合計×配送員の配送可能本数
に従って、前記抽出した配送員データにより識別される各配送員に、配送本数を割り当て、
前記配送本数合計が前記配送可能本数合計より多い場合、第3の式
仮割当本数=(配送本数合計-配送可能本数合計)÷超過可能本数合計×配送員の超過可能本数
に従って、前記抽出した配送員データにより識別される各配送員に、仮の配送本数を割り当て、
前記仮割当本数が前記配送員の超過可能本数+配送可能本数より多い場合、前記配送員の割当本数を前記配送員の超過可能本数+配送可能本数とし、
前記仮割当本数が前記配送員の超過可能本数+配送可能本数以下である場合、前記配送員の割当本数を前記仮割当本数とする
本数割当手段と、
前記抽出された配送データを、当該配送データの郵便番号に基づいてソートし、
前記配送員の割当本数に応じて、前記配送データを配送員に割り当てる
配送データ割当手段と
を含むことを特徴とする配送エリア管理システム。
Priority Applications (4)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US14/405,865 US20150149381A1 (en) | 2012-06-05 | 2013-06-05 | Delivery Area Management Method |
AU2013273015A AU2013273015A1 (en) | 2012-06-05 | 2013-06-05 | Delivery area management method |
CA2873147A CA2873147C (en) | 2012-06-05 | 2013-06-05 | Delivery area management method |
US15/366,976 US20170132563A1 (en) | 2012-06-05 | 2016-12-01 | Delivery Area Management Method |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP2012128090A JP5457502B2 (ja) | 2012-06-05 | 2012-06-05 | 配送エリア管理方法 |
JP2012-128090 | 2012-06-05 |
Related Child Applications (2)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US14/405,865 A-371-Of-International US20150149381A1 (en) | 2012-06-05 | 2013-06-05 | Delivery Area Management Method |
US15/366,976 Continuation US20170132563A1 (en) | 2012-06-05 | 2016-12-01 | Delivery Area Management Method |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2013183294A1 true WO2013183294A1 (ja) | 2013-12-12 |
Family
ID=49711700
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/JP2013/003541 WO2013183294A1 (ja) | 2012-06-05 | 2013-06-05 | 配送エリア管理方法 |
Country Status (5)
Country | Link |
---|---|
US (2) | US20150149381A1 (ja) |
JP (1) | JP5457502B2 (ja) |
AU (3) | AU2013273015A1 (ja) |
CA (1) | CA2873147C (ja) |
WO (1) | WO2013183294A1 (ja) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN110245864A (zh) * | 2019-06-14 | 2019-09-17 | 上海中通吉网络技术有限公司 | 快件处理方法、装置和巴枪 |
Families Citing this family (17)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP5570552B2 (ja) * | 2012-06-08 | 2014-08-13 | 日本瓦斯株式会社 | 配送予測システムおよび配送予測方法 |
JP6298917B1 (ja) * | 2017-05-09 | 2018-03-20 | 東京瓦斯株式会社 | ガス容器の交換システム、その交換プログラム、その交換装置およびその交換方法 |
CN108876232A (zh) * | 2018-03-31 | 2018-11-23 | 广东顺德科顺电子商务有限公司 | 一种气瓶配送交易系统 |
US10672277B2 (en) | 2018-04-26 | 2020-06-02 | Uatc, Llc | Systems and methods for managing space at a location for receiving assets |
JP2019219783A (ja) * | 2018-06-18 | 2019-12-26 | 株式会社エナジー・ソリューションズ | 配送計画生成システムおよびプログラム |
US11068832B1 (en) * | 2018-08-31 | 2021-07-20 | VuTrans Solutions LLC | System and method for identifying freight capacity |
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 |
US20220147926A1 (en) | 2019-03-29 | 2022-05-12 | Nippon Gas Co., Ltd. | Information processing apparatus, information processing method, and program |
US20220147932A1 (en) | 2019-03-29 | 2022-05-12 | Nippon Gas Co., Ltd. | Information processing apparatus, information processing method, and program |
US20220148103A1 (en) * | 2019-03-29 | 2022-05-12 | Nippon Gas Co., Ltd. | Information processing apparatus, information processing method, and program |
KR102308767B1 (ko) * | 2019-06-10 | 2021-10-01 | 김종완 | 배달 서비스 제공 장치 및 방법 |
US20210158288A1 (en) * | 2019-11-21 | 2021-05-27 | Coupang Corp. | Systems and methods for computerized balanced delivery route assignment and incentive structure |
KR102226115B1 (ko) * | 2020-07-03 | 2021-03-11 | 쿠팡 주식회사 | 전자 장치 및 그의 동작 방법 |
CN112309054A (zh) * | 2020-09-22 | 2021-02-02 | 中国石化集团共享服务有限公司 | 一种智能投递柜投递方法、装置及智能投递柜 |
US11443258B2 (en) * | 2020-11-26 | 2022-09-13 | Shopify Inc. | Real-time order delivery coordination between multiple merchants |
KR102652303B1 (ko) * | 2022-12-28 | 2024-03-29 | 쿠팡 주식회사 | 주문 처리 업무를 관리하는 전자 장치 및 그 방법 |
Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2001357106A (ja) * | 2000-04-14 | 2001-12-26 | Nippon Sanso Corp | ガス納入システム及び方法並びにガス容器の管理方法 |
JP2003292163A (ja) * | 2002-03-29 | 2003-10-15 | Ffc:Kk | 訪問事前通知システム、巡回型業務支援システム、事前通知方法、プログラム、記録媒体 |
JP2004021975A (ja) * | 2003-01-27 | 2004-01-22 | World:Kk | フロー管理システム、フロー管理方法、並びにコンピュータ上で動作する情報処理プログラム |
JP2004323230A (ja) * | 2003-03-03 | 2004-11-18 | Sagawa Express Co Ltd | 地域内物流コンサルティング方法及びそのプログラム |
JP2010070310A (ja) * | 2008-09-18 | 2010-04-02 | Yamaha Corp | 物流倉庫における作業者毎の集品品目数決定方法および集品品目数決定システム |
Family Cites Families (9)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2000187685A (ja) * | 1998-12-22 | 2000-07-04 | Casio Comput Co Ltd | デ―タ処理装置およびそのプログラム記録媒体 |
JP2002220119A (ja) * | 2001-01-24 | 2002-08-06 | Nec Corp | 配達員現在位置把握システムおよび配達員用送信装置 |
JP2002288291A (ja) * | 2001-03-26 | 2002-10-04 | Uchida Yoko Co Ltd | メール便処理方法及びシステム |
US6715514B2 (en) * | 2002-09-07 | 2004-04-06 | Worldwide Liquids | Method and apparatus for fluid transport, storage and dispensing |
JP2008071242A (ja) * | 2006-09-15 | 2008-03-27 | Sekisui Chem Co Ltd | 施工現場管理システム |
US9805317B2 (en) * | 2010-05-19 | 2017-10-31 | Caterpillar Inc. | Methods and systems for controlling fluid delivery missions on a site |
US8762291B2 (en) * | 2010-06-14 | 2014-06-24 | L'air Liquide, Societe Anonyme Pour L'etude Et L'exploitation Des Procedes Georges Claude | Robust optimization of bulk gas distribution |
US20120084223A1 (en) * | 2010-09-30 | 2012-04-05 | L'air Liquide Societe Anonyme Pour L'etude Et L'exploitation Des Procedes Georges Claude | System To Organize Commodity-Product Distribution |
JP5523433B2 (ja) * | 2011-11-28 | 2014-06-18 | 楽天株式会社 | 情報処理装置、情報処理方法及び情報処理プログラム |
-
2012
- 2012-06-05 JP JP2012128090A patent/JP5457502B2/ja active Active
-
2013
- 2013-06-05 AU AU2013273015A patent/AU2013273015A1/en not_active Abandoned
- 2013-06-05 CA CA2873147A patent/CA2873147C/en active Active
- 2013-06-05 US US14/405,865 patent/US20150149381A1/en not_active Abandoned
- 2013-06-05 WO PCT/JP2013/003541 patent/WO2013183294A1/ja active Application Filing
-
2016
- 2016-02-09 AU AU2016200808A patent/AU2016200808A1/en not_active Abandoned
- 2016-12-01 US US15/366,976 patent/US20170132563A1/en not_active Abandoned
-
2018
- 2018-01-15 AU AU2018200319A patent/AU2018200319B2/en active Active
Patent Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2001357106A (ja) * | 2000-04-14 | 2001-12-26 | Nippon Sanso Corp | ガス納入システム及び方法並びにガス容器の管理方法 |
JP2003292163A (ja) * | 2002-03-29 | 2003-10-15 | Ffc:Kk | 訪問事前通知システム、巡回型業務支援システム、事前通知方法、プログラム、記録媒体 |
JP2004021975A (ja) * | 2003-01-27 | 2004-01-22 | World:Kk | フロー管理システム、フロー管理方法、並びにコンピュータ上で動作する情報処理プログラム |
JP2004323230A (ja) * | 2003-03-03 | 2004-11-18 | Sagawa Express Co Ltd | 地域内物流コンサルティング方法及びそのプログラム |
JP2010070310A (ja) * | 2008-09-18 | 2010-04-02 | Yamaha Corp | 物流倉庫における作業者毎の集品品目数決定方法および集品品目数決定システム |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN110245864A (zh) * | 2019-06-14 | 2019-09-17 | 上海中通吉网络技术有限公司 | 快件处理方法、装置和巴枪 |
Also Published As
Publication number | Publication date |
---|---|
AU2018200319B2 (en) | 2019-03-28 |
JP2013254255A (ja) | 2013-12-19 |
CA2873147C (en) | 2015-04-28 |
CA2873147A1 (en) | 2013-12-12 |
AU2013273015A1 (en) | 2015-01-15 |
JP5457502B2 (ja) | 2014-04-02 |
US20150149381A1 (en) | 2015-05-28 |
AU2018200319A1 (en) | 2018-02-01 |
AU2016200808A1 (en) | 2016-02-25 |
US20170132563A1 (en) | 2017-05-11 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
WO2013183294A1 (ja) | 配送エリア管理方法 | |
US9990600B2 (en) | Delivery prediction system and method accelerated by α days | |
US20180101812A1 (en) | Method for leveling delivery counts | |
JP5802225B2 (ja) | 安全率マスタを用いた配送予測システムおよび方法 | |
JP2012232841A (ja) | 携帯配送システム | |
JP5947422B1 (ja) | 配送本数平準化における優先順位付け方法 | |
US10380514B2 (en) | System for setting a delivery count rank | |
JP5739921B2 (ja) | 配送員の休暇スケジュールの管理方法およびシステム | |
AU2013284895B2 (en) | Meter reader allocation system and meter reader allocation method | |
JP5756166B2 (ja) | 配送本数の平準化方法 | |
JP6241945B2 (ja) | パーツ手配サーバ、システム、方法、及び、プログラム | |
AU2017245317A1 (en) | Method for leveling delivery counts | |
AU2018203913A1 (en) | Delivery volume rank setting system |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
121 | Ep: the epo has been informed by wipo that ep was designated in this application |
Ref document number: 13801407 Country of ref document: EP Kind code of ref document: A1 |
|
ENP | Entry into the national phase |
Ref document number: 2873147 Country of ref document: CA |
|
NENP | Non-entry into the national phase |
Ref country code: DE |
|
WWE | Wipo information: entry into national phase |
Ref document number: 14405865 Country of ref document: US |
|
ENP | Entry into the national phase |
Ref document number: 2013273015 Country of ref document: AU Date of ref document: 20130605 Kind code of ref document: A |
|
122 | Ep: pct application non-entry in european phase |
Ref document number: 13801407 Country of ref document: EP Kind code of ref document: A1 |