CN112907071A - Bus scheduling method, system and device based on willingness-to-pay and storage medium - Google Patents

Bus scheduling method, system and device based on willingness-to-pay and storage medium Download PDF

Info

Publication number
CN112907071A
CN112907071A CN202110192461.3A CN202110192461A CN112907071A CN 112907071 A CN112907071 A CN 112907071A CN 202110192461 A CN202110192461 A CN 202110192461A CN 112907071 A CN112907071 A CN 112907071A
Authority
CN
China
Prior art keywords
bus
passenger
departure
buses
station
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
CN202110192461.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.)
South China University of Technology SCUT
Original Assignee
South China University of Technology SCUT
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 South China University of Technology SCUT filed Critical South China University of Technology SCUT
Priority to CN202110192461.3A priority Critical patent/CN112907071A/en
Publication of CN112907071A publication Critical patent/CN112907071A/en
Pending legal-status Critical Current

Links

Images

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/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06315—Needs-based resource requirements planning or analysis
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F30/00—Computer-aided design [CAD]
    • G06F30/20—Design optimisation, verification or simulation
    • 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/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06312—Adjustment or analysis of established resource schedule, e.g. resource or task levelling, or dynamic rescheduling
    • 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—Systems or methods specially adapted for specific business sectors, e.g. utilities or tourism
    • G06Q50/10—Services
    • G06Q50/26—Government or public services
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F2111/00—Details relating to CAD techniques
    • G06F2111/06—Multi-objective optimisation, e.g. Pareto optimisation using simulated annealing [SA], ant colony algorithms or genetic algorithms [GA]

Abstract

The invention discloses a bus scheduling method, system, device and storage medium based on willingness-to-pay, wherein the method comprises the following steps: acquiring uploaded bus travel demands, wherein the bus travel demands comprise an getting-on station, a getting-off station, arrival time and bus service level; determining bus operation income according to the bus travel demand, the running state of the bus and a flexible bus model, and acquiring an optimal departure strategy according to the bus operation income; adjusting the departure scheme according to the optimal departure strategy; the buses comprise basic service buses and high-level service buses, and the two types of buses run uninterruptedly and unidirectionally on the closed loop circuit; the optimal departure strategy maximizes bus operation revenue. The invention can adjust the departure scheme according to the demand condition of the passenger, meet the individual travel demand of the passenger, reduce the bus operation cost while meeting the individual demand of the passenger, and can be widely applied to the field of artificial intelligence.

Description

