CN110782073A - Series-point transportation model for single-point loading and multi-point unloading - Google Patents

Series-point transportation model for single-point loading and multi-point unloading Download PDF

Info

Publication number
CN110782073A
CN110782073A CN201910947708.0A CN201910947708A CN110782073A CN 110782073 A CN110782073 A CN 110782073A CN 201910947708 A CN201910947708 A CN 201910947708A CN 110782073 A CN110782073 A CN 110782073A
Authority
CN
China
Prior art keywords
point
customer
vehicle
client
unloading
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.)
Pending
Application number
CN201910947708.0A
Other languages
Chinese (zh)
Inventor
李俊杰
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Sinopharm Pharmaceutical Logistics Co Ltd
Original Assignee
Sinopharm Pharmaceutical Logistics Co Ltd
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 Sinopharm Pharmaceutical Logistics Co Ltd filed Critical Sinopharm Pharmaceutical Logistics Co Ltd
Priority to CN201910947708.0A priority Critical patent/CN110782073A/en
Publication of CN110782073A publication Critical patent/CN110782073A/en
Pending legal-status Critical Current

Links

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"
    • 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

Abstract

The invention discloses a serial point transportation model for single-point loading and multi-point unloading, which comprises the following steps: design chart Is a complete directed graph
Figure 100004_DEST_PATH_IMAGE004
Representing paths between clients
Figure 100004_DEST_PATH_IMAGE006
Is a set of nodes, and 0 represents the number of the distribution center, the other node numbers represent the numbers of the customers to be served, and the demand of customer i is
Figure 100004_DEST_PATH_IMAGE008
Arc of
Figure 100004_DEST_PATH_IMAGE010
The weight value of
Figure 100004_DEST_PATH_IMAGE012
Representing the cost of the vehicle from customer to customer, Q representing the maximum load capacity of each consist; variables are as follows: if it is not
Figure 100004_DEST_PATH_IMAGE014
Then consist k is shipped from customer i to customer j; determining a parameter list: n: the total number of customers,
Figure 100004_DEST_PATH_IMAGE016
: the client i is a member of the group,
Figure 100004_DEST_PATH_IMAGE018
: a distribution center is arranged at the center of the distribution box, : the cost of client i to client j,
Figure 100004_DEST_PATH_IMAGE022
: the amount of demand of the customer is such that,

Description

