CN111325436A - Network appointment vehicle co-operation passenger matching method and system, storage medium and server - Google Patents

Network appointment vehicle co-operation passenger matching method and system, storage medium and server Download PDF

Info

Publication number
CN111325436A
CN111325436A CN201811544536.4A CN201811544536A CN111325436A CN 111325436 A CN111325436 A CN 111325436A CN 201811544536 A CN201811544536 A CN 201811544536A CN 111325436 A CN111325436 A CN 111325436A
Authority
CN
China
Prior art keywords
passenger
information
appointment
matching
server
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
CN201811544536.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.)
Shanghai Pateo Network Technology Service Co Ltd
Original Assignee
Shanghai Pateo Network Technology Service 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 Shanghai Pateo Network Technology Service Co Ltd filed Critical Shanghai Pateo Network Technology Service Co Ltd
Priority to CN201811544536.4A priority Critical patent/CN111325436A/en
Publication of CN111325436A publication Critical patent/CN111325436A/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
    • 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/02—Reservations, e.g. for tickets, services or events
    • G06Q10/025—Coordination of plural reservations, e.g. plural trip segments, transportation combined with accommodation
    • 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)
  • Tourism & Hospitality (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)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Development Economics (AREA)
  • Game Theory and Decision Science (AREA)
  • Educational Administration (AREA)
  • Health & Medical Sciences (AREA)
  • General Health & Medical Sciences (AREA)
  • Primary Health Care (AREA)
  • Traffic Control Systems (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The invention provides a method and a system for matching passengers in the same row of online taxi appointment, a storage medium and a server, comprising the following steps: receiving co-traveling appointment information of a first passenger, wherein the co-traveling appointment information comprises personal characteristic information and a traveling path of the first passenger; searching a second passenger so that the personal characteristic information and the same-row path of the second passenger are respectively matched with the personal characteristic information and the travel path of the first passenger; and constructing the co-operation riding information of the first passenger and the second passenger based on one-network car appointment, and sending the co-operation riding information to the first passenger and the second passenger. The online appointment vehicle co-traveling passenger matching method and system, the storage medium and the server perform co-traveling passenger matching based on personal characteristics of passengers, so that co-riding experience of users is improved.

Description

Network appointment vehicle co-operation passenger matching method and system, storage medium and server
Technical Field
The invention relates to the technical field of network appointment vehicles, in particular to a method and a system for matching passengers in the same row of network appointment vehicles, a storage medium and a server.
Background
The network taxi appointment is short for network taxi appointment. In the aspect of constructing a diversified service system, taxis are divided into touring taxis and network reservation taxis. The user can reserve the vehicle for travel at specific time and specific place through the network booking.
In the prior art, the appointment of the same network car is carried out by only one passenger at the same time. In some situations, passengers may need to ride one vehicle for energy and cost saving. When two or more passengers reserve a vehicle at the same time, random matching is often performed through a travel route, resulting in the following problems:
(1) passengers in the same row have different backgrounds and lack common language, so that the experience of the passengers is poor;
(2) the probability of the co-multiplication with the familiar people is low, and the interest of the co-multiplication is reduced.
Disclosure of Invention
In view of the above-mentioned shortcomings of the prior art, an object of the present invention is to provide a method and a system for matching passengers in a same row of a network appointment car, a storage medium and a server, which are used for matching the passengers in the same row based on personal characteristics of the passengers, so as to improve the experience of the users in the same row.
To achieve the above and other related objects, the present invention provides a method for matching passengers in a same line of a network appointment car, comprising the steps of: receiving co-traveling appointment information of a first passenger, wherein the co-traveling appointment information comprises personal characteristic information and a traveling path of the first passenger; searching a second passenger so that the personal characteristic information and the same-row path of the second passenger are respectively matched with the personal characteristic information and the travel path of the first passenger; and constructing the co-operation riding information of the first passenger and the second passenger based on one-network car appointment, and sending the co-operation riding information to the first passenger and the second passenger.
In an embodiment of the present invention, the personal characteristic information includes one or more combinations of occupation, hobby, work unit, and age.
In an embodiment of the present invention, the method further comprises sending a fee payment algorithm to the first passenger, and allocating the payment fee of the first passenger and the second passenger according to the fee feedback information of the first passenger.
Correspondingly, the invention provides a network appointment vehicle co-traveling passenger matching system which comprises a receiving module, a matching module and a constructing module;
the receiving module is used for receiving the vehicle-sharing appointment information of a first passenger, and the vehicle-sharing appointment information comprises personal characteristic information and a travel path of the first passenger;
the matching module is used for searching a second passenger so that the personal characteristic information and the same-row path of the second passenger are respectively matched with the personal characteristic information and the traveling path of the first passenger;
the construction module is used for constructing the co-operation riding information of the first passenger and the second passenger based on one-network car appointment and sending the co-operation riding information to the first passenger and the second passenger.
In an embodiment of the present invention, the personal characteristic information includes one or more combinations of occupation, hobby, work unit, and age.
In an embodiment of the present invention, the system further includes a fee distribution module, configured to send a fee payment algorithm to the first passenger, and distribute the payment fee of the first passenger and the second passenger according to the fee feedback information of the first passenger.
The present invention provides a storage medium having stored thereon a computer program which, when executed by a processor, implements the above-described network appointment vehicle co-traveling passenger matching method.
The present invention provides a server, comprising: a processor and a memory;
the memory is used for storing a computer program;
the processor is used for executing the computer program stored in the memory so as to enable the server to execute the online appointment vehicle co-traveling passenger matching method.
Finally, the invention provides a network appointment vehicle-sharing passenger matching system, which comprises the server and the terminal;
the terminal is used for sending the co-operation appointment information to the server and receiving the co-operation riding information sent by the server.
In an embodiment of the present invention, the terminal includes a computer, a vehicle-mounted terminal, a smart phone, and a tablet computer.
As described above, the method and system for matching passengers in the same row of online taxi appointment, the storage medium and the server of the invention have the following advantages:
(1) matching passengers in the same row based on personal characteristics of the passengers so as to improve the passenger experience of the user;
(2) the social demand of the passengers is met while the riding demand of the passengers is met;
(3) the co-operation riding rate of the network car booking is improved, the energy consumption is saved, and the benefit of the network car booking is improved;
(4) the intelligent degree is high, and user manual operation is not needed, so that the user experience is greatly improved.
Drawings
FIG. 1 is a flow chart illustrating a method for matching passengers in a same row of a networked appointment vehicle according to an embodiment of the present invention;
FIG. 2 is a schematic diagram of an embodiment of the co-current passenger matching system of the present invention;
FIG. 3 is a schematic diagram of a server according to an embodiment of the present invention;
fig. 4 is a schematic structural diagram of a co-current passenger matching system for a network appointment vehicle according to another embodiment of the invention.
Description of the element reference numerals
21 receiving modules 21, 22 and 23
22 matching module
23 building block
31 processor
32 memory
41 Server
42 terminal
Detailed Description
The embodiments of the present invention are described below with reference to specific embodiments, and other advantages and effects of the present invention will be easily understood by those skilled in the art from the disclosure of the present specification. The invention is capable of other and different embodiments and of being practiced or of being carried out in various ways, and its several details are capable of modification in various respects, all without departing from the spirit and scope of the present invention. It is to be noted that the features in the following embodiments and examples may be combined with each other without conflict.
It should be noted that the drawings provided in the following embodiments are only for illustrating the basic idea of the present invention, and the components related to the present invention are only shown in the drawings rather than drawn according to the number, shape and size of the components in actual implementation, and the type, quantity and proportion of the components in actual implementation may be changed freely, and the layout of the components may be more complicated.
The network appointment vehicle co-traveling passenger matching method and system, the storage medium and the server carry out co-traveling passenger matching based on the personal characteristics of the passengers, so that people with the same interest, hobbies, occupation or familiarity can take the vehicle in the same row, the interest of the co-traveling vehicle is increased, and the co-traveling experience of users is improved.
As shown in fig. 1, in one embodiment, the method for matching passengers in a same row of a network appointment vehicle of the present invention comprises the following steps:
and step S1, receiving the co-operation car-booking information of the first passenger, wherein the co-operation car-booking information comprises the personal characteristic information and the travel route of the first passenger.
Specifically, when a passenger needs to take a car in the same trip, the passenger sends car appointment information to the server through terminal equipment such as a computer, a smart phone, a tablet personal computer and a vehicle-mounted terminal. And the server receives the communication car booking information in a wireless mode.
Wherein the co-traveling appointment information includes personal characteristic information and a travel path of the first passenger. The personal characteristic information includes but is not limited to one or more combinations of occupation, hobbies, work units and age. The personal characteristic information can roughly determine the background of the passenger, and information support is provided for subsequent peer matching. The travel path includes a departure place and a destination. Preferably, the travel path further includes at least one navigation path between the departure place and the destination.
And step S2, searching for a second passenger, so that the personal characteristic information and the co-traveling path of the second passenger are respectively matched with the personal characteristic information and the traveling path of the first passenger.
Specifically, the server searches for a matched second passenger according to the personal characteristic information and the co-traveling path of the first passenger, so that the personal characteristic information and the co-traveling path of the first passenger and the second passenger are respectively matched.
For example, if the occupation of the first passenger is software engineer and the occupation of the second passenger is IT research and development, the personal characteristic information of the first passenger and the second passenger are matched. As another example, if the first passenger works at company XX, the second passenger works at company YY, and the company XX and the company YY are business association companies, then the first passenger and the second passenger have a potential association, and it is determined that the personal characteristics of the first passenger and the second passenger match.
Meanwhile, when the travel path of the first passenger is completely matched with or partially matched with the travel path of the second passenger, it is indicated that the travel path of the first passenger is matched with the travel path of the second passenger. For example, the first passenger removes a crop from the people's plaza and the second passenger removes a crop from the yokoji, and a determination is made that the travel path portion of the first passenger and the second passenger match, and travel may be performed at the yokoji to the crop section. For another example, the first passenger may remove a crop from the people's square and the second passenger may also remove a crop from the people's square, and it is determined that the travel paths of the first passenger and the second passenger completely match.
And S3, constructing the co-operation riding information of the first passenger and the second passenger based on one-network car appointment, and sending the co-operation riding information to the first passenger and the second passenger.
Specifically, when the personal characteristics and the travel paths of the first passenger and the second passenger both match, the server constructs a co-riding association of the first passenger and the second passenger, that is, enables the first passenger and the second passenger to contract a co-riding ride based on a certain network, and transmits the co-riding ride information to the first passenger and the second passenger. The co-traveling taking information at least comprises network appointment information, first passenger information, second passenger information, a first passenger getting-on place, a second passenger getting-on place, a first passenger getting-off place and a second passenger getting-off place.
It should be noted that, when the vehicle appointment information further includes a travel time, the travel times of the first passenger and the second passenger need to be matched. And only when the travel time is matched, performing the personal feature matching and the travel path matching. If the travel time of the first passenger and the travel time of the second passenger are different from each other within a preset threshold value, sending time coordination confirmation information to the first passenger; if the first passenger agrees to coordinate time, constructing the co-operation riding information of the first passenger and the second passenger based on one-network car appointment; and if the first passenger does not agree with the coordination time, the matched passenger in the same row is searched again.
In an embodiment of the present invention, the method for matching network-reduced vehicle-fellow passengers further includes sending a fee payment algorithm to the first passenger, and distributing the payment fees of the first passenger and the second passenger according to the fee feedback information of the first passenger. In particular, the server also provides a fare payment algorithm for selection by the passenger. For example, to encourage fellow rides, the server sends a payment algorithm to the first passenger, and if the first passenger pays 50% of the second passenger, the payment algorithm is distributed if the first passenger agrees; if the first passenger does not agree, the first passenger is charged according to a default algorithm, such as a mileage charging method.
As shown in fig. 2, in one embodiment, the system for matching passengers in the same row of networked appointment vehicles of the present invention includes a receiving module 21, a matching module 22 and a constructing module 23.
The receiving module 21 is configured to receive vehicle-sharing information of a first passenger, where the vehicle-sharing information includes personal feature information and a travel route of the first passenger.
Specifically, when a passenger needs to take a car in the same trip, the passenger sends car appointment information to the server through terminal equipment such as a computer, a smart phone, a tablet personal computer and a vehicle-mounted terminal. And the server receives the communication car booking information in a wireless mode.
Wherein the co-traveling appointment information includes personal characteristic information and a travel path of the first passenger. The personal characteristic information includes but is not limited to one or more combinations of occupation, hobbies, work units and age. The personal characteristic information can roughly determine the background of the passenger, and information support is provided for subsequent peer matching. The travel path includes a departure place and a destination. Preferably, the travel path further includes at least one navigation path between the departure place and the destination.
The matching module 22 is connected to the receiving module 21 and is configured to search for a second passenger so that the personal characteristic information and the co-traveling path of the second passenger are matched with the personal characteristic information and the traveling path of the first passenger, respectively.
Specifically, the server searches for a matched second passenger according to the personal characteristic information and the co-traveling path of the first passenger, so that the personal characteristic information and the co-traveling path of the first passenger and the second passenger are respectively matched.
For example, if the occupation of the first passenger is software engineer and the occupation of the second passenger is IT research and development, the personal characteristic information of the first passenger and the second passenger are matched. As another example, if the first passenger works at company XX, the second passenger works at company YY, and the company XX and the company YY are business association companies, then the first passenger and the second passenger have a potential association, and it is determined that the personal characteristics of the first passenger and the second passenger match.
Meanwhile, when the travel path of the first passenger is completely matched with or partially matched with the travel path of the second passenger, it is indicated that the travel path of the first passenger is matched with the travel path of the second passenger. For example, the first passenger removes a crop from the people's plaza and the second passenger removes a crop from the yokoji, and a determination is made that the travel path portion of the first passenger and the second passenger match, and travel may be performed at the yokoji to the crop section. For another example, the first passenger may remove a crop from the people's square and the second passenger may also remove a crop from the people's square, and it is determined that the travel paths of the first passenger and the second passenger completely match.
The construction module 23 is connected to the matching module 22, and is configured to construct the co-occurrence riding information of the first passenger and the second passenger based on a network appointment, and send the co-occurrence riding information to the first passenger and the second passenger.
Specifically, when the personal characteristics and the travel paths of the first passenger and the second passenger both match, the server constructs a co-riding association of the first passenger and the second passenger, that is, enables the first passenger and the second passenger to contract a co-riding ride based on a certain network, and transmits the co-riding ride information to the first passenger and the second passenger. The co-traveling taking information at least comprises network appointment information, first passenger information, second passenger information, a first passenger getting-on place, a second passenger getting-on place, a first passenger getting-off place and a second passenger getting-off place.
It should be noted that, when the vehicle appointment information further includes a travel time, the travel times of the first passenger and the second passenger need to be matched. And only when the travel time is matched, performing the personal feature matching and the travel path matching. If the travel time of the first passenger and the travel time of the second passenger are different from each other within a preset threshold value, sending time coordination confirmation information to the first passenger; if the first passenger agrees to coordinate time, constructing the co-operation riding information of the first passenger and the second passenger based on one-network car appointment; and if the first passenger does not agree with the coordination time, the matched passenger in the same row is searched again.
In an embodiment of the present invention, the online appointment vehicle fellow passenger matching system further includes a fee distribution module, configured to send a fee payment algorithm to the first passenger, and distribute the payment fee of the first passenger and the second passenger according to the fee feedback information of the first passenger. In particular, the server also provides a fare payment algorithm for selection by the passenger. For example, to encourage fellow rides, the server sends a payment algorithm to the first passenger, and if the first passenger pays 50% of the second passenger, the payment algorithm is distributed if the first passenger agrees; if the first passenger does not agree, the first passenger is charged according to a default algorithm, such as a mileage charging method.
It should be noted that the division of the modules of the above apparatus is only a logical division, and the actual implementation may be wholly or partially integrated into one physical entity, or may be physically separated. And the modules can be realized in a form that all software is called by the processing element, or in a form that all the modules are realized in a form that all the modules are called by the processing element, or in a form that part of the modules are called by the hardware. For example: the x module can be a separately established processing element, and can also be integrated in a certain chip of the device. In addition, the x-module may be stored in the memory of the apparatus in the form of program codes, and may be called by a certain processing element of the apparatus to execute the functions of the x-module. Other modules are implemented similarly. All or part of the modules can be integrated together or can be independently realized. The processing element described herein may be an integrated circuit having signal processing capabilities. In implementation, each step of the above method or each module above may be implemented by an integrated logic circuit of hardware in a processor element or an instruction in the form of software. These above modules may be one or more integrated circuits configured to implement the above methods, such as: one or more Application Specific Integrated Circuits (ASICs), one or more microprocessors (DSPs), one or more Field Programmable Gate Arrays (FPGAs), and the like. When a module is implemented in the form of a processing element scheduler code, the processing element may be a general-purpose processor, such as a Central Processing Unit (CPU) or other processor capable of calling program code. These modules may be integrated together and implemented in the form of a System-on-a-chip (SOC).
The storage medium of the present invention stores thereon a computer program that realizes the above-described network appointment vehicle co-traveling passenger matching method when executed by a processor. The storage medium includes: various media that can store program codes, such as ROM, RAM, magnetic disk, U-disk, memory card, or optical disk.
As shown in fig. 3, in an embodiment, the server of the present invention includes: a processor 31 and a memory 32.
The memory 32 is used for storing computer programs.
The memory 32 includes: various media that can store program codes, such as ROM, RAM, magnetic disk, U-disk, memory card, or optical disk.
The processor 31 is connected to the memory 32, and is configured to execute the computer program stored in the memory 32, so that the server executes the above-mentioned method for matching passengers in the same vehicle as the contracted vehicle.
Preferably, the Processor 31 may be a general-purpose Processor, including a Central Processing Unit (CPU), a Network Processor (NP), and the like; the integrated Circuit may also be a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA) or other Programmable logic device, discrete Gate or transistor logic device, or discrete hardware components.
As shown in fig. 4, in one embodiment, the system for matching passengers in a same row of a networked appointment vehicle of the present invention includes the server 41 and the terminal 42.
The terminal 42 is in communication connection with the server 41, and is configured to send the vehicle-sharing appointment information to the server 41 and receive the vehicle-sharing information sent by the server 41.
In an embodiment of the present invention, the terminal 41 includes a vehicle-mounted terminal, a smart phone, and a tablet computer.
In conclusion, the online appointment vehicle co-traveling passenger matching method and system, the storage medium and the server perform co-traveling passenger matching based on personal characteristics of passengers, so that co-riding experience of users is improved; the social demand of the passengers is met while the riding demand of the passengers is met; the co-operation riding rate of the network car booking is improved, the energy consumption is saved, and the benefit of the network car booking is improved; the intelligent degree is high, and user manual operation is not needed, so that the user experience is greatly improved. Therefore, the invention effectively overcomes various defects in the prior art and has high industrial utilization value.
The foregoing embodiments are merely illustrative of the principles and utilities of the present invention and are not intended to limit the invention. Any person skilled in the art can modify or change the above-mentioned embodiments without departing from the spirit and scope of the present invention. Accordingly, it is intended that all equivalent modifications or changes which can be made by those skilled in the art without departing from the spirit and technical spirit of the present invention be covered by the claims of the present invention.

