A low-cost vehicle scheduling and route planning method based on multiple depots and multiple models

A vehicle scheduling and path planning technology, applied in computational models, biological models, instruments, etc., can solve problems such as being unable to effectively meet the needs of enterprise scheduling, not fully considering the actual situation, easily falling into local optimal solutions, etc., to reduce inefficiencies The effect of calculating time, reducing the probability of falling into a local optimal solution, and accelerating the convergence speed

Active Publication Date: 2021-06-29
ZHEJIANG UNIV OF TECH
View PDF3 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0003] Traditional vehicle scheduling often only considers a single car model in a single car park, ignoring the impact of multi-car parks and multi-car models on logistics costs. At the same time, differences in labor costs and raw material costs caused by multiple car parks will also affect products The production cost will affect the total cost of sales, and finally directly affect the profit of the enterprise. Therefore, in the process of vehicle scheduling, multiple factors such as the parking lot, model and product cost should be considered together.
[0004] When the existing technology solves the problems related to vehicle scheduling, there are generally shortcomings such as not fully considering the actual situation, the solution scale is small, the solution accuracy is poor, and it is easy to fall into a local optimal solution, which cannot effectively meet the actual scheduling needs of the enterprise.

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 low-cost vehicle scheduling and route planning method based on multiple depots and multiple models
  • A low-cost vehicle scheduling and route planning method based on multiple depots and multiple models
  • A low-cost vehicle scheduling and route planning method based on multiple depots and multiple models

Examples

Experimental program
Comparison scheme
Effect test

example

[0139] Example: An oil company has four distribution centers, namely A, B, C, and D. There are 13 vehicles of three types. Now there are 50 customers who need oil distribution services. The specific information is shown in Table 1 and As shown in Table 2, it is required to arrange reasonable vehicles and their delivery routes to minimize the total cost of all vehicles and maximize the profit of the enterprise.

[0140] Table 1 Customer Information Form

[0141]

[0142] Table 2 Distribution center information table

[0143]

[0144]

[0145] Determine the total size of the frog group F=1000, the group number familyNum=20, the number of frogs in the group subFamiSize=50, the local search times numSe=10 for each group, the subgroup size Sz=35, the maximum number of iterations of the group G= 1000, initial temperature T=1000, cooling rate q=0.9. This example aims to minimize the total cost, including product cost and vehicle cost. After implementing the low-cost vehicl...

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 low-cost vehicle scheduling and path planning method based on multiple car parks and multiple models, which establishes an integer programming model; a genetic algorithm and a neighborhood search algorithm are mixed in the leapfrog algorithm, and the global optimization of the genetic algorithm is fully utilized ability and the local exploration ability of the neighborhood search algorithm; use cluster analysis to make the solution faster and the initial solution better; introduce the probability formula to construct part of the initial solution, improve the excellence of the initial solution, ensure the diversity of the population, and make the While the algorithm improves the convergence speed, it is not easy to fall into the local optimal solution; the method of multi-vehicle genetic coding reduces the invalid calculation time of the algorithm; More diversity; use the neighborhood search algorithm to conduct guided local optimization of the optimal individual in the group, speed up the convergence speed, and reduce the probability of the algorithm falling into the local optimal solution prematurely. High precision.

Description

technical field [0001] The invention relates to a low-cost vehicle dispatching and route planning method based on multiple car parks and multiple vehicle types. Background technique [0002] The problem of vehicle scheduling and route planning is a crucial issue affecting the logistics and transportation of enterprises, especially for some large traditional and modern logistics enterprises, the level of transportation costs seriously restricts the development of enterprises, therefore, how to meet the individual needs of customers, Reasonable and efficient scheduling and path planning of enterprise vehicles is a problem worthy of research. [0003] Traditional vehicle scheduling often only considers a single car model in a single car park, ignoring the impact of multi-car parks and multi-car models on logistics costs. At the same time, differences in labor costs and raw material costs caused by multiple car parks will also affect products The production cost will affect the...

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/06G06Q10/08G06Q10/04G06N3/00
CPCG06N3/006G06Q10/047G06Q10/06315G06Q10/08355
Inventor 鲁建厦李嘉丰陈寿伍闫青翟文倩李豪
Owner ZHEJIANG 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