CN111325371B - Transportation route planning method and system - Google Patents
Transportation route planning method and system Download PDFInfo
- Publication number
- CN111325371B CN111325371B CN201811526136.0A CN201811526136A CN111325371B CN 111325371 B CN111325371 B CN 111325371B CN 201811526136 A CN201811526136 A CN 201811526136A CN 111325371 B CN111325371 B CN 111325371B
- Authority
- CN
- China
- Prior art keywords
- transportation
- shift
- point
- points
- determining
- Prior art date
- Legal status (The legal status 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 status listed.)
- Active
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/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
- G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q10/083—Shipping
- G06Q10/0835—Relationships between shipper or supplier and carriers
- G06Q10/08355—Routing methods
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02T—CLIMATE CHANGE MITIGATION TECHNOLOGIES RELATED TO TRANSPORTATION
- Y02T10/00—Road transport of goods or passengers
- Y02T10/10—Internal combustion engine [ICE] based vehicles
- Y02T10/40—Engine management systems
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Human Resources & Organizations (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Quality & Reliability (AREA)
- Marketing (AREA)
- Operations Research (AREA)
- Entrepreneurship & Innovation (AREA)
- Development Economics (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Game Theory and Decision Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The application discloses a transportation route planning method and system, which are applied to the field of logistics and comprise the following steps: determining a connection point for performing straight hair for any transportation shift, wherein the straight hair is used for distributing goods from a transfer station to the connection point without transfer through a network point; determining a first transportation line for goods distribution of the transportation shift from a transition to the connection point for straightening according to the determined connection point for straightening; determining a second transportation line for goods distribution from a transit station to a network point of the transportation shift according to the determined connection point for straightening; and determining a third transportation line for goods distribution from the network point to the connection point within the distribution range of the transportation shift according to the determined connection point for straightening. The method disclosed by the invention can reduce the retention time of the goods increased by secondary sorting of the network points and improve the delivery timeliness of the goods.
Description
Technical Field
The invention relates to the field of logistics in general, and in particular relates to a transportation route planning method and a transportation route planning system.
Background
In the current logistics field, most logistics distribution schemes are as follows: the goods are sorted in the transfer station, when the sorted goods are delivered to the distribution points from the transfer station, the distribution points sort the goods for the second time, and deliver the goods after the second sorting to each connection point from the distribution points.
Under this kind of delivery scheme, on the one hand, the goods is after the transfer letter sorting, and then the distribution is carried out the secondary letter sorting to the site, has increased the residence time of goods, has influenced the delivery ageing of goods. On the other hand, the distribution point needs to sort the delivered goods for the second time, and sometimes the sorting is not necessary, which causes the waste of the distribution point sorting resources.
Disclosure of Invention
In view of the above-mentioned defects or shortcomings in the prior art, it is desirable to provide a transportation route planning method and system, which can reduce the retention time of the goods increased by the secondary sorting of the distribution points and improve the delivery timeliness of the goods.
In a first aspect, the present invention provides a transportation route planning method, including the following steps:
determining a connection point for performing straight hair for any transportation shift, wherein the straight hair is used for distributing goods from a transfer station to the connection point without transfer through a network point;
determining a first transportation line for goods distribution of the transportation shift from a transition to the connection point for straightening according to the determined connection point for straightening;
determining a second transportation line for goods distribution from a transit station to a network point of the transportation shift according to the determined connection point for straightening;
and determining a third transportation line for goods distribution from the network point to the connection point within the distribution range of the transportation shift according to the determined connection point for straightening.
In another aspect, the present invention further provides a transportation route planning system, including:
the system comprises a connection point selecting unit, a connection point selecting unit and a data processing unit, wherein the connection point selecting unit is used for determining a connection point for performing straight hair for any transportation shift, and the straight hair is used for distributing goods from a transfer station to the connection point without transfer through a network point;
the first transportation route planning unit is used for determining a first transportation route for cargo distribution of the transportation shift from the transition to the junction point which is subjected to the straightening according to the determined junction point which is subjected to the straightening;
the second transportation route planning unit is used for determining a second transportation route of the transportation shift for goods distribution from the transfer station to the network points according to the determined junction point for straightening;
and the third transportation route planning unit is used for determining a third transportation route for cargo distribution from the network point to the connection point within the distribution range of the transportation shift according to the determined connection point for straightening.
According to the transportation route planning method provided by the invention, the straight connection points are selected, and the goods are delivered to the straight connection points from the transfer station without being transferred through the network points, so that the time of the goods sent to the connection points in the delivery process is saved, and the delivery timeliness of the goods sent to the straight connection points is improved. On the other hand, because some goods no longer send to the site for the goods that send to the site reduce, thereby reduced the quantity of the goods that the site needs secondary letter sorting, reduced the goods because of carrying out the time that the secondary letter sorting is detained at the site, consequently also improved the goods delivery time efficiency that sends to the junction of the goods delivered by the site. The invention also correspondingly provides a transportation route planning system.
Drawings
Other features, objects and advantages of the present application will become more apparent upon reading of the following detailed description of non-limiting embodiments thereof, made with reference to the accompanying drawings in which:
fig. 1 is a flow chart of a method of transportation route planning in an embodiment of the present invention;
fig. 2 is a schematic diagram of a transportation route planning system according to an embodiment of the present invention.
Detailed Description
The present application will be described in further detail with reference to the following drawings and examples. It is to be understood that the specific embodiments described herein are merely illustrative of the relevant invention and not restrictive of the invention. It should be noted that, for convenience of description, only the portions related to the present invention are shown in the drawings.
It should be noted that, in the present application, the embodiments and features of the embodiments may be combined with each other without conflict. The present application will be described in detail below with reference to the embodiments with reference to the attached drawings.
In the existing distribution network, each day there are fixed shifts (e.g., 3 shifts of the morning shift, the middle shift, and the evening shift) from which to deliver the goods to the distribution points (while returning the goods of the distribution points to the middle shift), and also there are fixed shifts from which to deliver the goods to the connection points (while returning the goods of the connection points to the distribution points). Generally, a transit station is installed in a city to store goods in the city, and a plurality of urban areas and counties of the city are respectively provided with a network site as storage areas for the goods in the urban areas and the counties. Each network point has a larger distribution range and covers more transceiver points (usually, one transceiver point exists in one cell and one village), so that some transceiver points with better positions (such as the transceiver point of a larger cell in one segment) are selected as access points, the network points distribute (and collect) goods to the access points, and other transceiver points (of nearby cells) collect and distribute the goods to adjacent access points. The delivery/pickup of goods to the end user is then performed by the transceiving point.
In such a distribution network, since the goods are sorted at a transfer station and then distributed to a distribution point for secondary sorting, the retention time of the goods in the distribution process is long. In order to solve the problem and improve the distribution timeliness of the goods, in an embodiment of the present invention, a transportation route planning method is disclosed, as shown in fig. 1, which is a flow chart of the transportation route planning method in the embodiment of the present invention, including the steps of:
s101, for any transport shift, determining a connection point for straightening, wherein straightening is to distribute goods from a transit station to the connection point without transit through a network point. Generally, the number of shifts with more goods can be selected to determine the connection point for the straight hair, the connection point for the straight hair can be determined for each shift, or the connection point for the straight hair can be determined only for the first shift of each day. Since the transition may have stock of the previous day, the number of parts in the first shift of the day is often the greatest, and therefore the optimization of the route (determining the connection point to make a straight hair) for the first shift of the day is the best, and since the optimization of the route requires a large amount of calculation and a large amount of time, in order to improve the efficiency of the route optimization, in a preferred embodiment of the present invention, the any transport shift is the first shift of the day. When the connection point of the straight hair is determined, the piece quantity of the connection point can be used as a reference, the distance between the connection point and the transition point can be used as a reference, and the importance degree or the area size of a distribution area covered by the connection point can be used as a reference. The number of the connecting points for straightening hair is limited by the number of available bayonets of the transfer, and cannot exceed the number of available bayonets of the transfer. The number of access points that can be selected for straightening is further constrained by the distance between the access point and the transition, the time window of the access point (i.e. the time period for the access point to receive and send the delivered goods, and usually the access point has a corresponding time window for a transport shift, for example, the time window for a certain access point corresponding to the first shift of the day is 7-00-8 a.m.:10 a.m.), and the number of available vehicles (when there are fewer available vehicles, only a limited number of access points can be connected in series within the time window corresponding to a transport shift). For example, when the number of available gates is 10 and there are many available vehicles, the largest number of 10 junction points (usually, there are many junction points far away from a city) may be selected for straightening hair, or the largest number of 10 junction points from a transition may be selected for straightening hair, or the largest number of 10 junction points in a distribution area covered by the junction points may be selected for straightening hair. When there are few vehicles available, or the distance between the access point and the transition is long, or the time window is too short, the number of access points for straightening is generally determined to be less than 10 even if the number of available gates is 10.
S102, determining a first transportation line for goods distribution of the transportation shift from a transition to the connection point for straightening according to the determined connection point for straightening; for a certain transportation shift, after the straight junction points are determined, the first transportation route for distributing goods to the straight junction points from the transition point needs to be determined, so that the distribution tasks of the straight junction points can be completed. The first transportation line can be one line or a plurality of lines, and the first transportation line does not transit through a network point. For example, the first transportation line from the transition C to the connection points x1, x2, x3, x4, x5, x6 where straight hair is conducted may be C-x2-x1-x5-x6-x3-x4-C (indicating that the vehicle sent from the transition C returns to the transition C after passing through the connection points x2, x1, x5, x6, x3, x4 in sequence), or C-x2-x1-C and C-x5-x6-x3-x4-C (indicating that the first transportation line includes 2 lines, the first line is that the vehicle sent from the transition C returns to the transition C after passing through the connection points x2, x1 in sequence, and the second line is that the vehicle sent from the transition C returns to the transition C after passing through the connection points x5, x6, x3, x4 in sequence), or C-x4-x 2-x 38 zx3238-x 5-x 3-x 4-x 3238-x 5-x 3-x 4-x 1-x 4-x 62-x 6-x-f. Generally, a vehicle can only be transported on one of the above-mentioned lines during a shift. After the connection point for straight hair is determined, the problem of the first transportation route is determined to be converted into the conventional VRPTW (vehicular routing with time windows), so that the problem can be solved by using general heuristic algorithms such as ant colony algorithm, tabu search, genetic algorithm and the like, and can also be solved by using other algorithms such as path construction heuristic algorithm, path improvement heuristic algorithm, synthetic heuristic algorithm, branch boundary method and the like.
S103, determining a second transportation line for goods distribution from a transit station to a network point of the transportation shift according to the determined junction for straightening; after the straight connection points are determined for a certain transport shift, when the connection points in the distribution range of a certain network point are all straight connection points, the certain network point is not distributed in the shift. For a network site within the distribution range including a connection point without straight hair, due to the large quantity of the network sites, the network site is generally directly distributed to the network site by a transfer station without being transferred by other network sites (i.e. only one vehicle transports goods of one network site in one transport shift), so that a second transport route for the transport shift to distribute goods to the network site from the transfer station can be determined. Of course, the invention does not exclude the transportation of goods at a plurality of points by one vehicle, and the problem of determining the second transportation route is converted into the conventional VRPTW, and can be solved by the general heuristic algorithm, the route construction heuristic algorithm, the route improvement heuristic algorithm, the branch boundary method and other algorithms.
S104, determining a third transportation line for goods distribution from the network point to the connection point within the distribution range of the transportation shift according to the determined connection point for straightening. For a certain transportation shift, after the straight connection point is determined, the network point only needs to distribute goods to the connection point which does not need to be directly sent within the distribution range, at the moment, the problem of determining the third transportation route is converted into the conventional VRPTW, and the general heuristic algorithm, the route construction heuristic algorithm, the route improvement heuristic algorithm, the branch boundary method and other algorithms can be used for solving.
According to the transportation route planning method provided by the invention, the transportation route for distributing from the transfer station to the connection point which is subjected to straight hair, the transportation route for distributing from the transfer station to the network point and the transportation route for distributing from the network point to the connection point which is not subjected to straight hair are determined by selecting the connection point which is subjected to straight hair, so that the transportation route planning of the whole distribution area is completed. In the embodiment provided by the invention, the goods are delivered to the straight connecting points from the transfer station without passing through the network points, so that the time (the secondary sorting time and the residence time at the network points) of the goods sent to the straight connecting points in the delivery process is saved, and the delivery time of the goods sent to the straight connecting points is prolonged. On the other hand, because some goods no longer send to the site for the goods that send to the site reduce, thereby reduced the quantity of the goods that the site needs the secondary letter sorting, indirectly reduced the goods because of carrying out the time that the secondary letter sorting is detained at the site, consequently also improved the goods delivery ageing of sending to the junction of the goods delivered by the site.
Because the influence of straightening to different connection points on the improvement of the whole logistics efficiency is different, in order to better improve the distribution efficiency of the whole logistics, a more suitable connection point needs to be selected and determined as the connection point for straightening. To achieve this object, in a preferred embodiment of the invention, the step of determining the junction at which to straighten hair for any transport shift comprises:
determining a transportation mission for the transportation shift; the transportation task generally includes the quantity of the access points of the transportation shift, i.e. the goods are delivered to the corresponding access points within the time window of each access point, for example, the task is to deliver the goods of the first shift of all the access points to the corresponding access points within the time window of the first shift of the day (for example, 7.
Determining the priority of the connection point of the transportation shift according to the transportation task; in general, the priority of the transit shift access points may be determined according to the piece of the transit shift access point determined by the transit mission, and the priority of the same access point may be different in different transit shifts, if there is a transfer point with a larger piece in the first shift and a smaller piece in the third shift, the priority of the first shift is higher in the day and the priority of the third shift is lower in the day. Under the same other conditions, the priority of the connection point is positively related to the piece quantity of the connection point, that is, under the same other conditions, the priority of the connection point with the piece quantity of 1000 is higher than the priority of the connection point with the piece quantity of 800, so that the selected connection point for straightening has more piece quantities, more piece quantities are distributed in the straightening process, and the distribution efficiency of the whole logistics can be improved. In order to further improve the distribution efficiency of the whole logistics, in a preferred embodiment of the present invention, the priority of the connection point is the product of the distance from the connection point to the transfer station and the quantity of the connection point of the transportation shift. By considering the influence of the distance of the connection points when selecting the connection points for straightening, more goods with longer distance can be straightened. Compared with the method that the goods in a shorter distance are straightened, the lower limit of the logistics time can be improved by straightening the goods in a longer distance, and the logistics distribution efficiency of different connection points is closer.
Acquiring available transportation resources of the transportation shift; the available transportation resources include: the number of vehicles available for logistics transportation, the number of available gates for sorting goods at a transfer station, and of course, the number of drivers, etc., are included, but generally, the number of drivers rarely constitutes a limitation for transportation.
Determining the junction points of the transportation shift which are in the straight hair, so that the sum of the priorities of all the junction points in the straight hair is the maximum under the condition that the transportation task and the available transportation resources are met. After the priorities of the connecting points are determined, under the condition that the transportation tasks and the available transportation resources are met, the scheme enabling the sum of the priorities of the straight connecting points to be the largest is selected. For example, in a certain transportation shift, under the condition that the transportation task and the available transportation resources are satisfied, the straight connection points may be x2, x4, x1, x3, x5, or x1, x2, x3, and the priority levels of the connection points x1, x2, x3, x4, x5 are 2000, 4000, 3000, 6000, 3000, respectively. Then, when x2 and x4 are selected as the connection points for straightening, the sum of the priorities of all the connection points for straightening is 10000; when x1, x3 and x5 are selected as the connection points for straightening, the sum of the priorities of all the connection points for straightening is 8000; when x1, x2 and x3 are selected as the connection points for straightening, the sum of the priorities of all the connection points for straightening is 9000; and determining the connection points x2 and x4 as the connection points for straightening the transport shift because the sum of the priorities of all the connection points for straightening is the maximum when the connection points x2 and x4 are selected as the connection points for straightening the transport shift.
The priority which can reflect the influence degree of the connection points on the logistics efficiency (such as the piece amount of the connection points, the distance from the transfer station, the size of the coverage range and the like) is set for the connection points, and the connection points with the maximized priority are selected as the connection points for straightening based on the setting, so that the distribution efficiency of the whole logistics can be better improved.
In order to reduce the cost expenditure of the network nodes, in one embodiment of the present invention, before determining the connection point for straightening, the network nodes further include the following steps:
determining a cancelable mesh point, wherein the cancelable mesh point is a mesh point which can be straightly sent by a connecting point in a distribution range in each shift; for a network point, when each access point in the distribution range can be directly sent in each shift under the condition of meeting the transportation task and available transportation resources, the network point can be cancelled.
Straightening the connection points in the distribution range of the cancelable mesh points;
and canceling the cancelable mesh points.
The embodiment of the invention can cancel part of the network points by using the straight method to distribute the connection points instead of the network point transfer method, thereby saving the operation cost of the network points, and simultaneously, the cargo distribution efficiency of the connection points in the distribution range of the cancelled network points is improved because the transfer by the network points is not needed.
In a preferred embodiment of the present invention, when there are multiple halftone dots that can be cancelled and cannot be cancelled simultaneously, each possible halftone dot cancellation combination is determined as a halftone dot cancellation scheme, such as scheme 1 is to cancel halftone dots S1 and S2 simultaneously (of course, if the halftone dots S1 and S2 can be cancelled simultaneously, the halftone dot S1 can be cancelled separately or the halftone dot S2 can be cancelled separately), scheme 2 is to cancel halftone dot S3, scheme 3 is to cancel halftone dots S4 and S5 simultaneously, and scheme 4 is to cancel halftone dots S1 and S4 simultaneously.
For each mesh point canceling scheme, determining the sum of the priorities of all the straight-hair connection points (because mesh points are canceled, the connection points in the mesh point distribution range need to be straight-hair) in the scheme; if the sum of the priorities of all the connection points which are subjected to hair straightening under the scheme 2 is the sum of the priorities of the connection points in the distribution range of the network point S3; the sum of the priorities of all the connection points which are subjected to hair straightening under the scheme 3 is the sum of the priorities of the connection points in the distribution range of the mesh point S4 and the mesh point S5; the sum of the priorities of all the connection points which are subjected to the straightening under the scheme 4 is the sum of the priorities of the connection points in the distribution range of the mesh point S1 and the mesh point S4.
And selecting a mesh point canceling scheme which enables the sum of the priorities to be maximum, canceling the corresponding mesh point, and straightening the junction point which does not have the mesh point to transit because the mesh point is canceled.
The preferred embodiment of the invention can select the network node canceling scheme which is optimal for improving the distribution efficiency of the whole logistics when various network node canceling schemes exist, thereby achieving the effect of further improving the distribution efficiency of the whole logistics.
Because the number of the connection points is large, the number of combinations of different connection points is huge, the calculation amount is too high by selecting the connection point combination with the largest sum of the priorities after each possible combination is calculated one by one, the straight connection point is difficult to be determined in time, and the requirement of logistics on timeliness of a determined scheme cannot be met. To solve this problem and to determine the connection points that are straight, more quickly, in an embodiment of the present invention, the step of determining the connection points that are straight for the transportation shift so that the sum of the priorities of all the connection points that are straight under the condition that the transportation task and the available transportation resources are satisfied is the maximum comprises:
constructing a target function representing the sum of the priorities of all the connection points which are subjected to hair straightening; the objective function may be determined by whether the junction is serviced by a vehicle (indicating that there is a vehicle straightening the junction when the junction is serviced by a vehicle), such as the objective function is:
wherein i is the number of the connection point; n is the total number of the connection points; p is a radical of formula i Is the priority of the docking point i; delta i For indicating whether or not the contact point i is serviced by a vehicle, δ when the contact point i is serviced by a vehicle i =1, otherwise δ i ＝0。
Determining constraint conditions of the objective function according to the transportation tasks and available transportation resources of the transportation shift; for example, the available transportation resources include the number of available slots of the transfer station, and the limitation conditions at this time are as follows: in the objective function, δ i And =1 is not more than the available bayonet number of the transit field. Meanwhile, the number of available vehicles, the speed of the vehicles, the distance between the connection points and the distance of the transition point in the distance between the connection pointsSeparating the time window of the access point, etc. will impose constraints on whether the access point is serviced by a vehicle.
Determining a service state of the connection point when the objective function reaches a maximum value under the constraint condition, wherein the service state comprises: vehicular service and non-vehicular service; due to δ suffered by the objective function i =1 number of occurrences no greater than the limit of available gates for transitions, significantly reducing the number of possible combinations of contacts to straighten out, enabling a significant increase in the speed of selecting contacts with the largest sum of priorities.
And determining the connection point with the service state of being served by the vehicle as the connection point for the transportation shift to carry out straightening.
The embodiment of the invention reduces the number of different connection point combinations by limiting the number of available bayonets of the transfer, and can determine the connection points for straightening hair more quickly.
Further, in order to more quickly select the access point with the largest sum of priorities, in a preferred embodiment of the present invention,
the objective function is a function based on the priority of the connection point and the service state of the vehicle to the connection point; the objective function is:
wherein i is the number of the connection point; k is the number of the vehicle; n is the total number of the connection points; p is a radical of i Is the priority of the docking point i;
for indicating whether or not the access point i is served by the vehicle k, and when the access point i is served by the vehicle k, then>
Otherwise
When the priority of the connection point is the distance and place between the connection point and the transfer stationThe objective function is, when the product of the quantities of the connection points of the transport shift is described below:
wherein, d i The distance from the docking point i to the transition. In the preferred embodiment provided by the invention, the delivery relationship between the vehicles and the access points is linked, and the delivery relationship between the vehicles and the access points is limited by the speed of the vehicles, the distance between the access points and a transition point, and the time window of the access points, so that the number of the vehicles limits the number of the selected combinations of the access points, and the speed of the access point with the largest sum of the selected priorities can be obviously increased.
The constraint conditions include: the vehicles can not be overloaded, at most one vehicle can only be used for service at any transport shift connecting point, the distribution tasks of the connecting points are completed in the time window of the connecting point, and the total number of the straight connecting points in any transport shift is not more than the available bayonet number of the transit station in the transport shift. The constraint may be expressed as:
wherein q is i The quantity of the connection point i; q k Is the maximum cargo capacity of vehicle k; m is the number of available vehicles; a is i The starting time of the time window for the docking point i; b i The end time of the time window for the docking point i;
a point in time served by vehicle k for docking point i; b is the number of available bayonets. These constraints in turn indicate that none of the vehicles can be overloaded, that at most one vehicle can serve at any transport shift access point, that the tasks of delivery at the access point are completed within the time window of the access point, and that the total number of access points which are straight at any transport shift is not greater than the total number of transfer stations at the transport shiftThe available bayonet number of the shift. By these constraints, the variable space of the objective function can be further limited, and the junction point at which the hair is straightened can be determined more quickly.
In order to improve the distribution efficiency of the whole logistics without excessively increasing the distribution cost of the logistics, after the connection points to be straightened are determined, the whole distribution network needs to be optimized in terms of transportation cost, in one embodiment of the invention,
the step of determining a first transportation line for delivering goods from the transition to the connection point for straightening of the transportation shift according to the determined connection point for straightening of the transportation shift comprises the following steps: determining a transportation line corresponding to the distribution scheme of the main road Cheng Zuiduan in the distribution schemes from the transfer to the determined straight connection point as a first transportation line in the transportation shift;
the second transportation route for goods distribution from the transfer point to the network point of the transportation shift is determined according to the determined connection point for straightening, and the second transportation route comprises: in the transportation shift, determining a transportation line corresponding to the distribution scheme of the main road Cheng Zuiduan in the distribution schemes from the transfer to the network points as a second transportation line; the mesh points are mesh points which comprise connection points without straight hair in a distribution range;
the third transportation route for determining the transportation shift to deliver the goods from the network point to the connection point within the delivery range of the transportation shift according to the determined connection point for straightening comprises the following steps: in the transportation shift, determining a transportation line corresponding to a distribution scheme of the main road Cheng Zuiduan in distribution schemes from the network points to the connection points in the distribution range as a third transportation line; the connection point is not used for straightening hair.
The cost limitation of the whole distribution network is realized by respectively optimizing the transportation lines for distribution from the transit to the connection points which are straight, the transportation lines for distribution from the transit to the network points and the transportation lines for distribution from the network points to the connection points which are not straight.
In an embodiment of the present invention, a transportation route planning system is further disclosed, as shown in fig. 2, which is a schematic diagram of a transportation route planning system in an embodiment of the present invention, including:
the system comprises a connection point selecting unit, a connection point selecting unit and a data processing unit, wherein the connection point selecting unit is used for determining a connection point for performing straight hair for any transportation shift, and the straight hair is used for distributing goods from a transfer station to the connection point without transfer through a network point;
the first transportation route planning unit is used for determining a first transportation route for cargo distribution of the transportation shift from the transition to the junction point which is subjected to the straightening according to the determined junction point which is subjected to the straightening;
the second transportation route planning unit is used for determining a second transportation route of the transportation shift for goods distribution from the transfer station to the network points according to the determined junction point for straightening;
and the third transportation route planning unit is used for determining a third transportation route for cargo distribution from the network point to the connection point within the distribution range of the transportation shift according to the determined connection point for straightening.
In a preferred embodiment of the present invention, the docking point selecting unit includes:
the priority determining unit is used for determining the priority of the transportation shift connection point;
a transportation condition acquisition unit for acquiring available transportation resources of the transportation shift;
a connection point determining unit, configured to determine the connection points at which the transportation shift is going straight, so that the sum of the priorities of all the connection points going straight is the largest under the condition that the available transportation resources are satisfied.
The embodiment of the invention and the preferred embodiment provide a transportation route planning system, which can execute the embodiment of the method, and the implementation principle and the technical effect are similar, and are not described again.
The foregoing description is only exemplary of the preferred embodiments of the application and is illustrative of the principles of the technology employed. It will be appreciated by a person skilled in the art that the scope of the invention according to the present application is not limited to the specific combination of the above-mentioned features, but also covers other embodiments where any combination of the above-mentioned features or their equivalents is made without departing from the inventive concept. For example, the above features may be replaced with (but not limited to) features having similar functions disclosed in the present application.
Claims (8)
1. A transportation route planning method, characterized by comprising the steps of:
determining a connection point for performing straight hair for any transportation shift, wherein the straight hair is used for distributing goods from a transfer station to the connection point without transfer through a network point;
determining a first transportation line for goods distribution of the transportation shift from a transition to the connection point for straightening according to the determined connection point for straightening;
determining a second transportation line for goods distribution from a transit station to a network point of the transportation shift according to the determined junction point for straightening;
determining a third transportation line for goods distribution from the network points to the connection points within the distribution range of the transportation shift according to the determined connection points for straightening;
wherein, the step of determining a junction point for straightening for any transport shift comprises: determining a transport mission for the transport shift; determining the priority of the transportation class access point according to the transportation task; obtaining available transportation resources of the transportation shift; determining the straight connection points of the transportation shift so as to maximize the sum of the priorities of all the straight connection points under the condition of meeting the transportation task and the available transportation resources;
the step of determining a first transportation line for delivering goods from the transition to the connection point for straightening of the transportation shift according to the determined connection point for straightening of the transportation shift comprises the following steps: determining a transportation line corresponding to the distribution scheme of the main road Cheng Zuiduan in the distribution schemes from the transition to the determined connection point for straightening as a first transportation line in the transportation shift;
the second transportation route for goods distribution from the transfer point to the network point of the transportation shift is determined according to the determined connection point for straightening, and the second transportation route comprises: in the transportation shift, determining a transportation line corresponding to the distribution scheme of the main road Cheng Zuiduan in the distribution schemes from the transfer to the network points as a second transportation line; the mesh points are mesh points which comprise junction points without straight hair in the distribution range;
the third transportation route for determining the transportation shift to deliver the goods from the network point to the connection point within the delivery range of the transportation shift according to the determined connection point for straightening comprises the following steps: in the transportation shift, determining a transportation line corresponding to a distribution scheme of the main road Cheng Zuiduan in distribution schemes from the network points to the connection points in the distribution range as a third transportation line; the connection points are connection points which do not straighten hair.
2. The transportation route planning method of claim 1, wherein said any transportation shift is a first shift of the day.
3. The transportation route planning method according to claim 1,
the transportation task of the transportation shift comprises the distance from the access point to the transfer station and the quantity of the access point of the transportation shift;
the priority of the connection points is the product of the distance from the connection points to the transfer station and the piece quantity of the connection points of the transportation shift.
4. The transportation route planning method according to claim 1,
before determining the junction point for straightening, the method further comprises the following steps:
determining a cancelable mesh point, wherein the cancelable mesh point is a mesh point at which a connection point in a distribution range can be subjected to straight hair in each shift;
straightening the connection points in the distribution range of the cancelable mesh points;
and canceling the cancelable mesh points.
5. The transportation route planning method according to claim 1 or 3, wherein said step of determining the straight access points of the transportation shift so as to maximize the sum of the priorities of all the straight access points on condition that the transportation mission and the available transportation resources are met comprises:
constructing a target function representing the sum of the priorities of all the connection points which are subjected to hair straightening;
determining constraint conditions of the objective function according to the transportation tasks and available transportation resources of the transportation shift;
determining a service state of the connection point when the objective function reaches a maximum value under the constraint condition, wherein the service state comprises: vehicular service and non-vehicular service;
and determining the connection point with the service state of being served by the vehicle as the connection point for the transportation shift to carry out straightening.
6. The transportation route planning method according to claim 5, characterized in that:
the objective function is a function based on the priority of the connection point and the service state of the vehicle to the connection point;
the constraint conditions include: the vehicles cannot be overloaded, at most, only one vehicle can be used for service at any transport shift connecting point, the distribution tasks of the connecting points are completed in the time window of the connecting point, and the total number of the straight connecting points in any transport shift is not more than the available bayonet number of the transit station in the transport shift.
7. A transportation route planning system, comprising:
the system comprises a connection point selecting unit, a connection point selecting unit and a data processing unit, wherein the connection point selecting unit is used for determining a connection point for performing straight hair for any transportation shift, and the straight hair is used for distributing goods from a transfer station to the connection point without transfer through a network point;
the first transportation route planning unit is used for determining a first transportation route for cargo distribution of the transportation shift from the transition to the junction point which is subjected to the straightening according to the determined junction point which is subjected to the straightening;
the second transportation route planning unit is used for determining a second transportation route of the transportation shift for goods distribution from the transfer station to the network points according to the determined junction point for straightening;
a third transportation route planning unit, configured to determine, according to the determined junction point where the transportation shift is straight, a third transportation route where the transportation shift delivers goods from the network point to the junction point within the delivery range of the transportation shift;
the connection point selecting unit is also used for determining the transportation task of the transportation shift; determining the priority of the transportation class access point according to the transportation task; acquiring available transportation resources of the transportation shift; determining the straight connection points of the transportation shift so as to maximize the sum of the priorities of all the straight connection points under the condition of meeting the transportation task and the available transportation resources;
the first transportation route planning unit is further configured to determine, as the first transportation route, a transportation route corresponding to a distribution scheme of the main route Cheng Zuiduan in distribution schemes from a transition to the determined straight junction in the transportation shift;
the second transportation route planning unit is further configured to determine, as a second transportation route, a transportation route corresponding to a distribution scheme of the main route Cheng Zuiduan in distribution schemes from a transfer to a branch point in the transportation shift; the mesh points are mesh points which comprise connection points without straight hair in a distribution range;
the third transportation route planning unit is further configured to determine, in the transportation shift, a transportation route corresponding to a distribution scheme of the main route Cheng Zuiduan in distribution schemes from a network point to a connection point within a distribution range of the network point as a third transportation route; the connection point is not used for straightening hair.
8. The transportation route planning system of claim 7, wherein the docking point selection unit comprises:
the priority determining unit is used for determining the priority of the transportation shift junction;
a transportation condition acquisition unit for acquiring available transportation resources of the transportation shift;
a connection point determining unit, configured to determine the connection points at which the transportation shift is going straight, so that the sum of the priorities of all the connection points going straight is the largest under the condition that the available transportation resources are satisfied.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811526136.0A CN111325371B (en) | 2018-12-13 | 2018-12-13 | Transportation route planning method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811526136.0A CN111325371B (en) | 2018-12-13 | 2018-12-13 | Transportation route planning method and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111325371A CN111325371A (en) | 2020-06-23 |
| CN111325371B true CN111325371B (en) | 2023-04-18 |
Family
ID=71170094
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811526136.0A Active CN111325371B (en) | 2018-12-13 | 2018-12-13 | Transportation route planning method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111325371B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112308312B (en) * | 2020-10-29 | 2024-05-03 | 上海寻梦信息技术有限公司 | Warehouse-leaving package transfer method, model training method and related equipment |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2001233413A (en) * | 2000-02-21 | 2001-08-28 | Hitachi Ltd | Physical distribution planning system |
| JP2001273353A (en) * | 2000-03-24 | 2001-10-05 | Daihatsu Motor Co Ltd | Physical distribution system |
| CN101739812A (en) * | 2009-12-10 | 2010-06-16 | 浙江师范大学 | Route optimizing method for logistic distribution vehicle |
| CN106156966A (en) * | 2015-04-03 | 2016-11-23 | 阿里巴巴集团控股有限公司 | Logistics monitoring method and equipment |
| CN108921483A (en) * | 2018-07-16 | 2018-11-30 | 深圳北斗应用技术研究院有限公司 | A kind of logistics route planing method, device and driver arrange an order according to class and grade dispatching method, device |
-
2018
- 2018-12-13 CN CN201811526136.0A patent/CN111325371B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2001233413A (en) * | 2000-02-21 | 2001-08-28 | Hitachi Ltd | Physical distribution planning system |
| JP2001273353A (en) * | 2000-03-24 | 2001-10-05 | Daihatsu Motor Co Ltd | Physical distribution system |
| CN101739812A (en) * | 2009-12-10 | 2010-06-16 | 浙江师范大学 | Route optimizing method for logistic distribution vehicle |
| CN106156966A (en) * | 2015-04-03 | 2016-11-23 | 阿里巴巴集团控股有限公司 | Logistics monitoring method and equipment |
| CN108921483A (en) * | 2018-07-16 | 2018-11-30 | 深圳北斗应用技术研究院有限公司 | A kind of logistics route planing method, device and driver arrange an order according to class and grade dispatching method, device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111325371A (en) | 2020-06-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108764777B (en) | Electric logistics vehicle scheduling method and system with time window | |
| Shafahi et al. | A practical model for transfer optimization in a transit network: Model formulations and solutions | |
| Hsu et al. | Routing, ship size, and sailing frequency decision-making for a maritime hub-and-spoke container network | |
| EP2760696B1 (en) | Method and system for charging electric vehicles | |
| CN109214608A (en) | A kind of vehicle scheduling optimization method | |
| CN104464274A (en) | Car-sharing taxi taking method and server | |
| CN111985700B (en) | Vehicle carrying bill quantity balancing method and device for determining home delivery | |
| CN112085271B (en) | Crowdsourcing mode-based traditional industry cluster goods collection path optimization method | |
| CN112529487B (en) | Vehicle scheduling method, device and storage medium | |
| Kancharla et al. | An adaptive large neighborhood search approach for electric vehicle routing with load-dependent energy consumption | |
| CN111325371B (en) | Transportation route planning method and system | |
| Cao et al. | Electric vehicle charging reservation under preemptive service | |
| CN113935528B (en) | Intelligent scheduling method, intelligent scheduling device, computer equipment and storage medium | |
| CN114386720A (en) | Logistics system scheduling management method, system, terminal equipment and storage medium | |
| CN111898863B (en) | Dynamic scheduling method and device for vehicles in rail transit | |
| CN114118868A (en) | Scheduling system and method | |
| Fontes et al. | A bi-objective multi-population biased random key genetic algorithm for joint scheduling quay cranes and speed adjustable vehicles in container terminals | |
| CN115578013B (en) | Balanced scheduling method and system applied to intelligent bus | |
| Bai et al. | Online fair allocation in autonomous vehicle sharing | |
| CN116342005A (en) | Logistics system network construction method and related equipment | |
| CN115081819A (en) | Scheduling method, scheduling device, electronic equipment and storage medium | |
| CN110334723B (en) | Dynamically-increased baggage picking and delivering order scheduling method | |
| CN113327074B (en) | Logistics network updating method and device and logistics network structure | |
| García Albarracín et al. | Limited-stop high-frequency service design: Reducing in-vehicle congestion | |
| CN111860918A (en) | Distribution method and device, electronic device and computer readable medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |