WO2019056874A1 - 拼车路线的提供方法、客户端、服务器及拼车系统 - Google Patents

拼车路线的提供方法、客户端、服务器及拼车系统 Download PDF

Info

Publication number
WO2019056874A1
WO2019056874A1 PCT/CN2018/098641 CN2018098641W WO2019056874A1 WO 2019056874 A1 WO2019056874 A1 WO 2019056874A1 CN 2018098641 W CN2018098641 W CN 2018098641W WO 2019056874 A1 WO2019056874 A1 WO 2019056874A1
Authority
WO
WIPO (PCT)
Prior art keywords
candidate
carpool
carpooling
driving
travel
Prior art date
Application number
PCT/CN2018/098641
Other languages
English (en)
French (fr)
Inventor
夏一平
尹大飞
杨毓杰
朱家辉
Original Assignee
北京摩拜科技有限公司
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 北京摩拜科技有限公司 filed Critical 北京摩拜科技有限公司
Publication of WO2019056874A1 publication Critical patent/WO2019056874A1/zh

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/50—Network services
    • H04L67/52—Network services specially adapted for the location of the user terminal
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/40—Business processes related to the transportation industry
    • G—PHYSICS
    • G07—CHECKING-DEVICES
    • G07F—COIN-FREED OR LIKE APPARATUS
    • G07F17/00—Coin-freed apparatus for hiring articles; Coin-freed facilities or services
    • G07F17/0042—Coin-freed apparatus for hiring articles; Coin-freed facilities or services for hiring of objects
    • G07F17/0057—Coin-freed apparatus for hiring articles; Coin-freed facilities or services for hiring of objects for the hiring or rent of vehicles, e.g. cars, bicycles or wheelchairs
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/12—Protocols specially adapted for proprietary or special-purpose networking environments, e.g. medical networks, sensor networks, networks in vehicles or remote metering networks

Definitions

  • the invention relates to the technical field of traffic planning, and more particularly to a method for providing a carpool route, a client, a server and a carpooling system.
  • the number of passengers on the vehicle is lower than the number of passenger seats that the vehicle can provide, the seat rate is low, the transportation resources are wasted, and the travel efficiency is low.
  • a method for providing a carpool route for providing a carpool route for a vehicle owner traveling through a vehicle and a passenger having a travel demand comprising:
  • the driving information includes at least a starting point of driving, a driving end point, a driving time, and a number of carpool seats provided, and the traffic geographic information includes at least a traffic map, and the traveling demand includes at least a departure place, a destination, and a departure time of the passenger;
  • the candidate carpool route includes a carpool starting point, a carpooling destination, and a carpooling manner for each candidate passenger;
  • the carpool starting point is the driving starting point or one of the candidate stopping points in the candidate stopping point set;
  • the carpooling end point Is the driving destination or one of the candidate stops in the candidate stop point;
  • the carpooling manner includes a mode of travel of the candidate passenger from the departure place to the carpool starting point, and the candidate passenger from the carpooling end point
  • the travel mode includes at least walking and cycling;
  • the cost of the carpool includes at least one of a carpooling time, a carpooling distance, and a carpooling fee;
  • the candidate carpool route with the lowest carpool cost is selected as the carpool route, and the carpool route is provided to the owner and the corresponding passenger to trigger the car owner and the passenger to realize carpool travel according to the carpool route.
  • the step of selecting candidate stops includes:
  • each candidate docking area at least one location that allows the vehicle to be docked is selected as a candidate stopping point to obtain a plurality of said candidate stops.
  • the step of acquiring the plurality of candidate carpool routes includes:
  • the carpooling condition includes at least the distance between the departure place and the candidate carpool starting point within a preset distance range, the destination and the driving end point, or the candidate carpool starting point, the candidate stopping point.
  • the distance is within a preset distance and the departure time matches the travel time;
  • the corresponding candidate carpool route is constructed to obtain a plurality of the candidate carpool routes.
  • the step of acquiring the plurality of candidate carpool routes includes:
  • the carpooling condition includes at least the distance between the departure place and the candidate carpool starting point within a preset distance range, the destination and the driving end point, or the candidate carpool starting point, the candidate stopping point.
  • the distance is within a preset distance and the departure time matches the travel time;
  • the corresponding candidate carpool route is constructed to obtain a plurality of the candidate carpool routes.
  • the step of calculating the carpool cost of each of the candidate carpool routes is:
  • the carpooling cost of the candidate passenger includes reaching the corresponding carpool starting point from the departure place, the carpooling end point, and the carpooling end point to the destination in the corresponding carpooling manner.
  • the carpooling cost of the owner is the sum of the carpooling costs of all the candidate passengers minus the driving cost of the car owner
  • the driving cost of the car owner includes the said carpooling route from the driving starting point The starting point of the carpooling and the driving cost of the carpooling end point reaching the driving end point, and the driving cost includes at least one of the driving time, the driving distance and the driving cost
  • the carpooling cost of the candidate carpool route is calculated.
  • the traffic geographic information further includes a geographical distribution of the shared bicycle, and the geographical distribution of the shared bicycle includes an order of the shared bicycle and an available quantity;
  • the traffic geographic information further includes historical traffic data, and the historical traffic data includes one of historical congestion data and historical carpool hotspot data;
  • the driving information further includes driving remark information including at least one of a vehicle type, a vehicle mileage, a driver driving age, and a mileage charging;
  • the travel demand further includes travel preference information, and the travel preference information includes at least a vehicle One of type, carpooling method, and mileage charging.
  • a method for providing a carpool route for providing a carpool route for a car owner traveling through a vehicle and a passenger having a travel demand including:
  • the driving information includes at least a driving starting point, a driving end point, a driving time, and a number of carpool seats provided;
  • the travel demand includes at least a departure place, a destination, and a departure time of the passenger
  • the carpooling route includes a carpooling starting point, a carpooling destination, and a carpooling manner of each of the passengers;
  • a server for providing a carpool route by a vehicle owner traveling by a vehicle and a passenger having a travel demand, including:
  • a memory for storing executable instructions
  • a processor for operating the server to perform a carpool route providing method according to the first aspect of the present invention in accordance with control of the instructions.
  • a client is provided, and a carpool route is provided by a vehicle owner traveling by a vehicle and a passenger having a travel demand, including:
  • a memory for storing executable instructions
  • a processor for operating the server to perform a carpool route providing method according to the second aspect of the present invention in accordance with control of the instructions.
  • a carpooling system for providing a carpool route by a vehicle owner traveling and a passenger having travel demand, including:
  • At least one server according to the third aspect of the invention.
  • a plurality of clients as in the fourth aspect of the invention are identical to the fourth aspect of the invention.
  • the carpool route with the lowest carpooling cost can be selected to be provided to the driver and the corresponding passenger, the carpool travel can be realized, the full occupancy rate of the vehicle travel can be improved, the traffic resources can be effectively utilized, and the travel efficiency can be improved. It is especially suitable for the application scenarios of time-share rental vehicles.
  • FIG. 1 is a block diagram showing an example of a hardware configuration of a system that can be used to implement an embodiment of the present invention.
  • Fig. 2 is a flow chart showing a method of providing a carpool route in the first embodiment of the present invention.
  • FIG. 3 is a flow chart showing the acquisition of a set of candidate stops in the first embodiment of the present invention.
  • Fig. 4 is a flow chart showing the construction of a candidate carpool route in the first embodiment of the present invention.
  • Fig. 5 is a diagram showing an example of constructing a candidate carpool route of the first embodiment of the present invention.
  • FIG. 6 is a flow chart showing the calculation of the cost of carpooling for each of the candidate carpool routes in the first embodiment of the present invention.
  • Fig. 7 is a schematic block diagram of a server of the first embodiment of the present invention.
  • Fig. 8 is a flow chart showing a method of providing a carpool route according to a second embodiment of the present invention.
  • Figure 9 is a schematic block diagram of a client of a second embodiment of the present invention.
  • Figure 10 is a schematic block diagram of a carpooling system in accordance with a third embodiment of the present invention.
  • system 1000 includes a server 1100, a client 1200, and a network 1300.
  • the server 1100 is a service point that provides processing, database, and communication facilities, and may be a monolithic server or a distributed server that spans multiple computers or computer data centers.
  • the type may be limited to a web server, a news server, a mail server, a message server, an advertisement server, a file server, an application server, an interactive server, a database server, or a proxy server.
  • each server may comprise hardware, software, or an embedded logic component or a combination of two or more such components for performing the appropriate functions supported or implemented by the server.
  • a server such as a blade server, a cloud server, or the like, or may be a server group composed of a plurality of servers, may include one or more of the above types of servers, and the like.
  • server 1100 can be a computer.
  • the server 1100 can include a processor 1110, a memory 1120, an interface device 1130, a communication device 1140, a display device 1150, and an input device 1160, as shown in FIG.
  • the server may also include a speaker, a microphone, etc., these components are not relevant to the present invention and are therefore omitted herein.
  • the processor 1110 may be, for example, a central processing unit CPU, a microprocessor MCU, or the like.
  • the memory 1120 includes, for example, a ROM (Read Only Memory), a RAM (Random Access Memory), a nonvolatile memory such as a hard disk, and the like.
  • the interface device 1130 includes, for example, a USB interface, a serial interface, and the like.
  • the communication device 1140 can perform, for example, wired or wireless communication.
  • the display device 1150 is, for example, a liquid crystal display.
  • Input device 1160 can include, for example, a touch screen, a keyboard, and the like.
  • the client 1200 is an electronic device having a communication function and a service processing function.
  • the client 1200 can be a mobile terminal such as a cell phone, a laptop, a tablet, a palmtop, and the like.
  • the client 1200 is installed with a carpooling application (APP) that provides carpooling services, and can support users who have carpooling needs to publish their own carpooling information.
  • APP carpooling application
  • a car owner who travels through the vehicle issues his own driving information, and the carpooling passengers Publish its own travel demand, etc., and provide carpooling routes for matching owners and passengers, triggering the owner and passengers to follow the instructions of the carpooling route, and the owner driving the vehicle picks up the passengers who arrive at the starting point of the carpool by walking or cycling at the starting point of the carpooling. After the passengers at the end of the carpool are divided into the passengers of the carpool, they arrive at the end of the car owner and realize the carpool trip.
  • the owner's vehicle is not limited to the owner's private vehicle, but may also be a rental vehicle acquired by the owner through a time-sharing lease.
  • the vehicle may be two or more small cars, minibuses, buses, coaches, and the like.
  • client 1200 can include processor 1210, memory 1220, interface device 1230, communication device 1240, display device 1250, input device 1260, speaker 1270, microphone 1280, and the like.
  • the processor 1210 may be a central processing unit CPU, a microprocessor MCU, or the like.
  • the memory 1220 includes, for example, a ROM (Read Only Memory), a RAM (Random Access Memory), a nonvolatile memory such as a hard disk, and the like.
  • the interface device 1230 includes, for example, a USB interface, a headphone jack, and the like.
  • the communication device 1240 can, for example, perform wired or wireless communication.
  • the display device 1250 is, for example, a liquid crystal display, a touch display, or the like.
  • Input device 1260 can include, for example, a touch screen, a keyboard, and the like. The user can input/output voice information through the speaker 1270 and the microphone 1280.
  • the communication network 1300 can be a wireless network or a network, and can be a local area network or a wide area network.
  • clients 1200-1, 1200-2, 1200-3, 1200-4, and web server 1100 can communicate over communication network 1300.
  • the system 1000 illustrated in Figure 1 is merely illustrative and is in no way intended to limit the invention, its application or use.
  • the memory 1120 of the server 1100 is configured to store executable instructions
  • the processor 1110 is configured to run the server 1100 according to the control of the instructions to perform an embodiment of the present invention. The method of providing any carpool route provided in the program.
  • the memory 1220 of the client 1200 is configured to store executable instructions, and the processor 1210 is configured to run the client 1200 according to the control of the instruction to perform any carpool route provided by the embodiment of the present invention. Method of providing.
  • the present invention may relate only to some of the devices, for example, the server 1100 only relates to the processor 1110 and the storage.
  • Device 1120, or client 1200 only relates to processor 1210 and storage device 1220, and the like.
  • a technician can design instructions in accordance with the disclosed aspects of the present invention. How the instructions control the processor for operation is well known in the art and will not be described in detail herein.
  • a method for providing a carpool route for providing a carpool route for a car owner traveling through the vehicle and a passenger having travel demand.
  • the vehicle is a motor vehicle that can provide multi-person rides.
  • it can be a small car of two or more, a minibus, a bus, a coach, and the like.
  • the owner may be a person for traveling through the vehicle, and may be the owner of the vehicle or a renter of the vehicle, for example, may be a renter who rents the vehicle by time sharing.
  • the method for providing the carpool route includes:
  • step S2100 the driving information of the owner, the traffic geographic information, and the travel demand of the plurality of passengers are obtained.
  • the driving information is related information of the driving of the vehicle owner, and includes at least a starting point of the driving, a driving end point, a driving time, and a number of carpool seats provided.
  • the travel time may include the departure time of the owner, the time of the expected end of the trip, or the payment period of the rental vehicle.
  • the driving starting point and the driving end point may be unique name information, unique identification or geographical location coordinate data of the corresponding geographical location.
  • the driving information may further include driving remark information including at least one of a vehicle type, a vehicle mileage, a driver driving age, and a mileage charging.
  • vehicle type is an attribute type of a traveling vehicle, and can be distinguished according to the performance or comfort of the vehicle. For example, the vehicle can be classified into a normal type, a comfortable type, or a luxury type according to the comfort level.
  • vehicle mileage is the mileage that the travel vehicle has traveled.
  • the driving age of the owner is the number of years the driver of the driving vehicle has driven the vehicle.
  • the mileage charge is a carpooling fee per unit mileage for the car owner to collect the carpool passengers.
  • Traffic geographic information includes at least a traffic map.
  • the traffic map includes a map that covers the corresponding travel area, and may be pre-stored in the local storage of the device that implements the embodiment, or may be invoked through an interface provided by an existing map application to obtain a correspondingly provided map, and may also acquire different
  • the route combination and real-time road condition information under the travel mode include public transportation, bicycle riding, walking, self-driving travel, etc.
  • the traffic geographic information may further include historical traffic data including one of historical congestion data and historical carpool hotspot data.
  • the historical congestion data is data of a congestion state of each time period of a traffic route that can be traveled on the traffic map according to historical data;
  • the historical carpool hot spot data is a carpool starting point or a carpool destination according to historical data statistics.
  • the data of the location of the carpool hotspot may be a subway station, a parking lot, a bus stop, a bicycle stop, a taxi waiting point, an intersection of a convenient car, etc.
  • the historical carpool hotspot data may include a carpool hotspot.
  • the traffic geographic information may also include a geographical distribution of shared bicycles, the geographic distribution of the shared bicycles including the stops of the shared bicycle and the available number.
  • the shared bicycle is a bicycle that can provide a time-sharing rental service, including a human bicycle, a power bicycle, an electric bicycle, and the like.
  • Travel demand includes at least the departure place, destination, and departure time of the passenger.
  • the origin and destination may be unique name information, unique identifiers or geographical location coordinate data of the corresponding geographical location.
  • the travel demand may further include travel preference information, where the travel preference information is used to describe a preference of the corresponding passenger when traveling by car, including at least one of a vehicle type, a carpooling manner, and a mileage charge.
  • the type of the vehicle is the type of the vehicle that the corresponding passenger desires to travel by car, and corresponds to the type of the vehicle in the above-mentioned driving remark information, and details are not described herein again.
  • the carpooling method is a carpooling method that the corresponding passenger is willing to accept, including the type of travel that is willing to use, from the departure place to the corresponding carpool starting point and from the carpool end point to the destination.
  • the mileage charge is the charge for the unit mileage that the passenger wants to travel by carpool.
  • the human-machine interaction interface can be provided through the client for the vehicle owner and the passenger, for the vehicle owner to input the corresponding driving information and the passenger to input the corresponding travel demand, thereby obtaining the driving information of the owner and the travel demand of the passenger.
  • Step S2200 Select a plurality of candidate stops between the driving start point and the driving end point according to the driving information and the traffic geographic information, to obtain a candidate stopping point set including the plurality of candidate stopping points.
  • the step of selecting candidate stops may be as shown in FIG. 3, including:
  • Step S2210 According to the traffic geographic information, multiple candidate docking areas are divided by a preset geographical distance between the starting point of the driving and the ending point of the driving.
  • the preset geographical distance can be set according to specific application scenarios or engineering experience.
  • the driving route of the starting point of the driving to the driving end point can be obtained, segmented one by one by a preset geographical distance, and the central position of each segment is taken as the center, with a preset geographical distance as a preset geographical distance.
  • Diameter division results in a circular or rectangular candidate docking area.
  • inappropriate candidate docking areas may be filtered out in the divided candidate parking areas according to the traffic geographic information, for example, a crowded area that is not suitable for vehicle parking, or unsuitable for passengers to ride, walk, etc. Arriving area; or, in the divided candidate starting area according to the traffic geographic information, only candidate parking areas related to historical carpool hotspot data may be reserved, for example, including subway station, parking lot, bus stop, bicycle stop , taxi waiting point, candidate docking area for easy intersections.
  • Step S2220 In each candidate docking area, at least one location that allows the vehicle to stop is selected as a candidate stopping starting point to obtain a plurality of the candidate stopping orders.
  • the carpool hotspot in the candidate docking area may be selected as a candidate stop point according to the historical carpool hotspot data included in the traffic geographic information, for example, a subway station port, a parking lot, a bus stop, a bicycle stop, and a rental Waiting for cars, easy intersections, etc.
  • the available number of shared bicycles in the candidate docking area may be selected to be greater than a preset number of bicycle parking places, and the preset number may be set according to actual application requirements.
  • Obtaining a plurality of candidate stops can be used to select candidate passengers in the candidate steps and construct a plurality of candidate carpool routes, so that the carpool route with the lowest carpool cost can be selected and provided to the owner and the corresponding passengers, thereby achieving carpool travel and improving vehicle travel.
  • Step S2300 traverse the acquired plurality of travel demands according to the driving information, the traffic geographic information, and the candidate stop point set, construct a plurality of the candidate carpool routes, and calculate and obtain each candidate. Carpooling cost of carpooling route.
  • the candidate carpool route includes a carpool starting point, a carpooling destination, and a carpooling manner for each candidate passenger;
  • the carpool starting point is the driving starting point or one of the candidate stopping points in the candidate stopping point set;
  • the carpooling end point Is the driving destination or one of the candidate stops in the candidate stop point;
  • the carpooling manner includes a mode of travel of the candidate passenger from the departure place to the carpool starting point, and the candidate passenger from the carpooling end point
  • the travel mode includes at least walking and cycling;
  • the cost of the carpool includes at least one of a carpooling time, a carpooling distance, and a carpooling fee.
  • the step of acquiring a plurality of the candidate carpool routes may be as shown in FIG. 4, including:
  • Step S2311 taking the driving starting point and each of the candidate stopping points as candidate starting points, traversing the plurality of acquired travel demands, selecting passengers meeting the carpooling condition, and obtaining a plurality of candidate passengers;
  • the carpooling condition includes at least the distance between the departure place and the candidate carpool starting point within a preset distance range, the destination and the driving end point, or the candidate carpool starting point, the candidate stopping point.
  • the distance is within a preset distance and the departure time matches the travel time;
  • the preset distance range may be set according to a specific application scenario or engineering experience value. For example, when the passenger supports the bicycle riding from the departure place to the carpool starting point or from the carpool end point to the destination, the preset distance range may be set to a distance. More than 3 kilometers;
  • the departure time is matched with the driving time, and the departure time of the passenger is not limited to be exactly the same as the driving time of the owner.
  • the passenger can start the carpooling in the middle of the journey of the owner driving the vehicle, as long as the owner of the vehicle drives the car to reach the passenger carpool.
  • the time of the starting point matches the departure time expected by the passenger.
  • the carpooling conditions may also include other information matching, such as matching the vehicle type in the driving remark information with the vehicle type in the travel demand, the mileage charging in the driving remark information, the mileage charging in the travel demand, the driver's driving age and the passenger's request, etc. Wait.
  • Step S2312 constructing a plurality of candidate passenger sets from among the plurality of candidate passengers that have been acquired
  • the number of candidate passengers in each of the candidate passenger sets does not exceed the number of carpool seats.
  • step S2313 for each of the candidate passenger sets, the corresponding candidate carpool route is constructed, and a plurality of the candidate carpool routes are obtained.
  • the candidate P ordering candidate stops are obtained according to the method shown in FIG. 3, Ps p (p ⁇ 1,2,3,...,P ⁇ ), the preset distance range is no more than 3 km;
  • each passenger's travel demand includes the departure place is U k _s and the destination is U k _e
  • the departure time is U k _t, which can traverse the travel demand of K passengers, and obtain the distance between U k _s and D_s or a certain Ps i is not more than 3 km, and U k _e and D_s or Ps j (i ⁇ j ⁇ P
  • the distance between the N candidate passengers U n (n ⁇ 1, 2, 3, ..., N ⁇ ) whose distance is not more than 3 km, U k _t and D_t, and each candidate passenger has a corresponding carpool starting point is D_s or a Ps i with a distance of less than 3 km from the starting point, the end of the carpool is D_s or Ps j (i ⁇ j ⁇ P) whose distance is less than 3 km from its destination;
  • a corresponding candidate carpool route may be constructed to obtain a plurality of the candidate carpool routes, and the candidate passenger set ⁇ U 1 , U 2 , U 3 ⁇ is taken as an example, and the candidate passenger U 1 is assumed.
  • the starting point of carpooling is Ps 1
  • the end of carpooling is D_e
  • the distance from the starting point U 1 _s to the carpool starting point Ps 1 by bicycle riding, the carpooling destination D_e is the same as its destination U 1 _e
  • the starting point of the passenger U 2 is D_s
  • the carpooling end point It is Ps 2 , from the departure point U 2 _s to the carpool starting point D_s by bicycle riding, from the carpool destination Ps 2 to the destination U 2 _e by bicycle riding
  • the passenger U 3 carpool starting point is Ps 1
  • the carpooling end point is Ps 3
  • its starting point U 3 _s is the same as the carpool starting point Ps 1 , from the carpool destination Ps 3 through the bicycle to reach its destination U 3 _e, the candidate carpool route obtained as shown in Figure 5:
  • For passenger U 3 take the vehicle from U 3 _s to Ps 3 and from Ps 3 to the U 3 _e by bicycle.
  • the corresponding candidate carpool route can be obtained.
  • the step of calculating the travel cost of each of the candidate carpool routes may be as shown in FIG. 6, including:
  • Step S2321 calculating, for each candidate passenger, the carpooling cost under the candidate carpool route according to the corresponding travel demand and the traffic geographic information, respectively.
  • the carpooling cost of the candidate passenger includes reaching the corresponding carpool starting point from the departure place, the carpooling end point, and the carpooling end point to the destination in the corresponding carpooling manner.
  • Step S2322 calculating, by the vehicle owner, the cost of the carpool under the candidate carpool route according to the corresponding driving information and the traffic geographic information.
  • the carpooling cost of the owner is the sum of the carpooling costs of all the candidate passengers minus the driving cost of the car owner
  • the driving cost of the car owner includes the said carpooling route from the driving starting point The starting point of the carpooling and the driving cost of the carpooling end point reaching the driving end point, and the driving cost includes at least one of the driving time, the driving distance and the driving cost
  • Step S2323 Calculate the carpooling cost of the candidate carpool route according to the car owner and the carpooling book of the candidate passenger under the candidate carpool route.
  • the carpooling cost is the carpooling time, and the carpooling time includes the length of time from U 1 _s to Ps 1 by bicycle riding and the length of time from Ps 1 to U 1 _e, which can be acquired by traffic geographic information.
  • carpool Carpool cost is from U 1 passengers can get from riding through traffic geographical information
  • travel distance summing carpool distance Carpooling is assumed that the cost carpool fee, you can get through the traffic geographical information in passenger traffic map U 1 trip distance, ride distance, ride costs were estimated according to distance riding, calculated according to the cost of car travel distance and mileage expenses, Summing and getting carpool fees
  • the driving route is to drive the vehicle from the D_s route Ps 1 , Ps 2 , Ps 3 to D_e, and the corresponding driving distance can be obtained through the traffic geographic information.
  • Driving time It can be calculated by dividing the driving distance by the estimated driving speed estimated by historical traffic data in the traffic geographic information, and the driving cost.
  • the carpooling cost of the candidate carpool route can be obtained as follows:
  • the cost of carpooling needs to comprehensively consider the distance of carpooling, the time of carpooling, and the cost of carpooling.
  • the vehicle distance, the carpool time, and the carpooling fee are set to different weights to realize the comprehensive calculation of the travel cost.
  • different priorities can be set for the owner or the passenger.
  • different priorities can be set for the owner or the passenger.
  • the travel cost of the candidate carpool route is used, different priority weights may be set according to the carpool priority of the owner or the passenger, and the corresponding carpool cost is respectively multiplied to calculate the travel cost under the carpool route.
  • the carpooling route with the lowest carpooling cost can be selected to be provided to the driver and the corresponding passengers in the subsequent steps, the carpool travel is realized, the vehicle occupancy rate is improved, and the traffic resources are effectively utilized. Improve travel efficiency. It is especially suitable for the application scenarios of time-share rental vehicles.
  • step S2400 the candidate carpool route with the lowest carpool cost is selected as the carpool route, and the carpool route is provided to the owner and the corresponding passenger to trigger the car owner and the passenger to realize carpool travel according to the carpool route.
  • the candidate carpool route with the lowest cost of carpooling is selected as the carpool route, which is provided to the owner and the corresponding passengers, improves the full occupancy rate of the vehicle travel, effectively utilizes the traffic resources, and improves the travel efficiency. It is especially suitable for the application scenarios of time-share rental vehicles.
  • the carpool route can be provided to the owner and the corresponding passenger through the human-computer interaction interface of the client.
  • the route from the starting point of the vehicle owner to the carpool starting point of the passenger, and the carpooling end point to the driving end point can be displayed.
  • the estimated travel time, etc.; for the passengers it is possible to show which travel mode is used to arrive at the carpool starting point from the departure place, when the vehicle is expected to arrive at the carpool starting point and the carpool end point, and in which travel mode to reach the destination from the carpool end point, and the like.
  • Providing passengers with a shared bicycle reservation service can enable passengers to “seamlessly” transfer vehicles through bicycles to achieve carpooling and improve the efficiency of carpooling.
  • a server 200 is further provided for implementing the method for providing a carpool route provided in this embodiment.
  • the device includes a memory 210 and a processor 220:
  • a memory 210 configured to store executable instructions
  • the processor 220 is configured to run the server to perform the method for providing the carpool route provided in the embodiment according to the control of the instruction.
  • the server 200 may have various physical forms, for example, may be a blade server, a cloud server, or the like, or may be a server group composed of a plurality of servers.
  • server 200 can be server 1100 as shown in FIG.
  • server 200 can be implemented in a variety of ways.
  • server 200 can be implemented by an instruction configuration processor.
  • the instructions can be stored in the ROM, and when the device is booted, the instructions are read from the ROM into the programmable device to implement the server 200.
  • server 200 can be cured into a dedicated device (eg, an ASIC).
  • the server 200 can be divided into mutually independent units, or they can be implemented together.
  • the server 200 may be implemented by one of the various implementations described above, or may be implemented by a combination of two or more of the various implementations described above.
  • a carpool route with the lowest carpool cost can be selected and provided to the driver and the corresponding passenger to realize carpool travel and improve vehicle travel. Full occupancy rate, effective use of transportation resources, and improve travel efficiency. It is especially suitable for the application scenarios of time-share rental vehicles.
  • a method for providing a carpool route for providing a carpool route for a vehicle owner traveling through a vehicle and a passenger having a travel demand, as shown in FIG. 8, including:
  • Step S3100 providing a driving information publishing interface for the vehicle owner to release driving information.
  • the driving information includes at least a driving starting point, a driving end point, a driving time, and a number of carpool seats provided; the driving information is described in detail in the first embodiment, and details are not described herein again.
  • the driving information publishing interface is a human-machine interaction interface that can be used by a user to perform a click operation, a text or a voice input operation, and can obtain driving information issued by a user who is a vehicle owner in response to a user operation, so as to cooperate with the implementation of the first embodiment.
  • the method of providing carpool routes is a human-machine interaction interface that can be used by a user to perform a click operation, a text or a voice input operation, and can obtain driving information issued by a user who is a vehicle owner in response to a user operation, so as to cooperate with the implementation of the first embodiment.
  • Step S3200 providing a travel demand release interface for the passenger to publish travel demand
  • the travel demand includes at least a departure place, a destination, and a departure time of the passenger; the travel demand is described in detail in the first embodiment, and details are not described herein again.
  • the travel demand release interface is a human-computer interaction interface that can be used by a user to perform a click operation, a text or a voice input operation, and can obtain a travel demand issued by a user as a passenger in response to a user operation, so as to cooperate with the implementation of the first embodiment.
  • the method of providing carpool routes is a human-computer interaction interface that can be used by a user to perform a click operation, a text or a voice input operation, and can obtain a travel demand issued by a user as a passenger in response to a user operation, so as to cooperate with the implementation of the first embodiment.
  • Step S3300 providing a carpool route display interface, so that the owner and the corresponding passenger obtain the corresponding carpool route through the display.
  • the carpool route is provided according to the method in the first embodiment, and the carpool route includes a carpool starting point, a carpooling destination, and a carpooling manner for each of the passengers; the carpooling manner includes the candidate passenger from the departure place. a mode of travel to the start of the carpool and a mode of travel of the candidate passenger from the end of the carpool to the destination; the mode of travel includes at least walking and cycling.
  • the carpool route display interface is a human-computer interaction interface that can be used by the user to perform a click operation and a zoom operation.
  • the user can display the corresponding carpool route to the user in response to the related operation of the user, and cooperate with the carpool route in the first embodiment.
  • a client 300 is further provided for implementing the method for providing a carpool route provided in this embodiment.
  • the memory 310 and the processor 320 are included:
  • a memory 310 configured to store executable instructions
  • the processor 320 is configured to run the server to perform the method for providing the carpool route provided in the embodiment according to the control of the instruction.
  • the client 300 can have various physical forms, for example, a mobile phone, a palmtop computer, a tablet computer, a desktop computer, or the like.
  • client 300 can be server 1200 as shown in FIG.
  • client 300 can be implemented in a variety of ways.
  • client 300 can be implemented by an instruction configuration processor.
  • the instructions can be stored in the ROM, and when the device is booted, the instructions are read from the ROM into the programmable device to implement the client 300.
  • client 300 can be cured into a dedicated device (eg, an ASIC).
  • the client 300 can be divided into mutually independent units, or they can be combined and implemented.
  • the client 300 may be implemented by one of the various implementations described above, or may be implemented by a combination of two or more of the various implementations described above.
  • the carpool route with the lowest carpooling cost can be provided to the driver and the corresponding passenger to realize carpool travel and improve vehicle travel. Full occupancy rate, effective use of transportation resources, and improve travel efficiency. It is especially suitable for the application scenarios of time-share rental vehicles.
  • a carpooling system 400 for providing a carpool route for a vehicle owner traveling through a vehicle and a passenger having a travel demand, as shown in FIG. 10, including:
  • At least one server 200 provided in the first embodiment At least one server 200 provided in the first embodiment
  • a plurality of clients 300 as provided in the second embodiment is provided.
  • the vehicle owner traveling through the vehicle can release the driving information through the driving information publishing interface provided by the client 300, and the passenger who has the travel demand can be released through the providing travel demand publishing interface provided by the client 300.
  • the client 300 obtains corresponding driving information and travel demand in response to the operation of the owner and the passenger, and then sends the request to the server 200.
  • the server 200 provides the carpooling cost for the owner and the corresponding passenger according to the method for providing the carpool route in the first embodiment.
  • the smallest carpool route is sent to the owner and the client 300 of the corresponding passenger respectively, so that the client 300 can provide the carpool route to the owner and the corresponding passenger through the carpool route display interface.
  • the carpooling system 400 can have multiple physical forms.
  • the carpooling system 400 can be the system 1000 shown in FIG.
  • the carpooling route with the lowest carpooling cost can be provided to the driver and the corresponding passengers, the carpooling trip can be realized, the vehicle occupancy rate can be improved, and the vehicle utilization rate can be effectively utilized.
  • the invention can be a system, method and/or computer program product.
  • the computer program product can comprise a computer readable storage medium having computer readable program instructions embodied thereon for causing a processor to implement various aspects of the present invention.
  • the computer readable storage medium can be a tangible device that can hold and store the instructions used by the instruction execution device.
  • the computer readable storage medium can be, for example, but not limited to, an electrical storage device, a magnetic storage device, an optical storage device, an electromagnetic storage device, a semiconductor storage device, or any suitable combination of the foregoing.
  • Non-exhaustive list of computer readable storage media include: portable computer disks, hard disks, random access memory (RAM), read only memory (ROM), erasable programmable read only memory (EPROM) Or flash memory), static random access memory (SRAM), portable compact disk read only memory (CD-ROM), digital versatile disk (DVD), memory stick, floppy disk, mechanical encoding device, for example, with instructions stored thereon A raised structure in the hole card or groove, and any suitable combination of the above.
  • a computer readable storage medium as used herein is not to be interpreted as a transient signal itself, such as a radio wave or other freely propagating electromagnetic wave, an electromagnetic wave propagating through a waveguide or other transmission medium (eg, a light pulse through a fiber optic cable), or through a wire The electrical signal transmitted.
  • the computer readable program instructions described herein can be downloaded from a computer readable storage medium to various computing/processing devices or downloaded to an external computer or external storage device over a network, such as the Internet, a local area network, a wide area network, and/or a wireless network.
  • the network may include copper transmission cables, fiber optic transmissions, wireless transmissions, routers, firewalls, switches, gateway computers, and/or edge servers.
  • a network adapter card or network interface in each computing/processing device receives computer readable program instructions from the network and forwards the computer readable program instructions for storage in a computer readable storage medium in each computing/processing device .
  • Computer program instructions for performing the operations of the present invention may be assembly instructions, instruction set architecture (ISA) instructions, machine instructions, machine related instructions, microcode, firmware instructions, state setting data, or in one or more programming languages.
  • the computer readable program instructions can execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer, partly on the remote computer, or entirely on the remote computer or server. carried out.
  • the remote computer can be connected to the user's computer through any kind of network, including a local area network (LAN) or wide area network (WAN), or can be connected to an external computer (eg, using an Internet service provider to access the Internet) connection).
  • the customized electronic circuit such as a programmable logic circuit, a field programmable gate array (FPGA), or a programmable logic array (PLA), can be customized by utilizing state information of computer readable program instructions.
  • Computer readable program instructions are executed to implement various aspects of the present invention.
  • the computer readable program instructions can be provided to a general purpose computer, a special purpose computer, or a processor of other programmable data processing apparatus to produce a machine such that when executed by a processor of a computer or other programmable data processing apparatus Means for implementing the functions/acts specified in one or more of the blocks of the flowcharts and/or block diagrams.
  • the computer readable program instructions can also be stored in a computer readable storage medium that causes the computer, programmable data processing device, and/or other device to operate in a particular manner, such that the computer readable medium storing the instructions includes An article of manufacture that includes instructions for implementing various aspects of the functions/acts recited in one or more of the flowcharts.
  • the computer readable program instructions can also be loaded onto a computer, other programmable data processing device, or other device to perform a series of operational steps on a computer, other programmable data processing device or other device to produce a computer-implemented process.
  • instructions executed on a computer, other programmable data processing apparatus, or other device implement the functions/acts recited in one or more of the flowcharts and/or block diagrams.
  • each block in the flowchart or block diagram can represent a module, a program segment, or a portion of an instruction that includes one or more components for implementing the specified logical functions.
  • Executable instructions can also occur in a different order than those illustrated in the drawings. For example, two consecutive blocks may be executed substantially in parallel, and they may sometimes be executed in the reverse order, depending upon the functionality involved.
  • each block of the block diagrams and/or flowcharts, and combinations of blocks in the block diagrams and/or flowcharts can be implemented in a dedicated hardware-based system that performs the specified function or function. Or it can be implemented by a combination of dedicated hardware and computer instructions. It is well known to those skilled in the art that implementation by hardware, implementation by software, and implementation by a combination of software and hardware are equivalent.

