CN112183889B - Riding route recommendation method and device - Google Patents

Riding route recommendation method and device Download PDF

Info

Publication number
CN112183889B
CN112183889B CN202011158309.5A CN202011158309A CN112183889B CN 112183889 B CN112183889 B CN 112183889B CN 202011158309 A CN202011158309 A CN 202011158309A CN 112183889 B CN112183889 B CN 112183889B
Authority
CN
China
Prior art keywords
route
riding
station
train
riding route
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202011158309.5A
Other languages
Chinese (zh)
Other versions
CN112183889A (en
Inventor
张亚南
成晨
张晴晴
程新洲
吴洋
董润莎
郝若晶
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
China United Network Communications Group Co Ltd
Original Assignee
China United Network Communications Group 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 China United Network Communications Group Co Ltd filed Critical China United Network Communications Group Co Ltd
Priority to CN202011158309.5A priority Critical patent/CN112183889B/en
Publication of CN112183889A publication Critical patent/CN112183889A/en
Application granted granted Critical
Publication of CN112183889B publication Critical patent/CN112183889B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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/00Administration; Management
    • G06Q10/04Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • G06Q10/047Optimisation of routes or paths, e.g. travelling salesman problem

Abstract

The application discloses a riding route recommending method and device, relates to the technical field of traffic, and is used for improving riding experience of passengers. The riding route recommending method comprises the following steps: acquiring route information of a plurality of riding routes; the route information of each riding route comprises the door crowding degree of train doors in the riding route and the total station number of the riding route; the riding route comprises a station entrance, a station exit, a riding train and a train door number; a target riding route is determined among the plurality of riding routes according to the route information of the riding route. According to the method, the target riding route is determined through route information of the riding route, and the target riding route comprises the door number of a train to be ridden. Compared with the prior art that passengers have certain blindness when selecting to ride the carriage and get on from which door, the route recommendation scheme including the train door number of riding can be provided for the passengers, so that the experience of riding the passengers is improved.

Description

Riding route recommendation method and device
Technical Field
The application relates to the technical field of traffic, in particular to a riding route recommending method and device.
Background
The subway has the characteristics of large transportation capacity, high speed, stable running, no cross overlapping of running routes and other running routes, no influence of external environment on the in-car environment and punctual time, and becomes the optimal traffic tool for mass traveling.
However, since a subway has a plurality of cars and each car has a plurality of doors, passengers have a certain blindness in selecting a car to ride and a car to get on from, and a relatively crowded car or door is often selected, and thus, the experience of passengers riding is low.
Disclosure of Invention
The application provides a riding route recommending method and device, which are used for improving riding experience of passengers.
In order to achieve the above purpose, the present application adopts the following technical scheme:
in a first aspect, the present application provides a riding route recommendation method, the method including: and acquiring route information of a plurality of riding routes, wherein the route information of each riding route comprises the door crowding degree of a train door in the riding route and the total station number of the riding route, the riding route comprises a station entrance, a station exit, a riding train and the door number of the train, and then determining a target riding route in the plurality of riding routes according to the route information of the riding routes.
According to the riding route recommending method, the target riding route is determined according to the route information of the riding route, and the target riding route comprises the door number of a riding train. Compared with the prior art, passengers can select the passenger compartment and get on the car from which car door, the car passenger car has certain blindness, and a route recommendation scheme comprising the number of the passenger train door can be provided for the passengers, so that the riding experience of the passengers is improved.
In a second aspect, the present application provides a riding route recommendation device, the detection device comprising: an acquisition unit and a determination unit.
The acquisition unit is used for acquiring route information of a plurality of riding routes; the route information of each riding route comprises the door crowding degree of train doors in the riding route and the total station number of the riding route; the riding route comprises a station entrance, a station exit, a riding train and a train door number. The determination unit is configured to determine a target riding route among the plurality of riding routes based on route information of the riding routes.
In a third aspect, the present application provides a ride route recommendation device including a memory and a processor. The memory is coupled to the processor. The memory is for storing computer program code, the computer program code comprising computer instructions. When the processor executes the computer instructions, the ride route recommendation device performs the ride route recommendation method as described in the first aspect and any one of its possible designs.
In a fourth aspect, the present application provides a computer readable storage medium having instructions stored therein which, when run on a ride route recommendation device, cause the device to perform the ride route recommendation method according to the first aspect and any one of its possible designs.
In a fifth aspect, the present application provides a computer program product comprising computer instructions which, when run on a ride route recommendation device, cause the ride route recommendation device to perform the ride route recommendation method according to the first aspect and any one of its possible designs.
For a detailed description of the second to fifth aspects and various implementations thereof in this application, reference may be made to the detailed description of the first aspect and various implementations thereof; moreover, the advantages of the second aspect and the various implementations thereof may be referred to as analyzing the advantages of the first aspect and the various implementations thereof, and will not be described herein.
These and other aspects of the present application will be more readily apparent from the following description.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings that are needed in the description of the embodiments will be briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present application, and that other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
Fig. 1 is a schematic flow chart of a riding route recommendation method according to an embodiment of the present application;
fig. 2 is a second flow chart of a riding route recommendation method according to an embodiment of the present application;
fig. 3 is a flowchart illustrating a third method for recommending a riding route according to an embodiment of the present application;
fig. 4 is a flowchart illustrating a method for recommending a riding route according to an embodiment of the present disclosure;
fig. 5 is a flowchart of a riding route recommendation method provided in an embodiment of the present application;
fig. 6 is a schematic hardware structure of a riding route recommendation device according to an embodiment of the present application;
fig. 7 is a schematic structural diagram of a riding route recommendation device according to an embodiment of the present application.
Detailed Description
The following description of the embodiments of the present application will be made clearly and fully with reference to the accompanying drawings, in which it is evident that the embodiments described are only some, but not all, of the embodiments of the present application. All other embodiments, which can be made by one of ordinary skill in the art without undue burden from the present disclosure, are within the scope of the present disclosure.
The terms "first," "second," and the like, are used for descriptive purposes only and are not to be construed as indicating or implying relative importance or implicitly indicating the number of technical features indicated. Thus, a feature defining "a first" or "a second" may explicitly or implicitly include one or more such feature. In the description of the present application, unless otherwise indicated, the meaning of "a plurality" is two or more.
The subway has the characteristics of large transportation capacity, high speed, stable running, no cross overlapping of running routes and other running routes, no influence of external environment on the in-car environment and punctual time, and becomes the best traffic tool for mass traveling.
At present, when passengers travel to take a subway, the following steps are generally carried out: 1. selecting a subway station entrance close to the departure position; 2. randomly selecting an elevator entrance or a stair entrance to reach a ridable position after entering a subway station from an entrance; 3. if the subway arrives at the station exactly, selecting a subway door close to the subway to enter the subway, and if the subway does not arrive at the station, selecting a subway train door with fewer queuing numbers to enter the subway, or temporarily replacing the subway door to an uncongested door when the subway arrives at the station; 4. and (3) leaving the subway from the vehicle door, and selecting an elevator entrance or a stair entrance to exit according to the destination.
However, since a subway has a plurality of cars and each car has a plurality of doors, passengers have a certain blindness in selecting a car to ride and a car to get on from, and a relatively crowded car or door is often selected, and thus, the experience of passengers riding is low.
In view of the above, the present application provides a riding route recommendation method capable of providing a passenger with a route recommendation scheme including a riding train door number. Compared with the prior art, passengers have certain blindness when selecting to take the carriage and get on the car from which car door, and the experience of passengers taking the car can be improved.
The train related to the embodiment of the present application may be a train such as a subway, a light rail, etc., which is not limited in the embodiment of the present application.
For convenience of description, a train will be mainly described as a subway train.
The execution subject of the riding route recommending method provided by the embodiment of the application is a riding route recommending device (hereinafter referred to as a recommending device).
Optionally, the recommending device in the embodiment of the present application may obtain, according to map software on a terminal device of a user, a current position, a departure place, a destination, and a riding route of a passenger, where the riding route may include an entrance, an exit, a riding train of a subway, a station traversed by the riding train, and a station number of the riding train. The recommending device and the terminal equipment of the user can be integrated together or can be independently arranged, and the embodiment of the application is not limited.
The terminal device of the user includes a mobile phone, a tablet computer and the like, which can be provided with map software.
The following describes a riding route recommendation method provided in the embodiment of the present application.
As shown in fig. 1, the riding route recommending method includes:
s101, the recommending device acquires route information of a plurality of riding routes.
The riding route comprises a station entrance, a station exit, a riding train and a train door number.
Optionally, the entrance is the subway station closest to the current position of the passenger, and may be the subway station most convenient for the passenger to go to, which is not limited in this embodiment of the present application.
Optionally, the departure port is a subway station port closest to the destination of the passenger, and may be a subway station port most convenient for the passenger to travel to the destination, which is not limited in the embodiment of the present application.
Alternatively, the train taken may be a direct train or a transfer train.
For example, when the train is a direct train, that is, only one train (train 1) is present. The train 1 includes 3 doors, and the door numbers are 01, 02, and 03, respectively, and the number of the riding routes is 3, and the riding routes are 1, 2, and 3, respectively. The riding route 1 includes a stop entrance, a stop exit, a train 1, and a door 01, the riding route 2 includes a stop entrance, a stop exit, a train 1, and a door 02, and the riding route 3 includes a stop entrance, a stop exit, a train 1, and a door 03.
For example, the train is a transfer train, that is, when the train includes two or more than two trains (train 1 and train 2), for example, the train 1 includes 3 doors, and the door numbers are 01, 02 and 03, respectively; train 2 includes 2 doors, with door numbers 04, 05, respectively. In this case, the number of the riding routes is 6, and the riding routes are respectively 1, 2, 3, 4, 5 and 6. The riding route 1 is as follows: entrance, exit, train 1, train 2, train 1 door 01 and train 2 door 04; the riding route 2 is as follows: entrance to exit to train 1 to train 2 to train 1 door 02 to train 2 door 04; the riding route 3 is as follows: entrance to exit to train 1 to train 2 to train 1 door 03 to train 2 door 04; the riding route 4 is as follows: entrance to stop, exit to stop, train 1, train 2, door 01 of train 1, door 05 of train 2; the riding route 5 is as follows: entrance to stop, exit to stop, train 1, train 2, door 02 of train 1, door 05 of train 2; the riding route 6 is as follows: entrance to exit to train 1 to train 2 to train 1 door 03 to train 2 door 05.
The route information of the riding route includes the door crowdedness of the train doors in the riding route and the total number of stops of the riding route.
The door congestion degree of a train door indicates the congestion degree of the train door when a passenger rides on the train from the door.
Optionally, as shown in fig. 2, the step S101 of obtaining the door congestion degree of the train door in the riding path includes steps S1011-S1013.
S1011, the recommending device acquires the crowding degree of the train door at the first station in the riding route.
The first station is any station among stations included in the riding route.
Referring to fig. 2, as shown in fig. 3, S1011 includes S10111-S10112.
S10111, the recommending device acquires the number of seats of train doors in a preset range and the number of people in the preset range at the first station in the riding route.
The preset range is an area formed on the train by taking a car door as a center and taking a preset length as a radius.
The preset range is an area formed with the vehicle door as the center and with half of the distance between the two vehicle doors as the radius, for example.
S10112, the recommending device determines the crowding degree of the train door in the first station in the riding route according to the number of seats of the train door in the preset range in the riding route and the number of people in the preset range at the first station.
Illustratively, the crowding level may include 0.2, 0.4, 0.6, 0.8, 1.
The recommendation device determines the crowding degree of the train door in the first station in the riding route according to the ratio A of the number of people in the preset range of the train door in the first station in the riding route to the number of seats in the preset range of the train door in the riding route and the preset crowding degree interval.
The preset congestion degree interval corresponds to the congestion degree one by one.
Illustratively, the preset congestion level interval includes (0, 1/2], (1/2, 1], (1, 3/2], (3/2, 5/2], (5/2, +..
For example, when the ratio a of the number of persons in the preset range of the train door in the riding route at the first station to the number of seats in the preset range of the train door in the riding route is in the range of (0, 1/2), that is, when a is greater than 0 and less than or equal to 1/2, the crowdedness of the train door in the riding route at the first station is 0.2.
Illustratively, the ratio A is in the range of (1/2, 1), i.e., when A is greater than 1/2 and less than or equal to 1, the crowding of the train door at the first station in the riding route is 0.4.
Illustratively, the ratio A is in the range of (1, 3/2), i.e., when A is greater than 1 and less than or equal to 3/2, the crowding of the train door at the first station in the riding route is 0.6.
Illustratively, the ratio A is in the range of (3/2, 5/2), i.e., when A is greater than 3/2 and less than or equal to 5/2, the crowding of the train door at the first station in the ride route is 0.8.
Illustratively, when the ratio A is in the range of (5/2, ++), i.e., when A is greater than 5/2, the crowding of the train door in the first station in the ride route is 1.
S1012, the recommendation device determines an attenuation coefficient of the congestion degree of the first station according to the congestion degree of the first station, the total number of stations on the riding route, and the number of stations from the first station to the second station.
Optionally, the second station is an initial station of the riding route, and the first station and the second station are stations of the same train number.
The first station may be the second station, or may be any station other than the second station among the train stations on which the train is traveling.
The attenuation coefficient of the degree of congestion indicates the degree of influence of the degree of congestion on the passengers. When the train starts at the station, the influence of the crowding degree of the train door on the passengers is the largest, and the influence of the crowding degree of the train door on the experience of the passengers is attenuated along with the increase of the number of stations of the train from the station.
Optionally, the attenuation coefficient of the crowdedness of the first station determined by the recommending device satisfies the following formula one.
The first formula is:
C(n)=u (N-1)/N
wherein C (N) represents an attenuation coefficient of the degree of congestion of the first station, N represents the total number of stations of the riding route, N represents the number of stations from the first station to the second station, and u represents a constant.
S1013, the recommending device determines the door crowding degree of the train door in the riding route according to the crowding degree of the first station and the attenuation coefficient of the crowding degree of the first station.
Optionally, the door crowding degree of the train door in the riding route determined by the recommending device satisfies the following formula two.
The formula II is:
Figure BDA0002743473360000061
wherein C (d) represents the door crowding degree of the train door in the riding route, N represents the total number of stations in the riding route, N represents the number of stations from the first station to the second station, and C (N) represents the attenuation coefficient of the crowding degree of the first station.
Optionally, the route information of the riding route may further include a walking distance of the riding route.
The walking distance of the riding route means the distance the passenger needs to walk when selecting the riding route.
Illustratively, when the train being ridden is a direct train, the walking distance of the ride route 1 includes the walking distance of the passenger from the entrance to the door 01 when the train 1 arrives at the subway station where the entrance is located and the walking distance of the door 01 to the exit when the train 1 arrives at the subway station where the exit is located.
Illustratively, when the riding train is a transfer train, the riding route 1 is: entrance to stop, exit to train 1, train 2, train 1 door 01, train 2 door 04, the walking distance of the riding route 1 includes the walking distance of the passenger from the entrance to the door 01 when the train 1 arrives at the subway station where the entrance is located, the walking distance of the door 01 to the door 02 when the train 1 arrives at the transfer station, and the walking distance of the door 04 to the exit when the train 2 arrives at the subway station where the exit is located.
Alternatively, a walking grade may be used instead of the walking distance, the walking grade being the walking distance divided by 1000 for convenience of subsequent calculation.
S102, the recommendation device determines a target riding route from a plurality of riding routes according to the route information of the riding routes.
Referring to fig. 1, S102 includes S1021-S1023 as shown in fig. 4.
S1021, the recommending device determines whether the total station number of the riding route is larger than a first preset threshold value.
The first preset threshold may be determined according to the actual situation.
Alternatively, the first preset threshold may be 30.
In the case where the total number of stops of the riding route is greater than the first preset threshold, S1022 is continued. If the total number of stops of the riding route is less than or equal to the first preset threshold, S1023 is continued.
And S1022, the recommending device determines a target riding route from the plurality of riding routes according to the door crowding degree of the train door in the riding routes.
And determining a riding route with the door crowding degree of the train door being smaller than that of the train door in the first riding route in the plurality of riding routes as a target riding route.
The first travel route is any one of the plurality of travel routes other than the target travel route.
For example, the number of the riding routes is 3, namely, riding route 1, riding route 2 and riding route 3. The riding route 1 is as follows: entrance, exit, train 1, door 01, and riding route 2 is as follows: entrance to stop, exit to stop, train 1, door 02, and ride route 3 includes entrance to stop, exit to train 1, door 03. The congestion degree of the door 01 in the riding route 1 is a, the congestion degree of the door 02 in the riding route 2 is b, the congestion degree of the door 03 in the riding route 3 is c, and if a is smaller than b and a is smaller than c, the riding route 1 is determined as the target riding route.
S1023, the recommendation device determines a target riding route in a plurality of riding routes according to the walking distance of the riding routes, the total station number of the riding routes and the door crowding degree of train doors in the riding routes.
Referring to fig. 4, as shown in fig. 5, S1023 includes S10231 to S10232.
S10231, the recommending device determines the recommending degree of the riding route according to the walking distance of the riding route, the total station number of the riding route and the door crowding degree of the train doors in the riding route.
The recommending device determines the recommending degree of the riding routes, namely, determines the recommending degree of each riding route.
Optionally, the recommendation degree of each riding route determined by the recommendation device satisfies the following formula three.
The formula III is:
Figure BDA0002743473360000081
wherein E (N) represents the recommended degree of the riding route, C (d) represents the door crowding degree of the train door in the riding route, W (d) represents the walking distance of the riding route, N represents the total station number of the riding route, and N is more than 0 and less than or equal to 30.
S10232, the recommending device determines a target riding route according to the recommendation degree of the riding route.
The recommendation device determines the recommendation degree of each riding route and determines the target riding route.
The target travel route is a travel route having a recommendation degree smaller than that of the second travel route among the plurality of travel routes.
The second travel route is any one of the plurality of travel routes other than the target travel route.
For example, the number of the riding routes is 3, namely, riding route 1, riding route 2 and riding route 3. The recommendation degree of the riding route 1 is d, the recommendation degree of the riding route 2 is e, the recommendation degree of the riding route 3 is f, and if d is smaller than e and a is smaller than f, the riding route 1 is determined as the target riding route.
After determining the target riding route, the recommending device may display the target riding route to the passenger so that the passenger can travel to the destination according to the target riding route.
According to the riding route recommending method, the target riding route is determined according to the route information of the riding route, and the target riding route comprises the door number of a riding train. Compared with the prior art, passengers can select the passenger compartment and get on the car from which car door, the car passenger car has certain blindness, and a route recommendation scheme comprising the number of the passenger train door can be provided for the passengers, so that the riding experience of the passengers is improved.
The foregoing description of the solution provided in the embodiments of the present application has been mainly presented in terms of a method. To achieve the above functions, it includes corresponding hardware structures and/or software modules that perform the respective functions. Those of skill in the art will readily appreciate that the elements and algorithm steps of the examples described in connection with the embodiments disclosed herein may be implemented as hardware or combinations of hardware and computer software. Whether a function is implemented as hardware or computer software driven hardware depends upon the particular application and design constraints imposed on the solution. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present application.
As shown in fig. 6, the present embodiment provides a riding route recommendation device 600. The ride route recommendation device may include at least one processor 601, a communication line 602, a memory 603, and a communication interface 604.
Specifically, the processor 601 is configured to execute computer-executable instructions stored in the memory 603, thereby implementing steps or actions of the terminal.
Processor 601 may be a chip. For example, it may be a field programmable gate array (field programmable gate array, FPGA), an application specific integrated chip (application specific integrated circuit, ASIC), a system on chip (SoC), a central processing unit (central processor unit, CPU), a network processor (network processor, NP), a digital signal processing circuit (digital signal processor, DSP), a microcontroller (micro controller unit, MCU), a programmable controller (programmable logic device, PLD) or other integrated chip.
A communication line 602 for transmitting information between the processor 601 and the memory 603.
The memory 603 is used for storing and executing computer-executable instructions, and is controlled to be executed by the processor 601.
The memory 603 may be independent and coupled to the processor via communication line 602. The memory 303 may be volatile memory or nonvolatile memory, or may include both volatile and nonvolatile memory. The nonvolatile memory may be a read-only memory (ROM), a Programmable ROM (PROM), an Erasable PROM (EPROM), an electrically Erasable EPROM (EEPROM), or a flash memory. The volatile memory may be random access memory (random access memory, RAM) which acts as an external cache. By way of example, and not limitation, many forms of RAM are available, such as Static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double data rate SDRAM (DDR SDRAM), enhanced SDRAM (ESDRAM). It should be noted that the memory of the systems and devices described herein is intended to comprise, without being limited to, these and any other suitable types of memory.
Communication interface 604 for communicating with other devices or communication networks. The communication network may be an ethernet, a radio access network (radio access network, RAN), or a wireless local area network (wireless local area networks, WLAN), among others.
It is noted that the structure shown in fig. 6 does not constitute a limitation of the riding route recommendation device, and the riding route recommendation device may include more or less components than those shown in fig. 6, or may combine some components, or may be a different arrangement of components.
As shown in fig. 7, the present embodiment provides a riding route recommendation device 70. The riding route recommending apparatus may include an acquisition unit 71, a determination unit 72.
An acquisition unit 71 for acquiring route information of a plurality of riding routes. For example, in connection with fig. 1, the acquisition unit 71 may be used to perform S101.
A determination unit 72 for determining a target riding route among the plurality of riding routes based on the route information of the riding route. For example, in connection with fig. 1, the determination unit 72 may be used to perform step S102.
It should be understood that, in various embodiments of the present application, the sequence numbers of the foregoing processes do not mean the order of execution, and the order of execution of the processes should be determined by the functions and internal logic thereof, and should not constitute any limitation on the implementation process of the embodiments of the present application.
In actual implementation, the acquisition unit 71, the determination unit 72 may be implemented by the processor 601 shown in fig. 6 calling the program code in the memory 603. The specific implementation process may refer to descriptions of the riding route recommending method parts shown in fig. 1 to 5, and will not be repeated here.
Another embodiment of the present application further provides a computer readable storage medium, where computer instructions are stored, where the computer instructions, when executed on a passenger route recommendation device, cause the passenger route recommendation device to execute the steps of the passenger route recommendation execution in the method flow shown in the above method embodiment.
In another embodiment of the present application, there is also provided a computer program product comprising instructions that, when executed on a ride route recommender, cause the ride route recommender to perform the steps performed by the ride route recommender in the method flow illustrated in the method embodiments described above.
Those of ordinary skill in the art will appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware, or combinations of computer software and electronic hardware. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the solution. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present application.
It will be clear to those skilled in the art that, for convenience and brevity of description, specific working procedures of the above-described systems, apparatuses and units may refer to corresponding procedures in the foregoing method embodiments, which are not described in detail herein.
In the several embodiments provided in this application, it should be understood that the disclosed systems, devices, and methods may be implemented in other ways. For example, the above-described device embodiments are merely illustrative, e.g., the partitioning of elements is merely a logical functional partitioning, and there may be additional partitioning in actual implementation, e.g., multiple elements or components may be combined or integrated into another system, or some features may be omitted, or not implemented. Alternatively, the coupling or direct coupling or communication connection shown or discussed with each other may be through some interface, indirect coupling or communication connection of devices or units, electrical, mechanical, or other form.
The units described as separate units may or may not be physically separate, and units shown as units may or may not be physical units, may be located in one place, or may be distributed over a plurality of network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
In addition, each functional unit in each embodiment of the present application may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit.
The foregoing is merely specific embodiments of the present application, but the scope of the present application is not limited thereto, and any changes or substitutions easily conceivable by those skilled in the art within the technical scope of the present application should be covered in the scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.

Claims (8)

1. A ride route recommendation method, the method comprising:
acquiring the crowding degree of a train door at a first station in a riding route, wherein the riding route comprises the first station;
determining an attenuation coefficient of the crowding degree of the first station according to the crowding degree of the first station, the total station number of the riding route and the station numbers from the first station to the second station; the second station is an initial station of the riding route, and the first station and the second station are stations of the same train number; the attenuation coefficient of the crowding degree of the first station satisfies the following formula:
C(n)=u (N-1)/N
wherein C (N) represents an attenuation coefficient of the degree of congestion of the first station, N represents the total number of stations of the riding route, N represents the number of stations from the first station to the second station, and u represents a constant
Determining the door congestion degree of train doors in the riding route according to the congestion degree of the first station and the attenuation coefficient of the congestion degree of the first station;
acquiring route information of a plurality of riding routes; the route information of each riding route comprises the door crowdedness degree of train doors in the riding route and the total station number of the riding route; the riding route comprises a station entrance, a station exit, a riding train and a door number of the train; the route information of the riding route further comprises a walking distance of the riding route;
determining a recommendation degree of the riding route according to the walking distance of the riding route, the total station number of the riding route and the door crowding degree of train doors in the riding route under the condition that the total station number of the riding route is smaller than or equal to a first preset threshold value; wherein the recommendation degree of each riding route satisfies the following formula:
Figure QLYQS_1
wherein E (N) represents the recommended degree of the riding route, C (d) represents the door crowding degree of train doors in the riding route, W (d) represents the walking distance of the riding route, N represents the total station number of the riding route, and N is more than 0 and less than or equal to 30;
determining a target riding route according to the recommendation degree of the riding route; the target riding route is a riding route with recommendation degree smaller than that of the second riding route in the plurality of riding routes; the second travel route is any one of the plurality of travel routes other than the target travel route.
2. The method of claim 1, wherein determining a target ride route from the plurality of ride routes based on the route information for the ride route comprises:
and determining the target riding route in the plurality of riding routes according to the door crowding degree of the train doors in the riding routes under the condition that the total station number of the riding routes is larger than a first preset threshold value.
3. The method of claim 2, wherein determining the target ride route among the plurality of ride routes based on the degree of door congestion of the train doors in the ride route comprises:
determining a riding route with the door crowding degree of the train door being smaller than that of the train door in a first riding route in the plurality of riding routes as the target riding route; the first travel route is any one of the plurality of travel routes other than the target travel route.
4. The method of claim 1, wherein the obtaining the congestion level of the train door in the first station in the riding route comprises:
acquiring the number of seats of train doors in a preset range and the number of people in the preset range when the train doors are at the first station in the riding route;
and determining the crowding degree of the train door in the first station in the riding route according to the number of seats of the train door in the preset range in the riding route and the number of people in the preset range when the train door is in the first station.
5. The method of claim 4, wherein determining the degree of congestion of the train doors in the first station in the ride route based on the number of seats of the train doors in the predetermined range in the ride route and the number of persons in the predetermined range at the first station comprises:
and determining the crowding degree of the train door in the first station in the riding route according to the ratio of the number of the train door in the first station in the preset range to the number of seats of the train door in the riding route in the preset range and a preset crowding degree interval.
6. A riding route recommendation device, the device comprising:
the system comprises an acquisition unit, a first station and a second station, wherein the acquisition unit is used for acquiring the crowdedness degree of train doors at the first station in a riding route, and the riding route comprises the first station;
a determining unit, configured to determine an attenuation coefficient of the congestion degree of the first station according to the congestion degree of the first station, the total station number of the riding route, and the station numbers of the first station to the second station; the second station is an initial station of the riding route, and the first station and the second station are stations of the same train number; the attenuation coefficient of the crowding degree of the first station satisfies the following formula:
C(n)=u (N-1)/N
wherein C (N) represents an attenuation coefficient of the degree of congestion of the first station, N represents the total number of stations of the riding route, N represents the number of stations from the first station to the second station, and u represents a constant
The determining unit is further used for determining the door crowding degree of the train door in the riding route according to the crowding degree of the first station and the attenuation coefficient of the crowding degree of the first station;
the acquisition unit is also used for acquiring route information of a plurality of riding routes; the route information of each riding route comprises the door crowdedness degree of train doors in the riding route and the total station number of the riding route; the riding route comprises a station entrance, a station exit, a riding train and a door number of the train; the route information of the riding route further comprises a walking distance of the riding route;
the determining unit is further configured to determine, when the total number of stops of the riding route is less than or equal to a first preset threshold, a recommendation degree of the riding route according to a walking distance of the riding route, the total number of stops of the riding route, and a door crowding degree of a train door in the riding route; wherein the recommendation degree of each riding route satisfies the following formula:
Figure QLYQS_2
wherein E (N) represents the recommended degree of the riding route, C (d) represents the door crowding degree of train doors in the riding route, W (d) represents the walking distance of the riding route, N represents the total station number of the riding route, and N is more than 0 and less than or equal to 30;
the determining unit is further used for determining a target riding route according to the recommendation degree of the riding route; the target riding route is a riding route with recommendation degree smaller than that of the second riding route in the plurality of riding routes; the second travel route is any one of the plurality of travel routes other than the target travel route.
7. A ride route recommendation device, characterized in that the ride route recommendation device comprises a memory and a processor; the memory is coupled to the processor; the memory is used for storing computer program codes, and the computer program codes comprise computer instructions; when the processor executes the computer instructions, the ride route recommendation device performs the ride route recommendation method according to any one of claims 1-5.
8. A computer readable storage medium having instructions stored therein which, when run on a ride route recommendation device, cause the device to perform the ride route recommendation method of any of claims 1-5.
CN202011158309.5A 2020-10-26 2020-10-26 Riding route recommendation method and device Active CN112183889B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202011158309.5A CN112183889B (en) 2020-10-26 2020-10-26 Riding route recommendation method and device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202011158309.5A CN112183889B (en) 2020-10-26 2020-10-26 Riding route recommendation method and device

Publications (2)

Publication Number Publication Date
CN112183889A CN112183889A (en) 2021-01-05
CN112183889B true CN112183889B (en) 2023-06-06

Family

ID=73922719

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202011158309.5A Active CN112183889B (en) 2020-10-26 2020-10-26 Riding route recommendation method and device

Country Status (1)

Country Link
CN (1) CN112183889B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115027525B (en) * 2021-02-24 2023-06-20 中国联合网络通信集团有限公司 Train transfer method, system, terminal device and computer readable storage medium

Citations (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103649684A (en) * 2011-03-31 2014-03-19 索尼公司 Information processing device, device for generating congestion level map, information processing method, programme, and recording medium
CN104408082A (en) * 2014-11-11 2015-03-11 大连海天兴业科技有限公司 Real-time information-based metro passenger service system
CN205451483U (en) * 2016-03-31 2016-08-10 赵文旭 Device is guided by bus in public transit
CN106203694A (en) * 2016-07-07 2016-12-07 百度在线网络技术(北京)有限公司 Place crowding forecast model foundation, place crowding Forecasting Methodology and device
CN106448135A (en) * 2016-09-30 2017-02-22 百度在线网络技术(北京)有限公司 Bus route recommendation method and device
CN107204124A (en) * 2016-03-16 2017-09-26 高德信息技术有限公司 Bus recommends method and apparatus
CN107545320A (en) * 2017-07-03 2018-01-05 北京交通大学 A kind of urban track traffic passenger paths planning method and system based on graph theory
JP2018081022A (en) * 2016-11-17 2018-05-24 株式会社ナビタイムジャパン Information processing system, information processing program, information processor, and information processing method
CN108388542A (en) * 2018-01-18 2018-08-10 中国科学院遥感与数字地球研究所 A kind of rail traffic crowding computational methods and system
CN110428117A (en) * 2019-08-15 2019-11-08 北京交通大学 The accurate abductive approach of passenger flow and system under the more scenes of urban track traffic
CN110450822A (en) * 2018-05-07 2019-11-15 中车株洲电力机车研究所有限公司 A kind of rail traffic method of servicing, device, equipment and system

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10753754B2 (en) * 2017-01-19 2020-08-25 Andrew DeLizio Managing autonomous vehicles

Patent Citations (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103649684A (en) * 2011-03-31 2014-03-19 索尼公司 Information processing device, device for generating congestion level map, information processing method, programme, and recording medium
CN104408082A (en) * 2014-11-11 2015-03-11 大连海天兴业科技有限公司 Real-time information-based metro passenger service system
CN107204124A (en) * 2016-03-16 2017-09-26 高德信息技术有限公司 Bus recommends method and apparatus
CN205451483U (en) * 2016-03-31 2016-08-10 赵文旭 Device is guided by bus in public transit
CN106203694A (en) * 2016-07-07 2016-12-07 百度在线网络技术(北京)有限公司 Place crowding forecast model foundation, place crowding Forecasting Methodology and device
CN106448135A (en) * 2016-09-30 2017-02-22 百度在线网络技术(北京)有限公司 Bus route recommendation method and device
JP2018081022A (en) * 2016-11-17 2018-05-24 株式会社ナビタイムジャパン Information processing system, information processing program, information processor, and information processing method
CN107545320A (en) * 2017-07-03 2018-01-05 北京交通大学 A kind of urban track traffic passenger paths planning method and system based on graph theory
CN108388542A (en) * 2018-01-18 2018-08-10 中国科学院遥感与数字地球研究所 A kind of rail traffic crowding computational methods and system
CN110450822A (en) * 2018-05-07 2019-11-15 中车株洲电力机车研究所有限公司 A kind of rail traffic method of servicing, device, equipment and system
CN110428117A (en) * 2019-08-15 2019-11-08 北京交通大学 The accurate abductive approach of passenger flow and system under the more scenes of urban track traffic

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
" 基于Android的地铁综合服务系统的设计与实现";沈士翔;《中国优秀硕士学位论文全文数据库 工程科技II辑》;C033-82 *

Also Published As

Publication number Publication date
CN112183889A (en) 2021-01-05

Similar Documents

Publication Publication Date Title
CN108734980B (en) Vehicle route control
CN104067642B (en) For controlling the method and apparatus that transfer and/or receive of the portable wireless user device to security message
JP2020514895A (en) Inter-vehicle automatic passenger sharing system and method
CN111033595A (en) Shared vehicle management method and shared vehicle management device
CN109425355A (en) Recommended method of navigating and system, car-mounted terminal and vehicle
CN112262418B (en) Vehicle management system and vehicle management method
CN112183889B (en) Riding route recommendation method and device
EP3222974A1 (en) Navigation device, navigation method and storage medium
CN107967816A (en) Car-mounted terminal, parking stall shared system, parking stall determine method and device
US10909778B1 (en) Systems and methods for providing vehicular collision data
CN111063188A (en) Distributed route determination system
JP2019176329A (en) Vehicle communication control method and vehicle communication device
JP5938535B1 (en) Vehicle entry / exit management system
KR20160033214A (en) Vehicular information provision system, vehicular information provision method, and program
KR20200067053A (en) System and method for providing information about parking space
JP6333341B2 (en) Information processing apparatus, search area setting method, and program
CN110111600B (en) Parking lot recommendation method based on VANETs
CN111882912B (en) Riding information processing method, device and system
KR101428513B1 (en) Method and Apparatus for Transmitting Information to Wireless Access Point
CN113762644B (en) Congestion state prediction method and device based on Markov chain
JP6981051B2 (en) Information processing equipment, information processing system, information processing method and information processing program
JP2021060894A (en) Information processor
US9646490B2 (en) Vehicle traveling support communication apparatus and communication system
JP7350603B2 (en) information processing equipment
CN111932891B (en) Road condition identification method and related device

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
GR01 Patent grant
GR01 Patent grant