Series-point transportation model for single-point loading and multi-point unloading
Technical Field
The invention relates to the technical field of logistics transportation, in particular to a serial-point transportation model for single-point loading and multi-point unloading.
Background
The general target function of the graph theory model is the lowest total price, the limiting conditions include two factors, one is a load factor and the other is a time window factor, the existing national medicine logistics have one more limiting condition, and the number of transportation sites is less than or equal to 3 (namely, the number of the series points is less than or equal to 2).
First, analyzing the time window factor from the merck project, it can be seen that the price from south to any one location is 7000 m per car, which means that if the goods to two different locations need to be transported by cluster point, the price cannot be higher than 7000 m (if the price exceeds 7000 m, it is not difficult to find from the price optimization theory, only one car needs to be transported alone), and the cluster point cost is less than 7000 m, and through the cluster point price, it is found that if the distance between two locations exceeds 600km, the price exceeds 7000 m, which means that the first condition of cluster point is the distance is less than 600 km.
Then, we make a further assumption that the unloading start time of the first transportation task is about 2 pm, all the goods are checked at about 5 pm, the first transportation task is well-organized and accepted, then the transportation is started from 5 to the second transportation point, the transportation with the maximum transportation distance of 600km only needs about 9 hours, then the second transportation point in the middle of the night is sure to reach the transportation point of the cluster point, and the 9 th warehouse working time is completely reached, and the concept of time window is not available (according to the explanation of national drug logistics, it is almost impossible to transport 2 points a day, and even if the warehouses are in the same city, except for the warehouses a and B in the same place in the same city).
In summary, as long as we consider that the first transportation point is reached at about 2 pm (can be advanced), and the second transportation point on the second day is completely driven, the problem of time window does not need to be considered, so in the national medicine logistics model of this time, the limitation of vehicle support number and the limitation of number of times of serial connection are mainly considered, and then the following national medicine logistics transportation model is established.
Disclosure of Invention
The invention aims to provide a serial-point transportation model for single-point loading and multi-point unloading, so as to solve the problems in the background technology.
In order to achieve the purpose, the invention provides the following technical scheme: the model of the serial point transportation for single-point loading and multi-point unloading is as follows: design chart
Figure 11791DEST_PATH_IMAGE002
Is a complete directed graph
Figure DEST_PATH_IMAGE004
Representing paths between clients
Figure DEST_PATH_IMAGE006
Is a set of nodes, and 0 represents the number of the distribution center, the other node numbers represent the numbers of the customers to be served, and the demand of customer i is
Figure DEST_PATH_IMAGE008
Arc of
Figure DEST_PATH_IMAGE010
The weight value of Representing the cost of the vehicle from customer to customer, Q representing the maximum load capacity of each consist;
variables are as follows: if it is not
Figure DEST_PATH_IMAGE014
Then consist k is shipped from customer i to customer j;
determining a parameter list: n: the total number of customers,
Figure DEST_PATH_IMAGE016
: the client i is a member of the group,
Figure DEST_PATH_IMAGE018
: a distribution center is arranged at the center of the distribution box, : the cost of client i to client j,
Figure 334768DEST_PATH_IMAGE008
: the amount of demand of the customer is such that, : capacity limit of the consist;
an objective function:
Figure DEST_PATH_IMAGE022
；
constraint conditions are as follows:
Figure DEST_PATH_IMAGE024
，
，
Figure DEST_PATH_IMAGE028
，
Figure DEST_PATH_IMAGE030
，
Figure DEST_PATH_IMAGE032
。
preferably, the objective of the problem is to find a set of paths, requiring that the starting point of each path is a distribution center, the load of each train set cannot exceed a capacity limit Q, and the objective functions are to minimize the number of vehicles and transportation costs (directly expressed in the length of the travel path), respectively, a first constraint ensuring that each vehicle departs from the distribution center, a second constraint ensuring that each customer is visited only once by one train set, a fourth constraint ensuring that each vehicle meets the maximum load specification, a fifth constraint ensuring that a train set has at most 3 sites, the first four constraints being the same as the deterministic path planning model, and a final constraint being a constraint specific to the national drug logistics cold chain vehicle, each vehicle having at most 3 different sites.
Preferably, it is also used with a greedy algorithm, and each step of the greedy algorithm must satisfy the conditions ①, feasible in that it must satisfy the constraints of the problem, ②, locally optimal (which may be relaxed to better) that he is the best local selection (which may be relaxed to better) among all the possible selections in the current step, and ③, irrevocable, i.e., that the selection, once made, is not changeable at later steps of the algorithm.
Preferably, the system is also used with MATLAB, and the MATLAB needs to be introduced by tables, wherein the tables comprise a string point price table, a number of asks price table, a point distance table, a destination departure sequence table and a table containing the number of asks and a destination.
Preferably, the MATLAB program flow is: firstly, the table information enters a loveakb program to generate AK, AL, AM and AN programs (including a first time point crossing part program, a second time point crossing part program and a non-point crossing part program, and divided into 0 time point crossing calculation price, a vehicle, 1 time point crossing calculation price, a vehicle, 2 times point crossing calculation price and a vehicle), then the results of AK, AM, AL and AN are accumulated to generate AN answer table, and finally, the result is automatically output to the program.
Compared with the prior art, the invention has the following beneficial effects:
the invention uses the minimum algorithm complexity to obtain the local optimal solution closest to the global optimal solution, can analyze the limitation of the vehicle support number and the serial number, has the optimal price, ensures that the overall accuracy of the model reaches about 90 percent, and has qualified project acceptance.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
The model of the serial point transportation for single-point loading and multi-point unloading is as follows: design chart
Figure 477780DEST_PATH_IMAGE002
Is a complete directed graph
Figure 229835DEST_PATH_IMAGE004
Representing paths between clients Is a set of nodes, and 0 represents the number of the distribution center, the other node numbers represent the numbers of the customers to be served, and the demand of customer i is
Figure 506281DEST_PATH_IMAGE008
Arc of
Figure 705182DEST_PATH_IMAGE010
The weight value of Representing the cost of the vehicle from customer to customer, Q representing the maximum load capacity of each consist;
variables are as follows: if it is not
Figure 305107DEST_PATH_IMAGE014
Then, thenConsist k is shipped from customer i to customer j;
determining a parameter list: n: the total number of customers, : the client i is a member of the group,
Figure 484864DEST_PATH_IMAGE018
: a distribution center is arranged at the center of the distribution box, : the cost of client i to client j,
Figure 375777DEST_PATH_IMAGE008
: the amount of demand of the customer is such that, : capacity limit of the consist;
an objective function:
Figure 79476DEST_PATH_IMAGE022
；
constraint conditions are as follows:
Figure 660630DEST_PATH_IMAGE024
，
Figure 704720DEST_PATH_IMAGE026
，
，
，
Figure 948117DEST_PATH_IMAGE032
。
the local optimal solution closest to the global optimal solution is obtained by using the minimum algorithm complexity, the limitation of the vehicle support number and the number of times of the serial points can be analyzed, the price is optimal, the overall accuracy of the model reaches about 90%, and the project acceptance is qualified.
The objective of the problem is to find a set of paths, requiring the starting point of each path to be the distribution center, the load of each train set not to exceed the capacity limit Q, and the objective functions to minimize the number of vehicles and the transportation cost (directly expressed in the length of the travel path), respectively, the first constraint ensuring that each vehicle departs from the distribution center, the second and third constraint ensuring that each customer is visited only once by one train set, the fourth constraint ensuring that each vehicle meets the maximum load specification, the fifth constraint ensuring that a train set goes to 3 locations at most, the first four constraints being the same as the deterministic path planning model, and the last constraint being the special constraints of the cold chain train of the national drug logistics, each vehicle can go to 3 different locations at most.
It is also used with a greedy algorithm that must satisfy the conditions ①, feasible that it must satisfy the constraints of the problem, ②, local optimum (which can be relaxed to better), that it is the best local choice among all the possible choices in the current step (which can be relaxed to better choice), ③, irrevocable that the choice, once made, cannot be changed in later steps of the algorithm.
The system is also matched with MATLAB for use, and the MATLAB is required to be introduced by tables, wherein the tables comprise a string point price table, a number support price table, a place distance table, a destination departure sequence table and a table surface containing the number support and the destination.
The MATLAB program flow is: firstly, the table information enters a loveakb program to generate AK, AL, AM and AN programs (including a first time point crossing part program, a second time point crossing part program and a non-point crossing part program, and divided into 0 time point crossing calculation price, a vehicle, 1 time point crossing calculation price, a vehicle, 2 times point crossing calculation price and a vehicle), then the results of AK, AM, AL and AN are accumulated to generate AN answer table, and finally, the result is automatically output to the program.
When the model is used, the local optimal solution closest to the global optimal solution is obtained by using the minimum algorithm complexity, the limitation of the vehicle support number and the serial number of points can be analyzed, the price is optimal, the overall accuracy of the model reaches about 90%, and the project acceptance is qualified.
Although embodiments of the present invention have been shown and described, it will be appreciated by those skilled in the art that changes, modifications, substitutions and alterations can be made in these embodiments without departing from the principles and spirit of the invention, the scope of which is defined in the appended claims and their equivalents.

