CN111861116A - Passenger queuing method of automatic taxi driving system - Google Patents

Passenger queuing method of automatic taxi driving system Download PDF

Info

Publication number
CN111861116A
CN111861116A CN202010549085.4A CN202010549085A CN111861116A CN 111861116 A CN111861116 A CN 111861116A CN 202010549085 A CN202010549085 A CN 202010549085A CN 111861116 A CN111861116 A CN 111861116A
Authority
CN
China
Prior art keywords
order
orders
queue
time
taxi
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
CN202010549085.4A
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.)
Guangdong University of Technology
Original Assignee
Guangdong University of Technology
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 Guangdong University of Technology filed Critical Guangdong University of Technology
Priority to CN202010549085.4A priority Critical patent/CN111861116A/en
Publication of CN111861116A publication Critical patent/CN111861116A/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
    • 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/06316—Sequencing of tasks or work
    • 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
    • G06Q30/00—Commerce
    • G06Q30/06—Buying, selling or leasing transactions
    • G06Q30/0601—Electronic shopping [e-shopping]
    • G06Q30/0633—Lists, e.g. purchase orders, compilation or processing
    • G06Q30/0635—Processing of requisition or of purchase orders
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/40—Business processes related to the transportation industry

Landscapes

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

Abstract

The invention discloses a passenger queuing method of an automatic driving taxi system, which uses two queuing queues to search orders, perfectly matches with an automatic driving taxi fleet and also considers the co-taking mode of taxis. The queuing strategy considers the repeated retrieval process of the failed orders, and meets the practical requirement according to the principle that the passengers waiting for the longest time preferentially arrange the vehicles. Aiming at the characteristics of automatically driving a taxi fleet, the queuing strategy repeatedly matches the orders which are failed to be matched at intervals of 60 seconds, and the orders within the latest 60 seconds are filtered by sequencing the orders, so that the success rate of taxi taking of passengers is ensured, and meanwhile, the calculation cost is greatly reduced.

Description

