A Dynamic Scheduling Method for Public Bicycles Based on Hybrid Heuristic Algorithm

A public bicycle and hybrid heuristic technology, applied in the field of urban intelligent public transportation systems, can solve the problems of insufficient algorithm solution efficiency, insufficient scheduling strategy design, and poor efficiency of scheduling algorithm solution, etc., to achieve less calculation time and satisfactory The effect of high degree and good scheduling effect

Active Publication Date: 2021-02-19
HANGZHOU DIANZI UNIV
View PDF3 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] At present, there are very few studies in this field at home and abroad, but a small number of articles have proposed corresponding dynamic scheduling algorithms. However, the solution efficiency of their algorithms is not efficient enough, the problem modeling is not reasonable enough, and the design of scheduling strategies is not perfect enough. The overall solution efficiency of the scheduling algorithm is not good

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 Dynamic Scheduling Method for Public Bicycles Based on Hybrid Heuristic Algorithm
  • A Dynamic Scheduling Method for Public Bicycles Based on Hybrid Heuristic Algorithm
  • A Dynamic Scheduling Method for Public Bicycles Based on Hybrid Heuristic Algorithm

Examples

Experimental program
Comparison scheme
Effect test

Embodiment

[0115]In this section, 20 data samples are designed to be used for experiments. The format of the experimental data is shown in Table 2. The experiment requires data to provide information such as the location of the dispatch center, the coordinates of multiple public bicycle stations, the dispatch amount of each station, the corresponding time window for dispatch and the total parking space.

[0116]Table 2 Description of experimental data format

[0117]

[0118]The important parameters of the model and algorithm are set as follows: Tco = 21:00, cp=0.6(RMB / KM), tij =150*dij , Ei=ai-120, fi= Bi+120, Tac = 20 (minute), cw= 0.3. The length of the time slice is set to 15 minutes, and the capacity of the transporter is set to carry 30 bicycles. According to time limit rules: fi≤Tac +now, dynamic demand information will be given in turn.

[0119]The results of the algorithm by testing 20 samples are shown in Table 3. The simulation time for testing is 25 minutes. The "sample" column in Table 3 corr...

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 public bicycle dynamic scheduling method based on a hybrid heuristic algorithm. The present invention includes the following methods: 1. carry out regional management to each site; 2. obtain relevant information of each site, including the coordinates of the site and the calculated demand information, and divide the entire working area into a plurality of small sub-areas, each Each sub-area has a dispatch center, which manages all sites belonging to the same sub-area as the dispatch center; 3. The event manager judges whether to recalculate the dispatch plan according to the dynamic dispatch strategy, and if necessary, the event manager will build a static dispatch instance , the static scheduling example includes the departure location, departure time and basic demand information of each transport vehicle; 4. Use the improved variable neighborhood ant colony algorithm to solve the problem. The invention can calculate a more optimal scheduling scheme, and the solution efficiency is higher. It can maximize the citizens' satisfaction with the use of public bicycles with a more cost-effective scheduling scheme.

Description

Technical field[0001]The invention belongs to the technical field of urban intelligent public transportation systems, and relates to a public bicycle dynamic dispatch method based on a hybrid heuristic algorithm.Background technique[0002]With the rapid development of cities, the urban population continues to increase, and the number of motor vehicles also increases, making traffic congestion and environmental pollution increasingly severe. Giving full play to the role of urban public bicycles can effectively alleviate these problems. However, at present, there are some problems in the operation of public bicycles, which affect the efficiency of operation. "Difficulty in renting and changing bicycles" is the problem that users have the strongest feedback during bicycle use, that is, some bicycle rental sites have a certain period of time. The number of bicycles is not large enough for users to rent bicycles. There are no parking spaces at certain bicycle sites for some time periods, ...

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/06G06Q50/30
CPCG06Q10/06312G06Q50/30
Inventor 徐海涛马智超
Owner HANGZHOU DIANZI UNIV
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