Claims (5)

1. The model of the serial point transportation for single-point loading and multi-point unloading is as follows: design chart
Figure 106512DEST_PATH_IMAGE001
Is a complete directed graph
Figure 458996DEST_PATH_IMAGE002
Representing paths between clients
Figure 401544DEST_PATH_IMAGE003
Is a set of nodes, and 0 represents the number of the distribution center, the other node numbers represent the numbers of the customers to be served, and the demand of customer i is
Figure 839478DEST_PATH_IMAGE004
Arc of
Figure 197778DEST_PATH_IMAGE005
The weight value of
Figure 670348DEST_PATH_IMAGE006
Representing the cost of the vehicle from customer to customer, Q representing the maximum load capacity of each consist;
variables are as follows: if it is not
Figure 783798DEST_PATH_IMAGE007
Then consist k is shipped from customer i to customer j;
determining a parameter list: n: the total number of customers,
Figure 709028DEST_PATH_IMAGE008
: the client i is a member of the group,
Figure 621752DEST_PATH_IMAGE009
: a distribution center is arranged at the center of the distribution box, : the cost of client i to client j,
Figure 967600DEST_PATH_IMAGE004
: the amount of demand of the customer is such that,
Figure 317809DEST_PATH_IMAGE010
: capacity limit of the consist;
an objective function:
Figure 345808DEST_PATH_IMAGE011
；
constraint conditions are as follows:
Figure 527391DEST_PATH_IMAGE012
，
Figure 717064DEST_PATH_IMAGE013
，
Figure 616887DEST_PATH_IMAGE014
，
Figure 369948DEST_PATH_IMAGE015
，
Figure 671616DEST_PATH_IMAGE016
。
2. the tandem transport model for single point loading and multiple point unloading of claim 1, wherein: the objective of the problem is to find a set of paths, requiring the starting point of each path to be a distribution center, the load of each train set cannot exceed a capacity limit Q, and the objective functions are to minimize the number of vehicles and the transportation cost (directly expressed in the length of the travel path), respectively, the first constraint condition ensures that each vehicle departs from the distribution center, the second and third constraint conditions ensure that each customer is visited only once by one train set, the fourth constraint condition is that each vehicle meets the maximum load specification, the fifth constraint condition is that a train set goes to 3 places at most, the first four constraint conditions are the same as the deterministic path planning model, and the last constraint condition is a constraint condition specific to the national drug logistics cold chain train, and each vehicle can go to 3 different points at most.
3. The tandem transport model for single-point loading and multi-point unloading according to claim 1, wherein said model is further used with a greedy algorithm, and wherein each step of the greedy algorithm must satisfy ①, feasible in that it must satisfy constraints of the problem, ②, locally optimal (can be relaxed to better) that it is the best local selection (can be relaxed to better) among all the feasible selections in the current step, and ③, irrevocable, that once a selection is made, it cannot be changed in later steps of the algorithm.
4. The tandem transport model for single point loading and multiple point unloading of claim 1, wherein: the system is also matched with MATLAB for use, and the MATLAB needs to be introduced by tables, wherein the tables comprise a string point price table, a number support price table, a place distance table, a destination departure sequence table and a table surface containing the number support and the destination.
5. The tandem transport model for single point loading and multiple point unloading of claim 4, wherein: the MATLAB program flow is as follows: firstly, the table information enters a loveakb program to generate AK, AL, AM and AN programs (including a first time point crossing part program, a second time point crossing part program and a non-point crossing part program, and divided into 0 time point crossing calculation price, a vehicle, 1 time point crossing calculation price, a vehicle, 2 times point crossing calculation price and a vehicle), then the results of AK, AM, AL and AN are accumulated to generate AN answer table, and finally, the result is automatically output to the program.
CN201910947708.0A 2019-10-08 2019-10-08 Series-point transportation model for single-point loading and multi-point unloading Pending CN110782073A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910947708.0A CN110782073A (en) 2019-10-08 2019-10-08 Series-point transportation model for single-point loading and multi-point unloading

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910947708.0A CN110782073A (en) 2019-10-08 2019-10-08 Series-point transportation model for single-point loading and multi-point unloading

