A Vehicle Scheduling Optimization Method

An optimization method and vehicle scheduling technology, applied in the computer field, can solve the problems of scattered unloading points, poor transportation conditions, and large demand, and achieve the effects of improving loading efficiency, reducing distribution costs, and improving economic benefits.

Active Publication Date: 2019-01-15
CHENGDU INFOEX TECH CO LTD
View PDF4 Cites 8 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0003] The technical problem to be solved by the present invention is that due to the special variety of feed itself, the demand for transportation and distribution of feed is large, most of the feed is not resistant to storage, the unloading points of farms are scattered, the transportation conditions are poor, and the arrival time is strong, making the logistics The cost occupies a large proportion of the total cost. The problem of vehicle scheduling is an important part that affects the logistics cost of feed enterprises. The existing vehicle scheduling technology has been unable to meet the requirements of reducing the logistics cost of feed enterprises and improving economic benefits. The purpose is to provide a A vehicle scheduling optimization method to solve the above problems

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 Scheduling Optimization Method
  • A Vehicle Scheduling Optimization Method
  • A Vehicle Scheduling Optimization Method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0027] A vehicle scheduling optimization method of the present invention comprises the following steps: S1: Acquiring vehicle information, distribution center information and destination information, and generating constraint conditions; S2: Allocating unloaded vehicles to the distribution center according to the constraint conditions; the constraint conditions It is a combination of one or more of time constraints, vehicle constraints, demand constraints, and distance constraints; S3: Design the distribution route for the allocated vehicles.

[0028]When this embodiment is implemented, vehicle information, distribution center information, and destination information are acquired first, and constraints are generated; the constraints mentioned here are one or more of time constraints, vehicle constraints, demand constraints, and distance constraints. Combination, time constraints are generally cargo delivery time, loading and unloading time, empty time, etc. Vehicle constraints ...

Embodiment 2

[0030] In this embodiment, on the basis of Embodiment 1, step S2 includes the following sub-steps: S21: number all vehicles; S22: obtain each The idle vehicles corresponding to the distribution center; S23: arrange the idle vehicles to the distribution center.

[0031] During the implementation of this embodiment, in order to match idle vehicles to distribution centers, all vehicles are first numbered, and then the corresponding idle vehicles of each distribution center are obtained according to the total demand of each distribution center and the average distance from all idle vehicles to the distribution center. Vehicles, generally speaking, each distribution center needs more than one vehicle, so it is necessary to balance the demand of the distribution center and the distance from the idle vehicle to the distribution center, and then arrange the idle vehicles to the distribution center, which can reduce the distance of the vehicle , It can also meet the needs of the distri...

Embodiment 3

[0033] In this embodiment, on the basis of Embodiment 2, step S22 includes the following sub-steps: obtain the corresponding idle vehicle of the distribution center according to the following formula: In the formula, q is the number of vehicles, λ is the adjustment coefficient, Gi is the quantity of feed that the i-th distribution center needs to distribute, θ is the time required to load each ton of feed, is the delivery distance from the jth vehicle to the i delivery point.

[0034] When this embodiment is implemented, the demand of the distribution center and the distance from the idle vehicle to the distribution center can be integrated through the above formula, and the i components can be optimized and sorted, and the top k vehicles can be selected to be arranged in each distribution center of i, from which through Argmin The function is selected to achieve the purpose of allocating vehicles.

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 vehicle scheduling optimization method, comprising the following steps: S1, acquiring vehicle information, distribution center information and destination information, and generating constraint conditions; 2, distributing an empty vehicle to a distribution center accord to a constraint condition; the constraint conditions are a combination of one or more of a time constraint, a vehicle constraint and a demand constraint, and a distance constraint; S3: designing the distribution route for the assigned vehicles. A method for optimizing vehicle scheduling by assigning vehicles first, and then the route planning is carried out to plan the vehicle driving of the distribution center and the destination, at the same time, the algorithm is used to optimize the vehicle scheduling problem of feed distribution. That is to say, under certain constraint conditions, the vehicle scheduling is carried out reasonably, so that the transportation cost is minimized, and the userwaiting time is optimized, so that the cost function is optimized.

Description

technical field [0001] The invention relates to the field of computer technology, in particular to a vehicle scheduling optimization method. Background technique [0002] In recent years, with the rapid development of my country's social economy, people's living standards have improved, and the demand for agricultural and sideline products has continued to increase, making the aquaculture industry develop rapidly, and the feed industry closely connected with it is also booming. Well-known brand feed Businesses keep popping up. Feed enterprises are an important part of animal husbandry. From the perspective of feed logistics process, it includes the logistics process of raw materials for feed production from bottom to top and finished feed products from top to bottom. It is also a logistics process from decentralization to concentration and from concentration to decentralization process. Due to the particularity and variety of feed itself, the demand for transportation and 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 Applications(China)
IPC IPC(8): G06Q10/04G06Q10/06G06Q10/08
CPCG06Q10/04G06Q10/047G06Q10/06312G06Q10/08355
Inventor 田艳梅蒲皓
Owner CHENGDU INFOEX TECH CO LTD
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