Passenger queuing method of automatic taxi driving system
Technical Field
The invention relates to the technical field of computers and transportation, in particular to a passenger queuing method of an automatic taxi driving system.
Background
The high-speed development of big data, Internet of vehicles and artificial intelligence technology provides more ideas for the construction of the traffic field, and new vehicles, service modes and management means bring more innovative development opportunities for future traffic systems. Automotive intelligence is becoming widely used, with autopilot technology being the most typical. In the visible future, autodrive taxis will also be in place. The automatic taxi driving fleet has the characteristics of intelligence, high efficiency, high-quality user experience and the like, and is seen by most scholars and passengers. Undoubtedly, in the operation mode of automatically driving a taxi, the process of 'driver decision' is completely cancelled, and a very complete dispatching system is needed in the management background of the operation mode, so that the whole process from order collection to vehicle dispatching is completed.
There are many studies analyzing a dispatching system for automatically driving a taxi. The travel benefit of the automatic driving taxi is researched in a simulation mode in a thesis of Dynamic edge-sharing and street sizing for a system of shared automatic vehicles in Austin, Texas, and the huge potential of the automatic driving applied to the taxi is proved; in the article Addressing the minimum fleet project in-demand urban approach to minimum fleet is discussed by autonomous taxi fleet simulation. They have avoided a summary of the framework of an automated taxi system. The family model-based theory Framework of automatic driving path planning is proposed in The article "Framework for automatic taxi operation", vehicles are pre-distributed in required places through design, complexity of automatic driving fleet scheduling is simplified, however, how a failed order is re-submitted is not considered in The Framework, and if an order which fails to be matched is directly determined as a failed order, a passenger driving success rate can be greatly reduced. If the re-matching is not continued, the re-submission of the failed order will increase a large amount of computational cost, which will slow down the program running significantly in computer simulation, and in reality, will burden the fleet dispatch backend server. Because the automatic driving vehicle has the characteristics of networking and track prediction, the running condition of the vehicle in a short time is usually predicted when the driver and the passenger are matched, and the probability of matching the passenger with a proper vehicle in a short time is low. Through the experimental simulation of the user, the states of all simulation objects are updated every 1 second, and the matching is repeatedly tried for the orders which are failed to be matched every second, the probability of successful matching in 60s is less than 3%, but the calculation cost is increased by about 50 times compared with the calculation cost which is increased by only one time of retrieval in 60 s. The paper "simulation of a specially structured queuing system consisting of taxis and passengers" provides a queuing method, but it is not suitable for automatically driving a taxi fleet, nor does it give full play to the advantages of automatically driving vehicles. Thus, an automated taxi fleet system requires a suitable method for passengers to wait and queue.
Disclosure of Invention
The invention aims to overcome the defects of the prior art and provide a passenger queuing method of an automatic driving taxi system, which can improve the taxi taking success rate of passengers and reduce the calculation cost.
In order to achieve the purpose, the technical scheme provided by the invention is as follows:
a passenger queuing method for an automated taxi system, comprising the steps of:
s1, collecting taxi taking demands of passengers and collecting information of the automatic driving vehicles uninterruptedly through an automatic driving taxi dispatching system; the taxi taking requirements of the passengers comprise boarding and alighting places, maximum waiting time, riding willingness and order initiating time; the automatic driving vehicle information comprises vehicle positions, vacant seats, whether the vehicle is empty or not and a vehicle running schedule, so that the system can be matched for passengers;
s2, the automatic taxi-driving scheduling system puts all orders formed in a time window into an order queue for queuing, and people and vehicles are matched according to the queuing sequence of time priority; matching successful orders, and dispatching corresponding taxis to receive passengers in the past; if the matching fails, the failed order needs to be collected and submitted again to arrange the vehicle for the waiting passenger.
Further, in step S2, if the matching fails, the following policy is waited for execution:
1) after the people-vehicle matching fails, placing the order into an order waiting queue, and resubmitting the order after waiting for a fixed time of 60 s;
2) after resubmission, the resubmitted order and the newly created order within the time window enter an order search queue simultaneously, and the system retrieves vehicles for the order in chronological order.
Further, the order search queue of step 2) is composed of orders in the failed order waiting queue and orders collected in the corresponding time window;
the orders in the order searching queue are arranged according to the time creating sequence, and one or a batch of orders are taken out from the queue in sequence for people and vehicles matching until all the orders are taken out; and when each time window starts, the order searching queue is empty, the orders needing to be scheduled are collected and put into the queue to complete scheduling, and when the time window ends, the order searching queue is also empty.
Further, the failed orders in the order waiting queue and the orders collected in the corresponding time window are inserted into the order searching queue according to the following algorithm:
suppose at TnowAt that time, there are multiple orders O in the failed order wait queue 1、O2、O3、O4、O5、…、OiWhile waiting, the creation time satisfies the relation (1)
T1<T2<T3<T4<T5<…<Ti； (1)
TnowWhen the system respectively takes out the failure orders in the waiting queue, judging whether the failure orders satisfy the formula (2) and the formula (3) at the same time, if so, namely, the failure orders need to be retrieved again, preparing to send the failure orders to an order searching queue, continuously judging the next failure order, and when the first failure order which does not satisfy the formula (2) appears, stopping the judgment;
Tnow-T＞60 (2)
(Tnow-T)％60＝0 (3)
in the formula, T is the creation time corresponding to the order;
then taking out the failed orders meeting the formulas (2) and (3) simultaneously, sending the failed orders to an order search queue simultaneously with the new orders collected in the time window, and arranging the orders with earlier creation time at the front end of the queue;
and finally, inserting all the collected orders in the corresponding time window into the tail of the order searching queue according to time.
Compared with the prior art, the principle and the advantages of the scheme are as follows:
1. the method is suitable for automatically driving the taxi fleet and is also suitable for a taxi sharing mode.
2. The algorithm is simple, the characteristics of the automatic driving taxi fleet are fully combined, the repeated retrieval is carried out at intervals, and the further calculation cost is low.
3. The method can be directly applied to a taxi computer simulation system, is more realistic and can improve the matching success rate of people and vehicles compared with a simulation system which does not consider resubmission; compared with a system for continuously and repeatedly searching, the method can greatly improve the operation efficiency.
4. The compatibility is strong, and the method is suitable for an automatic driving shared taxi system and can also be applied to various taxi simulation systems.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the services required for the embodiments or the technical solutions in the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to these drawings without creative efforts.
Fig. 1 is a schematic diagram of the operation of a passenger queuing method of an automated taxi driving system according to the present invention;
fig. 2 is an example of waiting order enqueuing in the present embodiment.
Detailed Description
The invention will be further illustrated with reference to specific examples:
as shown in fig. 1, the passenger queuing method of the automated taxi driving system according to the embodiment includes the following steps:
s1, collecting taxi taking demands of passengers and collecting information of the automatic driving vehicles uninterruptedly through an automatic driving taxi dispatching system; the taxi taking requirements of the passengers comprise boarding and alighting places, maximum waiting time, riding willingness and order initiating time; the automatic driving vehicle information comprises vehicle positions, vacant seats, whether the vehicle is empty or not and a vehicle running schedule, so that the system can be matched for passengers;
S2, the automatic taxi-driving scheduling system puts all orders formed in a time window into an order queue for queuing, and people and vehicles are matched according to the queuing sequence of time priority; matching successful orders, and dispatching corresponding taxis to receive passengers in the past; if the matching fails, the failed order needs to be collected and submitted again to arrange the vehicle for the waiting passenger.
In step S2, if the matching fails, the following waiting policy is used:
1) after the people-vehicle matching fails, placing the order into an order waiting queue, and resubmitting the order after waiting for a fixed time of 60 s;
2) after resubmission, the resubmitted order and the newly created order within the time window enter an order search queue simultaneously, and the system retrieves vehicles for the order in chronological order.
The order searching queue of the step 2) consists of orders in the failed order waiting queue and orders collected in a corresponding time window;
the orders in the order searching queue are arranged according to the time creating sequence, and one or a batch of orders are taken out from the queue in sequence for people and vehicles matching until all the orders are taken out; and when each time window starts, the order searching queue is empty, the orders needing to be scheduled are collected and put into the queue to complete scheduling, and when the time window ends, the order searching queue is also empty.
As shown in FIG. 2, the failed orders in the order waiting queue and the collected orders in the corresponding time window are inserted into the order search queue according to the following algorithm:
suppose at TnowAt that time, there are 5 orders (O) in the queue for the failed order1、O2、O3、O4、O5) Waiting. Their creation time satisfies the relation (1).
T1＜T2＜T3＜T4＜T5(1)
TnowAt first, the systemFirstly taking out O1It is judged that they satisfy both of the formulas (2) and (3), and O is therefore1Satisfies the condition of re-retrieval, O1Dequeue ready to join the order search queue. The system continues to determine order O2Due to O2Is created with a time T2＝T now30, obviously not satisfying equation (2), and according to relation (1), the following order is inevitably not satisfying equation (2), and the judgment can be immediately stopped.
Tnow-T1>60 (2)
(Tnow-T1)％60＝0 (3)
In the formula, T is the creation time corresponding to the order;
then taking out O1Send to the order search queue simultaneously with the new orders collected within the time window, and O1Is the earliest creation time and therefore at the front of the queue;
and finally, inserting all the collected orders in the corresponding time window into the tail of the order searching queue according to time.
The above-mentioned embodiments are merely preferred embodiments of the present invention, and the scope of the present invention is not limited thereto, so that variations based on the shape and principle of the present invention should be covered within the scope of the present invention.