Publications (1)

Publication Number Publication Date
CN110782073A true CN110782073A (en) 2020-02-11

Family

ID=69384808

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910947708.0A Pending CN110782073A (en) 2019-10-08 2019-10-08 Series-point transportation model for single-point loading and multi-point unloading

Country Status (1)

Country Link
CN (1) CN110782073A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113537672A (en) * 2020-04-15 2021-10-22 北京旷视机器人技术有限公司 Task allocation method, task allocation device, medium, and electronic device

Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106203912A (en) * 2016-07-07 2016-12-07 成都镜杰科技有限责任公司 Logistics information intelligent processing method
CN107145971A (en) * 2017-04-18 2017-09-08 苏州工业职业技术学院 A kind of express delivery dispatching optimization method of dynamic adjustment
CN108537491A (en) * 2018-04-27 2018-09-14 河南农业大学 A kind of fresh agricultural products Distribution path optimization method, storage medium
CN109034468A (en) * 2018-07-19 2018-12-18 南京邮电大学 A kind of logistics distribution paths planning method with time window based on cuckoo algorithm
CN109034481A (en) * 2018-07-31 2018-12-18 北京航空航天大学 A kind of vehicle routing problem with time windows modeling and optimization method based on constraint planning
CN109858739A (en) * 2018-12-20 2019-06-07 电子科技大学中山学院 logistics transportation scheduling method, computer storage medium and electronic equipment
CN110046749A (en) * 2019-03-22 2019-07-23 杭州师范大学 It is a kind of based on real-time road electric business package with city o2o wrap up Common Distribution system
CN110119831A (en) * 2018-02-07 2019-08-13 青岛农业大学 A kind of the transportation route optimization system and method for logistic management system
CN110197311A (en) * 2019-06-12 2019-09-03 江苏航运职业技术学院 A kind of logistics distribution paths planning method based on intelligent optimization