Bus scheduling method, system and device based on willingness-to-pay and storage medium
Technical Field
The invention relates to the field of artificial intelligence, in particular to a bus dispatching method, a bus dispatching system, a bus dispatching device and a bus dispatching storage medium based on willingness-to-pay.
Background
Along with the improvement of the social and economic development level, the service requirement of the passenger on the bus is also improved to a certain degree, the conventional bus system can only meet the basic travel requirement of the passenger, and the high requirement of the passenger on personalized travel cannot be met due to the single bus service level. If the service with high requirement is provided for each passenger uniformly, the operation cost is large, and a large amount of resources are wasted.
Disclosure of Invention
In order to solve at least one of the technical problems in the prior art to a certain extent, the invention aims to provide a bus dispatching method, a bus dispatching system, a bus dispatching device and a bus dispatching storage medium based on willingness-to-pay.
The technical scheme adopted by the invention is as follows:
a bus dispatching method based on willingness-to-pay comprises the following steps:
acquiring uploaded bus travel demands, wherein the bus travel demands comprise an getting-on station, a getting-off station, arrival time and bus service level;
determining bus operation income according to the bus travel demand, the running state of the bus and a flexible bus model, and acquiring an optimal departure strategy according to the bus operation income;
adjusting the departure scheme according to the optimal departure strategy;
the buses comprise basic service buses and high-level service buses, and the two types of buses run uninterruptedly and unidirectionally on the closed loop circuit;
the flexible bus model is used for analyzing and processing travel demand information of passengers, optimizing and adjusting bus departure conditions and guiding passengers to take buses;
the optimal departure strategy maximizes bus operation revenue.
Further, the bus starts from the starting station and runs unidirectionally around the annular closed line, and passengers are delivered at each station;
for the bus, the time t when the bus n running to the mth circle reaches the station inimThe calculation formula is as follows:
Figure BDA0002945539820000011
wherein x isntIndicating whether the vehicle n departs at the end of the time t, wherein the departure is 1, and the non-departure is 0; d0iRepresents the distance of the origin from station i in the ring line; d represents the length of the entire closed loop circuit; v represents the bus travel speed; beta represents the time for waiting for passengers to get on or off the bus at each platform; i represents the total number of stations of the ring line;
for the bus, the calculation formula of the number of passengers on the bus when the bus n running to the mth circle leaves the station i is as follows:
Figure BDA0002945539820000021
pn0m＝pnI(m-1)
wherein, ynumAnd the passenger u takes the bus n running to the mth circle, takes 1 and does not take 0.
Further, the constraint conditions of the capacity threshold of the high-level service type bus are as follows:
pnimsn≤P
wherein s isnWhether the bus is a high-level service bus is represented as 1 and a basic service bus is represented as 0; p represents the maximum number of passengers that can be accommodated by the high-level service type bus.
Further, the bus dispatching method also comprises the following steps:
determining a first target to minimize the waiting time of each passenger according to the travel demand of the bus and the running state of the bus;
the first target is:
y is the optimum solution of the following formula if and only if n and m arenum＝1。
Figure BDA0002945539820000022
Figure BDA0002945539820000023
Figure BDA0002945539820000024
Wherein, tuRepresenting passenger arrival times;
Figure BDA0002945539820000025
representing a set of acceptable bus service levels for passenger u.
Further, according to the bus trip demand, the running state of bus and the flexible bus model, confirm the public transit operation income, include:
determining a second target as comprehensive benefits of three aspects of maximum passenger perception, bus operation and government management according to the bus trip demand, the running state of the bus and the flexible bus model;
the expression of the second target is:
Figure BDA0002945539820000026
benefits F on the bus operating level1The calculation formula is as follows:
Figure BDA0002945539820000027
benefits of passenger perception levels F2The calculation formula is as follows:
Figure BDA0002945539820000031
benefits of government regulatory level F3The calculation formula is as follows:
Figure BDA0002945539820000032
C1representing the operating cost of a single basic service bus; c2Represents the operating cost of a single high-level service bus; csRepresents a government subsidy for a single basic service bus; c3Representing passenger fares for basic service buses; c4Representing passenger fares for high-level service buses; cμEconomic benefits representing passenger satisfaction; cγRepresenting the passenger waiting time cost.
Further, the adjusting the departure scheme according to the optimal departure strategy includes:
determining the type, departure time, driving route and stop bus station of the bus according to the optimal departure strategy;
controlling the running state of the bus according to the determined type, departure time, driving route and stop bus station of the bus;
the bus is an unmanned bus.
Further, the bus dispatching method also comprises the following steps:
all passengers upload bus travel demands through intelligent keys arranged on a bus stop or application programs on an intelligent terminal before traveling.
The other technical scheme adopted by the invention is as follows:
a bus dispatching system based on willingness-to-pay comprises:
the data acquisition module is used for acquiring the uploaded bus travel demands, and the bus travel demands comprise an getting-on station, a getting-off station, arrival time and bus service level;
the strategy determining module is used for determining bus operation income according to the bus trip demand, the running state of the bus and the flexible bus model, and acquiring an optimal departure strategy according to the bus operation income;
the bus dispatching module is used for adjusting the departure scheme according to the optimal departure strategy;
the buses comprise basic service buses and high-level service buses, and the two types of buses run uninterruptedly and unidirectionally on the closed loop circuit;
the flexible bus model is used for analyzing and processing travel demand information of passengers, optimizing and adjusting bus departure conditions and guiding passengers to take buses;
the optimal departure strategy maximizes bus operation revenue.
The other technical scheme adopted by the invention is as follows:
a bus dispatching device based on willingness-to-pay comprises:
at least one processor;
at least one memory for storing at least one program;
when executed by the at least one processor, cause the at least one processor to implement the method described above.
The other technical scheme adopted by the invention is as follows:
a storage medium having stored therein a processor-executable program for performing the method as described above when executed by a processor.
The invention has the beneficial effects that: the invention can adjust the departure scheme according to the demand condition of the passenger, meet the individual travel demand of the passenger, reduce the bus operation cost while meeting the individual demand of the passenger, and has practical popularization value.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the following description is made on the drawings of the embodiments of the present invention or the related technical solutions in the prior art, and it should be understood that the drawings in the following description are only for convenience and clarity of describing some embodiments in the technical solutions of the present invention, and it is obvious for those skilled in the art that other drawings can be obtained according to these drawings without creative efforts.
Fig. 1 is an effect diagram of an departure situation of a bus dispatching method based on willingness-to-pay in an embodiment of the present invention;
fig. 2 is an operation flowchart of a bus scheduling method based on willingness-to-pay in the embodiment of the present invention.
Detailed Description
Reference will now be made in detail to embodiments of the present invention, examples of which are illustrated in the accompanying drawings, wherein like or similar reference numerals refer to the same or similar elements or elements having the same or similar function throughout. The embodiments described below with reference to the accompanying drawings are illustrative only for the purpose of explaining the present invention, and are not to be construed as limiting the present invention. The step numbers in the following embodiments are provided only for convenience of illustration, the order between the steps is not limited at all, and the execution order of each step in the embodiments can be adapted according to the understanding of those skilled in the art.
In the description of the present invention, it should be understood that the orientation or positional relationship referred to in the description of the orientation, such as the upper, lower, front, rear, left, right, etc., is based on the orientation or positional relationship shown in the drawings, and is only for convenience of description and simplification of description, and does not indicate or imply that the device or element referred to must have a specific orientation, be constructed and operated in a specific orientation, and thus, should not be construed as limiting the present invention.
In the description of the present invention, the meaning of a plurality of means is one or more, the meaning of a plurality of means is two or more, and larger, smaller, larger, etc. are understood as excluding the number, and larger, smaller, inner, etc. are understood as including the number. If the first and second are described for the purpose of distinguishing technical features, they are not to be understood as indicating or implying relative importance or implicitly indicating the number of technical features indicated or implicitly indicating the precedence of the technical features indicated.
In the description of the present invention, unless otherwise explicitly limited, terms such as arrangement, installation, connection and the like should be understood in a broad sense, and those skilled in the art can reasonably determine the specific meanings of the above terms in the present invention in combination with the specific contents of the technical solutions.
The embodiment provides a bus dispatching method based on willingness-to-pay, aiming at the personalized travel demand of a passenger, according to the seat willingness-to-pay of the passenger, a high-level service type bus which is provided with comfortable tables and chairs, WiFi, drinking water, noise reduction earphones and the like and can meet the functions of mobile office work, leisure entertainment and the like and a basic service type bus which only meets the basic travel demand of the passenger are arranged. The basic service type bus and the high-level service type bus are set according to the passenger seat payment intention, the buses with two service levels run uninterruptedly and unidirectionally on a closed loop circuit, the departure condition of the unmanned flexible bus is dynamically updated and adjusted, the passenger satisfaction is improved, the passenger waiting time is reduced, the bus operation cost is reduced, and the government subsidies are reduced.
Example one
As shown in fig. 1 and 2, a bus dispatching method based on willingness-to-pay comprises the following steps:
1) the passenger puts forward the bus travel demand through intelligent keys on a bus stop platform or an application program on a mobile phone and the like, wherein the bus travel demand comprises information such as the boarding stop, the alighting stop, the arrival time and the acceptable bus service level of the passenger.
The method specifically comprises the following steps: all passengers submit information such as boarding stations, getting-off stations, expected arrival time and acceptable bus service levels through intelligent keys on the bus station platforms or application programs on mobile phones before going out.
2) According to the currently received travel demands of all passengers and the running state of the bus, the flexible bus model determines the available income after departure, gives an optimal departure strategy and realizes the maximization of benefits of the passengers, the bus company and the government.
The analysis process of the public traffic system module specifically comprises the following steps: after receiving a departure command, the bus runs uninterruptedly and unidirectionally around an annular closed line from a starting station, and receives and delivers passengers at each station; according to the passenger demands and the running state of the bus, the waiting time of each passenger is determined to be minimized; the goal of the determination is to maximize the combined benefits of three levels of passenger perception (service object), bus operation (service provision) and government management (service supervision).
For the bus, the time t when the bus n running to the mth circle reaches the station inimThe calculation formula is as follows:
Figure BDA0002945539820000051
wherein x isntIndicating whether the vehicle n departs at the end of the time t, wherein the departure is 1, and the non-departure is 0; d0iRepresents the distance of the origin from station i in the ring line; d represents the length of the entire closed loop circuit; v represents the bus travel speed; beta represents the time for waiting for passengers to get on or off the bus at each platform; i denotes the total number of stations of the ring line.
For the bus, the calculation formula of the number of passengers on the bus when the bus n running to the mth circle leaves the station i is as follows:
Figure BDA0002945539820000052
pn0m＝pnI(m-1)
wherein, ynumAnd the passenger u takes the bus n running to the mth circle, takes 1 and does not take 0.
The constraint conditions of the capacity threshold of the VIP type bus (namely, the high-level service type bus) are as follows:
pnimsn≤P
wherein s isnWhether the bus is a VIP type bus is represented, the VIP type bus is 1, and the common bus is 0; p represents the maximum number of passengers that a VIP type bus can accommodate.
According to the passenger demands and the running state of the bus, the waiting time of each passenger is determined to be minimized;
further, the goal is:
y is a value when and only when n and m are the optimal solutions of the following formulanum＝1。
Figure BDA0002945539820000061
Figure BDA0002945539820000062
Figure BDA0002945539820000063
Wherein, tuRepresenting passenger arrival times;
Figure BDA0002945539820000064
representing a set of acceptable bus service levels for passenger u.
Further, the goal is:
Figure BDA0002945539820000065
interest F on bus operation level1The calculation formula is as follows:
Figure BDA0002945539820000066
benefits of passenger perception levels F2The calculation formula is as follows:
Figure BDA0002945539820000067
benefits of government regulatory level F3The calculation formula is as follows:
Figure BDA0002945539820000068
in the above series of computational equations, the relevant parameters define: c1Represents the operation cost of a single common bus; c2Represents the operating cost of a single VIP-type bus; csRepresents a government subsidy for a single general bus; c3Representing passenger fares for a normal type bus; c4Represents passenger fares for VIP-type buses; cμEconomic benefits representing passenger satisfaction; cγRepresenting the passenger waiting time cost.
3) And the system issues the updated and adjusted bus departure strategy to the bus. The bus receives the departure signal, starts operation and serves passengers.
After receiving the instruction, the unmanned flexible bus runs uninterruptedly and unidirectionally around an annular closed line and receives and delivers passengers at each station. Passengers wait at the station for the arrival of a bus of acceptable service level.
4) The bus stops at a bus station according to a driving route, and passengers get on or off the bus and respond to the traveling demands of the passengers.
After receiving the instruction, the unmanned flexible bus runs uninterruptedly and unidirectionally around an annular closed line, passengers are delivered at each station, and the passengers finish getting on and off the bus to meet the requirements of the passengers.
To sum up, compare with traditional fixed service bus, this embodiment scheme adapts to passenger's individualized trip demand, according to passenger's seat payment will, set up and possess comfortable table chair, wiFi, drinking water, fall the configuration such as earphone of making an uproar, can satisfy the high-level service type bus of functions such as mobile office, amusement and recreation, and the basic service type bus that only satisfies passenger's basic trip demand, overcome and only provide single service level bus and can't satisfy the passenger demand to and maintain traditional fixed bus service inefficiency when the passenger demand is lower, the problem of wasting of resources.
Example two
The following explains the bus scheduling method in detail with reference to specific embodiments.
On an annular closed bus line, 5 stop stations are arranged in total, the serial numbers are 1-5 respectively, the distances between every two adjacent stations are shown in table 1, and four automatic driving buses are put into operation. Within half an hour, the passenger travel demands as shown in table 2 are generated.
Table 1: examples distance meters of adjacent stops (unit: meter)
1→2 2→3 3→4 4→5 5→1
1200 1100 1600 1750 1850
Table 2: embodiment passenger public transport trip demand information table
Figure BDA0002945539820000071
Figure BDA0002945539820000081
Figure BDA0002945539820000091
Figure BDA0002945539820000101
Figure BDA0002945539820000111
Step 1: passengers submit travel demands including getting-on stops, getting-off stops, arrival time and acceptable bus service level through platform intelligent keys or mobile phone APP;
step 2: the model analyzes passenger demands and bus state information, generates targets and constraints, solves the model, determines bus departure time, the service level of the issued buses and the like, and obtains a new departure scheme;
the model is solved to obtain the optimal departure scheme of four buses, as shown in table 3:
TABLE 3
Departure time (min) 0 4 13 17
Corresponding service level High level Foundation High level Foundation
And step 3: the automatic driving bus implementation updates the departure scheme after adjustment, and passenger accessible APP knows bus information.
And 4, step 4: the unmanned bus stops at a bus station according to a driving route, passengers get on or off the bus, and the traveling requirements of the passengers are responded.
Compared with the traditional fixed service public transport, the invention has obvious advantages, the optimization effect is shown as follows, the income and the passenger satisfaction of the public transport company are obviously improved, and the waiting time of the passengers is reduced, as shown in the table 4.
TABLE 4
Fixed public transport The invention Degree of optimization
Income of public transport company (Yuan) 544 619 13.79％
Passenger satisfaction index 117.75 132.5 12.53％
Waiting time (min) for passenger 360.74 347.62 3.64％
This embodiment also provides a public transit dispatch system based on willingness-to-pay, include:
the data acquisition module is used for acquiring the uploaded bus travel demands, and the bus travel demands comprise an getting-on station, a getting-off station, arrival time and bus service level;
the strategy determining module is used for determining bus operation income according to the bus trip demand, the running state of the bus and the flexible bus model, and acquiring an optimal departure strategy according to the bus operation income;
the bus dispatching module is used for adjusting the departure scheme according to the optimal departure strategy;
the buses comprise basic service buses and high-level service buses, and the two types of buses run uninterruptedly and unidirectionally on the closed loop circuit;
the flexible bus model is used for analyzing and processing travel demand information of passengers, optimizing and adjusting bus departure conditions and guiding passengers to take buses;
the optimal departure strategy maximizes bus operation revenue.
The bus scheduling system based on willingness-to-pay can execute the bus scheduling method based on willingness-to-pay provided by the method embodiment of the invention, can execute any combination implementation steps of the method embodiment, and has corresponding functions and beneficial effects of the method.
This embodiment still provides a public transit scheduling device based on willingness to pay, includes:
at least one processor;
at least one memory for storing at least one program;
when executed by the at least one processor, cause the at least one processor to implement the method described above.
The bus scheduling device based on willingness-to-pay can execute the bus scheduling method based on willingness-to-pay provided by the method embodiment of the invention, can execute any combination implementation steps of the method embodiment, and has corresponding functions and beneficial effects of the method.
The embodiment of the application also discloses a computer program product or a computer program, which comprises computer instructions, and the computer instructions are stored in a computer readable storage medium. The computer instructions may be read by a processor of a computer device from a computer-readable storage medium, and the computer instructions executed by the processor cause the computer device to perform the method described above.
The embodiment also provides a storage medium, which stores an instruction or a program capable of executing the bus scheduling method based on willingness-to-pay provided by the method embodiment of the invention, and when the instruction or the program is run, the steps can be implemented by any combination of the method embodiments, and the method has corresponding functions and beneficial effects.
In alternative embodiments, the functions/acts noted in the block diagrams may occur out of the order noted in the operational illustrations. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality/acts involved. Furthermore, the embodiments presented and described in the flow charts of the present invention are provided by way of example in order to provide a more thorough understanding of the technology. The disclosed methods are not limited to the operations and logic flows presented herein. Alternative embodiments are contemplated in which the order of various operations is changed and in which sub-operations described as part of larger operations are performed independently.
Furthermore, although the present invention is described in the context of functional modules, it should be understood that, unless otherwise stated to the contrary, one or more of the described functions and/or features may be integrated in a single physical device and/or software module, or one or more functions and/or features may be implemented in a separate physical device or software module. It will also be appreciated that a detailed discussion of the actual implementation of each module is not necessary for an understanding of the present invention. Rather, the actual implementation of the various functional modules in the apparatus disclosed herein will be understood within the ordinary skill of an engineer, given the nature, function, and internal relationship of the modules. Accordingly, those skilled in the art can, using ordinary skill, practice the invention as set forth in the claims without undue experimentation. It is also to be understood that the specific concepts disclosed are merely illustrative of and not intended to limit the scope of the invention, which is defined by the appended claims and their full scope of equivalents.
The functions, if implemented in the form of software functional units and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present invention may be embodied in the form of a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes.
The logic and/or steps represented in the flowcharts or otherwise described herein, e.g., an ordered listing of executable instructions that can be considered to implement logical functions, can be embodied in any computer-readable medium for use by or in connection with an instruction execution system, apparatus, or device, such as a computer-based system, processor-containing system, or other system that can fetch the instructions from the instruction execution system, apparatus, or device and execute the instructions. For the purposes of this description, a "computer-readable medium" can be any means that can contain, store, communicate, propagate, or transport the program for use by or in connection with the instruction execution system, apparatus, or device.
More specific examples (a non-exhaustive list) of the computer-readable medium would include the following: an electrical connection (electronic device) having one or more wires, a portable computer diskette (magnetic device), a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber device, and a portable compact disc read-only memory (CDROM). Additionally, the computer-readable medium could even be paper or another suitable medium upon which the program is printed, as the program can be electronically captured, via for instance optical scanning of the paper or other medium, then compiled, interpreted or otherwise processed in a suitable manner if necessary, and then stored in a computer memory.
It should be understood that portions of the present invention may be implemented in hardware, software, firmware, or a combination thereof. In the above embodiments, the various steps or methods may be implemented in software or firmware stored in memory and executed by a suitable instruction execution system. For example, if implemented in hardware, as in another embodiment, any one or combination of the following techniques, which are known in the art, may be used: a discrete logic circuit having a logic gate circuit for implementing a logic function on a data signal, an application specific integrated circuit having an appropriate combinational logic gate circuit, a Programmable Gate Array (PGA), a Field Programmable Gate Array (FPGA), or the like.
In the foregoing description of the specification, reference to the description of "one embodiment/example," "another embodiment/example," or "certain embodiments/examples," etc., means that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the invention. In this specification, schematic representations of the above terms do not necessarily refer to the same embodiment or example. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples.
While embodiments of the present invention have been shown and described, it will be understood by those of ordinary skill in the art that: various changes, modifications, substitutions and alterations can be made to the embodiments without departing from the principles and spirit of the invention, the scope of which is defined by the claims and their equivalents.
While the preferred embodiments of the present invention have been illustrated and described, it will be understood by those skilled in the art that various changes in form and details may be made therein without departing from the spirit and scope of the invention as defined by the appended claims.

