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

Inactive Publication Date: 2015-11-25
CHINA TOBACCO ZHEJIANG IND
View PDF3 Cites 23 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] The vehicle routing problem is a non-deterministic polynomial problem, which is difficult to obtain an exact solution
[0007] 2) The customer's order cannot be delivered in batches, each customer's order must be delivered by one vehicle
[0015] (5) Problem with time window and problem without time window

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Improved chromosome coding based logistic transportation and scheduling method
  • Improved chromosome coding based logistic transportation and scheduling method
  • Improved chromosome coding based logistic transportation and scheduling method

Examples

Experimental program
Comparison scheme
Effect test

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...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention relates to a material scheduling method, in particular to an improved chromosome coding based logistic transportation and scheduling method. The method comprises the following steps: 1) coding; 2) initializing a population; 3) calculating the fitness of each individual, wherein the fitness is an index value used for measuring the quality of individuals in the population; 4) judging the fitness of each individual to determine that which of the individuals can enter the next step; 5) performing crossover operation according to a probability Pc; 6) performing mutation operation according to a probability Pm; 7) judging whether the optimal fitness of the individual meets a given condition or the fitness of the individual is not improved after repeatedly performing crossover and mutation operations, and if the condition is met, converging an iterative process of an algorithm and ending the algorithm; or otherwise, going to the step 3) and performing iterative operation; and 8) outputting an optimal solution by the algorithm. The method can provide an intelligent scheduling policy for decision markers of enterprises, so that the distribution speed is increased, the distribution accuracy is improved, the distribution cost is reduced, and the enterprise profit is increased.

Description

technical field [0001] The invention relates to a material scheduling method, in particular to a logistics transportation scheduling method based on improved chromosome coding. Background technique [0002] The transportation scheduling problem can affect the distribution service quality and distribution cost of enterprises. Optimized transportation scheduling speeds up delivery, reduces delivery costs, improves service quality, and increases corporate profits. Getting merchandise to customers on time and efficiently depends on proper vehicle scheduling. Generally speaking, the scheduling plan that decision makers need to formulate includes: the allocation of cargo vehicles, the selection of delivery routes, the selection of delivery time slots, and so on. [0003] However, if the distribution customers are many and scattered, and the distribution road is complicated, it is impossible to formulate a reasonable scheduling plan only by manual experience. Today's customers r...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Applications(China)
IPC IPC(8): G06Q10/04G06Q10/08G06Q50/28
Inventor 高扬华章志华陆海良郁钢单宇翔
Owner CHINA TOBACCO ZHEJIANG IND
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap