CN113345216B - Vehicle scheduling method for large-scale activities - Google Patents

Vehicle scheduling method for large-scale activities Download PDF

Info

Publication number
CN113345216B
CN113345216B CN202110594853.2A CN202110594853A CN113345216B CN 113345216 B CN113345216 B CN 113345216B CN 202110594853 A CN202110594853 A CN 202110594853A CN 113345216 B CN113345216 B CN 113345216B
Authority
CN
China
Prior art keywords
yard
parking lot
vehicle
vehicles
service
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.)
Active
Application number
CN202110594853.2A
Other languages
Chinese (zh)
Other versions
CN113345216A (en
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.)
Lanhai Fujian Information Technology Co ltd
Original Assignee
Lanhai Fujian Information Technology Co ltd
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 Lanhai Fujian Information Technology Co ltd filed Critical Lanhai Fujian Information Technology Co ltd
Priority to CN202110594853.2A priority Critical patent/CN113345216B/en
Publication of CN113345216A publication Critical patent/CN113345216A/en
Application granted granted Critical
Publication of CN113345216B publication Critical patent/CN113345216B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • G—PHYSICS
    • G08—SIGNALLING
    • G08G—TRAFFIC CONTROL SYSTEMS
    • G08G1/00—Traffic control systems for road vehicles
    • G08G1/01—Detecting movement of traffic to be counted or controlled
    • G08G1/0104—Measuring and analyzing of parameters relative to traffic conditions
    • G08G1/0125—Traffic data processing
    • G08G1/0129—Traffic data processing for creating historical data or processing based on historical data
    • 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
    • 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
    • G—PHYSICS
    • G08—SIGNALLING
    • G08G—TRAFFIC CONTROL SYSTEMS
    • G08G1/00—Traffic control systems for road vehicles
    • G08G1/01—Detecting movement of traffic to be counted or controlled
    • G08G1/052—Detecting movement of traffic to be counted or controlled with provision for determining speed or overspeed
    • G—PHYSICS
    • G08—SIGNALLING
    • G08G—TRAFFIC CONTROL SYSTEMS
    • G08G1/00—Traffic control systems for road vehicles
    • G08G1/20—Monitoring the location of vehicles belonging to a group, e.g. fleet of vehicles, countable or determined number of vehicles