Claims (10)

1. A bus dispatching method based on willingness-to-pay is characterized by comprising the following steps:
acquiring uploaded bus travel demands, wherein the bus travel demands comprise an getting-on station, a getting-off station, arrival time and bus service level;
determining bus operation income according to the bus travel demand, the running state of the bus and a flexible bus model, and acquiring an optimal departure strategy according to the bus operation income;
adjusting the departure scheme according to the optimal departure strategy;
the buses comprise basic service buses and high-level service buses, and the two types of buses run on the closed loop circuit in one direction;
the optimal departure strategy maximizes bus operation revenue.
2. The bus dispatching method based on willingness-to-pay as per claim 1, wherein the bus starts from the starting station and runs in one direction around the annular closed line, and passengers are delivered at each station;
for the bus, the time t when the bus n running to the mth circle reaches the station inimThe calculation formula is as follows:
Figure FDA0002945539810000011
wherein x isntIndicating whether the vehicle n departs at the end of the time t, wherein the departure is 1, and the non-departure is 0; d0iRepresents the distance of the origin from station i in the ring line; d represents the length of the entire closed loop circuit; v represents the bus travel speed; beta represents the time for waiting for passengers to get on or off the bus at each platform; i represents the total number of stations of the ring line;
for the bus, the calculation formula of the number of passengers on the bus when the bus n running to the mth circle leaves the station i is as follows:
Figure FDA0002945539810000012
pn0m＝pnI(m-1)
wherein, ynumAnd the passenger u takes the bus n running to the mth circle, takes 1 and does not take 0.
3. The method as claimed in claim 2, wherein the constraint condition of the capacity threshold of the high-level service bus is as follows:
pnimsn≤P
wherein s isnWhether the bus is a high-level service bus is represented as 1 and a basic service bus is represented as 0; p represents the maximum number of passengers that can be accommodated by the high-level service type bus.
4. The bus scheduling method based on willingness-to-pay according to claim 2, further comprising the following steps:
determining a first target to minimize the waiting time of each passenger according to the travel demand of the bus and the running state of the bus;
the first target is:
y is the optimum solution of the following formula if and only if n and m arenum＝1；
Figure FDA0002945539810000021
Figure FDA0002945539810000022
Figure FDA0002945539810000023
Wherein, tuRepresenting passenger arrival times;
Figure FDA0002945539810000024
representing a set of acceptable bus service levels for passenger u.
5. The bus scheduling method based on willingness-to-pay according to claim 1, wherein determining the bus operation income according to the bus travel demand, the running state of the bus and the flexible bus model comprises:
determining a second target as comprehensive benefits of three aspects of maximum passenger perception, bus operation and government management according to the bus trip demand, the running state of the bus and the flexible bus model;
the expression of the second target is:
Figure FDA0002945539810000025
benefits F on the bus operating level1The calculation formula is as follows:
Figure FDA0002945539810000026
benefits of passenger perception levels F2The calculation formula is as follows:
Figure FDA0002945539810000027
benefits of government regulatory level F3The calculation formula is as follows:
Figure FDA0002945539810000028
C1representing the operating cost of a single basic service bus; c2Represents the operating cost of a single high-level service bus; csRepresents a government subsidy for a single basic service bus; c3Representing passenger fares for basic service buses; c4Representing passenger fares for high-level service buses; cμEconomic benefits representing passenger satisfaction; cγRepresenting the passenger waiting time cost.
6. The method for dispatching buses based on willingness-to-pay according to claim 1, wherein the adjusting of the departure scheme according to the optimal departure strategy comprises:
determining the type, departure time, driving route and stop bus station of the bus according to the optimal departure strategy;
controlling the running state of the bus according to the determined type, departure time, driving route and stop bus station of the bus;
the bus is an unmanned bus.
7. The bus scheduling method based on willingness-to-pay according to claim 1, further comprising the following steps:
all passengers upload bus travel demands through intelligent keys arranged on a bus stop or application programs on an intelligent terminal before traveling.
8. A bus dispatching system based on willingness-to-pay is characterized by comprising:
the data acquisition module is used for acquiring the uploaded bus travel demands, and the bus travel demands comprise an getting-on station, a getting-off station, arrival time and bus service level;
the strategy determining module is used for determining bus operation income according to the bus trip demand, the running state of the bus and the flexible bus model, and acquiring an optimal departure strategy according to the bus operation income;
the bus dispatching module is used for adjusting the departure scheme according to the optimal departure strategy;
the buses comprise basic service buses and high-level service buses, and the two types of buses run on the closed loop circuit in one direction;
the optimal departure strategy maximizes bus operation revenue.
9. The utility model provides a public transit scheduling device based on willingness-to-pay which characterized in that includes:
at least one processor;
at least one memory for storing at least one program;
when executed by the at least one processor, cause the at least one processor to implement the method of any one of claims 1-7.
10. A storage medium having stored therein a program executable by a processor, wherein the program executable by the processor is adapted to perform the method of any one of claims 1-7 when executed by the processor.
CN202110192461.3A 2021-02-20 2021-02-20 Bus scheduling method, system and device based on willingness-to-pay and storage medium Pending CN112907071A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110192461.3A CN112907071A (en) 2021-02-20 2021-02-20 Bus scheduling method, system and device based on willingness-to-pay and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110192461.3A CN112907071A (en) 2021-02-20 2021-02-20 Bus scheduling method, system and device based on willingness-to-pay and storage medium