Landscapes

  • Engineering & Computer Science (AREA)
  • Business, Economics & Management (AREA)
  • Human Resources & Organizations (AREA)
  • Physics & Mathematics (AREA)
  • Strategic Management (AREA)
  • Economics (AREA)
  • General Physics & Mathematics (AREA)
  • General Health & Medical Sciences (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Marketing (AREA)
  • Signal Processing (AREA)
  • General Business, Economics & Management (AREA)
  • Theoretical Computer Science (AREA)
  • Tourism & Hospitality (AREA)
  • Health & Medical Sciences (AREA)
  • Medical Informatics (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Game Theory and Decision Science (AREA)
  • Development Economics (AREA)
  • Computing Systems (AREA)
  • Primary Health Care (AREA)
  • Navigation (AREA)
  • Traffic Control Systems (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

本发明公开了一种拼车路线的提供方法、服务器、客户端及拼车系统。该方法包括：获取车主的行车信息、交通地理信息以及多个乘客的出行需求；根据行车信息以及交通地理信息，在行车起点与行车终点之间选取多个候选停靠点，得到包含多个候选停靠点的候选停靠点集合；根据行车信息、交通地理信息以及候选停靠点集合，遍历已获取的多个出行需求，构建多条候选拼车路线，并计算获取每条候选拼车路线的拼车成本；选取拼车成本最小的候选拼车路线作为拼车路线，并将拼车路线提供给车主和对应的乘客。根据本发明，可以有效利用交通资源，提高出行效率。

Description

拼车路线的提供方法、客户端、服务器及拼车系统 技术领域
本发明涉及交通规划技术领域，更具体地，涉及一种拼车路线的提供方法、客户端、服务器及拼车系统。
背景技术
随着城市人口密度增大和私家车辆的数量增多，城市交通出现拥堵已经成为常态，限制私家车辆出行的措施例如因为车辆牌照摇号、车辆限号出行等使得通过私家车辆出行存在很多不便，越来越多的人通过提供车辆分时租赁服务的应用或网站，租赁车辆出行。
但是，用户通过分时租赁获取的车辆出行时，乘坐车辆的人数低于该车辆可提供的乘客座位数，满座率较低，浪费交通资源，出行效率较低。
因此，发明人认为，有必要对上述现有技术存在的问题进行改进。
发明内容
本发明的一个目的是提供一种用于提供拼车路线的新技术方案。
根据本发明的第一方面，提供了一种拼车路线的提供方法，用于为通过车辆出行的车主以及具有出行需求的乘客提供拼车路线，所述方法包括：
获取车主的行车信息、交通地理信息以及多个乘客的出行需求,
其中，所述行车信息至少包括行车起点、行车终点、行车时间、提供的拼车座位数，所述交通地理信息至少包括交通地图，所述出行需求至少包括乘客的出发地、目的地、出发时间；
根据所述行车信息以及所述交通地理信息，在所述行车起点与所述行车终点之间选取多个候选停靠点，得到包含所述多个候选停靠点的候选停靠点集合；
根据所述行车信息、所述交通地理信息以及所述候选停靠点集合，遍 历已获取的所述多个出行需求，构建多条所述候选拼车路线，并计算获取每条所述候选拼车路线的拼车成本；
其中，所述候选拼车路线包括每个候选乘客的拼车起点、拼车终点以及拼车方式；所述拼车起点是所述行车起点或者所述候选停靠点集中的一个所述候选停靠点；所述拼车终点是所述行车终点或者所述候选停靠点集中的一个所述候选停靠点；所述拼车方式包括所述候选乘客从出发地到达所述拼车起点的出行方式、所述候选乘客从所述拼车终点到达目的地的出行方式；所述出行方式至少包括步行和自行车骑行；所述拼车成本至少包括拼车时长、拼车距离、拼车费用三者其中之一；
选取拼车成本最小的候选拼车路线作为拼车路线，并将所述拼车路线提供给车主和对应的乘客，以触发车主和所述乘客根据所述拼车路线实现拼车出行。
可选地，所述选取候选停靠点的步骤包括：
根据所述交通地理信息，在所述行车起点到行车终点之间以预设的地理距离划分多个候选停靠区域；
在每个候选停靠区域中，至少选取一个允许所述车辆停靠的地点作为候选停靠起点，以得到多个所述候选停靠点。
可选地，所述获取多条所述候选拼车路线的步骤包括：
分别以所述行车起点以及每一个所述候选停靠点作为候选拼车起点，遍历已获取的多个所述出行需求，选取符合拼车条件的乘客，得到多个候选乘客；
其中，所述拼车条件至少包括所述出发地与所述候选拼车起点的距离在预设距离范围内、所述目的地与所述行车终点或者所述候选拼车起点后序的所述候选停靠点的距离在预设距离范围内并且所述出发时间与所述行车时间匹配；
从已获取的多个候选乘客中，构建多个候选乘客集合，
其中，每个所述候选乘客集合中的候选乘客数目不超过所述拼车座位数；
对每个所述候选乘客集合，构建对应的所述候选拼车路线，得到多条 所述候选拼车路线。
可选地，所述获取多条所述候选拼车路线的步骤包括：
分别以所述行车起点以及每一个所述候选停靠点作为候选拼车起点，遍历已获取的多个所述出行需求，选取符合拼车条件的乘客，得到多个候选乘客；
其中，所述拼车条件至少包括所述出发地与所述候选拼车起点的距离在预设距离范围内、所述目的地与所述行车终点或者所述候选拼车起点后序的所述候选停靠点的距离在预设距离范围内并且所述出发时间与所述行车时间匹配；
从已获取的多个候选乘客中，构建多个候选乘客集合，
其中，每个所述候选乘客集合中的候选乘客数目不超过所述拼车座位数；
对每个所述候选乘客集合，构建对应的所述候选拼车路线，得到多条所述候选拼车路线。
可选地，所述计算获取每条所述候选拼车路线的拼车成本的步骤包括：
分别对每个候选乘客，根据对应的出行需求和所述交通地理信息，计算得到该候选拼车路线下的所述拼车成本，
其中，所述候选乘客的拼车成本包括以对应的拼车方式从所述出发地达到对应的所述拼车起点、从所述拼车起点到达所述拼车终点以及从所述拼车终点到达所述目的地的拼车成本；
对所述车主，根据对应的行车信息和所述交通地理信息，计算得到该候选拼车路线下的所述拼车成本，
其中，所述车主的拼车成本是所有所述候选乘客的拼车成本之和减去所述车主的行车成本，所述车主的行车成本包括从所述行车起点途径所述候选拼车路线涉及的所述拼车起点、所述拼车终点到达所述行车终点的行车成本，所述行车成本至少包括行车时长、行车距离、行车费用三者其中之一；
根据所述车主以及所述候选乘客在该候选拼车路线下的拼车车本，计 算得到该候选拼车路线的拼车成本。
可选地，所述交通地理信息还包括共享自行车的地理分布，所述共享自行车的地理分布包括所述共享自行车的停靠点以及可用数量；
和/或
当所述乘客被触发通过自行车骑行从所述出发地到达所述拼车起点，或者被触发通过自行车骑行从所述拼车终点到达对应的所述目的地时，为所述乘客提供共享自行车预约服务。
可选地，
所述交通地理信息还包括历史交通数据，所述历史交通数据包括历史拥堵数据、历史拼车热点数据其中之一；
和/或
所述行车信息还包括行驶备注信息，所述行驶备注信息至少包括车辆类型、车辆里程、车主驾龄以及里程收费其中之一；所述出行需求还包括出行偏好信息，所述出行偏好信息至少包括车辆类型、拼车方式、里程收费其中之一。
根据本发明的第二方面，提供一种拼车路线的提供方法，用于为通过车辆出行的车主以及具有出行需求的乘客提供拼车路线，包括：
提供行车信息发布界面，以供所述车主发布行车信息，
其中，所述行车信息至少包括行车起点、行车终点、行车时间、提供的拼车座位数；
提供出行需求发布界面，以供所述乘客发布出行需求，
其中，所述出行需求至少包括乘客的出发地、目的地、出发时间；
提供拼车路线展示界面，以供所述车主和对应的所述乘客通过展示获取对应的拼车路线，
其中，所述拼车路线根据如本发明第一方面的任意一项所述的方法提供，所述拼车路线包括每个所述乘客的拼车起点、拼车终点以及拼车方式；所述拼车方式包括所述候选乘客从出发地到达所述拼车起点的出行方式和所述候选乘客从所述拼车终点到达目的地的出行方式；所述出行方式至少包括步行和自行车骑行。
根据本发明的第三方面，提供一种服务器，通过车辆出行的车主以及具有出行需求的乘客提供拼车路线，包括：
存储器，用于存储可执行的指令；
处理器，用于根据所述指令的控制，运行所述服务器以执行如本发明第一方面的拼车路线的提供方法。
根据本发明的第四方面，提供一种客户端，通过车辆出行的车主以及具有出行需求的乘客提供拼车路线，包括：
存储器，用于存储可执行的指令；
处理器，用于根据所述指令的控制，运行所述服务器以执行如本发明第二方面的拼车路线的提供方法。
根据本发明的第五方面，提供一种拼车系统，通过车辆出行的车主以及具有出行需求的乘客提供拼车路线，包括：
至少一个如本发明第三方面所述的服务器；
多个如本发明第四方面所述的客户端。
根据本发明的一个实施例，可以选择拼车成本最小的拼车路线提供给司机和对应的乘客，实现拼车出行，提高车辆出行的满座率，有效利用交通资源，提高出行效率。尤其适用分时租赁车辆出行的应用场景。
通过以下参照附图对本发明的示例性实施例的详细描述，本发明的其它特征及其优点将会变得清楚。
附图说明
被结合在说明书中并构成说明书的一部分的附图示出了本发明的实施例，并且连同其说明一起用于解释本发明的原理。
图1是显示可用于实现本发明的实施例的系统的硬件配置的例子的框图。
图2示出了本发明第一实施例的拼车路线的提供方法的流程图。
图3示出了本发明第一实施例的获取候选停靠点集合的流程图。
图4示出了本发明第一实施例的构建候选拼车路线的流程图。
图5示出了本发明第一实施例的构建候选拼车路线的例子的示意图。
图6示出了本发明第一实施例的计算获取每条所述候选拼车路线的拼车成本的流程图。
图7是本发明第一实施例的服务器的示意性框图。
图8是本发明第二实施例的拼车路线的提供方法的流程图。
图9是本发明第二实施例的客户端的示意性框图。
图10是本发明第三实施例的拼车系统的示意性框图。
具体实施方式
现在将参照附图来详细描述本发明的各种示例性实施例。应注意到：除非另外具体说明，否则在这些实施例中阐述的部件和步骤的相对布置、数字表达式和数值不限制本发明的范围。
以下对至少一个示例性实施例的描述实际上仅仅是说明性的，决不作为对本发明及其应用或使用的任何限制。
对于相关领域普通技术人员已知的技术、方法和设备可能不作详细讨论，但在适当情况下，所述技术、方法和设备应当被视为说明书的一部分。
在这里示出和讨论的所有例子中，任何具体值应被解释为仅仅是示例性的，而不是作为限制。因此，示例性实施例的其它例子可以具有不同的值。
应注意到：相似的标号和字母在下面的附图中表示类似项，因此，一旦某一项在一个附图中被定义，则在随后的附图中不需要对其进行进一步讨论。
<硬件配置>
如图1所示，系统1000包括服务器1100、客户端1200以及网络1300。
服务器1100是提供处理、数据库、通讯设施的业务点，可以是整体式服务器或是跨多计算机或计算机数据中心的分散式服务器。其类型可以单不限于网络服务器，新闻服务器，邮件服务器，消息服务器，广告服务器，文件服务器，应用服务器，交互服务器，数据库服务器，或代理服务器。在一些实施例中，每个服务器可以包括硬件，软件，或用于执行服务器所支持或实现的合适功能的内嵌逻辑组件或两个或多个此类组件的组 合。例如，服务器例如刀片服务器、云端服务器等，或者可以是由多台服务器组成的服务器群组，可以包括上述类型的服务器中的一种或多种等等。
在一个例子中，服务器1100可以是一台计算机。在在另一个例子中，服务器1100可以如图1所示，包括处理器1110、存储器1120、接口装置1130、通信装置1140、显示装置1150、输入装置1160。尽管服务器也可以包括扬声器、麦克风等等，但是，这些部件与本发明无关，故在此省略。
其中，处理器1110例如可以是中央处理器CPU、微处理器MCU等。存储器1120例如包括ROM(只读存储器)、RAM(随机存取存储器)、诸如硬盘的非易失性存储器等。接口装置1130例如包括USB接口、串行接口等。通信装置1140例如能够进行有线或无线通信。显示装置1150例如是液晶显示屏。输入装置1160例如可以包括触摸屏、键盘等。
客户端1200是具有通信功能、业务处理功能的电子设备。客户端1200可以是移动终端，例如手机、便携式电脑、平板电脑、掌上电脑等等。在一个例子中，客户端1200是安装有提供拼车服务的拼车应用(APP)，可以支持有拼车需求的用户发布自身的拼车信息，例如，通过车辆出行的车主发布自身的行车信息，拼车的乘客发布自身的出行需求等，并且可以为匹配的车主和乘客提供拼车路线，触发车主以及乘客根据该拼车路线的指示，车主驾驶车辆在拼车起点接取由步行或者自行车骑行到达拼车起点的乘客，途径拼车终点分送拼车的乘客后，到达车主的终点，实现拼车出行。车主的车辆不局限与车主的私家车辆，还可以是车主通过分时租赁获取的租赁车辆等，该车辆可以是二座以上的小型车、小巴车、大巴车、旅游车等。
如图1所示，客户端1200可以包括处理器1210、存储器1220、接口装置1230、通信装置1240、显示装置1250、输入装置1260、扬声器1270、麦克风1280，等等。其中，处理器1210可以是中央处理器CPU、微处理器MCU等。存储器1220例如包括ROM(只读存储器)、RAM(随机存取存储器)、诸如硬盘的非易失性存储器等。接口装置1230例如包括USB接口、耳机接口等。通信装置1240例如能够进行有线或无线通信。显示装置1250例如是液晶显示屏、触摸显示屏等。输入装置1260例如可以包括触摸屏、键盘 等。用户可以通过扬声器1270和麦克风1280输入/输出语音信息。
通信网络1300可以是无线网络也可以网络，可以是局域网也可以是广域网。在图1所示的系统1000中，客户端1200-1、1200-2、1200-3、1200-4以及网页服务器1100可以通过通信网络1300进行通信。
图1所示的系统1000仅是解释性的，并且决不是为了要限制本发明、其应用或用途。应用于本发明的实施例中，服务器1100的所述存储器1120用于存储可执行的指令，所述处理器1110用于根据所述指令的控制，运行所述服务器1100，以执行本发明实施例中提供的任意一项拼车路线的提供方法。
客户端1200的所述存储器1220用于存储可执行的指令，所述处理器1210用于根据所述指令的控制，运行所述客户端1200，以执行本发明实施例提供的任意一项拼车路线的提供方法。
本领域技术人员应当理解，尽管在图1中对服务器1100以及客户端1200都示出了多个装置，但是，本发明可以仅涉及其中的部分装置，例如，服务器1100只涉及处理器1110和存储装置1120，或者客户端1200只涉及处理器1210和存储装置1220等。技术人员可以根据本发明所公开方案设计指令。指令如何控制处理器进行操作，这是本领域公知，故在此不再详细描述。
<第一实施例>
在本实施例中，提供一种拼车路线的提供方法，用于为通过车辆出行的车主以及具有出行需求的乘客提供拼车路线。
该车辆是可以提供多人共乘的机动车辆，例如，可以是二座以上的小型车、小巴车、大巴车、旅游车等。
该车主可以是用于通过该车辆出行权利的人员，可以是该车辆的所有者也可以是该车辆的租用者，例如，可以是通过分时租赁该车辆的租车者。
所述拼车路线的提供方法，如图2所示，包括：
步骤S2100，获取车主的行车信息、交通地理信息以及多个乘客的出行需求。
具体地，所述行车信息是所述车主驾驶车辆出行的相关信息，至少包括行车起点、行车终点、行车时间、提供的拼车座位数。行车时间可以包括车主的出发时间、预计结束行程的时间，或者是租赁车辆的付费时间段等。所述行车起点、行车终点可以是对应的地理位置的唯一名称信息、唯一标识或者地理位置坐标数据。
行车信息还可以包括行驶备注信息，所述行驶备注信息至少包括车辆类型、车辆里程、车主驾龄以及里程收费其中之一。车辆类型是出行车辆的属性类型，可以根据车辆的性能或者舒服度区分，例如，可以将车辆根据舒适度区分为普通型、舒适型或奢华型等。车辆里程是出行车辆已经行驶的里程。车主驾龄是驾驶出行车辆的司机已驾驶车辆的年限。所述里程收费是车主收取拼车乘客的每单位里程的拼车费用。
交通地理信息至少包括交通地图。所述交通地图包括覆盖对应出行区域的地图，可以是预先存储在实施本实施例的设备本地存储中，也可以通过现有的地图应用提供的接口进行调用获取对应提供的地图，还可以获取不同出行方式下的路线组合、实时路况信息等，该出行方式包括乘坐公共交通、自行车骑行、步行、自驾出行等。
所述交通地理信息还可以包括历史交通数据，所述历史交通数据包括历史拥堵数据、历史拼车热点数据其中之一。所述历史拥堵数据是根据历史数据统计的所述交通地图上可出行的交通路线的每个时段的拥堵状态的数据；所述历史拼车热点数据是根据历史数据统计的作为拼车起点或者拼车终点的拼车热点的地理位置的数据，拼车热点可以是某个地铁站口、停车场、公交站、自行车停靠点、出租车候车点、便于等车的路口等，该历史拼车热点数据可以包括拼车热点的唯一名称信息、地理坐标数据或者地理标识等。
所述交通地理信息还可以包括共享自行车的地理分布，所述共享自行车的地理分布包括所述共享自行车的停靠点以及可用数量。
所述共享自行车是可以提供分时租赁骑行服务的自行车，包括人力自行车、助力自行车、电动自行车等。
出行需求至少包括乘客的出发地、目的地、出发时间。所述出发地、 目的地可以是对应的地理位置的唯一名称信息、唯一标识或者地理位置坐标数据。
所述出行需求还可以包括出行偏好信息，所述出行偏好信息用于描述对应的乘客在拼车出行时的偏好，至少包括车辆类型、拼车方式、里程收费其中之一。车辆类型是对应的乘客期望拼车出行的车辆类型，与上述行驶备注信息中的车辆类型对应，在此不再赘述。拼车方式是对应的乘客愿意接受的拼车方式，包括愿意采用何种出行方式从出发地到达对应的拼车起点以及从拼车终点到达目的地。里程收费是对应的乘客期望的拼车出行的单位里程的收费。
在本实施例中，可以通过面向车主以及乘客的客户端提供人机交互界面，供车主输入对应行车信息以及供乘客输入对应的出行需求，以此获取车主的行车信息和乘客的出行需求。
步骤S2200，根据所述行车信息以及所述交通地理信息，在所述行车起点与所述行车终点之间选取多个候选停靠点，得到包含所述多个候选停靠点的候选停靠点集合。
具体地，所述选取候选停靠点的步骤，可以如图3所示，包括：
步骤S2210，根据所述交通地理信息，在所述行车起点到行车终点之间以预设的地理距离划分多个候选停靠区域。
该预设的地理距离，可以根据具体的应用场景或者工程经验设置。
具体地，可以根据交通地理信息中交通地理地图，获取行车起点去往行车终点的行车路线，以预设的地理距离逐一分段，取每段的中心位置作为中心，以预设的地理距离作为直径划分得到圆形或矩形的候选停靠区域。
在一个例子中，可以根据所述交通地理信息在划分的候选停靠区域滤除不适当的候选停靠区域，例如，人流密集不适合车辆停靠的区域，或者不适合乘客通过自行车骑行、步行等方式到达的区域；或者，可以根据所述交通地理信息在划分的候选起点区域中，只保留与历史拼车热点数据相关的候选停靠区域，例如，包括地铁站口、停车场、公交站、自行车停靠点、出租车候车点、便于等车的路口的候选停靠区域。
步骤S2220，在每个候选停靠区域中，至少选取一个允许所述车辆停 靠的地点作为候选停靠起点，以得到多个所述候选停靠点。
具体地，可以根据所述交通地理信息中包括的历史拼车热点数据，选择所述候选停靠区域中的拼车热点作为候选停靠点，例如，地铁站口、停车场、公交站、自行车停靠点、出租车候车点、便于等车的路口等。或者，还可以根据应用场景选择，例如，可以选择候选停靠区域中的共享自行车的可用数量大于预设数量的自行车停靠点附近可以停靠车辆的地点，该预设数量可以根据实际应用需求设置。
获取多个候选停靠点，可以用于在候选的步骤中选取候选乘客、构建多条候选拼车路线，从而可以选择拼车成本最小的拼车路线提供给车主和对应的乘客，实现拼车出行，提高车辆出行的满座率，有效利用交通资源，提高出行效率。尤其适用分时租赁车辆出行的应用场景。
步骤S2300，根据所述行车信息、所述交通地理信息以及所述候选停靠点集合，遍历已获取的所述多个出行需求，构建多条所述候选拼车路线，并计算获取每条所述候选拼车路线的拼车成本。
其中，所述候选拼车路线包括每个候选乘客的拼车起点、拼车终点以及拼车方式；所述拼车起点是所述行车起点或者所述候选停靠点集中的一个所述候选停靠点；所述拼车终点是所述行车终点或者所述候选停靠点集中的一个所述候选停靠点；所述拼车方式包括所述候选乘客从出发地到达所述拼车起点的出行方式、所述候选乘客从所述拼车终点到达目的地的出行方式；所述出行方式至少包括步行和自行车骑行；所述拼车成本至少包括拼车时长、拼车距离、拼车费用三者其中之一。
具体地，所述获取多条所述候选拼车路线的步骤，可以如图4所示，包括：
步骤S2311，分别以所述行车起点以及每一个所述候选停靠点作为候选拼车起点，遍历已获取的多个所述出行需求，选取符合拼车条件的乘客，得到多个候选乘客；
其中，所述拼车条件至少包括所述出发地与所述候选拼车起点的距离在预设距离范围内、所述目的地与所述行车终点或者所述候选拼车起点后序的所述候选停靠点的距离在预设距离范围内并且所述出发时间与所述行 车时间匹配；
所述预设距离范围可以根据具体的应用场景或者工程经验值设置，例如，在乘客支持通过自行车骑行从出发地到达拼车起点或者从拼车终点到达目的地时，预设距离范围可以设置距离不大于3公里；
所述出发时间与所述行车时间匹配，并不是限制乘客的出发时间必须与车主的行车时间完全相同，例如，乘客可以在车主驾驶车辆的行程中途开始拼车，只要确保车主驾驶车辆到达乘客的拼车起点的时间与乘客期望的出发时间相匹配即可。
拼车条件还可以包括其他信息匹配，例如行驶备注信息中的车辆类型与出行需求中的车辆类型匹配、行驶备注信息中的里程收费与出行需求中的里程收费匹配、车主驾龄与乘客的要求符合等等。
步骤S2312，从已获取的多个候选乘客中，构建多个候选乘客集合，
其中，每个所述候选乘客集合中的候选乘客数目不超过所述拼车座位数。
步骤S2313，对每个所述候选乘客集合，构建对应的所述候选拼车路线，得到多条所述候选拼车路线。
以下将举例进一步说明如图4所示的构建候选拼车路线的步骤：
假设车主D的行车起点是D_s、行车终点是D_e、行车时间是D_t、以及拼车座位数为3，根据D_s和D_e，以图3所示的方法得到候选P个依次排序候选停靠点，Ps p(p∈{1,2,3,...,P})，预设距离范围为不大于3公里；
假设共有K位乘客U k(k∈{1,2,3,...,K})发布了出行需求，每个乘客的出行需求中包括出发地是U k_s、目的地是U k_e、出发时间是U k_t，可以遍历K位乘客的出行需求，得到U k_s与D_s或者某一个Ps i的距离不大于3公里、并且U k_e与D_s或者Ps j(i<j≤P)的距离不大于3公里、U k_t与D_t匹配的N个候选乘客U n(n∈{1,2,3,...,N})，并且每个候选乘客具有对应的拼车起点是与其出发地距离小于3公里的D_s或者某一个Ps i，拼车终点是与其目的地距离小于3公里的D_s或者Ps j(i<j≤P)；
从N个候选乘客中任意选择1至3个候选乘客构建候选乘客集合：
{U 1},{U 2},...,{U N}
{U 1,U 2},{U 1,U 3},...,{U 1,U N}
{U 2,U 3},{U 2,U 4}...,{U 2,U N}
.......
{U N-1,U N}
{U 1,U 2,U 3},{U 1,U 3,U 4},...,{U 1,U N-1,U N}
{U 2,U 3,U 4},{U 2,U 4,U 5},...,{U 2,U N-1,U N}
……
{U N-2,U N-1,U N}
对每个所述候选乘客集合，可以构建得到对应的候选拼车路线，得到多条所述候选拼车路线，以上述候选乘客集合{U 1,U 2,U 3}为例，假设候选乘客U 1的拼车起点是Ps 1、拼车终点是D_e、通过自行车骑行从出发地U 1_s到达拼车起点Ps 1，拼车终点D_e与其目的地U 1_e相同；乘客U 2的拼车起点是D_s、拼车终点是Ps 2，通过自行车骑行从出发地U 2_s到达拼车起点D_s，从拼车终点Ps 2通过自行车骑行到达其目的地U 2_e；乘客U 3的拼车起点是Ps 1、拼车终点是Ps 3，其出发地U 3_s与拼车起点Ps 1相同，从拼车终点Ps 3通过自行车骑行到达其目的地U 3_e，得到的候选拼车路线如图5所示：
对于车主D：驾驶车辆从D_s途径Ps 1、Ps 2、Ps 3到达D_e；
对于乘客U 1：通过自行车骑行从U 1_s到达Ps 1，从Ps 1乘坐车辆到达U 1_e；
对于乘客U 2：通过自行车骑行从U 2_s到达D_s，从D_s乘坐车辆到达Ps 2，从Ps 2通过自行车骑行到达U 2_e；
对于乘客U 3：从U 3_s乘坐车辆到达Ps 3,从Ps 3通过自行车骑行到达其U 3_e。
以此类推，对于其他候选乘客集，可以得到对应的候选拼车路线。
在获取多条候选拼车路线后，计算获取每条所述候选拼车路线的出行成本的步骤，可以如图6所示，包括：
步骤S2321，分别对每个候选乘客，根据对应的出行需求和所述交通地理信息，计算得到该候选拼车路线下的所述拼车成本，
其中，所述候选乘客的拼车成本包括以对应的拼车方式从所述出发地达到对应的所述拼车起点、从所述拼车起点到达所述拼车终点以及从所述 拼车终点到达所述目的地的拼车成本；
步骤S2322，对所述车主，根据对应的行车信息和所述交通地理信息，计算得到该候选拼车路线下的所述拼车成本，
其中，所述车主的拼车成本是所有所述候选乘客的拼车成本之和减去所述车主的行车成本，所述车主的行车成本包括从所述行车起点途径所述候选拼车路线涉及的所述拼车起点、所述拼车终点到达所述行车终点的行车成本，所述行车成本至少包括行车时长、行车距离、行车费用三者其中之一；
步骤S2323，根据所述车主以及所述候选乘客在该候选拼车路线下的拼车车本，计算得到该候选拼车路线的拼车成本。
继续以上述候选乘客集合{U 1,U 2,U 3}对应的候选拼车路线举例说明。
对于乘客U 1，假设拼车成本是拼车时长，其拼车时长包括通过自行车骑行从U 1_s到达Ps 1的时长以及从Ps 1乘坐车辆到达U 1_e的时长，可以通过交通地理信息获取骑行距离、乘车距离，将骑行距离除以预估骑行时速得到骑行时长，乘车距离除以预估行驶时速得到乘车时长，将骑行时长与乘车时长求和得到拼车时长
Figure PCTCN2018098641-appb-000001
假设拼车成本是拼车距离，可以通过交通地理信息获取乘客U 1骑行距离、乘车距离，求和得到拼车距离
Figure PCTCN2018098641-appb-000002
假设拼车成本是拼车费用，可以通过交通地理信息中交通地图获取乘客U 1骑行距离、乘车距离，分别根据骑行距离预估骑行费用、根据乘车距离以及里程费用计算乘车费用，求和得到拼车费用
Figure PCTCN2018098641-appb-000003
对于乘客U 2、乘客U 3，计算拼车成本的方法与乘客U 1类似，可以得到乘客U 2的拼车时长
Figure PCTCN2018098641-appb-000004
拼车距离
Figure PCTCN2018098641-appb-000005
拼车费用
Figure PCTCN2018098641-appb-000006
乘客U 3的拼车时长
Figure PCTCN2018098641-appb-000007
拼车距离
Figure PCTCN2018098641-appb-000008
拼车费用
Figure PCTCN2018098641-appb-000009
在此不再赘述。
对于车主D，其行车路线是驾驶车辆从D_s途径Ps 1、Ps 2、Ps 3到达D_e，可以通过交通地理信息获取对应的行车距离
Figure PCTCN2018098641-appb-000010
行车时长
Figure PCTCN2018098641-appb-000011
可以根据行车距离除以由交通地理信息中的历史交通数据预估的行车时速计算得到，行车费用
Figure PCTCN2018098641-appb-000012
可以包括车主驾驶车辆行驶行车距离
Figure PCTCN2018098641-appb-000013
的油耗以及路桥费等相关交通费用、分时租赁车辆的租赁费用等；
对应地，车主D的拼车时长为
Figure PCTCN2018098641-appb-000014
拼车距离为
Figure PCTCN2018098641-appb-000015
拼车费用为
Figure PCTCN2018098641-appb-000016
在获取乘客U 1、乘客U 2、乘客U 3和车主D在该条候选拼车路线下拼车成本后，进行累加，就能得到该候选拼车路线的拼车成本，例如，假设拼车成本以拼车费用计算时，可以得到该候选拼车路线的拼车成本为：
Figure PCTCN2018098641-appb-000017
应当理解的是，在某些应用场景中，为了更好地贴合车主或乘客的需求，拼车成本的计算会更为复杂，例如拼车成本需要综合考虑拼车距离、拼车时间以及拼车费用，可以通过为车距离、拼车时间以及拼车费用设置对应不同的权重来实现出行成本的综合计算，而在本实施例公开了上述计算候选拼车路线的拼车成本的例子后，本领域技术人员可以无需任何创造性进行改进，以适用于成本需要综合考虑出行距离、出行时间以及出行花费或者更多信息的场景。
此外，对于车主或者乘客可以设置不同的优先级，在本实施例公开了上述计算候选拼车路线的拼车成本的例子后，本领域技术人员可以无需任何创造性进行改进，很容易想到，在累加求取候选拼车路线的出行成本时，可以根据车主或乘客的拼车优先级设置不同的优先级权重，分别乘以对应的拼车成本，来累加计算该拼车路线下的出行成本。
通过构建多条候选拼车路线并计算对应的拼车成本，使得在后续步骤中可以选择拼车成本最小的拼车路线提供给司机和对应的乘客，实现拼车出行，提高车辆出行的满座率，有效利用交通资源，提高出行效率。尤其适用分时租赁车辆出行的应用场景。
步骤S2400，选取拼车成本最小的候选拼车路线作为拼车路线，并将所述拼车路线提供给车主和对应的乘客，以触发车主和所述乘客根据所述拼车路线实现拼车出行。
选取拼车成本最小的候选拼车路线作为拼车路线，提供给车主和对应的乘客，提高车辆出行的满座率，有效利用交通资源，提高出行效率。尤其适用分时租赁车辆出行的应用场景。
在本实施例中，可以通过客户端的人机交互界面将拼车路线提供给车主和对应的乘客，例如，对车主，可以展示从车主的行车起点途径乘客的拼车起点、拼车终点到达行车终点的路线以及预计行车时间等；对于乘客，可以展示以哪种出行方式从出发地到达拼车起点、车辆预计什么时间点到达拼车起点以及拼车终点、以哪种出行方式从拼车终点到达目的地等等。
在本实施例中提供的拼车路线的提供方法还可以包括：
当所述乘客被触发通过自行车骑行从所述出发地到达所述拼车起点，或者被触发通过自行车骑行从所述拼车终点到达对应的所述目的地时，为所述乘客提供共享自行车预约服务。
为乘客提供给共享自行车预约服务，可以使得乘客通过骑行自行车“无缝”地换乘车辆实现拼车出行，提高拼车出行的效率。
<服务器>
在本实施例中，还提供一种服务器200，用于实施本实施例中提供的拼车路线的提供方法，如图7所示，包括存储器210、和处理器220：
存储器210，用于存储可执行的指令；
处理器220，用于根据所述指令的控制，运行所述服务器以执行本实施例中提供的拼车路线的提供方法。
在本实施例中，服务器200可以具有各种实体形式，例如，可以是刀片服务器、云端服务器等，或者可以是由多台服务器组成的服务器群组。在一个例子中，服务器200可以是如图1所示的服务器1100。
本领域技术人员应当明白，可以通过各种方式来实现服务器200。例如，可以通过指令配置处理器来实现服务器200。例如，可以将指令存储在ROM中，并且当启动设备时，将指令从ROM读取到可编程器件中来实现服务器200。例如，可以将服务器200固化到专用器件(例如ASIC)中。可以将服务器200分成相互独立的单元，或者可以将它们合并在一起实现。服务器200可以通过上述各种实现方式中的一种来实现，或者可以通过上述各种实现方式中的两种或更多种方式的组合来实现。
以上已经结合附图描述了本实施例中提供的拼车路线的提供方法及服务器，根据本实施例，可以选择拼车成本最小的拼车路线提供给司机和对应的乘客，实现拼车出行，提高车辆出行的满座率，有效利用交通资源，提高出行效率。尤其适用分时租赁车辆出行的应用场景。
<第二实施例>
<方法>
在本实施例中提供一种拼车路线的提供方法，用于为通过车辆出行的车主以及具有出行需求的乘客提供拼车路线，如图8所示，包括：
步骤S3100，提供行车信息发布界面，以供所述车主发布行车信息。
其中，所述行车信息至少包括行车起点、行车终点、行车时间、提供的拼车座位数；所述行车信息在第一实施例中已详细描述，在此不再赘述。
所述行车信息发布界面是可供用户执行点击操作、文本或语音输入操作的人机交互界面，可以通过响应于用户的操作获取作为车主的用户发布的行车信息，以配合实施第一实施例中拼车路线的提供方法。
步骤S3200，提供出行需求发布界面，以供所述乘客发布出行需求；
其中，所述出行需求至少包括乘客的出发地、目的地、出发时间；所述出行需求在在第一实施例中已详细描述，在此不再赘述。
所述出行需求发布界面是可供用户执行点击操作、文本或语音输入操作的人机交互界面，可以通过响应于用户的操作获取作为乘客的用户发布的出行需求，以配合实施第一实施例中拼车路线的提供方法。
步骤S3300，提供拼车路线展示界面，以供所述车主和对应的所述乘客通过展示获取对应的拼车路线，
其中，所述拼车路线根据第一实施例中的方法实施后提供，所述拼车路线包括每个所述乘客的拼车起点、拼车终点以及拼车方式；所述拼车方式包括所述候选乘客从出发地到达所述拼车起点的出行方式和所述候选乘客从所述拼车终点到达目的地的出行方式；所述出行方式至少包括步行和自行车骑行。
所述拼车路线展示界面是可供用户执行点击操作、缩放操作的人机交 互界面，可以通过响应于用户的相关操作，可以向用户展示对应的拼车路线，配合第一实施例中的拼车路线的提供方法实施拼车路线的提供。
<客户端>
在本实施例中，还提供一种客户端300，用于实施本实施例中提供的拼车路线的提供方法，如图9所示，包括存储器310、和处理器320：
存储器310，用于存储可执行的指令；
处理器320，用于根据所述指令的控制，运行所述服务器以执行本实施例中提供的拼车路线的提供方法。
在本实施例中，客户端300可以具有各种实体形式，例如，可以手机、掌上电脑、平板电脑、台式计算机等。在一个例子中，客户端300可以是如图1所示的服务器1200。
本领域技术人员应当明白，可以通过各种方式来实现客户端300。例如，可以通过指令配置处理器来实现客户端300。例如，可以将指令存储在ROM中，并且当启动设备时，将指令从ROM读取到可编程器件中来实现客户端300。例如，可以将客户端300固化到专用器件(例如ASIC)中。可以将客户端300分成相互独立的单元，或者可以将它们合并在一起实现。客户端300可以通过上述各种实现方式中的一种来实现，或者可以通过上述各种实现方式中的两种或更多种方式的组合来实现。
以上已经结合附图描述了本实施例中提供的拼车路线的提供方法及服务器，根据本实施例，可以将拼车成本最小的拼车路线提供给司机和对应的乘客，实现拼车出行，提高车辆出行的满座率，有效利用交通资源，提高出行效率。尤其适用分时租赁车辆出行的应用场景。
<第三实施例>
在本实施例中，提供一种拼车系统400，用于为通过车辆出行的车主以及具有出行需求的乘客提供拼车路线，如图10所示，包括：
至少一个第一实施例中提供的服务器200；
多个如第二实施例中提供的客户端300。
通过本实施例中提供的拼车系统400，通过车辆出行的车主可以通过客户端300提供的行车信息发布界面发布行车信息，有出行需求的乘客都可以通过客户端300提供的提供出行需求发布界面发布出行需求；
客户端300响应于车主、乘客的操作获取得到对应的行车信息、出行需求后，发送给服务器200；服务器200根据第一实施例中的拼车路线的提供方法，为车主和对应的乘客提供拼车成本最小的拼车路线，并分别发送给车主和对应乘客的客户端300，使得客户端300可以通过拼车路线展示界面，将拼车路线提供给车主和对应乘客。
在本实施例中，拼车系统400可以具有多种实体形式，具体的一个例子中，拼车系统400可以如图1所示的系统1000。
以上已经结合附图描述了本实施例中提供的拼车系统，根据本实施例，可以将拼车成本最小的拼车路线提供给司机和对应的乘客，实现拼车出行，提高车辆出行的满座率，有效利用交通资源，提高出行效率。尤其适用分时租赁车辆出行的应用场景。
本领域技术人员公知的是，随着诸如大规模集成电路技术的电子信息技术的发展和软件硬件化的趋势，要明确划分计算机系统软、硬件界限已经显得比较困难了。因为，任何操作可以软件来实现，也可以由硬件来实现。任何指令的执行可以由硬件完成，同样也可以由软件来完成。对于某一机器功能采用硬件实现方案还是软件实现方案，取决于价格、速度、可靠性、存储容量、变更周期等非技术性因素。因此，对于电子信息技术领域的普通技术人员来说，更为直接和清楚地描述一个技术方案的方式是描述该方案中的各个操作。在知道所要执行的操作的情况下，本领域技术人员可以基于对所述非技术性因素的考虑直接设计出期望的产品。
本发明可以是系统、方法和/或计算机程序产品。计算机程序产品可以包括计算机可读存储介质，其上载有用于使处理器实现本发明的各个方面的计算机可读程序指令。
计算机可读存储介质可以是可以保持和存储由指令执行设备使用的 指令的有形设备。计算机可读存储介质例如可以是――但不限于――电存储设备、磁存储设备、光存储设备、电磁存储设备、半导体存储设备或者上述的任意合适的组合。计算机可读存储介质的更具体的例子(非穷举的列表)包括：便携式计算机盘、硬盘、随机存取存储器(RAM)、只读存储器(ROM)、可擦式可编程只读存储器(EPROM或闪存)、静态随机存取存储器(SRAM)、便携式压缩盘只读存储器(CD-ROM)、数字多功能盘(DVD)、记忆棒、软盘、机械编码设备、例如其上存储有指令的打孔卡或凹槽内凸起结构、以及上述的任意合适的组合。这里所使用的计算机可读存储介质不被解释为瞬时信号本身，诸如无线电波或者其他自由传播的电磁波、通过波导或其他传输媒介传播的电磁波(例如，通过光纤电缆的光脉冲)、或者通过电线传输的电信号。
这里所描述的计算机可读程序指令可以从计算机可读存储介质下载到各个计算/处理设备，或者通过网络、例如因特网、局域网、广域网和/或无线网下载到外部计算机或外部存储设备。网络可以包括铜传输电缆、光纤传输、无线传输、路由器、防火墙、交换机、网关计算机和/或边缘服务器。每个计算/处理设备中的网络适配卡或者网络接口从网络接收计算机可读程序指令，并转发该计算机可读程序指令，以供存储在各个计算/处理设备中的计算机可读存储介质中。
用于执行本发明操作的计算机程序指令可以是汇编指令、指令集架构(ISA)指令、机器指令、机器相关指令、微代码、固件指令、状态设置数据、或者以一种或多种编程语言的任意组合编写的源代码或目标代码，所述编程语言包括面向对象的编程语言—诸如Smalltalk、C++等，以及常规的过程式编程语言—诸如“C”语言或类似的编程语言。计算机可读程序指令可以完全地在用户计算机上执行、部分地在用户计算机上执行、作为一个独立的软件包执行、部分在用户计算机上部分在远程计算机上执行、或者完全在远程计算机或服务器上执行。在涉及远程计算机的情形中，远程计算机可以通过任意种类的网络—包括局域网(LAN)或广域网(WAN)—连接到用户计算机，或者，可以连接到外部计算机(例如利用因特网服务提供商来通过因特网连接)。在一些实施例中，通过利用计算机可读程序指令 的状态信息来个性化定制电子电路，例如可编程逻辑电路、现场可编程门阵列(FPGA)或可编程逻辑阵列(PLA)，该电子电路可以执行计算机可读程序指令，从而实现本发明的各个方面。
这里参照根据本发明实施例的方法、装置(系统)和计算机程序产品的流程图和/或框图描述了本发明的各个方面。应当理解，流程图和/或框图的每个方框以及流程图和/或框图中各方框的组合，都可以由计算机可读程序指令实现。
这些计算机可读程序指令可以提供给通用计算机、专用计算机或其它可编程数据处理装置的处理器，从而生产出一种机器，使得这些指令在通过计算机或其它可编程数据处理装置的处理器执行时，产生了实现流程图和/或框图中的一个或多个方框中规定的功能/动作的装置。也可以把这些计算机可读程序指令存储在计算机可读存储介质中，这些指令使得计算机、可编程数据处理装置和/或其他设备以特定方式工作，从而，存储有指令的计算机可读介质则包括一个制造品，其包括实现流程图和/或框图中的一个或多个方框中规定的功能/动作的各个方面的指令。
也可以把计算机可读程序指令加载到计算机、其它可编程数据处理装置、或其它设备上，使得在计算机、其它可编程数据处理装置或其它设备上执行一系列操作步骤，以产生计算机实现的过程，从而使得在计算机、其它可编程数据处理装置、或其它设备上执行的指令实现流程图和/或框图中的一个或多个方框中规定的功能/动作。
附图中的流程图和框图显示了根据本发明的多个实施例的系统、方法和计算机程序产品的可能实现的体系架构、功能和操作。在这点上，流程图或框图中的每个方框可以代表一个模块、程序段或指令的一部分，所述模块、程序段或指令的一部分包含一个或多个用于实现规定的逻辑功能的可执行指令。在有些作为替换的实现中，方框中所标注的功能也可以以不同于附图中所标注的顺序发生。例如，两个连续的方框实际上可以基本并行地执行，它们有时也可以按相反的顺序执行，这依所涉及的功能而定。也要注意的是，框图和/或流程图中的每个方框、以及框图和/或流程图中的方框的组合，可以用执行规定的功能或动作的专用的基于硬件的系统来 实现，或者可以用专用硬件与计算机指令的组合来实现。对于本领域技术人员来说公知的是，通过硬件方式实现、通过软件方式实现以及通过软件和硬件结合的方式实现都是等价的。
以上已经描述了本发明的各实施例，上述说明是示例性的，并非穷尽性的，并且也不限于所披露的各实施例。在不偏离所说明的各实施例的范围和精神的情况下，对于本技术领域的普通技术人员来说许多修改和变更都是显而易见的。本文中所用术语的选择，旨在最好地解释各实施例的原理、实际应用或对市场中的技术改进，或者使本技术领域的其它普通技术人员能理解本文披露的各实施例。本发明的范围由所附权利要求来限定。

Claims (10)

  1. 一种拼车路线的提供方法，用于为通过车辆出行的车主以及具有出行需求的乘客提供拼车路线，所述方法包括：
    获取车主的行车信息、交通地理信息以及多个乘客的出行需求,
    其中，所述行车信息至少包括行车起点、行车终点、行车时间、提供的拼车座位数，所述交通地理信息至少包括交通地图，所述出行需求至少包括乘客的出发地、目的地、出发时间；
    根据所述行车信息以及所述交通地理信息，在所述行车起点与所述行车终点之间选取多个候选停靠点，得到包含所述多个候选停靠点的候选停靠点集合；
    根据所述行车信息、所述交通地理信息以及所述候选停靠点集合，遍历已获取的所述多个出行需求，构建多条所述候选拼车路线，并计算获取每条所述候选拼车路线的拼车成本；
    其中，所述候选拼车路线包括每个候选乘客的拼车起点、拼车终点以及拼车方式；所述拼车起点是所述行车起点或者所述候选停靠点集中的一个所述候选停靠点；所述拼车终点是所述行车终点或者所述候选停靠点集中的一个所述候选停靠点；所述拼车方式包括所述候选乘客从出发地到达所述拼车起点的出行方式、所述候选乘客从所述拼车终点到达目的地的出行方式；所述出行方式至少包括步行和自行车骑行；所述拼车成本至少包括拼车时长、拼车距离、拼车费用三者其中之一；
    选取拼车成本最小的候选拼车路线作为拼车路线，并将所述拼车路线提供给车主和对应的乘客，以触发车主和所述乘客根据所述拼车路线实现拼车出行。
  2. 根据权利要求1所述的方法，其特征在于，所述选取候选停靠点的步骤包括：
    根据所述交通地理信息，在所述行车起点到行车终点之间以预设的地 理距离划分多个候选停靠区域；
    在每个候选停靠区域中，至少选取一个允许所述车辆停靠的地点作为候选停靠起点，以得到多个所述候选停靠点。
  3. 根据权利要求1或2所述的方法，其特征在于，所述获取多条所述候选拼车路线的步骤包括：
    分别以所述行车起点以及每一个所述候选停靠点作为候选拼车起点，遍历已获取的多个所述出行需求，选取符合拼车条件的乘客，得到多个候选乘客；
    其中，所述拼车条件至少包括所述出发地与所述候选拼车起点的距离在预设距离范围内、所述目的地与所述行车终点或者所述候选拼车起点后序的所述候选停靠点的距离在预设距离范围内并且所述出发时间与所述行车时间匹配；
    从已获取的多个候选乘客中，构建多个候选乘客集合，
    其中，每个所述候选乘客集合中的候选乘客数目不超过所述拼车座位数；
    对每个所述候选乘客集合，构建对应的所述候选拼车路线，得到多条所述候选拼车路线。
  4. 根据权利要求1-3任意一项所述的方法，其特征在于，所述计算获取每条所述候选拼车路线的拼车成本的步骤包括：
    分别对每个候选乘客，根据对应的出行需求和所述交通地理信息，计算得到该候选拼车路线下的所述拼车成本，
    其中，所述候选乘客的拼车成本包括以对应的拼车方式从所述出发地达到对应的所述拼车起点、从所述拼车起点到达所述拼车终点以及从所述拼车终点到达所述目的地的拼车成本；
    对所述车主，根据对应的行车信息和所述交通地理信息，计算得到该候选拼车路线下的所述拼车成本，
    其中，所述车主的拼车成本是所有所述候选乘客的拼车成本之和减去 所述车主的行车成本，所述车主的行车成本包括从所述行车起点途径所述候选拼车路线涉及的所述拼车起点、所述拼车终点到达所述行车终点的行车成本，所述行车成本至少包括行车时长、行车距离、行车费用三者其中之一；
    根据所述车主以及所述候选乘客在该候选拼车路线下的拼车车本，计算得到该候选拼车路线的拼车成本。
  5. 根据权利要求1-4任意一项所述的方法，其特征在于，
    所述交通地理信息还包括共享自行车的地理分布，所述共享自行车的地理分布包括所述共享自行车的停靠点以及可用数量；
    和/或
    当所述乘客被触发通过自行车骑行从所述出发地到达所述拼车起点，或者被触发通过自行车骑行从所述拼车终点到达对应的所述目的地时，为所述乘客提供共享自行车预约服务。
  6. 根据权利要求1-5任意一项所述的方法，其特征在于，
    所述交通地理信息还包括历史交通数据，所述历史交通数据包括历史拥堵数据、历史拼车热点数据其中之一；
    和/或
    所述行车信息还包括行驶备注信息，所述行驶备注信息至少包括车辆类型、车辆里程、车主驾龄以及里程收费其中之一；所述出行需求还包括出行偏好信息，所述出行偏好信息至少包括车辆类型、拼车方式、里程收费其中之一。
  7. 一种拼车路线的提供方法，用于为通过车辆出行的车主以及具有出行需求的乘客提供拼车路线，包括：
    提供行车信息发布界面，以供所述车主发布行车信息，
    其中，所述行车信息至少包括行车起点、行车终点、行车时间、提供的拼车座位数；
    提供出行需求发布界面，以供所述乘客发布出行需求，
    其中，所述出行需求至少包括乘客的出发地、目的地、出发时间；
    提供拼车路线展示界面，以供所述车主和对应的所述乘客通过展示获取对应的拼车路线，
    其中，所述拼车路线根据如权利要求1-6任意一项所述的方法提供，所述拼车路线包括每个所述乘客的拼车起点、拼车终点以及拼车方式；所述拼车方式包括所述候选乘客从出发地到达所述拼车起点的出行方式和所述候选乘客从所述拼车终点到达目的地的出行方式；所述出行方式至少包括步行和自行车骑行。
  8. 一种服务器，通过车辆出行的车主以及具有出行需求的乘客提供拼车路线，包括：
    存储器，用于存储可执行的指令；
    处理器，用于根据所述指令的控制，运行所述服务器以执行如权利要求1-6所述的拼车路线的提供方法。
  9. 一种客户端，通过车辆出行的车主以及具有出行需求的乘客提供拼车路线，包括：
    存储器，用于存储可执行的指令；
    处理器，用于根据所述指令的控制，运行所述服务器以执行如权利要求7所述的拼车路线的提供方法。
  10. 一种拼车系统，通过车辆出行的车主以及具有出行需求的乘客提供拼车路线，包括：
    至少一个如权利要求8所述的服务器；
    多个如权利要求9所述的客户端。
PCT/CN2018/098641 2017-09-20 2018-08-03 拼车路线的提供方法、客户端、服务器及拼车系统 WO2019056874A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201710855209.XA CN107682419B (zh) 2017-09-20 2017-09-20 拼车路线的提供方法、客户端、服务器及拼车系统
CN201710855209.X 2017-09-20

Publications (1)

Publication Number Publication Date
WO2019056874A1 true WO2019056874A1 (zh) 2019-03-28

Family

ID=61137460

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2018/098641 WO2019056874A1 (zh) 2017-09-20 2018-08-03 拼车路线的提供方法、客户端、服务器及拼车系统

Country Status (2)

Country Link
CN (1) CN107682419B (zh)
WO (1) WO2019056874A1 (zh)

Cited By (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110399999A (zh) * 2019-05-08 2019-11-01 腾讯科技（深圳）有限公司 乘车服务处理方法、装置、设备及存储介质
CN111080202A (zh) * 2019-12-13 2020-04-28 拉货宝网络科技有限责任公司 一种面向油量节省的作业车辆的效能管理方法及系统
CN111309009A (zh) * 2020-02-19 2020-06-19 广州小马智行科技有限公司 自动驾驶车辆的控制方法及装置、存储介质和运载工具
CN111882907A (zh) * 2020-06-18 2020-11-03 北京骑胜科技有限公司 交通工具的导航预警方法、装置、设备和存储介质
CN112183791A (zh) * 2020-08-25 2021-01-05 汉海信息技术(上海)有限公司 网约车调度方法、装置、电子设备及存储介质
CN112541135A (zh) * 2020-12-22 2021-03-23 北京百度网讯科技有限公司 信息共享方法、装置、电子设备、存储介质及程序产品
CN112541796A (zh) * 2019-09-23 2021-03-23 北京轻享科技有限公司 一种车辆信息的处理方法及装置
CN113011741A (zh) * 2021-03-18 2021-06-22 摩拜(北京)信息技术有限公司 一种车辆调度方法、装置及电子设备
CN113447038A (zh) * 2021-06-08 2021-09-28 北京百度网讯科技有限公司 路线的生成方法、装置、电子设备和存储介质
CN114595849A (zh) * 2020-12-07 2022-06-07 上海擎感智能科技有限公司 一种拼车方法、装置、终端及计算机可读存储介质
CN114819231A (zh) * 2022-04-06 2022-07-29 深圳市中天地网络通讯技术有限公司 一种基于互联网的智能出行租车方法及系统
CN116307311A (zh) * 2023-01-11 2023-06-23 哈尔滨工业大学 一种顺风车动态换乘系统
CN116578664A (zh) * 2023-07-13 2023-08-11 鱼快创领智能科技(南京)有限公司 车辆行程有向环路图的构建方法、行程预测方法及系统

Families Citing this family (24)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107682419B (zh) * 2017-09-20 2021-01-05 汉海信息技术(上海)有限公司 拼车路线的提供方法、客户端、服务器及拼车系统
JP6969507B2 (ja) * 2018-06-21 2021-11-24 トヨタ自動車株式会社 情報処理装置、情報処理方法及びプログラム
JP7102987B2 (ja) * 2018-07-05 2022-07-20 トヨタ自動車株式会社 情報処理装置、情報処理方法およびプログラム
JP7063172B2 (ja) * 2018-07-31 2022-05-09 トヨタ自動車株式会社 情報処理装置、乗車車両調整方法及び乗車車両調整プログラム
JP7047680B2 (ja) * 2018-09-04 2022-04-05 トヨタ自動車株式会社 情報処理装置、情報処理方法及びプログラム
CN109345036B (zh) * 2018-11-01 2021-03-19 中国联合网络通信集团有限公司 一种共享单车的使用方法和装置
CN109598591A (zh) * 2018-12-10 2019-04-09 福州臻美网络科技有限公司 网络苗木交易中的采购单合并方法及终端、存储介质
CN109615472B (zh) * 2018-12-10 2021-07-09 福州臻美网络科技有限公司 基于苗木交易平台中采购单拼单方法及终端、存储介质
CN111353623B (zh) * 2018-12-21 2024-09-06 阿尔派株式会社 信息管理装置及信息管理方法
JP7032294B2 (ja) 2018-12-26 2022-03-08 本田技研工業株式会社 車両制御装置、車両制御方法、およびプログラム
CN118229385A (zh) * 2018-12-31 2024-06-21 北京嘀嘀无限科技发展有限公司 一种多用户共乘方法及其系统
CN109949068A (zh) * 2019-01-09 2019-06-28 深圳北斗应用技术研究院有限公司 一种基于预测结果的实时拼车方法和装置
JP2021015378A (ja) * 2019-07-10 2021-02-12 トヨタ自動車株式会社 遠隔運転要求処理装置
WO2021012244A1 (en) * 2019-07-25 2021-01-28 Beijing Didi Infinity Technology And Development Co., Ltd. Systems and methods for order dispatching
CN110633815A (zh) * 2019-08-14 2019-12-31 杭州飞步科技有限公司 一种拼车方法和装置、电子设备、存储介质
CN110852827B (zh) * 2019-09-26 2021-11-19 杭州优行科技有限公司 订单处理方法、装置和设备
CN110992122B (zh) * 2019-10-22 2024-05-14 北京交通大学 人到车的网约顺风车匹配方法
CN110991817B (zh) * 2019-11-14 2021-06-18 广东科学技术职业学院 一种路线规划方法、装置及服务器
CN111881227A (zh) * 2020-05-21 2020-11-03 北京嘀嘀无限科技发展有限公司 一种确定拼车订单访问地图的方法和系统
CN112507193A (zh) * 2020-10-30 2021-03-16 长沙市到家悠享网络科技有限公司 数据更新方法、装置、设备和存储介质
CN112561639A (zh) * 2020-12-15 2021-03-26 北京嘀嘀无限科技发展有限公司 拼车服务处理方法、装置、设备及存储介质
CN112541805A (zh) * 2020-12-17 2021-03-23 云南叮功出行科技有限公司 一种拼车订单生成方法、系统、平台及存储介质
CN113191837A (zh) * 2021-04-09 2021-07-30 南京字符路科技有限公司 一种基于虚拟站台的乘客拼车系统
CN113344658A (zh) * 2021-05-25 2021-09-03 深圳依时货拉拉科技有限公司 行程中持续拼车的方法、计算机可读存储介质及计算机设备

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105225472A (zh) * 2015-10-14 2016-01-06 深圳市十方联智科技有限公司 一种拼车方法与设备
CN105678412A (zh) * 2015-12-31 2016-06-15 百度在线网络技术（北京）有限公司 面向多人乘车的路线规划方法和装置
CN106157600A (zh) * 2015-04-24 2016-11-23 北京中坤天朗信息技术有限公司 一种合乘出行调度的方法、相关设备及系统
US20160356615A1 (en) * 2015-06-05 2016-12-08 MuV Technologies, Inc. Scheduled and On-Demand Transportation Management Platform for Rideshare
CN107063285A (zh) * 2017-04-25 2017-08-18 杭州纳戒科技有限公司 同城出行服务实现方法、装置以及系统
CN107682419A (zh) * 2017-09-20 2018-02-09 北京摩拜科技有限公司 拼车路线的提供方法、客户端、服务器及拼车系统

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104616491A (zh) * 2015-02-17 2015-05-13 北京九五智驾信息技术股份有限公司 提供车辆服务的方法
CN104616360A (zh) * 2015-02-17 2015-05-13 北京九五智驾信息技术股份有限公司 拼车服务计费方法及装置
CN104616489A (zh) * 2015-02-17 2015-05-13 北京九五智驾信息技术股份有限公司 提供车辆服务的系统
US20160364823A1 (en) * 2015-06-11 2016-12-15 Raymond Cao Systems and methods for on-demand transportation
CN106441325A (zh) * 2016-02-04 2017-02-22 顾红波 一种联运导航的系统和方法

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106157600A (zh) * 2015-04-24 2016-11-23 北京中坤天朗信息技术有限公司 一种合乘出行调度的方法、相关设备及系统
US20160356615A1 (en) * 2015-06-05 2016-12-08 MuV Technologies, Inc. Scheduled and On-Demand Transportation Management Platform for Rideshare
CN105225472A (zh) * 2015-10-14 2016-01-06 深圳市十方联智科技有限公司 一种拼车方法与设备
CN105678412A (zh) * 2015-12-31 2016-06-15 百度在线网络技术（北京）有限公司 面向多人乘车的路线规划方法和装置
CN107063285A (zh) * 2017-04-25 2017-08-18 杭州纳戒科技有限公司 同城出行服务实现方法、装置以及系统
CN107682419A (zh) * 2017-09-20 2018-02-09 北京摩拜科技有限公司 拼车路线的提供方法、客户端、服务器及拼车系统

Cited By (19)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110399999A (zh) * 2019-05-08 2019-11-01 腾讯科技（深圳）有限公司 乘车服务处理方法、装置、设备及存储介质
CN110399999B (zh) * 2019-05-08 2024-06-04 腾讯科技（深圳）有限公司 乘车服务处理方法、装置、设备及存储介质
CN112541796A (zh) * 2019-09-23 2021-03-23 北京轻享科技有限公司 一种车辆信息的处理方法及装置
CN111080202A (zh) * 2019-12-13 2020-04-28 拉货宝网络科技有限责任公司 一种面向油量节省的作业车辆的效能管理方法及系统
CN111080202B (zh) * 2019-12-13 2023-06-06 拉货宝网络科技有限责任公司 一种面向油量节省的作业车辆的效能管理方法及系统
CN111309009A (zh) * 2020-02-19 2020-06-19 广州小马智行科技有限公司 自动驾驶车辆的控制方法及装置、存储介质和运载工具
CN111309009B (zh) * 2020-02-19 2023-12-15 深圳小马易行科技有限公司 自动驾驶车辆的控制方法及装置、存储介质和运载工具
CN111882907A (zh) * 2020-06-18 2020-11-03 北京骑胜科技有限公司 交通工具的导航预警方法、装置、设备和存储介质
CN112183791A (zh) * 2020-08-25 2021-01-05 汉海信息技术(上海)有限公司 网约车调度方法、装置、电子设备及存储介质
CN114595849A (zh) * 2020-12-07 2022-06-07 上海擎感智能科技有限公司 一种拼车方法、装置、终端及计算机可读存储介质
CN112541135A (zh) * 2020-12-22 2021-03-23 北京百度网讯科技有限公司 信息共享方法、装置、电子设备、存储介质及程序产品
CN113011741A (zh) * 2021-03-18 2021-06-22 摩拜(北京)信息技术有限公司 一种车辆调度方法、装置及电子设备
CN113011741B (zh) * 2021-03-18 2024-03-29 摩拜(北京)信息技术有限公司 一种车辆调度方法、装置及电子设备
CN113447038A (zh) * 2021-06-08 2021-09-28 北京百度网讯科技有限公司 路线的生成方法、装置、电子设备和存储介质
CN114819231A (zh) * 2022-04-06 2022-07-29 深圳市中天地网络通讯技术有限公司 一种基于互联网的智能出行租车方法及系统
CN116307311B (zh) * 2023-01-11 2023-11-21 哈尔滨工业大学 一种顺风车动态换乘系统
CN116307311A (zh) * 2023-01-11 2023-06-23 哈尔滨工业大学 一种顺风车动态换乘系统
CN116578664B (zh) * 2023-07-13 2023-09-26 鱼快创领智能科技(南京)有限公司 车辆行程有向环路图的构建方法、行程预测方法及系统
CN116578664A (zh) * 2023-07-13 2023-08-11 鱼快创领智能科技(南京)有限公司 车辆行程有向环路图的构建方法、行程预测方法及系统

Also Published As

Publication number Publication date
CN107682419A (zh) 2018-02-09
CN107682419B (zh) 2021-01-05

Similar Documents

Publication Publication Date Title
WO2019056874A1 (zh) 拼车路线的提供方法、客户端、服务器及拼车系统
CN107679652B (zh) 共乘路线的规划方法、客户端、服务器及系统
US9689693B2 (en) Systems and methods for learning and displaying customized geographical navigational options
US9534914B1 (en) Cognitive needs-based trip planning
TWI661387B (zh) 用於提供運輸服務資訊的方法和設備
US9534913B2 (en) Systems and methods for simultaneous electronic display of various modes of transportation for viewing and comparing
US11599964B2 (en) Network system to filter requests by destination and deadline
WO2017016517A1 (zh) 确定交通服务费用的方法及系统
US20170191849A1 (en) Parking availability system
JP2019528427A (ja) 経路計画システムおよび方法
US11392861B2 (en) Systems and methods for managing a vehicle sharing facility
US20170092130A1 (en) Automatic selection of parking spaces based on parking space attributes, driver preferences, and vehicle information
CN112384758A (zh) 交通路线选择的多模式方法
EP3676697A1 (en) Multimodal vehicle routing system and method with vehicle parking
JP7245441B2 (ja) 管理システム、管理方法、及び管理プログラム
US20220044344A1 (en) Systems and methods for using ridesharing vehicles and personal transportation vehicles
US20210133908A1 (en) Integrated social networking mobile application with ride sharing program
US11584241B2 (en) Routing and charging of electric powertrain vehicle
JP7280585B2 (ja) 情報処理システム、情報処理プログラムおよび情報処理方法
Zhang et al. Feeder: supporting last-mile transit with extreme-scale urban infrastructure data
EP4187204A1 (en) Method and system for generating a personalized routing graph for use with shared vehicle hubs
US20170254656A1 (en) Optimized route sharing
US20200175431A1 (en) Allocation of Vehicles for Inter-City Rides
AU2018217973A1 (en) Dynamic selection of geo-based service options in a network system
JP6954313B2 (ja) 交通案内システム、交通案内方法、及び、プログラム

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 18858568

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

32PN Ep: public notification in the ep bulletin as address of the adressee cannot be established

Free format text: NOTING OF LOSS OF RIGHTS PURSUANT TO RULE 112(1) EPC (EPO FORM 1205A DATED 08.09.2020)

122 Ep: pct application non-entry in european phase

Ref document number: 18858568

Country of ref document: EP

Kind code of ref document: A1