Landscapes

  • Business, Economics & Management (AREA)
  • Human Resources & Organizations (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Engineering & Computer Science (AREA)
  • Economics (AREA)
  • Strategic Management (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Marketing (AREA)
  • Theoretical Computer Science (AREA)
  • General Business, Economics & Management (AREA)
  • Tourism & Hospitality (AREA)
  • Game Theory and Decision Science (AREA)
  • Analytical Chemistry (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Development Economics (AREA)
  • Chemical & Material Sciences (AREA)
  • Educational Administration (AREA)
  • Health & Medical Sciences (AREA)
  • General Health & Medical Sciences (AREA)
  • Primary Health Care (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The invention discloses a vehicle scheduling method facing large-scale events, which provides a vehicle scheduling method for the problem that the host of each large-scale event sends and receives vehicles to the participants; the method comprises the following steps: the quick response time is set to meet the requirement of quick response of the service of the participants at three places of each transportation junction, hotel and activity center; according to the particularity of the active time periods, dynamically adjusting the vehicles in the parking lot at different time periods; setting a parking lot service capacity value, updating the service capacity value of each parking lot within a certain time window, and scheduling vehicles according to the parking lot service capacity value after the service of the vehicles is finished; temporary yards are set for occasional needs, so that the service capacity value of each yard is kept within a reasonable range. The invention improves the quality of event handling and the experience of event personnel through the yard setting, the yard vehicle configuration and the vehicle scheduling of the special vehicle receiving and sending service of the event (the event comprises a meeting).

Description

Vehicle scheduling method for large-scale activities
Technical Field
The invention relates to the two technical fields of scheduling planning and artificial intelligence, provides a vehicle scheduling method facing large-scale activities, and provides a vehicle scheduling method for solving the problem of vehicle receiving and sending of participants by hosts of the large-scale activities.
Background
With the economic development of China, scientific technology enters the prosperous period of development, the number of scientific and technological practitioners and the number of related educators are rapidly increased, various large-scale academic activities and activity types (such as academic conferences and conference types) are continuously enriched, and the content tends to be specialized and standardized. In recent years, some first-line cities, scientific strong cities and education strong cities in China continuously become international and national academic event places and organizations.
Various large-scale activities such as conferences often need to call a large number of vehicles to carry out the service of receiving and sending the participants so as to meet the professional and normative property of the activity handling. Therefore, the reasonable use and the scheduling of the vehicles are very important, and the reasonable scheduling can meet the service requirements of the participants and reduce the resource waste. For example, the host needs to determine the number of vehicles, the arrangement of the yard position, and the like according to the scale of the participants, the traffic mode, and the like. At present, the research on a vehicle scheduling method for a large-scale event (such as a large-scale meeting) is not abundant enough, so that the resource waste of a vehicle is caused when the large-scale event (such as a large-scale meeting) is held every time, and the service experience of a person who refers to the event is poor.
Disclosure of Invention
The invention mainly aims to provide a vehicle scheduling method for large-scale events, which improves the quality of event handling and the experience of event personnel by setting a yard, configuring the vehicles in the yard and scheduling the vehicles of special vehicles for the events (including meetings).
The invention adopts the following technical scheme:
a vehicle scheduling method facing large-scale activities comprises the following steps: the method comprises the steps of a parking lot setting step, a parking lot vehicle configuration step and a vehicle dispatching step;
the yard setting step comprises:
s101, receiving the set quick response time T QR (ii) a The fast response time indicates that the attendee can be served within this time;
s102, obtaining the sum ED of actual driving distances of the main traffic pivot point, the event designated hotel and the event handling place in a specific time period and the driving time ET spent by the driving distance ED in the same time period in one month before the event is handled by utilizing the historical data, and calculating the average speed v of the vehicle driving E = ED/ET; then respectively using the central points of each traffic pivot point, hotel and activity center as the circle center and v E ×T QR Building a plurality of circular areas for the radius; the yard can be arranged in a circular area so as to ensure that the response time is less than or equal to T QR ；
S103, calculating intersection of the circular areas pairwise, and taking the obtained intersection point set as a candidate parking lot position set DP to ensure that the driving distances from the parking lot to each traffic pivot point, each hotel and the activity center are all radii v E ×T QR ；
S104, judging whether the station points which can be set in the circular area do not belong to the set DP, and if not, executing S105; otherwise, the following processing is carried out:
s1041, if all the settable yard points in the circle with the center point of the traffic hub point as the center point are not in the candidate yard set DP, namely all the circles with the center point of the traffic hub point as the center point have no points with other circles, calculating the actual driving distance from each traffic hub point to all hotels, and sorting and taking out 3 paths with the shortest distance according to ascending order; and calculating the intersection point of the 3 paths and the circular area corresponding to the traffic pivot point, wherein the intersection point can be used as a train yard to be selected; then, the actual driving distance from the 3 intersection points to the hotel on the path is calculated
Figure GDA0003763691790000021
Actual distance traveled to the event venue
Figure GDA0003763691790000022
And the actual driving distance from the hotel to the event place
Figure GDA0003763691790000023
Taking an intersection point with the minimum distance sum of the three points as a candidate parking lot to be added into the set DP;
s1042, if all the settable yard points in the circle with the center point of the hotel as the center of the circle are not in the candidate yard set DP, calculating the actual driving distance from each hotel to all the traffic pivot points, and taking the nearest path; solving the intersection point of the path with the closest distance and the boundary of the circular area with the hotel center point as the circle center, and adding the intersection point into the set DP;
s1043, if all the settable yard points in the circle taking the center point of the activity place as the center of the circle are not in the candidate yard set DP, adding the intersection point of the path formed by all the hotels and the traffic hub points and the boundary of the circle C taking the center point of the activity place as the center of the circle into the set DP;
s105, for all the candidate parking lot positions (x) in the DP i ，y i ) E.g., DP, calculating the distance traveled between all yard locations and determining the distance to each location using the K nearest neighbor method (x) i ，y i ) Nearest K parking lot positions and calculating the presence index e of each parking lot position i (ii) a If e i If the value is 0, deleting the data from the set DP; if it is e i If the value is 1, the value is reserved;
s106, regarding each parking lot in the candidate parking lot set DP as a point, connecting the points to form a polygon, and calculating a point in the polygon, wherein the sum of the distances from the point to the parking lots is required to be minimum; solving the Fermat point of the polygon by using a simulated annealing algorithm, and taking the Fermat point as the position of a spare parking lot;
the yard vehicle configuration step comprises:
s107, receiving the set parking lot screening value L for carrying out parking lot screening in different stages; according to the time flow of the event holding and the following time periods, the number of vehicles in each yard is dynamically adjusted according to the demand conditions of different time periods, as follows:
s1071, the morning of the day before the start of the activity to the first day of the start of the activity is a time period T 1 Preferentially ensuring the vehicle requirements of the parking lot close to each traffic junction; calculating the actual driving distances between the yards and all the transportation hubs, arranging the actual driving distances in an ascending order, taking the front L yards to form a set DP1, wherein the number N of vehicles distributed to each yard in the set i ＝q k /Q, wherein Q k Representation and set DP 1 The estimated maximum value of the number of the participants arriving at the station in each hour at the traffic hub with the middle distance being closest;
s1072, the activity is in the period of time T 2 Equal distribution of vehicles to each yard, i.e. N i ＝N c /| DP |, where Q represents the maximum number of passengers per vehicle; n is a radical of c Representing the total number of vehicles assignable to the fleet;
s1073, the time period T is from afternoon of the end of the activity to the morning of the next day after the end of the activity 3 Preferentially ensuring the vehicle requirements of the parking lot close to the hotel; calculating the actual driving distances between the parking lots and all hotels, arranging the parking lots in an ascending order, taking the front L parking lots to form a set DP2, and distributing the number N of vehicles to the parking lots in the set i ＝q l /Q，q l Representation and DP 2 The number of participants entering the hotel at the lower couch, which is closest to the middle parking lot;
the vehicle dispatching step comprises the following steps:
s108, calculating a service capability value for each parking lot, and setting an updating time to update the service capability value; parking lot (x) i ，y i ) The service capability value of (a) is calculated as follows:
Figure GDA0003763691790000031
wherein, RN i Indicating the number of vehicles currently remaining in the yard, TM indicating the difference between the number of vehicles serviced by the yard and the number of vehicles returned to the yard within a time window from the current time;
s109, after the vehicle finishes the service, the yard returned by the vehicle is scheduled according to the current service capacity of each yard, and the service capacity value of each yard is ensured to be maintained in the interval [ A ] after the vehicle service is finished min ，A max ](ii) a Wherein A is min Represents a minimum value of service capability; a. The max Represents a maximum value of service capability;
s110, while scheduling in S109, according to the dynamic change condition of the service ability values of different parking lots, the service ability value of each parking lot is adjusted by using the standby parking lot, so that the service ability value of each parking lot is maintained in the interval [ A ] min ，A max ]。
Preferably, in S102, the center point of each transportation hub, hotel and event holding place is used as the center of circle and D is used QR Is formed by the following formulaA plurality of circular regions:
Figure GDA0003763691790000032
Figure GDA0003763691790000033
C＝{(x i ，y i )|(x i -x C ) 2 +(y i -y C ) 2 ≤(D QR ) 2 }
wherein, P i 、H i C respectively represents that a set of parking lot points can be arranged in a circular area with the ith traffic pivot point, the jth designated hotel on the couch and the event handling place as centers;
Figure GDA0003763691790000034
(x C ，y C ) Respectively representing the central coordinate of the ith transportation hub, the central coordinate of the ith hotel on the couch and the central coordinate of the event holding place; (x) i ，y i ) Indicating the ith yard location.
Preferably, in S103, the set of candidate yard positions DP:
DP＝{(x i ，y i )|P i ∩H i or P i ∩C or H i ∩C or P i ∩P j orH i ∩H j }。
preferably, in S105, the index e i Is represented as follows:
Figure GDA0003763691790000041
wherein e is i Indicates the ith yard position (x) i ，y i ) There is an index, and if 0, it means that the position is not necessarily set, otherwise, it means that the position is necessarily set, ND ik Represents the travel distance of the ith yard from the kth neighbor yard, and δ represents the threshold value.
Preferably, in S1072, N is c Calculated as the following function:
Figure GDA0003763691790000042
preferably, S109 includes:
if the vehicle finishes the service, the service capability value A of some parking lots exists k ＜A min And the service capability values of the parking lots are different, the vehicle returns to the parking lot with the lowest service capability value;
if the service ability value A is present k ＜A min If a plurality of same service capability values exist in the parking lot and the value is the smallest parking lot, the vehicle returns to the parking lot closest to the current position;
if the vehicle finishes the service, the service capability value A of most of the parking lots exists k ≥A max The vehicle returns to the alternate yard.
Preferably, S110 includes:
if the service ability value A of some parking lots k ≥A max The vehicles in these yards need to be dispatched to the backup yard to ensure that their capacity value drops to A max The waste of vehicle resources is avoided;
if the service capability value of some parking lots is always in A in a standby parking lot scheduling time window k ＜A min Dispatching the vehicles in the standby parking lot to the parking lot to improve the service capability value to (A) max +A min )/2。
Compared with the prior art, the invention has the following beneficial effects:
the invention relates to a vehicle dispatching method; the method comprises the following steps: the quick response time is set to meet the requirement of quick response of the service of the participants at three places of each transportation junction, hotel and activity center; according to the particularity of the active time periods, dynamically adjusting the vehicles in the parking lot at different time periods; setting a parking lot service capacity value, updating the service capacity value of each parking lot within a certain time window, and scheduling vehicles according to the parking lot service capacity value after the service of the vehicles is finished; temporary yards are set for occasional needs, so that the service capacity value of each yard is kept within a reasonable range. The invention improves the quality of event handling and the experience of event personnel through the yard setting, the yard vehicle configuration and the vehicle scheduling of the special vehicle receiving and sending service of the event (the event comprises a meeting).
The above description is only an overview of the technical solutions of the present invention, and the embodiments of the present invention are described below in order to make the technical means of the present invention more clearly understood, and to make the above and other objects, features, and advantages of the present invention more apparent.
The above and other objects, advantages and features of the present invention will become more apparent to those skilled in the art from the following detailed description of specific embodiments thereof, taken in conjunction with the accompanying drawings.
Drawings
FIG. 1 is a flow chart of yard setup according to the present invention;
FIG. 2 is a flow chart of yard vehicle setup of the present invention;
FIG. 3 is a flow chart of vehicle dispatch in accordance with the present invention.
Detailed Description
In order to more clearly illustrate the proposed method of the present invention, the following detailed description of the embodiments of the main part of the present invention is given with reference to the accompanying drawings.
In general, all participants want to experience professional and normative services provided by the host at the time of participation, and particularly in terms of taking and sending trips, the host and participants want to reduce the travel time between the commuting hub, the hotel on the couch and the event hosting site, so that the participants and trips are more conveniently. The method is mainly used for meeting the large-scale real-time travel demands when large-scale activities such as large conferences are held, and vehicles for providing services are reasonably arranged and scheduled through a quick vehicle response method, so that good travel services are provided for participants, and the perfect holding of the large-scale activities is assisted. The method provided by the invention mainly comprises three parts: yard settings, yard vehicle configuration, and vehicle dispatch.
In this embodiment, referring to fig. 1 to 3, a vehicle scheduling method for a large-scale activity includes the following steps:
s101, setting a quick response time T according to the activity (activity) service requirement QR . Specifically, the host or the third party company responsible for vehicle scheduling may set a fast response time T before the start of the event according to various factors such as the current city road conditions, weather, the number of people who see the event, and the like QR By fast response time is meant that the reference activity person can be served in this time, which should be as small as possible.
S102, estimating the average running speed of the vehicle according to the following formula by using historical traffic data:
Figure GDA0003763691790000051
wherein ED represents the sum of actual driving distances of a main urban transportation hub, a hotel specified for the event and an event handling place in a specific time period every day in the same time period within one month before the event is handled, and ET represents the sum of corresponding actual driving times. In the present invention, three time periods [ 8-00 ], [ 12.
S103, calculating the straight-line running distance D of the vehicle in the set quick response time according to the average running speed of the vehicle QR ＝v E ×T QR I.e. a fast response effect to the respective service point is guaranteed. And respectively using the central point of each traffic point (namely traffic hub, hotel, event holding place) as the center of circle D QR A plurality of circular areas are formed for the radius according to the following formula:
Figure GDA0003763691790000061
Figure GDA0003763691790000062
C＝{(x i ，y i )|(x i -x C ) 2 +(y i -y C ) 2 ≤(D QR ) 2 }
wherein, P i ，H i C respectively represents that a set of available parking lots is arranged in a circular area with the ith traffic pivot point, the jth designated hotel on the couch and the event handling place as centers;
Figure GDA0003763691790000063
(x C ，y C ) Respectively representing the central coordinate of the ith transportation hub, the central coordinate of the ith hotel on the couch and the central coordinate of the event holding place.
S104, according to the obtained circular area, calculating a cross point set according to the following formula to obtain a candidate parking lot position set DP:
DP＝{(x，y)|P i ∩H i or P i ∩C or H i ∩C or P i ∩P j or H i ∩H j }
to determine whether all the available yards in the circular area of a transportation hub, hotel or event venue are not in the DP, i.e., to determine whether all the available yards are in the DP
Figure GDA0003763691790000064
Or alternatively
Figure GDA0003763691790000065
Or
Figure GDA0003763691790000066
If not, executing S105; if so (in the case where none of the possible yard points is in the DP), the following processing is performed:
s1041, for
Figure GDA0003763691790000067
Then, the actual travel distance D between the ith transportation hub and all hotels j is calculated ij Sorting from small to large, selecting 3 driving paths with the shortest distance, and acquiring P i 3 intersections of the boundary with these 3 paths, denoted as
Figure GDA0003763691790000068
For these 3 intersections, the selection is made as the following function:
Figure GDA0003763691790000069
wherein,
Figure GDA00037636917900000610
indicating yard of waiting for pick-up
Figure GDA00037636917900000611
The actual distance to the corresponding hotel on the path,
Figure GDA00037636917900000612
indicating yard of waiting for pick-up
Figure GDA00037636917900000613
The distance to the venue of the event,
Figure GDA00037636917900000614
indicating the distance of the corresponding hotel on the path to the event venue. The selected point is then added to the set of candidate yard locations, i.e.
Figure GDA00037636917900000615
S1042, for
Figure GDA00037636917900000616
If so, selecting the traffic closest to the ith hotelThe driving path of the junction is determined, and the path and H are determined i Intersection of boundaries
Figure GDA0003763691790000071
Adding the intersection to DP, i.e.
Figure GDA0003763691790000072
S1043, to
Figure GDA0003763691790000073
The intersection of the boundary of C and the driving paths of all hotels and transportation hubs
Figure GDA0003763691790000074
Into DP, i.e.
Figure GDA0003763691790000075
S105, for all the candidate parking lot positions (x) in the DP i ，y i ) E.g., DP, calculating the distance traveled between all yard locations and determining the distance to each location using the K nearest neighbor method (x) i ，y i ) The nearest K yard locations, in the present invention, K is taken as 3, and the presence indicator of the yard location is calculated according to the following function:
Figure GDA0003763691790000076
wherein e is i Indicates the ith yard position (x) i ，y i ) There is an index, which if 0, indicates that the position is unnecessary to be set, otherwise, indicates that the position is necessary to be set. ND ik Indicating the travel distance of the ith yard from the kth neighbor yard. δ represents a threshold for assessing the presence of the yard. In the present invention, δ is set to 0.8.
For calculating presence indicators of the yard, by distance from the place of eventThe priority order is calculated by first calculating the presence indicator for the yard location closest to the event venue. After the existing index of the current parking lot is calculated, if the existing index is e i If the value is 0, deleting the value from the DP; if it is e i The value is 1, then hold. And then, continuously calculating the existence indexes of the next parking lot until the existence indexes of all parking lots are calculated. The resulting DP is the final set yard.
And S106, after the final set yard set DP is obtained in S105, in order to ensure that the service capability value (explained below) of each yard is kept within a reasonable range during vehicle dispatching, a spare yard is additionally arranged in the invention, and the sum of the distances from the spare yard to other yards is ensured to be minimum. Therefore, each yard in the yard candidate set DP is regarded as a point, and the points are connected to form a polygon, and a point in the polygon is determined, so that the sum of distances from the point to each yard is required to be minimized. In the process, the Fermat point of the polygon can be calculated by using a simulated annealing algorithm, and the Fermat point is the position of the spare yard.
After the yard setup is completed, the vehicles are configured for each yard as follows.
And S107, dynamically adjusting the number of vehicles in each yard according to the demand conditions in different time periods. In the present invention, the following three cases are set:
situation one, the morning of the day before the start of the activity to the first day of the activity is the time period T 1 During this time period, most of the participants choose to be in the event city via different means of transport, and therefore at T 1 The vehicle requirements of the parking lots close to the traffic hubs are guaranteed preferentially in the time period; calculating the actual driving distances between the yards and all the transportation hubs, arranging the actual driving distances in an ascending order, taking the front L yards to form a set DP1, wherein the number N of vehicles distributed to each yard in the set i ＝q k /Q, wherein Q k Representation and set DP 1 The estimated maximum value of the number of the station-arriving participants in each hour at the traffic hub with the middle distance being closest; the number of vehicles in the other yards, i.e. the set (DP-DP 1), is set to 2 to ensure the arrivalTo the lowest service capability value described below.
Case two, the period of activity progress is the time period T 2 In the time period, the participants are all engaged in activities, so that the demands of each parking lot on the vehicles are stable, and the vehicles can be evenly distributed to each parking lot, namely N i ＝N c /| DP |, where Q represents the maximum number of passengers per vehicle; n is a radical of hydrogen c Representing the total number of vehicles that the fleet may allocate, the value is calculated as the function:
Figure GDA0003763691790000081
case three, the afternoon of the end of the activity is the time period T to the morning of the next day after the end of the activity 3 In the time period, due to the end of the event, most of the attendees can choose to leave the event place, so that the vehicle demand of a train yard close to the hotel needs to be guaranteed preferentially; calculating the actual driving distances between the parking lots and all hotels, arranging the parking lots in ascending order, taking the front L parking lots to form a set DP2, and distributing the number N of vehicles to the parking lots in the set i ＝q l /Q，q l Representation and DP 2 The number of participants entering the hotel at the lower couch, which is closest to the middle parking lot; the number of vehicles in the other yards, i.e., in the set (DP-DP 2), is set to 2 to ensure that the minimum service capability value described below is achieved.
Note that: the estimated maximum value q of the number of the station-arriving participants per hour in the transportation hub k The number q of the participants who check in the hotel on the couch l The value of (2) can be estimated and counted according to the participant information submitted by the participants.
After the configuration of the vehicle is completed, the vehicle is adaptively scheduled according to the event and the travel demand change condition during the event holding period, which is specifically as follows.
And S108, scheduling the returned vehicles according to the situations, wherein the invention provides a parking lot service capability value to represent the transport capacity state of the parking lot. The host can set the following key values in advance according to actual requirements:
(1) Vehicle service time window: for calculating the difference between the number of vehicles served by the yard and the number of vehicles returned to the yard within the time window;
(2) Service capability value update time: updating the service capacity values of all the yards, and setting the service capacity values to be 5 minutes in the invention;
(3) Setting maximum value A of service capability value max Minimum value of A min Vehicle scheduling is performed as a criterion for different situations (in the present invention, a min Set to 0.2, A max Set to 0.8). If the service capacity value of the parking lot is larger than A max Then the vehicle is dispatched to ensure that the service capability value is maintained in the interval [ A ] representing the excess capacity of the yard min ，A max ](ii) a If the service capacity value of the parking lot is less than A min If the capacity of the yard is insufficient, the vehicle needs to be transferred from other yards to the yard to ensure that the service capacity value is maintained in the interval [ A ] min， A max ]；
(4) Scheduling time window of the standby parking lot: the method is used for scheduling and selecting the vehicles in the standby parking lot, and the time window is set to be 60 minutes in the invention;
(5) The service ability value of the yard is calculated as follows:
Figure GDA0003763691790000091
wherein, RN i The number of vehicles currently remaining in the yard is indicated, and TM indicates the difference between the number of vehicles serviced by the yard and the number of vehicles returned to the yard within a vehicle service time window from the current time (in the present invention, the vehicle time window is set to 30 minutes).
S109, after the vehicle finishes the service, the yard returned by the vehicle is scheduled according to the current service capability of each yard, wherein the yard returned by the ith vehicle is determined according to the following function:
Figure GDA0003763691790000092
wherein D is ik Indicates the distance traveled by the ith vehicle to the kth yard, A min And A max The minimum and maximum values of the service capability are shown, when the service capability value of a certain parking lot is less than A min If so, the capacity of the train yard is insufficient, otherwise, if the service capacity value is more than A max If so, the excess capacity of the train yard is indicated. In the present invention, A min Set to 0.2, A max Set to 0.8. Service capability value A when there are certain yards k ＜A min And if the capacity values of a plurality of the parking lots are the same, returning the parking lot closest to the current position. When the service capability values of all the parking lots meet A max ≥A k ＞A min And if so, returning the vehicle to the parking lot closest to the current position. When the service capability value A of most parking lots k ≥A max And if so, returning the vehicle to the standby parking lot.
And S110, adjusting the service capability value of each parking lot by using the standby parking lots according to the dynamic change condition of the service capability values of different parking lots. Service ability value A of current parking lot k ≥A max When the vehicle in the parking lot is dispatched to the standby parking lot, the capacity value of the vehicle is reduced to A max (ii) a When the service ability value of the parking lot is always in A within a time window (in the present invention, the time window is set to 60 minutes) k ＜A min Dispatching the vehicles in the standby parking lot to the parking lot to improve the service capability value to (A) max +A min )/2。
The foregoing description of specific embodiments of the present invention has been presented. It is to be understood that the present invention is not limited to the specific embodiments described above, and that various changes and modifications may be made by one skilled in the art within the scope of the appended claims without departing from the spirit of the invention.