Patent Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106203912A (en) * 2016-07-07 2016-12-07 成都镜杰科技有限责任公司 Logistics information intelligent processing method
CN107145971A (en) * 2017-04-18 2017-09-08 苏州工业职业技术学院 A kind of express delivery dispatching optimization method of dynamic adjustment
CN110119831A (en) * 2018-02-07 2019-08-13 青岛农业大学 A kind of the transportation route optimization system and method for logistic management system
CN108537491A (en) * 2018-04-27 2018-09-14 河南农业大学 A kind of fresh agricultural products Distribution path optimization method, storage medium
CN109034468A (en) * 2018-07-19 2018-12-18 南京邮电大学 A kind of logistics distribution paths planning method with time window based on cuckoo algorithm
CN109034481A (en) * 2018-07-31 2018-12-18 北京航空航天大学 A kind of vehicle routing problem with time windows modeling and optimization method based on constraint planning
CN109858739A (en) * 2018-12-20 2019-06-07 电子科技大学中山学院 logistics transportation scheduling method, computer storage medium and electronic equipment
CN110046749A (en) * 2019-03-22 2019-07-23 杭州师范大学 It is a kind of based on real-time road electric business package with city o2o wrap up Common Distribution system
CN110197311A (en) * 2019-06-12 2019-09-03 江苏航运职业技术学院 A kind of logistics distribution paths planning method based on intelligent optimization

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113537672A (en) * 2020-04-15 2021-10-22 北京旷视机器人技术有限公司 Task allocation method, task allocation device, medium, and electronic device

Similar Documents

Publication Publication Date Title
Huo et al. The allocation problem of electric car-sharing system: A data-driven approach
Park et al. A post-improvement procedure for the mixed load school bus routing problem
Lin et al. A simulated annealing heuristic for the truck and trailer routing problem with time windows
CN107274033B (en) Simple and feasible dynamic distribution path optimization method
Lin A cooperative strategy for a vehicle routing problem with pickup and delivery time windows
Zhu et al. The capacitated plant location problem with customers and suppliers matching
Bretzke Global urbanization: a major challenge for logistics
CN105678493B (en) Multistage distribution path establishing method and multistage distribution system
AU2014324087A1 (en) Determining network maps of transport networks
CN110782073A (en) Series-point transportation model for single-point loading and multi-point unloading
Pandelis et al. Finite and infinite-horizon single vehicle routing problems with a predefined customer sequence and pickup and delivery
Chow et al. An argumentation-oriented multi-agent system for automating the freight planning process
Palhares et al. Vehicle routing: application of travelling salesman problem in a dairy
Gaul et al. Solving the dynamic dial-a-ride problem using a rolling-horizon event-based graph
Corentin et al. Automated Delivery Robots: A Vehicle Routing Problem on last mile delivery cost per unit based on range and carrying capacity
Niu et al. End-of-line delivery vehicle routing optimization based on large-scale neighbourhood search algorithms considering customer-consumer delivery location preferences
Li et al. Optimization of vehicle routing problem with fatigue driving based on genetic algorithm
Islam et al. Rolling planning method for two-stage logistics system under unsteady demand
Cipta et al. Optimal Vehicle Routing Problem (VRP) For The Distribution Of Medical Devices By Applying The Clarke-Wright Algorithm
US20160034849A1 (en) System for assigning a goods consumer to a goods provider
Rosyida et al. Freight route planning in intermodal transportation network to deal with combinational disruptions
Gong et al. Two-generation ant colony system for vehicle routing problem with time windows
Zhang et al. INVESTIGATION ON THE LAST-MILE DELIVERY OF RURAL LOGISTICS UNDER CROWDSOURCING TRANSPORTATION IN CHINA.
Saker et al. Capacitated Vehicle Routing Problem with Delivery Options: Private or Shared Location
Li et al. Research on Network Drop Truck Scheduling Based on Dijkstra Algorithm

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