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

A vehicle routing optimization method

An optimization method, a technology of vehicle routing, applied in the fields of genetic laws, instruments, data processing applications, etc., to avoid premature convergence

Active Publication Date: 2018-06-26
NANJING UNIV OF POSTS & TELECOMM
View PDF3 Cites 1 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0005] The invention utilizes the genetic algorithm to solve the vehicle routing problem in the global connection, so that the problem solving process is optimized in terms of time and space complexity

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
  • A vehicle routing optimization method
  • A vehicle routing optimization method
  • A vehicle routing optimization method

Examples

Experimental program
Comparison scheme
Effect test

specific Embodiment approach

[0034] According to the attached figure 1 , The specific implementation of the present invention is:

[0035] 1). Define the vehicle routing problem as a graph model.

[0036] 11). Analyze the problem of vehicle routing and list all customer nodes, dispatching station nodes and non-negative costs between nodes in the route;

[0037] 12). Take all customers and dispatching stations in the path as vertex V in the graph i ={0,1,2,...,n}, vertex i∈{1,...,n} corresponds to the customer, vertex 0 corresponds to the dispatching station, and n is the number of customers;

[0038] 13). Take the vertex representing the dispatching station in the figure as the cluster V 0 , The remaining vertices are divided into k clusters according to certain requirements;

[0039] 14). The path with cost between nodes is regarded as the arc with non-negative cost between vertices in the graph;

[0040] 15). Each customer and demand d i Related, fictionalize the peak demand of the dispatching station as d 0 = 0, ...

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 present invention provides a vehicle route optimization method, which defines the vehicle route problem as a graphical model, solves the inter-cluster cost path from a global perspective to obtain a feasible solution space, and uses the Monte Carlo method, genetic operation and quantum revolving door adaptive strategy etc. to optimize the feasible solution space. The invention can solve the problem of finding vehicle paths in global connections, optimize the problem solving process in time and space complexity, and avoid premature convergence. The vehicle routing problem to be solved by this invention refers to a certain number of customers, each of whom has a different quantity of goods requirements. The distribution center provides goods to the customers, and a fleet is responsible for distributing the goods and organizing appropriate driving paths. The goal is to make the customers The needs are met, and goals such as the shortest distance, the lowest cost, and the least time consumption can be achieved under certain constraints.

Description

Technical field [0001] The invention relates to an optimization method for a vehicle path problem, which mainly solves the minimum cost path between clusters from a global perspective to optimize the feasible solution space of the vehicle path problem, and belongs to the application field of computer technology, information technology, and artificial intelligence technology. Background technique [0002] Genetic algorithm is a computational model that simulates the biological evolution process of natural selection and genetic mechanism of Darwin's biological evolution theory. It is a method of searching for the optimal solution by simulating the natural evolution process. The algorithm is a kind of evolutionary law (suitable for reference). The survival of the fittest, the survival of the fittest (genetic mechanism of the survival of the fittest) has evolved from the randomized search method. Its main feature is to directly operate on structural objects without the limitation of d...

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 Patents(China)
IPC IPC(8): G06Q10/04G06N3/12
CPCG06N3/126G06Q10/047G06Q10/08
Inventor 陈志卢海燕岳文静
Owner NANJING UNIV OF POSTS & TELECOMM
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

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