Publications (1)

Publication Number Publication Date
CN112907071A true CN112907071A (en) 2021-06-04

Family

ID=76124055

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110192461.3A Pending CN112907071A (en) 2021-02-20 2021-02-20 Bus scheduling method, system and device based on willingness-to-pay and storage medium

Country Status (1)

Country Link
CN (1) CN112907071A (en)

Citations (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103021194A (en) * 2012-12-27 2013-04-03 东南大学 Method for setting inter-station unidirectional sectioned green wave signals for long-spacing buses
CN106127357A (en) * 2016-07-29 2016-11-16 华南理工大学 A kind of customization public transport automatic routing system based on reservation data and method
CN107564269A (en) * 2017-08-28 2018-01-09 华南理工大学 A kind of half flexible bus dispatching method based on willingness to pay
CN109166337A (en) * 2018-09-04 2019-01-08 深圳市东部公共交通有限公司 Public transport arrival time generation method, device and bus passenger travelling OD acquisition methods
CN109308574A (en) * 2018-09-07 2019-02-05 华南理工大学 A kind of flexible bus dispatching method in internet of real-time response half
CN109376928A (en) * 2018-10-24 2019-02-22 天津市市政工程设计研究院 Consider the customization public transport rideshare optimization method of bipartite matching
CN109800902A (en) * 2018-12-11 2019-05-24 华南理工大学 A kind of unmanned public transport optimization method of uninterrupted reciprocating flexible line length
CN111063209A (en) * 2019-12-23 2020-04-24 北京航空航天大学 Automatic driving bus combined dispatching optimization method matched with inter-section bus
CN112101751A (en) * 2020-08-31 2020-12-18 华南理工大学 Public transport optimization method, system, device and storage medium
CN112233452A (en) * 2020-10-28 2021-01-15 厦门金龙联合汽车工业有限公司 Self-adaptive flexible scheduling method for bus

Patent Citations (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103021194A (en) * 2012-12-27 2013-04-03 东南大学 Method for setting inter-station unidirectional sectioned green wave signals for long-spacing buses
CN106127357A (en) * 2016-07-29 2016-11-16 华南理工大学 A kind of customization public transport automatic routing system based on reservation data and method
CN107564269A (en) * 2017-08-28 2018-01-09 华南理工大学 A kind of half flexible bus dispatching method based on willingness to pay
CN109166337A (en) * 2018-09-04 2019-01-08 深圳市东部公共交通有限公司 Public transport arrival time generation method, device and bus passenger travelling OD acquisition methods
CN109308574A (en) * 2018-09-07 2019-02-05 华南理工大学 A kind of flexible bus dispatching method in internet of real-time response half
CN109376928A (en) * 2018-10-24 2019-02-22 天津市市政工程设计研究院 Consider the customization public transport rideshare optimization method of bipartite matching
CN109800902A (en) * 2018-12-11 2019-05-24 华南理工大学 A kind of unmanned public transport optimization method of uninterrupted reciprocating flexible line length
CN111063209A (en) * 2019-12-23 2020-04-24 北京航空航天大学 Automatic driving bus combined dispatching optimization method matched with inter-section bus
CN112101751A (en) * 2020-08-31 2020-12-18 华南理工大学 Public transport optimization method, system, device and storage medium
CN112233452A (en) * 2020-10-28 2021-01-15 厦门金龙联合汽车工业有限公司 Self-adaptive flexible scheduling method for bus

Similar Documents

Publication Publication Date Title
CN109859459B (en) Automatic driving bus dispatching optimization method
CN109800902B (en) Unmanned bus optimization method for uninterrupted reciprocating flexible line length
WO2021004115A1 (en) Combined dispatching optimization method for manned buses and autonomous buses
WO2018032808A1 (en) Big data based bus line schedule collaborative optimization method
CN110782079B (en) Method for adjusting energy-saving high-speed railway train running chart based on stop scheme
CN109308574B (en) Real-time response Internet semi-flexible bus scheduling method
CN108390421A (en) Meter and the double scale charging bootstrap techniques of the electric vehicle of user satisfaction and system
CN111898909B (en) Unmanned bus dispatching method based on real-time requirements
CN111653098B (en) Intersection passing sequence optimization method for automatic guided vehicle with multiple loading capacity
CN112330007B (en) Passenger-oriented transfer connection optimization method and device
CN105389975A (en) Chauffeured car scheduling method and apparatus
CN111985700B (en) Vehicle carrying bill quantity balancing method and device for determining home delivery
CN111815166A (en) Cooperative optimization method and device of urban public transport system based on passenger flow distribution
CN116029510A (en) Vehicle scheduling method, device, equipment and storage medium
CN112907071A (en) Bus scheduling method, system and device based on willingness-to-pay and storage medium
CN111898863B (en) Dynamic scheduling method and device for vehicles in rail transit
CN112580962A (en) Traffic optimization scheduling system and method based on smart city
CN112233452A (en) Self-adaptive flexible scheduling method for bus
CN112101751A (en) Public transport optimization method, system, device and storage medium
CN113793195B (en) Network about vehicle order processing method and device, computer equipment and readable storage medium
CN111191904A (en) Intelligent vehicle formation method and device, electronic equipment and storage medium
CN114275014B (en) Subway congestion degree relieving method and device, server and storage medium
CN113096430B (en) Elastic public transport instant demand dynamic response method based on Euclidean distance charging
CN113859326B (en) Virtual marshalling method for train
CN114148382A (en) Train operation diagram compiling method facing virtual formation

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination