Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Multi-parking-lot multi-vehicle-model vehicle path planning method

A technology of vehicle routing and multi-vehicle models, applied in computing models, biological models, road network navigators, etc., can solve problems such as the quality of slow solutions, improve the quality of solutions, enhance local search capabilities and global search capabilities, The effect of improving versatility

Active Publication Date: 2020-02-28
ZHEJIANG UNIV OF TECH
View PDF5 Cites 5 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0010] (2) Aiming at the defects of slow solution process and low quality of the solution in the prior art, the present invention embeds the simulated annealing algorithm in the artificial fish swarm algorithm, and ensures that the quality of the solution will not decrease after the annealing search

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
  • Multi-parking-lot multi-vehicle-model vehicle path planning method
  • Multi-parking-lot multi-vehicle-model vehicle path planning method
  • Multi-parking-lot multi-vehicle-model vehicle path planning method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0078] The present invention will be further described below in conjunction with accompanying drawing, with reference to accompanying drawing, a kind of vehicle route planning method of multi-park multi-vehicle type of the present invention, comprises the following steps:

[0079] In step 1, the objective function is established with the goal of minimizing the total cost of vehicle distribution as follows:

[0080]

[0081] Among them, the first part of the objective function is the fixed cost of the delivery vehicle, and the second part is the variable cost of the delivery vehicle;

[0082] The relevant constraints of the model are as follows:

[0083]

[0084]

[0085]

[0086]

[0087]

[0088]

[0089] In the above model, formula (1) represents the objective function, that is, the minimum cost of delivery tasks; formula (2) means that the vehicles used cannot exceed the sum of the vehicles currently owned; formula (3) and formula (4) represent that a c...

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 discloses a multi-parking-lot multi-vehicle-model vehicle path planning method. The method comprises the following steps: 1) establishing an objective function by taking the lowest totalcost of vehicle distribution as an objective; 2) encoding and redefining an operation mode; 3) initializing a population; 4) calculating the fitness of the artificial fish, and recording the optimalindividual; 5) evaluating each fish, selecting the behavior of each fish at the same time, and selecting the behavior with the highest fitness improvement to execute; 6) calculating the fitness of theobtained new population, and updating the optimal solution in the population; 7) performing annealing search on the optimal solution of the population; 8) ending the primary iteration; 9) judging whether a termination condition is met or not, and if so, executing the step 10; otherwise, returning to execute the step 5, and carrying out a new round of iteration; and 10) decoding the finally recorded optimal individual, calculating the reciprocal of the fitness of the optimal individual, i.e., the value of the target function, and after decoding, taking the client between two same vehicle numbers in the obtained decoding sequence as the distribution route of the vehicle, and outputting an optimal scheme when the unused vehicle does not appear in the decoding sequence.

Description

technical field [0001] The invention relates to a vehicle route planning method for multiple parking lots and multiple vehicle models. Background technique [0002] The vehicle routing problem is widely used in daily life, especially with the continuous development of e-commerce, logistics enterprises have more opportunities and challenges, and the cost of logistics transportation is an important part of the service cost of logistics enterprises. Development has a significant impact. Therefore, formulating a reasonable vehicle scheduling and route plan based on the actual situation can save distribution costs to a large extent. Especially with the continuous increase in logistics volume, a reasonable distribution plan will bring greater benefits , while enhancing the competitiveness of logistics companies. Considering the above factors, it is of great significance to study the solution method of this problem. [0003] With the continuous increase of customer demand and dis...

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/04G06N3/00G01C21/34
CPCG06Q10/047G06N3/006G01C21/3446G01C21/3407
Inventor 冯定忠蒋权威
Owner ZHEJIANG UNIV OF TECH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products