Method for solving time-varying associated logistics transportation vehicle routing problem with hard time window

A technology related to logistics transportation and vehicle routing problems, which is applied in logistics, instruments, data processing applications, etc., and can solve problems such as not considering cargo related constraints

Inactive Publication Date: 2014-09-10
GUANGDONG UNIV OF TECH
View PDF0 Cites 35 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] Existing vehicle routing problems have the problem that all vehicle cargoes are loaded without considering the associative constraints between cargoes
In general, the time-varying associated logistics vehicle routing problem with hard time windows has multiple constraints, so it is more difficult than the ordinary vehicle problem

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
  • Method for solving time-varying associated logistics transportation vehicle routing problem with hard time window
  • Method for solving time-varying associated logistics transportation vehicle routing problem with hard time window
  • Method for solving time-varying associated logistics transportation vehicle routing problem with hard time window

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0077] The present invention will be further described below in conjunction with accompanying drawing:

[0078] The method of the invention based on the immune ant colony algorithm for the time-varying associated logistics transportation scheduling problem with a hard time window includes establishing a mathematical model of the problem, using the immune ant colony algorithm to obtain the initial solution of the chaotic tabu search algorithm, and the neighborhood construction based on the chaos optimization technology.

[0079] Such as figure 1 , 2 , As shown in 3, a method for solving the time-varying associated logistics transport vehicle routing problem with a hard time window includes the following steps:

[0080] 1) Establish a mathematical model of the time-varying associated logistics transportation vehicle routing problem with hard time window constraints;

[0081] The step 1) specifically includes the following steps:

[0082] Step 1.1: Describe the problem as foll...

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 method for solving a time-varying associated logistics transportation vehicle routing problem with a hard time window. The method includes the following steps: 1), building a math model of the time-varying associated logistics transportation vehicle routing problem with hard time window constraint; 2), designing an immune ant colony chaos taboo search algorithm to solve the problem. The method has the advantages that actual circumstances in the logistics transportation vehicle routing problem are reflected more accurately, so that a scheduling scheme formulated on the basis of the actual circumstances is more reliable; shortest vehicle traveling distance is taken as an optimization target, so that adapting requirements on the hard time window can be met better. The immune ant colony chaos taboo search algorithm is introduced, so that the method is enabled to have higher global and local optimization capability, and the method is enabled to have higher efficiency in solving large-scale problems.

Description

technical field [0001] The invention belongs to the field of logistics route planning and control, and in particular relates to a method for solving the route problem of time-varying associated logistics transport vehicles with hard time windows. Background technique [0002] Distribution is the core link of the logistics system, and it is an inevitable market behavior born with the market. With the increasingly fierce market competition and the continuous improvement of customer requirements, distribution will play a pivotal role in the future market competition. In the distribution business, the optimal scheduling of distribution vehicles involves a wide range of factors, and there are many factors to be considered. It also has a great impact on the distribution companies to improve service quality, reduce operating costs, and increase economic benefits. [0003] Scholars at home and abroad focus on the study of vehicle routing, mainly because it is the core issue of logis...

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/08G06Q50/28
Inventor 蔡延光郭帅蔡颢
Owner GUANGDONG UNIV OF TECH
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