Claims (4)

1. A passenger queuing method for an automated taxi system, comprising the steps of:
s1, collecting taxi taking demands of passengers and collecting information of the automatic driving vehicles uninterruptedly through an automatic driving taxi dispatching system; the taxi taking requirements of the passengers comprise boarding and alighting places, maximum waiting time, riding willingness and order initiating time; the automatic driving vehicle information comprises vehicle positions, vacant seats, whether the vehicle is empty or not and a vehicle running schedule, so that the system can be matched for passengers;
s2, the automatic taxi-driving scheduling system puts all orders formed in a time window into an order queue for queuing, and people and vehicles are matched according to the queuing sequence of time priority; matching successful orders, and dispatching corresponding taxis to receive passengers in the past; if the matching fails, the failed order needs to be collected and submitted again to arrange the vehicle for the waiting passenger.
2. The passenger queuing method of an automated taxi system of claim 1, wherein in step S2, if the matching fails, the following waiting strategy is implemented:
1) after the people-vehicle matching fails, placing the order into an order waiting queue, and resubmitting the order after waiting for a fixed time of 60 s;
2) After resubmission, the resubmitted order and the newly created order within the time window enter an order search queue simultaneously, and the system retrieves vehicles for the order in chronological order.
3. The passenger queuing method of an automated taxi system according to claim 2, wherein the order search queue of step 2) is composed of the orders in the failed order waiting queue and the corresponding collected orders in the time window;
the orders in the order searching queue are arranged according to the time creating sequence, and one or a batch of orders are taken out from the queue in sequence for people and vehicles matching until all the orders are taken out; and when each time window starts, the order searching queue is empty, the orders needing to be scheduled are collected and put into the queue to complete scheduling, and when the time window ends, the order searching queue is also empty.
4. A passenger queuing method for an automated taxi system as claimed in claim 3 wherein the failed orders in the order waiting queue and the collected orders within the corresponding time window are inserted into the order search queue according to the following algorithm:
suppose at TnowAt that time, there are multiple orders O in the failed order wait queue1、O2、O3、O4、O5、…、OiWhile waiting, the creation time satisfies the relationship Formula (1)
T1<T2<T3<T4<T5<…<Ti； (1)
TnowWhen the system respectively takes out the failure orders in the waiting queue, judging whether the failure orders satisfy the formula (2) and the formula (3) at the same time, if so, namely, the failure orders need to be retrieved again, preparing to send the failure orders to an order searching queue, continuously judging the next failure order, and when the first failure order which does not satisfy the formula (2) appears, stopping the judgment;
Tnow-T＞60 (2)
(Tnow-T)％60＝0 (3)
in the formula, T is the creation time corresponding to the order;
then taking out the failed orders meeting the formulas (2) and (3) simultaneously, sending the failed orders to an order search queue simultaneously with the new orders collected in the time window, and arranging the orders with earlier creation time at the front end of the queue;
and finally, inserting all the collected orders in the corresponding time window into the tail of the order searching queue according to time.
CN202010549085.4A 2020-06-16 2020-06-16 Passenger queuing method of automatic taxi driving system Pending CN111861116A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010549085.4A CN111861116A (en) 2020-06-16 2020-06-16 Passenger queuing method of automatic taxi driving system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010549085.4A CN111861116A (en) 2020-06-16 2020-06-16 Passenger queuing method of automatic taxi driving system