Claims (7)

1. A vehicle scheduling method facing large-scale activities is characterized by comprising the following steps: the method comprises the steps of setting a parking lot, configuring vehicles in the parking lot and scheduling the vehicles;
the yard setting step comprises:
s101, receiving the set quick response time T QR (ii) a The quick response time means that the personnel participating in the event can be served within this time;
s102, obtaining the sum ED of actual driving distances of the main traffic pivot point, the event designated hotel and the event handling place in a specific time period and the driving time ET spent by the driving distance ED in the same time period in one month before the event is handled by utilizing the historical data, and calculating the average speed v of the vehicle driving E = ED/ET; then respectively using the central points of each traffic pivot point, hotel and activity center as the circle center and v E ×T QR Building a plurality of circular areas for the radius; the yard can be arranged in a circular area so as to ensure that the response time is less than or equal to T QR ；
S103, calculating intersection of the circular areas pairwise, and taking the obtained intersection point set as a candidate parking lot position set DP to ensure that the driving distances from the parking lot to each traffic pivot point, each hotel and the activity center are all radii v E ×T QR ；
S104, judging whether the station points which can be set in the circular area do not belong to the set DP, and if not, executing S105; otherwise, the following processing is carried out:
s1041, if all the settable yard points in the circle taking the center point of the traffic hub point as the center of the circle are not in the candidate yard set DP, namely all the circles taking the center point of the traffic hub point as the center of the circle have no points with other circles, calculating the actual driving distance from each traffic hub point to all hotels, and sorting according to an ascending order and taking out 3 paths with the shortest distance; and calculating the intersection point of the 3 paths and the circular area corresponding to the traffic pivot point, wherein the intersection point can be used as a train yard to be selected; then, calculating the actual driving distance from the 3 intersection points to the hotel on the path
Figure FDA0003763691780000012
Actual distance traveled to the event venue
Figure FDA0003763691780000011
And the actual travel distance from the hotel to the event place
Figure FDA0003763691780000013
Taking an intersection point with the minimum distance sum of the three points as a candidate parking lot to be added into the set DP;
s1042, if all the settable yard points in the circle with the center point of the hotel as the center of the circle are not in the candidate yard set DP, calculating the actual driving distance from each hotel to all the traffic pivot points, and taking the nearest path; solving the intersection point of the path with the closest distance and the boundary of the circular area with the hotel center point as the circle center, and adding the intersection point into the set DP;
s1043, if all the settable yard points in the circle taking the center point of the activity place as the center of the circle are not in the candidate yard set DP, adding the intersection point of the path formed by all the hotels and the traffic hub points and the boundary of the circle C taking the center point of the activity place as the center of the circle into the set DP;
s105, for all the candidate parking lot positions (x) in the DP i ,y i ) E.g., DP, calculating the distance traveled between all yard locations and determining the distance to each location using the K nearest neighbor method (x) i ,y i ) Nearest K yard positions and calculating the presence index e of each yard position i (ii) a If e i If the value is 0, deleting the data from the set DP; if it is e i If the value is 1, the value is reserved;
s106, regarding each parking lot in the candidate parking lot set DP as a point, connecting the points to form a polygon, and calculating a point in the polygon, wherein the sum of the distances from the point to the parking lots is required to be minimum; solving the Fermat point of the polygon by using a simulated annealing algorithm, and taking the Fermat point as the position of a spare parking lot;
the yard vehicle configuration step comprises:
s107, receiving the set parking lot screening value L for performing parking lot screening at different stages; according to the time flow of the event holding and the following time periods, the number of vehicles in each yard is dynamically adjusted according to the demand conditions of different time periods, as follows:
s1071, the morning of the day before the start of the activity to the first day of the start of the activity is a time period T 1 Preferentially ensuring the vehicle requirements of the parking lot close to each traffic junction; calculating the actual driving distances between the yards and all the transportation hubs, arranging the actual driving distances in an ascending order, taking the front L yards to form a set DP1, wherein the number N of vehicles distributed to each yard in the set i ＝q k /Q, wherein Q k Representation and set DP 1 The estimated maximum value of the number of the participants arriving at the station in each hour at the traffic hub with the middle distance being closest;
s1072, the activity is in the period of time T 2 With equal distribution of vehicles to each yard, i.e. N i ＝N c /| DP |, where Q represents the maximum number of passengers per vehicle; n is a radical of c Representing the total number of vehicles assignable to the fleet;
s1073, the time period T is from afternoon of the end of the activity to the morning of the next day after the end of the activity 3 Preferentially ensuring the vehicle demand of a parking lot close to the hotel; calculating the actual driving distances between the parking lots and all hotels, arranging the parking lots in ascending order, taking the front L parking lots to form a set DP2, and distributing the number N of vehicles to the parking lots in the set i ＝q l /Q，q l Representation and DP 2 The number of participants entering the hotel at the lower couch, which is closest to the middle parking lot;
the vehicle dispatching step comprises the following steps:
s108, calculating a service capability value for each parking lot, and setting an updating time to update the service capability value; parking lot (x) i ,y i ) The service capability value of (a) is calculated as follows:
Figure FDA0003763691780000021
wherein, RN i Indicating the number of vehicles currently remaining in the yard, TM indicating the difference between the number of vehicles serviced by the yard and the number of vehicles returned to the yard within a time window from the current time;
s109, when the vehicle finishes the clothesAfter the service, according to the current service capability of each parking lot, scheduling the parking lot returned by the vehicle to ensure that the service capability value of each parking lot is maintained in the interval [ A ] after the service of the vehicle is finished min ,A max ](ii) a Wherein A is min Represents a minimum value of service capability; a. The max Represents a maximum value of service capability;
s110, while scheduling in S109, according to the dynamic change condition of the service ability values of different parking lots, the service ability value of each parking lot is adjusted by using the standby parking lot, so that the service ability value of each parking lot is maintained in the interval [ A ] min ,A max ]。
2. The method of claim 1, wherein in step S102, the center points of the transportation hubs, hotel and event venue are used as the center of a circle and D is used as the center of the circle QR A plurality of circular areas are formed for the radius according to the following formula:
Figure FDA0003763691780000031
Figure FDA0003763691780000032
C＝{(x i ,y i )|(x i -x C ) 2 +(y i -y C ) 2 ≤(D QR ) 2 }
wherein, P i 、H i C respectively represents that a set of parking lot points can be arranged in a circular area with the ith traffic pivot point, the jth designated hotel on the couch and the event handling place as centers;
Figure FDA0003763691780000033
(x C ,y C ) Respectively representing the central coordinate of the ith transportation hub, the central coordinate of the ith hotel on the couch and the central coordinate of the event holding place; (x) i ,y i ) Indicating the ith yard location.
3. The vehicle scheduling method for large events according to claim 2, wherein in S103, the set of candidate yard positions DP:
DP＝{(x i ,y i )|P i ∩H i or P i ∩C or H i ∩C or P i ∩P j or H i ∩H j }。
4. the method for dispatching vehicles for large-scale activities according to claim 1, wherein in S105, the index e is i Is represented as follows:
Figure FDA0003763691780000034
wherein e is i Indicates the ith yard position (x) i ,y i ) There is an index, and if 0, it means that the position is not necessarily set, otherwise, it means that the position is necessarily set, ND ik Represents the travel distance of the ith yard from the kth neighbor yard, and δ represents the threshold value.
5. The large-scale activity oriented vehicle scheduling method of claim 1, wherein in S1072, N is c Calculated as the following function:
Figure FDA0003763691780000035
6. the method for dispatching vehicles for large-scale activities according to claim 1, wherein in S109, the method comprises:
if the vehicle finishes the service, the service capability value A of some parking lots exists k <A min And the service capability values of the parking lots are different, the vehicle returns to the parking lot with the lowest service capability value;
if at service capability value A k <A min If a plurality of same service capability values exist in the parking lot and the value is the smallest parking lot, the vehicle returns to the parking lot closest to the current position;
if the vehicle finishes the service, the service capability value A of most of the parking lots exists k ≥A max The vehicle returns to the alternate yard.
7. The method for dispatching vehicles for large-scale activities according to claim 1, wherein S110 comprises:
if the service ability value A of some parking lots k ≥A max The vehicles in these yards need to be dispatched to the backup yard to ensure that their capacity value drops to A max The waste of vehicle resources is avoided;
if the service capability value of some parking lots is always in A in a standby parking lot scheduling time window k ＜A min Dispatching the vehicles in the standby parking lot to the parking lot to improve the service capability value to (A) max +A min )/2。
CN202110594853.2A 2021-05-28 2021-05-28 Vehicle scheduling method for large-scale activities Active CN113345216B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110594853.2A CN113345216B (en) 2021-05-28 2021-05-28 Vehicle scheduling method for large-scale activities

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110594853.2A CN113345216B (en) 2021-05-28 2021-05-28 Vehicle scheduling method for large-scale activities

