KR20170066836A - Vehicle allocation method for complex transportation service based on Internet of things and device for the same method - Google Patents

Vehicle allocation method for complex transportation service based on Internet of things and device for the same method Download PDF

Info

Publication number
KR20170066836A
KR20170066836A KR1020150172984A KR20150172984A KR20170066836A KR 20170066836 A KR20170066836 A KR 20170066836A KR 1020150172984 A KR1020150172984 A KR 1020150172984A KR 20150172984 A KR20150172984 A KR 20150172984A KR 20170066836 A KR20170066836 A KR 20170066836A
Authority
KR
South Korea
Prior art keywords
delivery
destination
shipping
swap
route
Prior art date
Application number
KR1020150172984A
Other languages
Korean (ko)
Other versions
KR102005547B1 (en
Inventor
안철
Original Assignee
주식회사 올로케이션
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 주식회사 올로케이션 filed Critical 주식회사 올로케이션
Priority to KR1020150172984A priority Critical patent/KR102005547B1/en
Publication of KR20170066836A publication Critical patent/KR20170066836A/en
Application granted granted Critical
Publication of KR102005547B1 publication Critical patent/KR102005547B1/en

Links

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
    • 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
    • G06Q50/30—

Landscapes

  • Business, Economics & Management (AREA)
  • Engineering & Computer Science (AREA)
  • Economics (AREA)
  • Operations Research (AREA)
  • Tourism & Hospitality (AREA)
  • Quality & Reliability (AREA)
  • Marketing (AREA)
  • Human Resources & Organizations (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Strategic Management (AREA)
  • Development Economics (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

A dispatching method for optimizing logistics transportation, the dispatching method comprising the steps of: initializing, by a predetermined algorithm, a delivery route assigned to a plurality of delivery articles each of which is responsible for a plurality of delivery zones, Sorting, grouping, and setting a delivery swap candidate for the destinations that correspond to the boundary region of the shipping region among the shipping destinations to obtain the final delivery route.

Description

Technical Field [0001] The present invention relates to a dispatching method for an integrated transportation service based on IoT,

TECHNICAL FIELD The present invention relates to a dispatching method for logistics transportation, and more particularly, to a dispensing method for providing an optimized dispatching route.

The courier goods of a company or an individual are transported to a delivery center through a courier service shop (for example, a convenience store or a delivery point of each courier company), and then collected into a hub terminal in each area. A hub terminal is a place to pre-collect shipment items to be shipped. In the hub terminal, the delivery items can be transported to the local sales office corresponding to each destination using the logistics vehicle. Each sales office has its own sales area, and each sales office can have multiple shipping workers. The sales area for each sales office may be divided into a plurality of shipping areas, and the shipping articles may be assigned based on each shipping area. The shipping articles can be given a delivery list of the date. Each shipping list may include a delivery time, a shipping address, an item description, and a shipping order according to the shipping time. At this time, as described above, since the shipping order is determined according to the delivery time, even if the first delivery destination and the fifth delivery destination are close to each other geographically, the total delivery distance by which the delivery operator moves can be increased. In this case, the delivery route may increase unreasonably if there are multiple destinations. That is, there is a problem that the total travel distance for the delivery increases unreasonably due to the restricted shipping order. This may be due to the fact that each delivery engineer is only allowed to deliver on a predetermined delivery region.

In order to solve the above-mentioned problem, the present invention proposes a dispatching method of assigning a dispatch route to each dispatcher so that the dispatch route of a specific dispatcher does not increase unreasonably.

A dispatching method according to one aspect of the present invention is a dispatching method for optimizing the transportation of goods, the dispensing method comprising: a plurality of delivery paths allocated to a plurality of delivery articles each of which is responsible for a plurality of shipping regions belonging to a specific business area, The method comprising the steps of: selecting first boundary shipping destinations belonging to a first boundary region of a first shipping region for shipping destinations belonging to a first shipping route assigned to a first shipping carrier, Determining whether a distance between a first destination and a second destination is less than a preset radius R, determining whether the distance is less than the preset radius R, Setting a first group of the first delivery documents to the same group, Determining whether or not to return to the outside of the circular area having the radius R around the preliminary delivery destination in the course of delivering to a post-processing destination having a low delivery priority after the delivery; Setting the first delivery site or the second delivery site as delivery swap candidates when it is determined that the delivery swap candidate should be returned, selecting a delivery swap candidate satisfying a predetermined condition among the delivery swap candidates as a delivery swap confirm delivery destination, Removing the selected delivery swap confirm shipping destination from the first shipping path and adding the selected shipping swap confirm shipping destination to the second shipping path assigned to the second shipping person.

At this time, each of the plurality of business areas managed by the plurality of sales offices is divided into a plurality of shipping regions, and the second delivery engineer is assigned to any one of the plurality of shipping regions that is adjacent to the first shipping region And the like.

Each of the plurality of business areas managed by the plurality of sales offices is divided into a plurality of shipping areas, and the process is performed for each of the plurality of shipping areas. The hub terminal may be configured to deliver the delivery article to each sales office based on a plurality of delivery lists determined as a result of the process.

Also, the process may be performed before delivering the delivery item to the plurality of sales offices at a hub terminal that provides delivery items to a plurality of sales offices.

In addition, the delivery swap candidate satisfying the predetermined condition may exclude a delivery destination set as the delivery swap candidate from the first delivery route of the first delivery region, and the second delivery region, which is adjacent to the first delivery region, When the simulation is performed in addition to the second delivery route, the total delivery distance increment of the second delivery route is smaller than the total delivery distance reduction of the first delivery route, and the total delivery distance of the second delivery route satisfies a predetermined value or less .

After the initialization step is executed, a delivery list of each delivery article is generated. At the time of execution of the process, a field of boundary condition, a group field, a delivery swap candidate field, and a delivery swap confirmation field are added to the delivery list .

In addition, the predetermined radius R may be smaller than a predetermined reference value through a ratio of the area of the first delivery area and the area of the first boundary area.

An apparatus according to one aspect of the present invention is an apparatus for executing a dispatching process for optimizing the transport of goods, the dispatching process comprising: a delivery route assigned to a plurality of delivery articles Selecting one of the first border destinations belonging to the first border region of the first delivery region at the destinations to be delivered by the first delivery person among the plurality of delivery articles, Determining whether a distance between any one of the first border delivery destinations and a second delivery destination is less than a predetermined radius R, if it is determined that the distance is less than the predetermined radius R, Setting the delivery address and the second delivery address to the same group, and setting the first delivery address and the second address, The first distributor moves to a destination outside the circular area having the radius R centered on the first destination of the first delivery destination and the second delivery destination in the order of delivery, The method comprising the steps of: determining whether to return to another destination within the circular area; setting the first destination and the second destination as delivery swap candidates; and if the delivery swap candidates And selecting a delivery swap candidate satisfying a predetermined condition as a delivery swap confirm delivery destination.

At this time, the process is also performed for different shipping areas (ex: A-2, B-1) of the business areas A and B adjacent to each other assigned to the sales offices In the hub terminal that provides the delivery items to the plurality of sales offices, the products may be delivered to the sales offices based on the plurality of delivery lists determined as a result of the process.

In addition, the process may be performed before delivering the delivery item to the plurality of sales offices at a hub terminal that provides delivery items to a plurality of sales offices.

In addition, the delivery swap candidate satisfying the predetermined condition may exclude the destination set as the delivery swap candidate from the first delivery route of the first delivery region, and the second delivery region of the second delivery region adjacent to the first delivery region, When the simulation is performed in addition to the delivery route, the total delivery distance increment of the second delivery route is smaller than the total delivery distance reduction of the first delivery route, and the total delivery distance of the second delivery route satisfies a predetermined value or less have.

A dispensing method according to another aspect of the present invention includes the steps of initializing a first delivery route assigned to a first delivery person who is in charge of a first delivery area, determining whether a distance between a preliminary delivery destination and a post- When it is judged that it is necessary to go out of the circular area having the radius R around the pre-processing destination and return after returning to the post-processing destination after the delivery to the pre-processing destination, Setting the destination or the post-processing destination as a delivery swap candidate, and excluding the delivery swap candidate from the first delivery path if the delivery swap candidate meets a predetermined test.

At this time, each of a plurality of business areas managed by a plurality of business locations is divided into a plurality of shipping areas, and the process is performed for each of the plurality of shipping areas, Wherein the processes are performed before delivering the deliverable article to each sales office in a hub terminal that provides delivery items to the plurality of sales offices, and in the hub terminal, the plurality of And may be arranged to deliver the delivery item to each sales office on the basis of the delivery list.

In addition, both the preprocessing destination and the post-processing destination are included in the border area of the first shipping area, and the shipping swap candidate is added to the second delivery route assigned to the second delivery article, May be assigned to any other shipping area that is adjacent to the first shipping area.

In addition, when simulating that the delivery swap candidate is excluded from the first delivery route and added to the second delivery route of the second delivery region adjacent to the first delivery region, the total delivery distance increment of the second delivery route The delivery swap candidate may be determined to satisfy the predetermined test when the total delivery distance of the first delivery path is smaller than the total delivery distance of the first delivery path and the total delivery distance of the second delivery path satisfies a predetermined value or less.

FIG. 1 is a diagram illustrating an overall shipping area structure according to an exemplary embodiment. Referring to FIG.
FIG. 2A shows a delivery list of a delivery engineer responsible for a delivery region A-1 according to an embodiment. FIG. 2B illustrates a delivery list of a delivery engineer responsible for a delivery region A- .
FIG. 3 shows a delivery route for each shipping region in the business area A according to an embodiment.
FIG. 4A is a view for explaining an optimized route generation process according to an embodiment of the present invention, and FIG. 4B is a table of information for proceeding efficient dispatch according to an embodiment of the present invention.
5 is a flowchart illustrating an optimized dispatch route generation process according to an embodiment of the present invention.
FIG. 6A is a final delivery list of a delivery engineer 11 according to an embodiment of the present invention, and FIG. 6B may be a final delivery list of a delivery engineer 12 according to an embodiment of the present invention.
FIG. 7 is a diagram illustrating a delivery path for each shipping region in the business area A according to an embodiment of the present invention.

Hereinafter, embodiments of the present invention will be described with reference to the accompanying drawings. However, the present invention is not limited to the embodiments described herein, but may be implemented in various other forms. The terminology used herein is for the purpose of understanding the embodiments and is not intended to limit the scope of the present invention. Also, the singular forms as used below include plural forms unless the phrases expressly have the opposite meaning.

FIG. 1 is a diagram illustrating an overall shipping area structure according to an exemplary embodiment. Referring to FIG.

The area 1 served by the hub terminal 2 may include a plurality of (for example, four) business offices AA to DD. Each business office (AA ~ DD) may have a designated business area (A ~ D). For example, the business area of business office AA may be (A), and the business area of business office BB may be (B). Each business area A to D can be divided into a plurality of shipping areas A-1, A-2, ..., D-3, and D-4. For example, the shipping area of the sales office AA may be (A-1, A-2, A-3, A-4), and the shipping area of the sales office BB may be (B-1, B- 3, B-4). A shipping article to be responsible for each of the above shipping areas may be assigned to each shipping area. Each shipping article may be provided with a shipping list of items to be delivered to the shipping address of the shipping region in charge.

FIG. 2A shows a delivery list of a delivery engineer responsible for a delivery region A-1 according to an embodiment. FIG. 2B illustrates a delivery list of a delivery engineer responsible for a delivery region A- .

Each delivery list may include a plurality of fields containing delivery information of the corresponding date. For example, it may include shipping order, shipping time, shipping address, and item details. At this time, the delivery order number is determined by the delivery time, and the delivery time can be set to a time desired by the customer. The shipping address is shown as a number for convenience of description.

FIG. 3 shows a delivery route for each shipping region in the business area A according to an embodiment.

The delivery route 21 of the delivery area A-1 is obtained by connecting the destinations 1-1 to 1-7 to be visited by the first delivery staff 11 in order of delivery time, The delivery route 22 of the second delivery destination A-2 is obtained by connecting the delivery destinations 2-1 to 2-5 to be visited by the second delivery person 12 in order of delivery time. The delivery list of the first delivery article 11 may be as shown in FIG. 2A, and the delivery list of the second delivery article 12 may be as shown in FIG. 2B.

The delivery time of the delivery destination 1-1 is set to be the same as the delivery time of the delivery destination 1-1 even though the delivery destination 1-1 and the delivery destination 1-5 are adjacent to each other, And the delivery time of the delivery destination 1-5 is about 2:00 pm, the first delivery agent 11 can not deliver the delivery to the delivery destination 1-1 and then to the delivery destination 1-5 immediately. That is, the first delivery staff 11 delivers the delivery items to the delivery addresses 1-2-1-4 at the next time point after delivery to the delivery address 1-1, and then directs them to the delivery address 1-5 do. In this case, the movement distance for delivery of the first delivery technician 11 becomes too inefficient. In addition, when the user moves to the destination (1-6) and the destination (1-7) after the destination (1-5), the travel distance of the first deliverer (11) becomes longer.

At this time, if only the destination 1-5 can be excluded from the delivery route 21, the travel distance of the first deliverer 11 may be efficiently allocated.

FIG. 4A is a view for explaining an optimized route generation process according to an embodiment of the present invention, and FIG. 4B is a table of information for proceeding efficient dispatch according to an embodiment of the present invention.

The shipping list of FIG. 4B includes the shipping order number, shipping time, shipping address, and item details field shown in FIG. 2A, and may further include a boundary condition, a group, a delivery swap candidate, and a delivery swap confirmation field have.

At this time, the boundary check field may indicate whether or not each destination is located in a boundary area of the corresponding shipping area. For example, referring to FIG. 4A, the boundary area of the delivery area A-1 may refer to an area outside the boundary line 30. Each of the shipping areas (A-1, ..., A-4) may have a border area. If the distance between any reference destination and an arbitrary adjacent destination belonging to the boundary region is smaller than a predetermined radius R, the reference destination and the adjacent destination can be set to the same group. For example, the destination 1-1 and the destination 1-5 may belong to the same group G1, and the destination 1-6 and the destination 1-7 may belong to the same group G2. At this time, in the group field, the destination of the region excluding the border region in the delivery region (A-1) may be indicated as NULL.

The shipping swap candidate field may be set to include a first group of destinations and a second group of destinations that are to be delivered to the first destination and the second destination, It can be displayed by judging whether it should move outside the circular area having the radius R and then return to the inside of the circular area again. At this time, if it is necessary to move to the outside of the circular area and then return to the outside, Y can be displayed on the first destination and the second destination, respectively. Alternatively, if it is not necessary to move to the upper part of the circular area during the process of delivering to the first destination and the second destination, N may be displayed on the first destination and the second destination, respectively. The destination marked Y may be considered a delivery swap candidate that is likely to be assigned to another shipping person in charge of another shipping area in the future.

In this case, the radius R means a value determined to be ineffective when moving outside the circular area around the circular area defined by the radius R around the first destination and returning to the inside of the circular area again . And the radius R may be set to a small value.

For example, in the case of the group G1, the destination to be delivered first among the destination 1-1 and the destination 1-5 may be the destination 1-1 having a faster delivery time. The destination to be shipped next to the destination (1-1) is the destination (1-2). When a circle area having a radius R is set around the destination (1-1), the destination (1-2) The delivery engineer 11 must move outside the circular area and then back inside the circular area. Therefore, Y may be displayed in the delivery swap candidate field corresponding to the destination 1-1 and the destination 1-5, respectively.

In the case of the group G2, the destination to be delivered first among the destination 1-6 and the destination 1-7 may be the destination 1-6 whose delivery time is earlier. The destination to be shipped next to the destination (1-6) is the destination (1-7). When a circle area having a radius R is set around the destination (1-6), the next destination Since there is a delivery destination 1-7, N can be displayed in the delivery swap candidate field, respectively.

You can select the shipping swap confirm shipping destination from the shipping destinations that are set as shipping swap candidates and mark them in the shipping swap confirmation field. At this time, when the first delivery region and the delivery region A-2 are referred to as the second delivery region, the delivery of the delivery article 12 responsible for the second delivery region A- It is possible to simulate the addition of the destination (1-1 or 1-5) set as the delivery swap candidate to the route (22). At this time, the increase of the total delivery distance of the delivery route 22 is calculated to be smaller than the decrease of the total delivery distance of the delivery route 21, (2) the total delivery distance of the delivery route 22 The delivery path set to the delivery swap candidate may be added to the delivery path 22 with certainty. That is, in the delivery swap confirmation field, the portion corresponding to the determined delivery swap candidate may be displayed as Y, and the remaining portion may be indicated as N, and the delivery swap confirmed delivery destination may be excluded from the final delivery list of the delivery article (11) have.

5 is a flowchart illustrating an optimized dispatch route generation process according to an embodiment of the present invention.

In step S10, the delivery route assigned to each delivery article can be initialized by a predetermined algorithm. At this time, a delivery list as shown in FIGS. 2A and 2B can be generated.

In step S20, the first border coupons belonging to the first border region of the first delivery region among the destinations to be delivered by the first delivery person can be selected. At this time, Y may be indicated in a portion corresponding to the selected first border shipping destinations among the border fields of the delivery list of the first delivery article.

In step S30, it is determined whether or not a distance between any reference destination and an arbitrary adjacent destination in the first border area is smaller than a preset radius R. If the distance between the reference destination (first destination) and the adjacent destination Second delivery place) can be set to the same group. At this time, the set result can be displayed as the group name in the group field of the delivery list.

In step S40, during the process of delivering to the first delivery destination and the second delivery destination belonging to the group, an outward part of the circular area having the radius R centered on the destination delivered first among the first delivery destination and the second delivery destination It is possible to determine whether or not to return to the inside of the circular area after moving.

In step S50, the delivery swap candidate can be set through the determination result in step S40.

In step S60, the delivery swap candidate satisfying the predetermined condition can be selected as the delivery swap confirm delivery destination. In this case, when the simulation is performed by adding the destination set as the delivery swap candidate, the increase in the total delivery distance of the second delivery route in the second delivery region is larger than the increase in the total delivery distance in the first delivery region May be calculated to be smaller than the decrease in distance and the shipping destination added to the simulation may be selected as the shipping swap confirm shipping destination if the total shipping distance of the second shipping route satisfies a predetermined value or less.

In step S70, a final delivery list can be generated.

The processes including the steps S10 to S70 are performed on the distribution areas (for example, A-2 and B-1) of business areas (for example, A and B) In the hub terminal that provides the delivery items to the plurality of sales offices, the goods may be delivered to the sales offices based on the plurality of delivery lists determined as a result of the process.

If the step S10 of FIG. 5 is a delivery path determination method according to the related art, the algorithm according to the flowchart shown in FIG. 5 may be considered as a new delivery path determination method according to an embodiment of the present invention.

The process including steps S10 to S70 may be performed before delivering the goods to the plurality of sales offices at a hub terminal that provides delivery items to a plurality of sales offices. Accordingly, the items to be delivered according to the final delivery list in step S70 can be properly delivered to the respective sales offices in the hub terminal.

FIG. 6A is a final delivery list of a delivery engineer 11 according to an embodiment of the present invention, and FIG. 6B may be a final delivery list of a delivery engineer 12 according to an embodiment of the present invention.

6A is a final delivery list in which the delivery order number 5 is excluded from the delivery list of FIG. 2A, the delivery order number 6 is changed to the delivery order number 5 'and the delivery order number 7 is changed to the delivery order number 6' FIG. 6B is a final delivery list in which the delivery order number 5 of the delivery list of FIG. 2A is added as the delivery order number 6 in the delivery list of FIG. 2B.

FIG. 7 is a diagram illustrating a delivery path for each shipping region in the business area A according to an embodiment of the present invention.

The difference between FIG. 3 and FIG. 7 is that, in FIG. 3, the delivery route of each delivery article includes all the delivery destinations of the delivery region to which the delivery article is assigned, while in FIG. 7, And the delivery route of the product is efficiently generated. That is, the delivery route 21 'of the delivery article 11 is a delivery route from which the delivery destination 1-5 is excluded from the existing delivery route 21 and the delivery route 22' Is a delivery route to which the delivery destination 1-5 is added in the delivery route 22 of FIG. At this time, the delivery time of the delivery address 2-5 may be before the delivery time of the delivery address 1-5.

It will be apparent to those skilled in the art that various modifications and variations can be made in the present invention without departing from the essential characteristics thereof. The contents of each claim in the claims may be combined with other claims without departing from the scope of the claims.

Claims (15)

A dispensing method for optimizing logistics transportation,
Comprising the steps of: initializing a plurality of delivery routes assigned to a plurality of delivery articles each of which is responsible for a plurality of shipping regions belonging to a specific business area, by a predetermined algorithm;
Selecting first border destinations belonging to a first border region of the first delivery region for the destinations belonging to the first delivery channel assigned to the first delivery agent;
Determining whether a distance between the first delivery destination and the second delivery destination is less than a predetermined radius R;
Setting the first destination and the second destination to the same group if the distance is determined to be smaller than the predetermined radius R;
The method according to claim 1, wherein, in the process of delivering to a post-processing destination having a lower delivery priority after the first delivery technician delivers the pre-processed delivery destination having a higher delivery priority among the first delivery destination and the second delivery destination, Determining whether to return to the outside of the circular area having R and return;
Setting the first delivery site or the second delivery site as delivery swap candidates when it is determined that the user should exit and return from the outside of the circular area; And
Selecting a shipping swap candidate that satisfies a predetermined condition among the shipping swap candidates as a shipping swap settlement destination to exclude the selected shipping swap settlement destination from the first shipping path, To a second shipping path assigned to the second shipping path;
And < RTI ID = 0.0 >
How to dispatch. The method according to claim 1,
Each of the plurality of business areas managed by the plurality of sales offices is divided into a plurality of shipping areas,
Wherein the second delivery engineer is assigned to any one of the plurality of delivery regions that is adjacent to the first delivery region.
How to dispatch. The method according to claim 1,
Each of the plurality of business areas managed by the plurality of sales offices is divided into a plurality of shipping areas,
Wherein the process is performed for each of the plurality of shipping regions,
The hub terminal providing the delivery items to the plurality of sales offices is configured to deliver the delivery items to the sales offices based on the plurality of delivery lists determined as a result of the process,
How to dispatch. The dispensing method according to claim 1, wherein the process is performed before delivering the delivery item to the plurality of sales outlets at a hub terminal that provides delivery items to a plurality of sales outlets. The method according to claim 1,
Wherein the delivery swap candidate satisfying the predetermined condition comprises:
When a destination set as the delivery swap candidate is excluded from the first delivery route of the first delivery region and the simulation is added to the second delivery route of the second delivery region adjacent to the first delivery region,
Wherein the increase of the total delivery distance of the second delivery route is smaller than the decrease of the total delivery distance of the first delivery route and the total delivery distance of the second delivery route satisfies a predetermined value or less,
How to dispatch. The method according to claim 1,
After the initialization step is executed, a delivery list of each delivery article is generated,
A group field, a delivery swap candidate field, and a delivery swap confirmation field are added to the delivery list when the process is executed,
How to dispatch. The dispensing method according to claim 1, wherein the predetermined radius R value is set to be smaller than a predetermined reference value through a ratio of an area of the first shipping area to the area of the first boundary area. An apparatus for executing an allocation process for optimizing logistics transportation,
Initializing a delivery route assigned to a plurality of delivery articles each of which is to take charge of a plurality of delivery regions, by a predetermined algorithm;
Selecting first boundary mailing destinations belonging to a first boundary area of the first distribution area at the destinations to be delivered by the first delivery person among the plurality of delivery persons;
Determining whether a distance between any one of the first boundary delivery destinations and a second delivery destination is less than a predetermined radius R;
Setting the first destination and the second destination to the same group if the distance is determined to be smaller than the predetermined radius R;
In the order of delivery of the first delivery destination and the second delivery destination belonging to the group, the first deliverer may have the radius R with the center of the first delivery destination of the first delivery destination and the second delivery destination Determining whether or not to return to another destination within the circular area after moving to a destination outside the circular area;
Setting the first delivery site and the second delivery site as delivery swap candidates when it is determined to return to another delivery site in the circular area; And
Selecting a delivery swap candidate satisfying a predetermined condition among the delivery swap candidates as a delivery swap confirm delivery destination;
, ≪ / RTI >
Device. 9. The method of claim 8,
The process is also performed for the dispatch areas of the business areas adjacent to each other assigned to the different advertisement sites,
The hub terminal providing the delivery items to the plurality of sales offices is configured to deliver the goods to the sales offices based on the plurality of delivery lists determined as a result of the process,
Device. 9. The apparatus of claim 8, wherein the process is performed prior to delivering the delivery item to the plurality of business locations at a hub terminal that provides delivery items to a plurality of business locations. 9. The method of claim 8,
Wherein the delivery swap candidate satisfying the predetermined condition comprises:
When a destination set as the delivery swap candidate is excluded from the first delivery route of the first delivery region and added to the second delivery route of the second delivery region adjacent to the first delivery region,
Wherein the increase of the total delivery distance of the second delivery route is smaller than the decrease of the total delivery distance of the first delivery route and the total delivery distance of the second delivery route satisfies a predetermined value or less,
Device. Initializing a first delivery path assigned to a first delivering article that is in charge of the first shipping region;
When the distance between the pre-processing destination and the post-processing destination belonging to the first delivery path is smaller than a predetermined radius R, the radius R is calculated with respect to the pre-processing destination after the delivery to the pre- Setting the preprocess delivery destination or the post-processing delivery destination as a delivery swap candidate when it is determined that the user should go out of the circular area having the circulation area and return it. And
If the delivery swap candidate satisfies a predetermined test, excluding the delivery swap candidate from the first delivery path
And < RTI ID = 0.0 >
How to dispatch. 13. The method of claim 12,
Each of the plurality of business areas managed by the plurality of sales offices is divided into a plurality of shipping areas,
Wherein the process is performed for each of the plurality of shipping regions,
Wherein the processes performed for each of the plurality of delivery regions are performed before delivering the delivery item to each sales office at a hub terminal that provides delivery items to the plurality of sales offices,
Wherein the hub terminal is configured to deliver the delivery item to each sales office on the basis of a plurality of delivery lists determined as a result of execution of the processes,
How to dispatch. 13. The method of claim 12,
Wherein the preprocessing destination and the post-processing destination both belong to a boundary region of the first shipping region,
Add the shipping swap candidate to the second shipping path assigned to the second shipping article,
And the second delivery engineer is assigned to any other shipping area that is adjacent to the first shipping area.
How to dispatch. 13. The method of claim 12,
When the simulation is performed such that the delivery swap candidate is excluded from the first delivery route and added to the second delivery route of the second delivery region adjacent to the first delivery region,
If the increase of the total delivery distance of the second delivery route is smaller than the decrease of the total delivery distance of the first delivery route and the total delivery distance of the second delivery route satisfies a predetermined value or less, Determine that you are satisfied with the test,
How to dispatch.
KR1020150172984A 2015-12-07 2015-12-07 Vehicle allocation method for complex transportation service based on Internet of things and device for the same method KR102005547B1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
KR1020150172984A KR102005547B1 (en) 2015-12-07 2015-12-07 Vehicle allocation method for complex transportation service based on Internet of things and device for the same method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
KR1020150172984A KR102005547B1 (en) 2015-12-07 2015-12-07 Vehicle allocation method for complex transportation service based on Internet of things and device for the same method

Publications (2)

Publication Number Publication Date
KR20170066836A true KR20170066836A (en) 2017-06-15
KR102005547B1 KR102005547B1 (en) 2019-07-30

Family

ID=59217223

Family Applications (1)

Application Number Title Priority Date Filing Date
KR1020150172984A KR102005547B1 (en) 2015-12-07 2015-12-07 Vehicle allocation method for complex transportation service based on Internet of things and device for the same method

Country Status (1)

Country Link
KR (1) KR102005547B1 (en)

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109658034A (en) * 2018-12-28 2019-04-19 拉扎斯网络科技（上海）有限公司 Distribution range generation method, distribution pressure adjustment method, distribution range generation device, distribution pressure adjustment device and server
WO2020101051A1 (en) * 2018-11-13 2020-05-22 경희대학교산학협력단 Delivery system, delivery management system, delivery management device, and delivery management method
KR20210086400A (en) 2019-12-31 2021-07-08 주식회사 로지스텍 Artificial intelligence-based intelligent drainage apparatus and operating method thereof
KR20220042910A (en) * 2020-09-28 2022-04-05 홍익대학교 산학협력단 IoT device-based logistics delivery method and IoT device for the same
CN116777187A (en) * 2023-08-25 2023-09-19 山东道万电气有限公司 Multi-path inspection intelligent central control scheduling method and platform
WO2024071499A1 (en) * 2022-09-30 2024-04-04 쿠팡 주식회사 Electronic device for acquiring area information, and method therefor
CN118350737A (en) * 2024-05-21 2024-07-16 青岛地铁集团有限公司 Path optimization method for material distribution

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR102509337B1 (en) 2022-11-28 2023-03-14 주식회사 위드컴퍼니 A method, device and system for logistics processing automation of goods to be delivered and installed using big data-based artificial intelligence model

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20070074676A (en) * 2006-01-10 2007-07-18 주식회사 엘지화학 Method for optimal multi-vehicle dispatch and system for the same
KR20110010006A (en) * 2009-07-23 2011-01-31 동양미래대학 산학협력단 System for joint allocating freight cars using lbs and allocating method thereof
KR20140041665A (en) * 2014-03-17 2014-04-04 황금찬 Providing method of schedule for delivery service automatically

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20070074676A (en) * 2006-01-10 2007-07-18 주식회사 엘지화학 Method for optimal multi-vehicle dispatch and system for the same
KR20110010006A (en) * 2009-07-23 2011-01-31 동양미래대학 산학협력단 System for joint allocating freight cars using lbs and allocating method thereof
KR20140041665A (en) * 2014-03-17 2014-04-04 황금찬 Providing method of schedule for delivery service automatically

Cited By (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2020101051A1 (en) * 2018-11-13 2020-05-22 경희대학교산학협력단 Delivery system, delivery management system, delivery management device, and delivery management method
CN109658034A (en) * 2018-12-28 2019-04-19 拉扎斯网络科技（上海）有限公司 Distribution range generation method, distribution pressure adjustment method, distribution range generation device, distribution pressure adjustment device and server
CN109658034B (en) * 2018-12-28 2022-03-29 拉扎斯网络科技（上海）有限公司 Distribution range generation method, distribution pressure adjustment method, distribution range generation device, distribution pressure adjustment device and server
KR20210086400A (en) 2019-12-31 2021-07-08 주식회사 로지스텍 Artificial intelligence-based intelligent drainage apparatus and operating method thereof
KR20230007973A (en) 2019-12-31 2023-01-13 주식회사 로지스텍 Artificial intelligence-based intelligent drainage apparatus and operating method thereof
KR20220042910A (en) * 2020-09-28 2022-04-05 홍익대학교 산학협력단 IoT device-based logistics delivery method and IoT device for the same
WO2024071499A1 (en) * 2022-09-30 2024-04-04 쿠팡 주식회사 Electronic device for acquiring area information, and method therefor
CN116777187A (en) * 2023-08-25 2023-09-19 山东道万电气有限公司 Multi-path inspection intelligent central control scheduling method and platform
CN116777187B (en) * 2023-08-25 2024-01-16 山东道万电气有限公司 Multi-path inspection intelligent central control scheduling method and platform
CN118350737A (en) * 2024-05-21 2024-07-16 青岛地铁集团有限公司 Path optimization method for material distribution

Also Published As

Publication number Publication date
KR102005547B1 (en) 2019-07-30

Similar Documents

Publication Publication Date Title
KR102005547B1 (en) Vehicle allocation method for complex transportation service based on Internet of things and device for the same method
CN111626577B (en) Vehicle scheduling method and device
CN108921327A (en) Shelf method for carrying, apparatus and system applied to goods to people's system
KR20160070699A (en) Method of designing vehicle delivery routes by setting zones
Fedtke et al. Layout planning of sortation conveyors in parcel distribution centers
Melacini et al. Development of a framework for pick-and-pass order picking system design
JP2017518940A5 (en)
CN110691743B (en) Method for sorting goods using an efficiently operating dynamic buffer and a storage system
Bunahri et al. Determination of Air Cargo Performance: Analysis of Revenue Management, Terminal Operations, and Aircraft Loading (Air Cargo Management Literature Review)
Fontana et al. Using the efficient frontier to obtain the best solution for the storage location assignment problem
JP2009146004A (en) Vehicle dispatching planning device and vehicle dispatching planning method
Gök et al. Robust resource planning for aircraft ground operations
KR20190032044A (en) Decision method of terminal according to parcel delivery address
US10643179B1 (en) Method and system for fulfilling inventory items
CN113762820B (en) Goods-to-person picking control method, system, electronic equipment and storage medium
US20200159219A1 (en) Simulator, control device, and non-transitory computer-readable recording medium
Meesuptaweekoon et al. Dynamic vehicle routing problem with multiple depots
KR102364312B1 (en) Simulation device, control device and simulation program
CN112016871A (en) Order dispatching method, device, equipment and storage medium
CN111832894B (en) Vehicle scheduling mode generation method and device and computer storage medium
KR101087757B1 (en) Management system and method for carousel
CN114493388A (en) Task allocation method and task allocation device
Brown Improving the efficiency of hub operations in a less-than-truckload distribution network
Faria et al. An original simulation model to improve the order picking performance: case study of an automated warehouse
US9162828B2 (en) Mail sorter with output container exchange

Legal Events

Date Code Title Description
A201 Request for examination
E902 Notification of reason for refusal
E601 Decision to refuse application
J201 Request for trial against refusal decision
J301 Trial decision

Free format text: TRIAL NUMBER: 2017101002168; TRIAL DECISION FOR APPEAL AGAINST DECISION TO DECLINE REFUSAL REQUESTED 20170502

Effective date: 20190123

S901 Examination by remand of revocation
E902 Notification of reason for refusal
GRNO Decision to grant (after opposition)
GRNT Written decision to grant