Claims (10)

1. A method for matching passengers in a same line with a network appointment car is characterized by comprising the following steps:
receiving co-traveling appointment information of a first passenger, wherein the co-traveling appointment information comprises personal characteristic information and a traveling path of the first passenger;
searching a second passenger so that the personal characteristic information and the same-row path of the second passenger are respectively matched with the personal characteristic information and the travel path of the first passenger;
and constructing the co-operation riding information of the first passenger and the second passenger based on one-network car appointment, and sending the co-operation riding information to the first passenger and the second passenger.
2. The networked car fellow passenger matching method of claim 1, wherein the personal characteristic information comprises one or more combinations of occupation, hobbies, work units, and age.
3. The networked car contract peer passenger matching method according to claim 1, further comprising sending a fare payment algorithm to the first passenger and allocating the payment fees of the first passenger and the second passenger according to the fare feedback information of the first passenger.
4. A network appointment vehicle same-row passenger matching system is characterized by comprising a receiving module, a matching module and a building module;
the receiving module is used for receiving the vehicle-sharing appointment information of a first passenger, and the vehicle-sharing appointment information comprises personal characteristic information and a travel path of the first passenger;
the matching module is used for searching a second passenger so that the personal characteristic information and the same-row path of the second passenger are respectively matched with the personal characteristic information and the traveling path of the first passenger;
the construction module is used for constructing the co-operation riding information of the first passenger and the second passenger based on one-network car appointment and sending the co-operation riding information to the first passenger and the second passenger.
5. The networked car fellow passenger matching system of claim 4, wherein the personal characteristic information includes one or more combinations of occupation, hobbies, work units, and age.
6. The networked car contract peer passenger matching system according to claim 4, further comprising a fare distribution module for sending a fare payment algorithm to the first passenger and distributing the payment fees of the first passenger and the second passenger according to the fare feedback information of the first passenger.
7. A storage medium having stored thereon a computer program, wherein the computer program, when executed by a processor, implements the network contract vehicle co-occurrence passenger matching method of any one of claims 1 to 3.
8. A server, comprising: a processor and a memory;
the memory is used for storing a computer program;
the processor is configured to execute the memory-stored computer program to cause the server to perform the network appointment vehicle peer passenger matching method of any one of claims 1-3.
9. A network appointment vehicle co-traveling passenger matching system, characterized by comprising the server and the terminal of claim 8;
the terminal is used for sending the co-operation appointment information to the server and receiving the co-operation riding information sent by the server.
10. The networked car appointment co-row passenger matching system according to claim 9, wherein the terminals comprise computers, vehicle-mounted terminals, smart phones and tablet computers.
CN201811544536.4A 2018-12-17 2018-12-17 Network appointment vehicle co-operation passenger matching method and system, storage medium and server Pending CN111325436A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201811544536.4A CN111325436A (en) 2018-12-17 2018-12-17 Network appointment vehicle co-operation passenger matching method and system, storage medium and server

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201811544536.4A CN111325436A (en) 2018-12-17 2018-12-17 Network appointment vehicle co-operation passenger matching method and system, storage medium and server