Publications (2)

Publication Number Publication Date
CN113345216A CN113345216A (en) 2021-09-03
CN113345216B true CN113345216B (en) 2022-10-11

Family

ID=77472106

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110594853.2A Active CN113345216B (en) 2021-05-28 2021-05-28 Vehicle scheduling method for large-scale activities

Country Status (1)

Country Link
CN (1) CN113345216B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115083208B (en) * 2022-07-20 2023-02-03 深圳市城市交通规划设计研究中心股份有限公司 Human-vehicle conflict early warning method, early warning analysis method, electronic device and storage medium

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111612327A (en) * 2020-05-18 2020-09-01 广州云从人工智能技术有限公司 Scheduling method, system, machine readable medium and equipment

Family Cites Families (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9562785B1 (en) * 2015-07-20 2017-02-07 Via Transportation, Inc. Continuously updatable computer-generated routes with continuously configurable virtual bus stops for passenger ride-sharing of a fleet of ride-sharing vehicles and computer transportation systems and computer-implemented methods for use thereof
US10692028B2 (en) * 2015-12-09 2020-06-23 Sap Se Optimal demand-based allocation
EP3623764A1 (en) * 2017-01-25 2020-03-18 Via Transportation, Inc. Method and system for managing a fleet of ride-sharing vehicles using virtual bus stops
JP7035957B2 (en) * 2018-10-23 2022-03-15 トヨタ自動車株式会社 Vehicle allocation instruction device, vehicle allocation instruction method and vehicle allocation instruction program
CN112102644B (en) * 2019-06-18 2022-11-01 腾讯科技（深圳）有限公司 Riding positioning method and device
CN111612358B (en) * 2020-05-25 2024-04-12 北京交通大学 Shared automobile vehicle dispatching and dispatcher path optimization method

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111612327A (en) * 2020-05-18 2020-09-01 广州云从人工智能技术有限公司 Scheduling method, system, machine readable medium and equipment

Also Published As

Publication number Publication date
CN113345216A (en) 2021-09-03

Similar Documents

Publication Publication Date Title
CN107564269B (en) A kind of half flexible bus dispatching method based on willingness to pay
CN107564270A (en) A kind of intelligent public transportation dispatching method for running
CN105279955B (en) A kind of share-car method and apparatus
US20070136110A1 (en) Method of table management
CN106652537B (en) Automatic reservation scheduling system and method for college teaching staff to pick up and send out vehicles
CN101501591A (en) Intelligent meeting scheduler
CN103067493A (en) Service reservation method based on cloud computing
CN111127274B (en) Community home care service scheduling and path planning method and device
CN113345216B (en) Vehicle scheduling method for large-scale activities
Van Buuren et al. A simulation model for emergency medical services call centers
CN109934380A (en) Shared electric car vehicle and personal scheduling optimization method based on dual layer resist
CN110444008B (en) Vehicle scheduling method and device
CN113096429B (en) Elastic bus area flexibility line generation method based on bus dispatching station distribution
CN114118766A (en) Passenger flow OD algorithm based on bus passenger travel multiple matching
JP2018081575A (en) Vehicle management method and vehicle management system
CN115730781A (en) Bus route optimization system based on big data analysis
Pratelli et al. Comparing route deviation bus operation with respect to dial-a-ride service for a low-demand residential area
CN111785015A (en) Public transport real-time regulation and control information system and scheduling method based on genetic algorithm
CN113936496B (en) Passenger identification-based intelligent interactive traffic scheduling method and system
CN111144779A (en) Intelligent conference system based on Internet of things and method thereof
CN113393029A (en) Method and equipment for predicting rail transit passenger flow
CN114862357A (en) Railway train apartment management system based on big data
Elaluf-Calderwood et al. Organizational agility with mobile ICT? The case of London Black Cab work
CN109146418A (en) A kind of meeting management system convenient for personnel participating in the meeting&#39;s interaction
Ripplinger et al. Technology adoption by small urban and rural transit agencies

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
CB03 Change of inventor or designer information
CB03 Change of inventor or designer information

Inventor after: Cai Yiqiao

Inventor after: Wang Xiaojun

Inventor after: Fu Shunkai

Inventor after: Wang Yufei

Inventor after: Zeng Shengming

Inventor after: Chen Yue

Inventor before: Cai Yiqiao

Inventor before: Wang Xiaojun

Inventor before: Fu Shunkai

Inventor before: Zeng Shengming

Inventor before: Chen Yue

GR01 Patent grant
GR01 Patent grant