Improved chromosome coding based logistic transportation and scheduling method
A scheduling method and chromosome technology, applied in logistics, instruments, data processing applications, etc., can solve the problems that orders cannot be delivered in batches, and it is difficult to obtain accurate solutions, so as to improve the speed and accuracy of distribution, increase profits, and reduce distribution. cost effect
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0052] Suppose there are m vehicles in the distribution center, and the capacity of each vehicle is q i (i=1,2,3,...,m). In order to reduce distribution costs and improve distribution efficiency, under the given time constraints, vehicle capacity constraints and other related constraints, it is necessary to design an optimal distribution route for each vehicle.
[0053] Several constraints of the optimization algorithm are described as follows: the distribution of commercial companies, the distribution volume of commercial companies, the number of available vehicles, and the capacity of vehicles. The least number of delivery vehicles and the shortest vehicle transportation distance are the optimization results of the algorithm. If the above two conditions can be satisfied at the same time, it is the optimal solution, but this is often impossible. So as long as one of the above two conditions is met.
[0054] The solution to the route optimization algorithm is mainly divided...
Embodiment 2
[0070] (1) Coding
[0071] Utilizing the chromosome principle and using natural numbers to encode the delivery target node, it is convenient and simple, and it is also convenient for computer processing. Use a chromosome of length k+m+1 to encode the mathematical model solution vector obtained in the previous section, the chromosome is (0,i 1 ,i 2 ,...,i 8 ,0,i j ,...,i 8 ,0,...,0,i p ,...,i q ,0).
[0072] This chromosome has a total of m+1 0s, 0 means the distribution center, i j Denotes commercial company j, and there are k commercial companies in total. This chromosome is expressed as: the first car departs from the distribution center and passes through i j ,...,i 8 After these commercial companies return to the distribution center, the first path is formed; the second vehicle starts from the distribution center and passes through i j ,...,i 8 After these commercial companies return to the distribution center, the second path is formed; the mth vehicle starts ...
Embodiment 3
[0112] The results of modeling through computer simulation programming:
[0113] This section takes Zhejiang China Tobacco Finished Cigarette Logistics Distribution as an example, and distributes cigarettes from Hangzhou Cigarette Factory to various commercial companies, as long as you know the distance of each commercial company, the demand of each commercial company for orders, and the geographical location information of each commercial company , the specific route of the vehicle can be obtained through the above genetic algorithm.
[0114] There is one distribution center, that is, Hangzhou Cigarette Factory and eight commercial companies, and the distance between each commercial company is shown in Table 1. The demand of each business company i is q i Cigarettes, where i=1,2,...,8, as shown in Table 2. According to the vehicle scheduling plan calculated by the scheduling algorithm and the specific route arrangement, the carrier starts from the distribution center, sends...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com