CN106372761A - Bus bike travel route planning method based on swarm intelligence calculation - Google Patents

Bus bike travel route planning method based on swarm intelligence calculation Download PDF

Info

Publication number
CN106372761A
CN106372761A CN201610887008.3A CN201610887008A CN106372761A CN 106372761 A CN106372761 A CN 106372761A CN 201610887008 A CN201610887008 A CN 201610887008A CN 106372761 A CN106372761 A CN 106372761A
Authority
CN
China
Prior art keywords
user
station
route
bike
time
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN201610887008.3A
Other languages
Chinese (zh)
Inventor
张建辉
甘家羽
李志�
卢鹏钎
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Hangzhou Dianzi University
Original Assignee
Hangzhou Dianzi University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Hangzhou Dianzi University filed Critical Hangzhou Dianzi University
Priority to CN201610887008.3A priority Critical patent/CN106372761A/en
Publication of CN106372761A publication Critical patent/CN106372761A/en
Pending legal-status Critical Current

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/40—Business processes related to the transportation industry

Landscapes

  • Business, Economics & Management (AREA)
  • Human Resources & Organizations (AREA)
  • Engineering & Computer Science (AREA)
  • Economics (AREA)
  • Strategic Management (AREA)
  • Tourism & Hospitality (AREA)
  • Theoretical Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Marketing (AREA)
  • General Business, Economics & Management (AREA)
  • Physics & Mathematics (AREA)
  • Game Theory and Decision Science (AREA)
  • Quality & Reliability (AREA)
  • Operations Research (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Development Economics (AREA)
  • Health & Medical Sciences (AREA)
  • General Health & Medical Sciences (AREA)
  • Primary Health Care (AREA)
  • Traffic Control Systems (AREA)
  • Navigation (AREA)

Abstract

The invention discloses a bus bike travel route planning method based on swarm intelligence calculation. With the current situation in which an intelligent mobile phone is widely popular, each user for borrowing a bus bike is regarded as a basic unit for information providing, and features and the law for bike using condition can be analyzed through feedback of real-time information transmitted by the users during a bus bike borrowing process. A server carries out real-time optimal calculation on bike using of the user, more accurate information of a borrowing-returning bike station can be provided for the user, the bike system use efficiency is thus improved, and the bike use experience of the user is enhanced.

Description

A kind of public transport cycling trip route planning method based on gunz calculating
Technical field
The invention belongs to Internet of Things field, more particularly to a kind of public transport cycling trip route rule based on gunz calculating The method of drawing.
Background technology
Public transport bicycle, as a kind of trip mode of low-carbon environment-friendly, is that urban transportation provides much unique facility. This trip mode at home and abroad come in a lot of cities by substantial amounts of popularization, gathers around while have many consumers, also give public transport from The use of driving system brings some pressure.The service that existing public transport bicycle system is provided lacks to user behavior Consider, and the planning of science.Cause that the bicycle utilization rate of many city bus bicycle systems is undesirable, the wasting of resources is existing As serious.For example some stations often rare people using and attach undue importance to one thing to the neglect of the other；User is often had to find available station difficulty, or by means of when returning the car Encounter and there is no situations such as vehicle or empty wagons stake.The appearance of these situations leads to user to take when using public transport bicycle system The unnecessary time in a large number, but can not enjoy and really easily service.
In real life, user expects advantageously using public transport bicycle system, and can quickly find and " have the car can Borrow, have the position can also " station.In the prior art, preferable method is directly to be obtained voluntarily using third party's service platform Car use information.However, its news release mode is single, the transmission of bicycle use information is not prompt enough comprehensively.Although much public Hand over bicycle system to provide station and information of vehicles, but it cannot know that the whole of user use car behavioural information, for example it is impossible to Know trip starting point and the destination of user in advance.In addition, these systems also cannot know user's starting point to initial station Path.Thus substantially, these systems can not provide the user with bicycle and the empty wagons stake information of accurately can using in real time, Cannot fundamentally solve the problems, such as that user's trip is time-consuming.How to gather information effectively in real time and to provide the user traffic path Dynamic programming become raising public transport bicycle system service efficiency problem demanding prompt solution.
Gunz calculates as a kind of emerging computation schema, with mobile radio terminal, particularly smart mobile phone Popular and widely available.The integrated various sensor of mobile device plays more and more important during gathered data Effect, this also makes behavior of men data become ubiquitous.Meanwhile, the developing rapidly of WWW, also calculating for gunz provides Technical foundation, practical application based on this technology is enriched.For example: using gunz calculate pattern, online friends some months it The interior New York Times just originally being needed to consume nearly 130 years of huge time and human resourcess are digitized achieving.Group Intelligence calculate have other patterns cannot and real-time and more optimization colony dispatch property, therefore it can dynamically be inquired about With obtain data, and it is potentially analyzed and is calculated.Understand, the pattern that gunz calculates can become solution through above analysis The certainly new way of the problems referred to above.For public transport bicycle system customer volume is many, bicycle using frequently, the feelings such as quantity of information is huge Condition, the pattern being calculated by gunz, rational trip planning can be formulated for user.And, the public transport under gunz computation schema Bicycle system can more fully obtain the position used car behavioural information, provide starting point and destination by user of user Information, just can plan a complete traffic path for it.In addition, under the pattern that gunz calculates, station information is more New more timely, the planning of route therefore can be carried out in advance for every user.
Content of the invention
The present invention is directed to the deficiencies in the prior art it is proposed that a kind of public transport cycling trip route based on gunz calculating is advised The method of drawing.
For achieving the above object, the inventive method, under the pattern that gunz calculates, is entered to traffic path using greedy algorithm Professional etiquette is drawn, and it comprises the concrete steps that:
Step one, obtain each public transport bicycle parking information b from data baseiIt is stored in set b.Including station geography position Put li, bicycle quantity can be used in this stationWith empty wagons stake quantity
Step 2, every user uiStarting point coordinate is provided respectivelyWith destination's coordinateServer passes through user's starting point With destination's coordinate information, retrieve peripheral distance and be less than user walking tolerance interval dmaxOptional station.
Step 3, by user profile ui, it is stored in user set u.Including user's starting pointAnd destinationOptional Beginning station setThe set of optional purpose station
Step 4, the optional station set of every user of traversal, find all optional traffic path ti, and calculate each Cost c (the t of bar routei) and in order to assess the q (t of this route qualityi), it is that every user selects assessed value q (ti) maximum Route.
Wherein, cost refers to complete the time required for every route, including from starting point to initial station and from purpose car Stand to the walking time of destinationWith the time of ridingI.e.Time can be counted by speed and distance Calculate.The inverse of cost is designated as assessing the q (t of this route qualityi), that is,
As q (ti) bigger it was demonstrated that c (ti) less, user completes to go on a journey, and consumed time is shorter, and feasibility is higher.
Step 5, repeat step four, until calculate every user assessed value q (t in all usersi) maximum route, Screen q (t in these routes againi) maximum one, only this route is distributed to corresponding user.
Step 6, be allocated successfully after, by the available bicycle quantity at the initial station corresponding to this traffic path and purpose The available empty wagons stake quantity at ground station reduces one respectively, and this user is deleted in user set u.
Step 7, by adjustment after data real-time update, using latest data be next round distribute prepare.
Step 8, repeat step four arrive step 7, continue as remaining user and carry out next round distribution.Until user's collection is combined into Empty or till feasible route can not being found for any user.
Advantage for present invention is:
(1) pass through the real-time user obtaining and use car solicited message, bicycle can be borrowed also situation be analyzed and predict. Using the method for the present invention, the vehicle occurring when can substantially solve a large number of users simultaneously using public transport bicycle system and empty wagons Stake quantity updates situation not in time, more in real time and more accurate than existing intelligent bus bicycle system；
(2) method utilizing gunz to calculate, by means such as search, arrangement, analytical data, can obtain public transport bicycle The information of system potential user, helps coordinates user to use public transport bicycle to reach, improves public transport bicycle system using effect The purpose of rate.For example using data reasonably dispatches different bicycle parking vehicles, and be the user being located in remote location Suitable public transport bicycle station information is provided；
(3) present invention makes full use of the advantage of smart mobile phone built-in sensors, in real time to server end feedback message.With When, server end also can more easily provide the user public transport bicycle and borrow also information.
Brief description
Fig. 1 is a kind of system architecture diagram of the public transport cycling trip route planning method based on gunz calculating.
Fig. 2 is a kind of flow chart of the public transport cycling trip route planning method based on gunz calculating.
Fig. 3 is user's traffic path schematic diagram in the present invention.
Specific embodiment
Below in conjunction with accompanying drawing, the invention will be further described.
According to Fig. 1, the pandemic present situation of combined with intelligent mobile phone of the present invention, by the use of every borrow public transport bicycle The base unit that an information provides is regarded at family as, by the real time information feedback of user's transmission during borrowing public transport bicycle Just feature and the rule of bicycle service condition can be analyzed.Wherein, the initial information of public transport bicycle is stored in data base, number Completed by the mobile device of user according to collection and offer work, the process of data and feedback operation are completed by server.For clothes For business device, by the user's departure place of offer and destination locations information in real time, just can obtain user group with garage is.Clothes Business device, by carrying out real-time optimization calculating to user with car, can provide the user and more accurately borrow site information of returning the car, from And improve the service efficiency of bicycle system, lift being tested with car body of user.Under the pattern that gunz calculates, server by utilizing has A large number of users asks the advantage servicing simultaneously, by the real-time analysis of population data and process, efficiently solving and borrow also The difficult problem of car.Especially for the region that the external visitor such as scenic spot flowing is larger, visitor user uses to public transport bicycle and needs Ask high, but public transport bicycle website around is unfamiliar with, in this case, the present invention more can make the most of the advantage, convenient for its offer Service
In conjunction with shown in Fig. 2, introduce the present invention by detailed complete below.
The present invention is a kind of public transport cycling trip route planning method based on gunz calculating, and specific embodiments are:
The total n public transport bicycle station of step one, hypothesis, m position user, obtain each station information b from data baseiDeposit Enter set b.Including station geographical position li, bicycle quantity can be used in this stationWith available empty wagons stake quantity
Wherein,
a i o &greaterequal; σ k = 1 m i ( b k o = b i ) , ∀ i = 1 , 2 , 3 , ... , n
a i t &greaterequal; σ k = 1 m i ( b k t = b i ) , ∀ i = 1 , 2 , 3 , ... , n
Represent station may only rewritten a limited number of times as the initial station in the traffic path being allocated or purpose station, When available bicycle quantity is 0, this station will cannot function as initial station and occur in any traffic path, with Reason, when available empty wagons stake quantity is 0, this station will cannot function as purpose station and occur in any traffic path.
Step 2, every user uiDuring request distribution channels, provide starting point coordinate respectively to serverWith destination's coordinateServer passes through user's starting point and destination's coordinate data, and retrieval peripheral distance is less than user walking tolerance interval dmax's Optional station.
According to Fig. 3, user often completes once to go on a journey to be needed to walk to initial station from starting point, rides from initial station Row, to purpose station, finally walks to destination from purpose station.dmaxFor long distance acceptable in user's gait processes From.In preferred embodiment of the present invention, described apart from dmaxIt is set to 500 meters.
Step 3, by user profile ui, it is stored in user set u.Including user's starting pointAnd destinationOptional Beginning station setThe set of optional purpose station
According to the description of step one and step 2, the set of optional initial station need to meet optional bicycle quantity be more than 0 and Walking distance is less than dmaxTwo conditions it may be assumed that
b i o = { b j | b j &element; b , a j o > 0 , d i s t ( l i o , b j ) < d m a x }
In the same manner, the set of optional purpose station need to meet optional empty wagons stake quantity more than 0 and walking distance is less than dmaxTwo bars Part it may be assumed that
b i t = { b j | b j &element; b , a i t > 0 , d i s t ( b j , l i t ) < d m a x }
Dist (a, b) represents the distance of two intersites.
Step 4, the optional initial station set traveling through every user respectively and the set of optional purpose station, find all Optional traffic path ti, a complete traffic path includes four parts: starting point, initial station, purpose station and purpose Ground it may be assumed that
t i = ( l i o , b i o , b i t , l i t )
Wherein,Initiateing station can not be identical with purpose station, is otherwise considered as planning failure.
Calculate the cost c (t of each routei) and in order to assess the q (t of this route qualityi), select every user q (ti) maximum route.
Cost c (ti) refer to complete the time required for every route, including from starting point to initial station and from purpose car Stand to the walking time of destinationWith the time of ridingI.e.Time can be counted by speed and distance Calculate:
t i w = &alpha; ( d i s t ( l i o , b i o ) + d i s t ( b i t , l i t ) )
t i r = &beta; d i s t ( b i o , b i t )
α and β is respectively the inverse of user's walking speed and riding speed.
The inverse of cost is designated as assessing the q (t of this route qualityi) it may be assumed that
When known to the starting point of a traffic path and destination and when constant, its q (ti) bigger it was demonstrated that c (ti) less, It is shorter that user completes trip the consumed time.Assume speed one timing, trip required separation distance is shorter, therefore this traffic path Feasibility is higher.
Step 5, repeat step four, until calculate every user assessed value q (t in all usersi) maximum route, Learn through above-mentioned analysis, as q (ti) bigger, the feasibility of traffic path is higher, therefore, screens q (t in these routes againi) This route is only distributed to corresponding user by big one.
Step 6, be allocated successfully after, by the available bicycle quantity at the initial station corresponding to this traffic path and purpose The available empty wagons stake quantity at ground station reduces one respectively, and this user is deleted in user set u, represents that this user becomes Distribution of work traffic path.
Step 7, the initial station by after adjustment, purpose station, available bicycle quantity and available empty wagons stake quantity and use The information such as family set carry out real-time update, often carry out must assure that the data of use is latest data during next round distribution.
Step 8, repeat step four arrive step 7, continue as remaining user and carry out next round distribution, and each wheel is only one User distributes traffic path.Till user's collection is combined into sky or can not find feasible route for any user.
For ensureing the exploitativeness of content of the invention, the present invention has carried out a series of experimental evaluation.Experiment is divided into server End and two parts of client.Server end is write using python language, and client builds in Android platform. Client mainly provides the user intuitively interface and the function such as checks to carry out route, and server end is mainly to the data collecting It is analyzed processing.
The present invention is a kind of public transport cycling trip route planning method based on gunz calculating, anti-by individual consumer Feedback, can collect the huge information of colony, and gathers around and have broad application prospects.(1) can be by collecting using the system Public transport cycling trip situation, real time propelling movement traffic information is it is possible to by way of everybody participates in, share respective Stroke；(2) every user can carry out public transport bicycle vehicle condition feedback in time, and the information collected contributes to associated companies to certainly The maintenance and repair of driving；(3) after gathered data, by analyzing the borrow public transport bicycle original position distribution number of user feedback According to the bustling degree that will be seen that a location, and the commercial value in this location is estimated with this, as the reference in setting shop Point；(4) public transport collected over the years bicycle service condition and route situation are combined with tourist attractions, can push away for user Send the route of most preferably going on a tour of Various Seasonal, drive city tour's culture and expanding economy.

Claims (1)

1. a kind of public transport cycling trip route planning method based on gunz calculating is it is characterised in that the concrete steps of the method It is:
Step one, obtain each public transport bicycle parking information b from data baseiIt is stored in set b；Including station geographical position li, Bicycle quantity can be used in this stationWith empty wagons stake quantity
Step 2, every user uiStarting point coordinate is provided respectivelyWith destination's coordinateServer passes through user's starting point and mesh Ground coordinate information, retrieval peripheral distance be less than user walking tolerance interval dmaxOptional station；
Step 3, by user profile ui, it is stored in user set u；Including user's starting pointAnd destinationOptional initial car Stand setThe set of optional purpose station
Step 4, the optional station set of every user of traversal, find all optional traffic path ti, and calculate each road Cost c (the t of linei) and in order to assess the q (t of this route qualityi), it is that every user selects assessed value q (ti) maximum road Line；
Wherein, cost refers to complete the time required for every route, including from starting point to initial station and from purpose station to The walking time of destinationWith the time of ridingI.e.Time can be calculated by speed and distance； The inverse of cost is designated as assessing the q (t of this route qualityi), that is,
As q (ti) bigger it was demonstrated that c (ti) less, user completes to go on a journey, and consumed time is shorter, and feasibility is higher；
Step 5, repeat step four, until calculate every user assessed value q (t in all usersi) maximum route, sieve again Select q (t in these routesi) maximum one, only this route is distributed to corresponding user；
Step 6, be allocated successfully after, by the available bicycle quantity at the initial station corresponding to this traffic path and destination's car The available empty wagons stake quantity stood reduces one respectively, and this user is deleted in user set u；
Step 7, by adjustment after data real-time update, using latest data be next round distribute prepare；
Step 8, repeat step four arrive step 7, continue as remaining user and carry out next round distribution；Until user collection be combined into sky or Till feasible route can not being found for any user.
CN201610887008.3A 2016-10-11 2016-10-11 Bus bike travel route planning method based on swarm intelligence calculation Pending CN106372761A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201610887008.3A CN106372761A (en) 2016-10-11 2016-10-11 Bus bike travel route planning method based on swarm intelligence calculation

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201610887008.3A CN106372761A (en) 2016-10-11 2016-10-11 Bus bike travel route planning method based on swarm intelligence calculation

Publications (1)

Publication Number Publication Date
CN106372761A true CN106372761A (en) 2017-02-01

Family

ID=57895433

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201610887008.3A Pending CN106372761A (en) 2016-10-11 2016-10-11 Bus bike travel route planning method based on swarm intelligence calculation

Country Status (1)

Country Link
CN (1) CN106372761A (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108917782A (en) * 2018-09-25 2018-11-30 国信优易数据有限公司 A kind of website recommendation method and device
CN110969291A (en) * 2019-11-21 2020-04-07 上海钧正网络科技有限公司 Shared vehicle path planning method and device, computer equipment and storage medium
CN112001557A (en) * 2020-08-31 2020-11-27 物联云仓(成都)科技有限公司 TMS system-based logistics distribution path optimization method, storage medium and computer equipment
CN114155713A (en) * 2021-12-15 2022-03-08 新唐信通(浙江)科技有限公司 Intersection blind area early warning control method and system based on roadside crowd-sourcing calculation

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101038685A (en) * 2007-04-12 2007-09-19 沈秋尧 City bicycles common management system
CN201689419U (en) * 2010-05-13 2010-12-29 杭州三网科技有限公司 Intelligent real-time travel route system
CN104165635A (en) * 2014-08-04 2014-11-26 浙江工业大学 Public bike user optimal route searching method

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101038685A (en) * 2007-04-12 2007-09-19 沈秋尧 City bicycles common management system
CN201689419U (en) * 2010-05-13 2010-12-29 杭州三网科技有限公司 Intelligent real-time travel route system
CN104165635A (en) * 2014-08-04 2014-11-26 浙江工业大学 Public bike user optimal route searching method

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108917782A (en) * 2018-09-25 2018-11-30 国信优易数据有限公司 A kind of website recommendation method and device
CN110969291A (en) * 2019-11-21 2020-04-07 上海钧正网络科技有限公司 Shared vehicle path planning method and device, computer equipment and storage medium
CN112001557A (en) * 2020-08-31 2020-11-27 物联云仓(成都)科技有限公司 TMS system-based logistics distribution path optimization method, storage medium and computer equipment
CN114155713A (en) * 2021-12-15 2022-03-08 新唐信通(浙江)科技有限公司 Intersection blind area early warning control method and system based on roadside crowd-sourcing calculation

Similar Documents

Publication Publication Date Title
CN103985247B (en) Taxi Transport capacity dispatching system based on city chauffeur demand distribution density
Zhang et al. Exploring the impact of built environment factors on the use of public bikes at bike stations: Case study in Zhongshan, China
CN103364002B (en) Route planning system and method combining real-time road conditions and public transport operation information
WO2019091108A1 (en) Transportation and trip survey data processing method
CN105825666B (en) City sprinkling truck intelligent dispatching method based on pavement humidity detection
CN103177561B (en) Method for generating bus real-time traffic status
Brčić et al. The role of smart mobility in smart cities
CN105809962A (en) Traffic trip mode splitting method based on mobile phone data
CN106372761A (en) Bus bike travel route planning method based on swarm intelligence calculation
CN109612488B (en) Big data micro-service-based mixed travel mode path planning system and method
CN104766473A (en) Traffic trip feature extraction method based on multi-mode public transport data matching
CN101510357A (en) Method for detecting traffic state based on mobile phone signal data
CN107403550B (en) Public transport road network data acquisition method and device and terminal equipment
CN104316068A (en) Method, device and system for navigation of electric automobile
CN103201776A (en) Method of retrieving information for a motor vehicle
Comi et al. An innovative methodology for micro-mobility network planning
Zhao et al. Agent-based model (ABM) for city-scale traffic simulation: A case study on San Francisco
Chalumuri et al. Development and evaluation of an integrated transportation system: A case study of Delhi
Jin et al. Nonlinear effects of the built environment on metro-integrated ridesourcing usage
Ji et al. A spatial-temporal model for locating electric vehicle charging stations
Feng et al. Environmental benefits mining based on data-driven taxi cruising recommendation strategy
Huber et al. Modelling bicycle route choice in German cities using open data, MNL and the bikeSim web-app
CN109800903A (en) A kind of profit route planning method based on taxi track data
CN104700616B (en) Urban traffic pressure Forecasting Methodology and system
Cui et al. Usage demand forecast and quantity recommendation for urban shared bicycles

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
RJ01 Rejection of invention patent application after publication
RJ01 Rejection of invention patent application after publication

Application publication date: 20170201