Publications (1)

Publication Number Publication Date
CN111861116A true CN111861116A (en) 2020-10-30

Family

ID=72986694

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010549085.4A Pending CN111861116A (en) 2020-06-16 2020-06-16 Passenger queuing method of automatic taxi driving system

Country Status (1)

Country Link
CN (1) CN111861116A (en)

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20140188668A1 (en) * 2012-12-31 2014-07-03 T-Mobile Usa, Inc. Recovery of E-Commerce Orders
CN104156863A (en) * 2014-08-08 2014-11-19 携程计算机技术（上海）有限公司 OTA website order processing system and method
CN105761482A (en) * 2016-05-10 2016-07-13 北京交通大学 Taxi real-time appointing method and system based on fairness
CN107679822A (en) * 2017-09-04 2018-02-09 金蝶蝶金云计算有限公司 Order status automatic update method, storage medium and computer equipment in ERP system
CN108038767A (en) * 2017-12-26 2018-05-15 广州供电局有限公司 Electric business order asynchronous distribution system and method based on message queue
CN110135925A (en) * 2018-02-08 2019-08-16 北京京东尚科信息技术有限公司 Order processing system, method and apparatus

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20140188668A1 (en) * 2012-12-31 2014-07-03 T-Mobile Usa, Inc. Recovery of E-Commerce Orders
CN104156863A (en) * 2014-08-08 2014-11-19 携程计算机技术（上海）有限公司 OTA website order processing system and method
CN105761482A (en) * 2016-05-10 2016-07-13 北京交通大学 Taxi real-time appointing method and system based on fairness
CN107679822A (en) * 2017-09-04 2018-02-09 金蝶蝶金云计算有限公司 Order status automatic update method, storage medium and computer equipment in ERP system
CN108038767A (en) * 2017-12-26 2018-05-15 广州供电局有限公司 Electric business order asynchronous distribution system and method based on message queue
CN110135925A (en) * 2018-02-08 2019-08-16 北京京东尚科信息技术有限公司 Order processing system, method and apparatus

Similar Documents

Publication Publication Date Title
CN109635971A (en) A kind of people&#39;s goods is shared to use vehicle method of servicing
CN110598908B (en) Path planning method based on multiple tasks and multiple vehicles
CN111868654A (en) Method and apparatus for route planning
CN111882107B (en) Driver and passenger matching method based on automatic driving shared taxi system
JP6964617B2 (en) Schedule management systems, mobiles, programs and methods
WO2014048217A1 (en) Public traffic information inquiry method, collection method and public traffic information system
CN113705997A (en) Automatic taxi double-system order dispatching method and application
CN116013059A (en) Scheduling method and device for operating vehicle, electronic equipment and storage medium
JP7014750B2 (en) Information processing equipment, mobiles, programs and methods
CN111445091B (en) Intelligent decision-making method for taxi driver in passenger transport center
WO2023241388A1 (en) Model training method and apparatus, energy replenishment intention recognition method and apparatus, device, and medium
CN111861116A (en) Passenger queuing method of automatic taxi driving system
CN110347937B (en) Intelligent passenger searching method for taxi
CN112541675A (en) Scheduling control method, device and system of vehicle system
CN112465384A (en) Transportation capacity scheduling method and device, computer equipment and computer readable storage medium
CN114897428A (en) Order processing method and device, electronic equipment and storage medium
CN112669603B (en) Urban traffic cooperation method and device based on big data
CN114881692A (en) Network appointment scheduling method and device, electronic equipment and storage medium
CN113222248B (en) Automatic taxi-driving charging pile selection method
CN112465178B (en) Vehicle planning method and storage medium
CN107578120A (en) It is a kind of that utility car share-car dispatching method is done based on electronic map
CN113393003A (en) Order processing method, device, server and storage medium
WO2020202412A1 (en) Information processing device, mobile body, program, and method
Angelelli et al. A real-time vehicle routing model for a courier service problem
CN116340007B (en) Resource collaborative optimization intelligent unmanned cluster task allocation method and system

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