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

Optimization algorithm for solving vehicle routing problem with time windows

A vehicle routing problem and optimization algorithm technology, applied in the field of modern heuristic algorithms, can solve problems such as slow convergence speed, large initial solution fluctuations, easy to fall into local optimal solutions, etc.

Inactive Publication Date: 2016-12-21
TSINGHUA UNIV
View PDF2 Cites 19 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Traditional heuristic algorithms such as saving algorithm, insertion algorithm, scanning algorithm, and two-stage method have many restrictions on the use of the algorithm itself, especially when the customer scale is large, the algorithm efficiency drops sharply, and it also faces many limitations
[0004] At present, the research on VRPTW solution methods is mainly transferred to modern heuristic algorithms such as simulated annealing algorithm, ant colony algorithm, genetic algorithm, artificial bee colony algorithm, etc., but the above-mentioned original algorithms also have their own shortcomings, mainly as follows: Larger range, poor neighborhood mining ability, slower convergence speed in the later stage, and easy to fall into local optimal solution, etc.

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
  • Optimization algorithm for solving vehicle routing problem with time windows
  • Optimization algorithm for solving vehicle routing problem with time windows
  • Optimization algorithm for solving vehicle routing problem with time windows

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0045] In order to make the objectives, technical solutions and advantages of the present invention clearer, the technical solutions in the embodiments of the present invention will be described in more detail below in conjunction with the drawings in the embodiments of the present invention. In the drawings, the same or similar reference numerals denote the same or similar elements or elements having the same or similar functions throughout. The described embodiments are some, but not all, embodiments of the invention. The embodiments described below by referring to the figures are exemplary and are intended to explain the present invention and should not be construed as limiting the present invention. Based on the embodiments of the present invention, all other embodiments obtained by persons of ordinary skill in the art without creative efforts fall within the protection scope of the present invention. Embodiments of the present invention will be described in detail below ...

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 an optimization algorithm for a vehicle routing problem with time windows. According to the optimization algorithm for the vehicle routing problem with time windows, a genetic algorithm and an artificial bee colony algorithm in a modern heuristic algorithm are organically integrated and improved, and an improved artificial bee colony algorithm is developed to solve a VRPTW problem.

Description

technical field [0001] The invention relates to the technical field of modern heuristic algorithms, in particular to an optimization algorithm for solving vehicle routing problems with time windows. Background technique [0002] Vehicle Routing Problems With Time Windows (VRPTW) is a typical combinatorial optimization problem that widely exists in our daily production and life, such as shopping malls, couriers delivering express delivery, and communication companies inspecting line nodes And aircraft, train, bus scheduling, etc. However, VRPTW is an NP-hard problem, and it is not easy to solve it accurately. Such problems have attracted many scientists in the world to devote their whole lives to research because of their huge scientific research value, economic value and practical application value. [0003] Among the VRPTW solution methods, the exact solution methods such as branch and bound method, cutting plane method, dynamic programming method and network flow method w...

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
IPC IPC(8): G06Q10/04G06N3/00G06N3/12
CPCG06N3/006G06N3/126G06Q10/047
Inventor 胡坚明裴欣刘宝龙张毅
Owner TSINGHUA UNIV
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