Publications (1)

Publication Number Publication Date
CN111325436A true CN111325436A (en) 2020-06-23

Family

ID=71172324

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201811544536.4A Pending CN111325436A (en) 2018-12-17 2018-12-17 Network appointment vehicle co-operation passenger matching method and system, storage medium and server

Country Status (1)

Country Link
CN (1) CN111325436A (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113420990A (en) * 2021-06-25 2021-09-21 贵州电网有限责任公司 Trip system and method based on employee post appointment
CN113420899A (en) * 2021-06-25 2021-09-21 贵州电网有限责任公司 Automatic matching-based car booking and traveling system and method
WO2024001151A1 (en) * 2022-06-30 2024-01-04 东南大学 Passenger-vehicle matching method for online ride-hailing vehicle shared travel

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103489309A (en) * 2013-08-20 2014-01-01 罗莉莎 Method and system for pooling taxi, sharing private car and hitchhiking
CN104616105A (en) * 2015-01-30 2015-05-13 罗莉莎 Method for enhancing safety of car pooling
CN106295913A (en) * 2016-08-31 2017-01-04 广州地理研究所 The matching system of a kind of rideshare about car and matching process thereof and device
CN107491825A (en) * 2016-06-13 2017-12-19 滴滴（中国）科技有限公司 A kind of about car processing method and system
CN108460966A (en) * 2017-02-21 2018-08-28 北京百度网讯科技有限公司 Method, apparatus, equipment and the computer storage media of vehicle scheduling
CN108648043A (en) * 2018-04-25 2018-10-12 京东方科技集团股份有限公司 Network about vehicle method and system

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103489309A (en) * 2013-08-20 2014-01-01 罗莉莎 Method and system for pooling taxi, sharing private car and hitchhiking
CN104616105A (en) * 2015-01-30 2015-05-13 罗莉莎 Method for enhancing safety of car pooling
CN107491825A (en) * 2016-06-13 2017-12-19 滴滴（中国）科技有限公司 A kind of about car processing method and system
CN106295913A (en) * 2016-08-31 2017-01-04 广州地理研究所 The matching system of a kind of rideshare about car and matching process thereof and device
CN108460966A (en) * 2017-02-21 2018-08-28 北京百度网讯科技有限公司 Method, apparatus, equipment and the computer storage media of vehicle scheduling
CN108648043A (en) * 2018-04-25 2018-10-12 京东方科技集团股份有限公司 Network about vehicle method and system

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113420990A (en) * 2021-06-25 2021-09-21 贵州电网有限责任公司 Trip system and method based on employee post appointment
CN113420899A (en) * 2021-06-25 2021-09-21 贵州电网有限责任公司 Automatic matching-based car booking and traveling system and method
WO2024001151A1 (en) * 2022-06-30 2024-01-04 东南大学 Passenger-vehicle matching method for online ride-hailing vehicle shared travel

Similar Documents

Publication Publication Date Title
CN111366160B (en) Path planning method, path planning device and terminal equipment
JP6942762B2 (en) How and system to charge for transportation services
WO2017088828A1 (en) Systems and methods for allocating sharable orders
WO2017028821A1 (en) Method and system for predicting current order information on the basis of historical order
CN103531025B (en) A kind of share-car method utilizing line sectionalizing method to carry out match information
CN107919013B (en) Get-on point processing method and server
CN109376311A (en) Suitable for the multiple matched system of driver-motroist, method and apparatus for multiplying model altogether
CN107101643B (en) A kind of share-car matching process
JP2019532372A (en) System and method for determining a driver's safety score
CN110741225B (en) System and method for determining target site
CN107767322B (en) Carpooling method and device
CN111325436A (en) Network appointment vehicle co-operation passenger matching method and system, storage medium and server
US20200104889A1 (en) Systems and methods for price estimation using machine learning techniques
CN111784018A (en) Resource scheduling method and device, electronic equipment and storage medium
CN108399460A (en) Network about vehicle Order splitting processing method and server
CN111489214B (en) Order allocation method, condition setting method, device and electronic equipment
Nguyen Fair cost sharing auction mechanisms in last mile ridesharing
JP2002024659A (en) Taxi dispatch reserving system
CN113642761A (en) Robotaxi automatic driving shared network car booking resource allocation method
CN110826943B (en) Method and related equipment for judging whether bus allocation is needed or not and determining bus allocation number
CN111260423B (en) Order allocation method, order allocation device, electronic equipment and computer readable storage medium
CN107437208A (en) Order processing method and server
CN111833119A (en) Order allocation method and device, electronic equipment and storage medium
CN111222900A (en) Information pushing method and device, electronic equipment and computer storage medium
CN112036774B (en) Service policy evaluation method, device, equipment and storage medium

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
WD01 Invention patent application deemed withdrawn after publication
WD01 Invention patent application deemed withdrawn after publication

Application publication date: 20200623