CN113536090A - Tourist group-following line people number management and control method - Google Patents
Tourist group-following line people number management and control method Download PDFInfo
- Publication number
- CN113536090A CN113536090A CN202110766990.XA CN202110766990A CN113536090A CN 113536090 A CN113536090 A CN 113536090A CN 202110766990 A CN202110766990 A CN 202110766990A CN 113536090 A CN113536090 A CN 113536090A
- Authority
- CN
- China
- Prior art keywords
- people
- scenic spot
- group
- scenic
- following
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 20
- 238000000605 extraction Methods 0.000 claims description 9
- 238000005457 optimization Methods 0.000 claims description 8
- 238000004140 cleaning Methods 0.000 claims description 6
- 238000012545 processing Methods 0.000 claims description 6
- 239000003550 marker Substances 0.000 claims description 3
- 238000012216 screening Methods 0.000 claims description 3
- 238000011160 research Methods 0.000 abstract description 5
- 238000013459 approach Methods 0.000 abstract description 2
- 238000007418 data mining Methods 0.000 abstract description 2
- 238000007726 management method Methods 0.000 description 26
- 239000011159 matrix material Substances 0.000 description 6
- 230000002354 daily effect Effects 0.000 description 3
- 230000009286 beneficial effect Effects 0.000 description 2
- 238000011161 development Methods 0.000 description 2
- 230000003203 everyday effect Effects 0.000 description 2
- 238000013178 mathematical model Methods 0.000 description 2
- 230000004075 alteration Effects 0.000 description 1
- 230000008901 benefit Effects 0.000 description 1
- 239000012141 concentrate Substances 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000005259 measurement Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000036651 mood Effects 0.000 description 1
- 230000008520 organization Effects 0.000 description 1
- 230000008569 process Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/951—Indexing; Web crawling techniques
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/953—Querying, e.g. by the use of web search engines
- G06F16/9535—Search customisation based on user profiles and personalisation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/953—Querying, e.g. by the use of web search engines
- G06F16/9537—Spatial or temporal dependent retrieval, e.g. spatiotemporal queries
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06311—Scheduling, planning or task assignment for a person or group
-
- 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/10—Services
- G06Q50/14—Travel agencies
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Theoretical Computer Science (AREA)
- Databases & Information Systems (AREA)
- Human Resources & Organizations (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Tourism & Hospitality (AREA)
- Strategic Management (AREA)
- General Engineering & Computer Science (AREA)
- Economics (AREA)
- Data Mining & Analysis (AREA)
- Entrepreneurship & Innovation (AREA)
- Marketing (AREA)
- General Business, Economics & Management (AREA)
- Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Development Economics (AREA)
- Educational Administration (AREA)
- General Health & Medical Sciences (AREA)
- Game Theory and Decision Science (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention provides a tour group-following line number management and control method, and belongs to the technical field of data mining. Which comprises the following steps: determining the scenic spots of the study; collecting travel and group following routes of approaches and scenic spots; dividing the time period of the research; counting the number of group-following lines meeting each scenic spot in each time period; the number of people of each scenic spot in each time period is restrained; the maximum number of people for each line is determined. The invention mainly utilizes the restriction of the number of people in all scenic spots where tourists travel with the group line to limit the number of people in each travel line, realizes scientific number management and control, and limits and shunts the number of people, thereby avoiding the occurrence of congestion in each scenic spot due to the fact that the number of people exceeds the capacity of the scenic spot in each time period, and providing a basis for scientific management and control of the number of people in the scenic spots.
Description
Technical Field
The invention relates to the technical field of data mining, in particular to a tourist group-following line people number management and control method.
Background
The control of the number of people in the tourist group comprehensively considers the sustainable development problem of the scenic spot, the number of people in the tourist route in the tourist group is limited to relieve the congestion of the hot scenic spot, and meanwhile, a scientific basis is provided for scenic spot management.
The current scenic spot people number management control method and system have the following defects: firstly: most researches are carried out on the problem of scenic spot visitor management from the perspective of how to evacuate a congested scenic spot, and the congestion phenomenon cannot be effectively prevented. Secondly, the method comprises the following steps: the existing scenic spot visitor number management method mainly aims at a single scenic spot, and neglects management and control among scenic spots related in spatial position. Thirdly, the management of the number of visitors in a scenic spot is mainly based on experience and lacks of a scientific technical method for support. Therefore, serious congestion often occurs in many scenic spots during the peak period of travel, and the travel experience of tourists is poor.
Disclosure of Invention
In view of the above, the invention provides a tourist group-following line people number management and control method, which can provide important guidance for shunting management and control of tourist numbers in scenic spots.
In order to achieve the purpose, the invention adopts the technical scheme that:
a tourism group-following line population management and control method comprises the following steps:
step 1, determining scenic spots related to management and control and historical data time span based on the management and control;
step 2, collecting the tour and group following routes of each scenic spot in the route;
step 3, dividing time periods, and counting the number of group-following persons meeting each scenic spot in each time period according to historical data;
step 4, according to the bearing capacity of each scenic spot, restricting the number of people of each scenic spot in each time period, determining an optimization target and establishing an optimization problem;
step 5, solving an optimization problem to obtain the maximum number of people of each tour group following route;
and 6, managing and controlling each tour group-following route according to the maximum number of people.
Further, the specific manner of step 2 is as follows:
step 2.1, acquiring a tour group route containing related scenic spots from an online tour ticketing website by means of crawler software, and acquiring information of scenic spot names, stay time of each scenic spot, positions of the scenic spots corresponding to each time period and track routes of the scenic spots;
step 2.2, data cleaning and extraction are carried out on the data obtained in the step 2.1, wherein the data cleaning and extraction comprises missing value processing, repeated item processing and important information extraction;
step 2.3, screening out tour heel group lines i and X of scenic spots with congestion phenomena in tour peak periodsiThe total number of screened lines is n for the number of people corresponding to the line i.
Further, the specific manner of step 3 is as follows:
step 3.1 introduction of the amount of marker aijkThe description is that whether the line i is in the mark quantity of the sight spot k in the time period j, the mark quantity indicates 'absent' when the value is 0, and the mark quantity indicates 'present' when the value is 1;
step 3.2, counting the number of persons passing with the group travel routes of each scenic spot in each time period
Further, the specific manner of step 5 is as follows:
step 5.1, establishing a constraint condition, namely, ensuring that the number of persons in the group-following tourist routes passing each scenic spot in each time period is ensured when no congestion occurs in the scenic spotThe number of actually containable tourists of the scenic spot is less than or equal to the number of actually containable tourists of the scenic spot;
step 5.2, establishing a scenic spot management target, namely, under the condition that the constraint condition of the step 5.1 is met, maximizing the sum of the number of persons of each party-following route, namely, enabling the sum of the number of persons of each party-following route to be maximum
And 5.3, establishing a simple linear programming problem in the steps 5.1 and 5.2, and directly solving the problem through matlab so as to obtain the maximum number of people on each tour group-following route.
The invention has the beneficial effects that:
1. the invention can obtain the number of the tourist groups in each scenic spot in each time period in advance according to the relevant information that the tourist groups stay in each scenic spot in each time period in the tourist group following line, thereby effectively estimating the number of the tourists in the scenic spots.
2. In the stage of constructing the objective function and the constraint condition, different management and regulation targets (such as maximum number of people or maximum economic benefit and the like) can be formulated according to the management requirements of the scenic region managers, and the maximum capacity or ecological capacity and the like of the scenic region can be considered when the condition constraint is set, so that various results can be generated by diversified design, the scenic region managers can select a scheme of a mood instrument, and the method is more scientific.
3. The invention can control the total number of tourists in each group in advance, can effectively avoid the problem of congestion caused by excessive number of tourists, improves the tourism experience of the tourists and can improve the satisfaction degree of the tourists to a certain extent.
4. The invention can utilize the capacity (maximum capacity or ecological capacity) of each scenic spot to control the tour heel group route, can relieve the passenger flow pressure of the hot scenic spot in the tour peak period, forces the tourists to select other scenic spots in the same time period, leads the flow of other (cold) scenic spots while staggering the time period, and is beneficial to the balanced development among the scenic spots.
Drawings
FIG. 1 is a flow chart of the present invention.
Detailed Description
The embodiments of the present invention will be described below by way of specific examples, and it is to be understood that the described embodiments are only a part of the embodiments of the present invention, and not all embodiments. Various details in this description may be modified or changed in various respects, all without departing from the spirit of the invention, based on different perspectives and applications. All other examples, which can be obtained by a person skilled in the art without inventive step based on the embodiments of the present invention, are within the scope of the present invention.
As shown in fig. 1, a method for managing and controlling the number of tourism parties in a group line comprises the following steps:
step 1, determining scenic spots related to management and control and historical data time span based on the management and control, namely selecting all or part of scenic spots within the jurisdiction of a scenic spot manager as research objects according to the actual management requirement of the scenic spot manager, and determining the research time span;
and step 2, collecting the travel and party following routes of the approaches and scenic spots. At present, travel routes are multiple and complex, such as daily trip, multiple daily trip and the like, and the routes are different from scenic spots and are different in daily shift. Therefore, the acquisition of a travel route is the key to the problem. The specific mode is as follows:
step 2.1, acquiring a party-following travel route containing the scenic spots to be researched from an online travel ticketing website by means of crawler software or codes, wherein the party-following travel route comprises information of k scenic spots, frequent stay, total travel fare and the like of the route of the travel route; in addition, data information can be directly obtained through a tourism company;
step 2.2, data cleaning and extraction are carried out, wherein the data cleaning and extraction comprises missing value processing, repeated item processing, important information extraction and other operations;
step 2.3, screening out tour group following routes i and X in scenic spots with frequent congestion at tour peakiThe number of people corresponding to the ith route can be obtained by the step, and n sample travel and group routes can be obtained as researches;
step 3, determining the maximum capacity and the average residence time of each scenic spot; specifically, the maximum capacity of each sight spot can be obtained through historical data or experience of a tourist expert, and the average stay time of each sight spot is calculated through the historical data.
And 4, dividing the time period, wherein the time period is divided by taking half a day as the minimum time unit, and obtaining the time period j in the time span. Specifically, the division of the time period is determined according to the travel party route data obtained in the above step 2 and step 3 and the average stay time of each sight spot, and the division can be determined according to actual problems. For example, half a day is used as the minimum time unit, or 2 hours and the like are used as time division;
and 5, arranging and constructing various possible number of group-following route persons meeting each scenic spot in each time period, wherein the specific mode is as follows:
step 5.1, introduction of the amount of marker aijkDescribing the mark quantity of whether the line i is in the sight point k at the time interval j, and the value of the mark quantity is 0 (absent) and 1 (present);
step 5.2, counting the number of persons passing with the group tour route of each scenic spot in each time period
Step 6, limiting the maximum capacity constraint condition and the overall objective function for the number of persons meeting each line of each scenic spot in each time period, wherein the specific mode is as follows:
step 6.1, establishing a constraint condition, namely, ensuring that the number of persons in the group-following tourist routes passing each scenic spot in each time period is ensured when no congestion occurs in the scenic spotLess than or equal to the actual number of guests that can be accommodated at the attraction.
Step 6.2, establishing scenic spot management targets, such as maximizing the sum of the number of people in each party-following route under the condition of satisfying the constraint condition of step 5.1, even if
And 7, establishing a model based on the step 6, solving to obtain an optimal solution under a corresponding target, and determining the maximum number of people of each line.
And 8, performing corresponding line people number management and control according to the maximum number of people obtained by the method.
And 8.1, providing the total number of people in various tourist routes of the tourist groups in the whole scenic spot by the optimization solution. For example, the scenic spot tourist routes have n types, so that the total number of people of the n types of tourist routes is obtained respectively. Tabulated summary thereof.
8.2, because the current travel routes are composed of a plurality of travel agencies, the travel management decision-making department needs to reasonably distribute the travel routes according to the total number of people of each travel route. The optimal decision can be reached as long as the constraints are met.
The method has a complex operation process, but the purpose of each step is strong, and the number of the tourists is controlled in advance by means of the tour and group following line, so that a more scientific and efficient management decision can be made for a scenic spot manager, the congestion phenomenon of the scenic spot can be relieved, and the tourism satisfaction degree of the tourists on the scenic spot is improved.
The method realizes the goal of receiving the maximum number of tourists in the panoramic area by constructing an optimized model and solving the optimal number of people in each tourism line through the model. The specific idea is as follows:
1. optimal collocation model construction of tour group route
In the tourist rush hour, some famous scenic spots appear the phenomenon that visitor excessively gathers and is detained, makes the plan arrangement in advance through studying, can avoid the emergence of visitor excessively concentrates the phenomenon of detaining. Considering that the number of travel groups accounts for a large proportion of the total number of travel groups and is easy to manage, it is considered to solve this problem by limiting the number of travel routes of each travel agency organization.
2. Basic assumptions and goals
Suppose a large scenic spot has h scenic spots in total, and the maximum capacity of each scenic spot is set. Only travelers to the tourist group are considered. Let each travel agency have n travel routes in common, and know the travel route of each travel route to each scenic spot in the scenic spot. The method aims to arrange the number of people in each tour route (namely, the number of people in each tour route is used as a decision variable of a model), so that the sum of the number of people in a plurality of routes in each scenic spot is not more than the maximum capacity of the people in each scenic spot in any time period, and the purpose of maximizing the sum of the number of people in all routes in a large scenic spot is achieved.
3. Model building
Firstly numbering n travel routes: i — 1, 2, … n, also numbering k scenic spots: k is 1, 2, … h. In order to describe the travel route of each travel route to visit each scenic spot, the date interval concerned can be divided into m periods, and a period number is introduced: j is 1, 2, … m. Thus, the travel of n travel routes within the date interval concerned can be represented by an n × m matrix B:
B=(bij) (1)
wherein, bijThe number of the scenic spot of the ith tour route in the time period j is the number of the scenic spot of the ith tour route, so that
bij∈{1,2,…,h},i=1,2,…,n;j=1,2,…,m
The ith row of the visible matrix B describes the course of line i. For example, the meanings indicated in the following table can be used.
TABLE 1.1 travel matrix B for h scenic spots in m time periods contained in n lines
Further, let rk be the maximum guest capacity of each scene, that is, the maximum guest capacity of the kth scene, and k is 1, 2, … h, as shown in table 1.2.
TABLE 1.2 maximum Capacity table of large scenic spots tour group circuits related to middle scenic spots
Sight spot number | 1 | 2 | …… | k | …… | h |
Maximum capacity | r1 | r2 | …… | rk | …… | rh |
The model is now established. Firstly, according to the formula (1), the mark amount describing whether the tourist of the ith travel route is in the sight point k in the time interval j is introduced as aijk:
Let the number of people in the ith line be XiThe number of people who visit the scenic spot k in the time period j of the ith line is aijkXiTherefore, the total number of people accessing the sight spot k in each line time interval j isSince we want the total number of people at the kth attraction to not exceed the maximum capacity of the kth attraction for all time periods j, then there should be a constraint
The goal is now to maximize the total number of people on each route:
the linear programming mathematical model of the problem can be obtained by combining the equations (3) and (4) as follows:
the optimal number of people arrangement of each tour route can be obtained by solving the model.
The following is a more specific example:
based on the data of the web crawler, 8 pieces of follower line data containing hot scenic spots (such as the national ditch or the yellow dragon) during the period from 10 month 1 to 10 month 7 of the national festival of 2017 are selected to construct a tourist attraction regulation and optimization model:
before modeling, two pieces of partial information need to be determined. One is how many lines are in the considered range when the model is built (in this example, 8 lines of the following clique are considered), and the other is to clarify the maximum capacity of each sight spot passed by the lines. Since only the receptionist during the period from 2014 to 2016 of national celebration in the national period lacks the maximum capacity data of each scenic spot, the present example uses the data of the receptionist in the golden week of the Jiuzhai-ditch scenic spot as a reference, and after determining the maximum capacity value of the Jiuzhai-ditch scenic spot, the assumed data is given to the maximum capacity of other scenic spots (see table 1).
TABLE 18 number of sights involved in line and maximum capacity
The half-day is selected as a time unit, and route data is sorted, so that the scenic spot routes corresponding to the eight routes are shown in the table 2.
TABLE 2 eight lines itinerary summary
Assuming that there are only 8 tourist routes in the scenic spot of the state of the aba every day, considering that the tourist routes of the same party may meet the same scenic spot in the same time period after departing on different or the same date, the 8 tourist routes need to be sequentially arranged according to the departure dates, considering that the longest route is 6 days, and thus, the 8 tourist routes are repeatedly started every day from 26 days of 9 months until 7 days of 10 months. Therefore, a 96 x 24-order matrix is constructed, and then only a travel scenic spot number data matrix B of the travel route in the golden week period from 10 month 1 to 10 month 7 in the related date interval is intercepted, namely the 96 x 14-order matrix:
B=(bij)96×14
the linear constraint of each scene point to the corresponding line in each time period can be obtained by summarizing and counting the line conditions of each scene point in 14 time periods, an actual optimal collocation mathematical model of the state of the Abam tour line is obtained, then the mathematic model is used for solving, and the final result is collated as shown in the following table 3.
TABLE 3 model measurement results
Line i | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | Total number of |
Number of people (human) | 9197 | 4725 | 1821 | 79 | 449 | 85 | 3056 | 589 | 20000 |
Therefore, the maximum number of people corresponding to the lines 1-8 is calculated, and scientific management and control on the 8 tourist routes with groups can be realized on the basis of the data result because the maximum value is known. At the moment, the sum of the number of all lines passing through any scenic spot in any time period is less than or equal to the maximum capacity of the scenic spot, and the sum of the maximum number of corresponding lines is 20000 people.
In a word, the invention mainly utilizes the restriction of the number of people in all scenic spots where tourists travel with the group line to limit the number of people in each travel line, realizes scientific number management and control, and limits and shunts the number of people, thereby avoiding the occurrence of congestion in each scenic spot in each time period because the number of people exceeds the capacity of the scenic spot, and providing a basis for scientific management and control of the number of people in the scenic spots.
Although embodiments of the present invention have been shown and described, it will be appreciated by those skilled in the art that changes, modifications, substitutions and alterations can be made in these embodiments without departing from the principles and spirit of the invention, the scope of which is defined in the appended claims and their equivalents.
Claims (4)
1. A tourist group-following line people number control method is characterized by comprising the following steps:
step 1, determining scenic spots related to management and control and historical data time span based on the management and control;
step 2, collecting the tour and group following routes of each scenic spot in the route;
step 3, dividing time periods, and counting the number of group-following persons meeting each scenic spot in each time period according to historical data;
step 4, according to the bearing capacity of each scenic spot, restricting the number of people of each scenic spot in each time period, determining an optimization target and establishing an optimization problem;
step 5, solving an optimization problem to obtain the maximum number of people of each tour group following route;
and 6, managing and controlling each tour group-following route according to the maximum number of people.
2. The method for managing and controlling the number of people on the travel party line according to claim 1, wherein the specific manner of the step 2 is as follows:
step 2.1, acquiring a tour group route containing related scenic spots from an online tour ticketing website by means of crawler software, and acquiring information of scenic spot names, stay time of each scenic spot, positions of the scenic spots corresponding to each time period and track routes of the scenic spots;
step 2.2, data cleaning and extraction are carried out on the data obtained in the step 2.1, wherein the data cleaning and extraction comprises missing value processing, repeated item processing and important information extraction;
step 2.3, screening out tour heel group lines i and X of scenic spots with congestion phenomena in tour peak periodsiThe total number of screened lines is n for the number of people corresponding to the line i.
3. The method for managing and controlling the number of people on the travel party line according to claim 2, wherein the specific manner of the step 3 is as follows:
step 3.1 introduction of the amount of marker aijhThe description is that the marking quantity of whether the line i is in the sight spot h in the time period j, the marking quantity indicates 'absent' when the value is 0, and the marking quantity indicates 'present' when the value is 1;
4. The people number control method for the travel party line as claimed in claim 3, wherein the specific manner of the step 5 is as follows:
step 5.1, establishing a constraint condition, namely, ensuring that the number of persons in the group-following tourist routes passing each scenic spot in each time period is ensured when no congestion occurs in the scenic spotThe number of actually containable tourists of the scenic spot is less than or equal to the number of actually containable tourists of the scenic spot;
step 5.2, establishing a scenic spot management target, namely, under the condition that the constraint condition of the step 5.1 is met, maximizing the sum of the number of persons of each party-following route, namely, enabling the sum of the number of persons of each party-following route to be maximum
And 5.3, establishing a simple linear programming problem in the steps 5.1 and 5.2, and directly solving the problem through matlab so as to obtain the maximum number of people on each tour group-following route.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202110766990.XA CN113536090B (en) | 2021-07-07 | 2021-07-07 | Tourist group-following line people number management and control method |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202110766990.XA CN113536090B (en) | 2021-07-07 | 2021-07-07 | Tourist group-following line people number management and control method |
Publications (2)
Publication Number | Publication Date |
---|---|
CN113536090A true CN113536090A (en) | 2021-10-22 |
CN113536090B CN113536090B (en) | 2022-09-16 |
Family
ID=78126971
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN202110766990.XA Active CN113536090B (en) | 2021-07-07 | 2021-07-07 | Tourist group-following line people number management and control method |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN113536090B (en) |
Citations (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2003023733A1 (en) * | 2001-09-07 | 2003-03-20 | Eric Jacquelin | Method and devices for assisting tourist movements |
CN106204357A (en) * | 2016-06-25 | 2016-12-07 | 郑州航空工业管理学院 | A kind of smart travel application platform |
CN108629323A (en) * | 2018-05-11 | 2018-10-09 | 哈尔滨工业大学 | A kind of integrated providing method of scenic spot tourist chain type trip |
CN108710669A (en) * | 2018-05-16 | 2018-10-26 | 清远博云软件有限公司 | A kind of tourist attractions travelling route formulating method |
CN109255734A (en) * | 2018-09-28 | 2019-01-22 | 赛拓信息技术有限公司 | Travel Service Management System |
CN110766195A (en) * | 2019-09-16 | 2020-02-07 | 武汉理工大学 | Scenic spot internal tour path planning method based on tourist demands |
CN112084401A (en) * | 2020-08-18 | 2020-12-15 | 桂林理工大学 | Tour route customizing device and method |
-
2021
- 2021-07-07 CN CN202110766990.XA patent/CN113536090B/en active Active
Patent Citations (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2003023733A1 (en) * | 2001-09-07 | 2003-03-20 | Eric Jacquelin | Method and devices for assisting tourist movements |
CN106204357A (en) * | 2016-06-25 | 2016-12-07 | 郑州航空工业管理学院 | A kind of smart travel application platform |
CN108629323A (en) * | 2018-05-11 | 2018-10-09 | 哈尔滨工业大学 | A kind of integrated providing method of scenic spot tourist chain type trip |
CN108710669A (en) * | 2018-05-16 | 2018-10-26 | 清远博云软件有限公司 | A kind of tourist attractions travelling route formulating method |
CN109255734A (en) * | 2018-09-28 | 2019-01-22 | 赛拓信息技术有限公司 | Travel Service Management System |
CN110766195A (en) * | 2019-09-16 | 2020-02-07 | 武汉理工大学 | Scenic spot internal tour path planning method based on tourist demands |
CN112084401A (en) * | 2020-08-18 | 2020-12-15 | 桂林理工大学 | Tour route customizing device and method |
Non-Patent Citations (2)
Title |
---|
YAN-YING CHEN, AN-JUNG CHENG,ET.AL.: "Travel Recommendation by Mining People Attributes and Travel Group Types From Community-Contributed Photos", 《IEEE TRANSACTIONS ON MULTIMEDIA》 * |
郑婉婷,李岩琦 ,景慎艳: "心扬旅行社管理系统设计与实现", 《电子世界》 * |
Also Published As
Publication number | Publication date |
---|---|
CN113536090B (en) | 2022-09-16 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Tiebout | An economic theory of fiscal decentralization | |
Alder et al. | Political distortions and infrastructure networks in China: A quantitative spatial equilibrium analysis | |
Mekonnen | Population forecasting for design of water supply system in Injibara Town, Amhara Region, Ethiopia | |
CN113380071A (en) | Parking space level parking demand state evaluation method for large complex | |
Thawaba | Building and planning regulations under Israeli colonial power: a critical study from Palestine | |
Shejul et al. | Temporal Analysis of Human Resources Development (HRD) in Pathardi Tehsil of Ahmednagar District, Maharashtra State, India | |
CN113536090B (en) | Tourist group-following line people number management and control method | |
Duque et al. | The 2007 Spanish National Immigrant Survey (ENI): Sampling from the Padrón | |
Gilbert | Planning, invasions and land speculation: the role of the state in Venezuela | |
CN114861975A (en) | Urban tourism traffic demand joint prediction method based on attraction strength | |
Singh | Urbanization trends in Manipur: emerging problems and prospects | |
Valliant et al. | Area sampling | |
CN108417040B (en) | Characteristic town traffic distribution prediction method | |
Neiman et al. | Review of the 2010 sample redesign of the consumer expenditure survey | |
Gancarczyk et al. | City smart specializations in tourism: The cases of Kraków, Poland, and Košice, Slovakia | |
Sanders | Linking station node-and place functions to traffic flow: a case study of the Tokyu Den-En Toshi line in Tokyo, Japan | |
Mella-Márquez et al. | 13. Urban Growth and Territorial Dynamics: A Spatial-Econometric Analysis of Spain | |
United States. Bureau of the Census | Current Population Survey: Design and Methodology | |
Farahmand | Migration to a New Settlement: A Study in District 17, Kabul, Afghanistan | |
Verkulevičiūtė-Kriukienė et al. | DEMOGRAPHIC AND SOCIAL CHANGES IN SUBURBS OF KLAIPĖDA IN 2010-2017. | |
Wollmann | Position and Functions of Local Government in Germany’s Federal Multi-level System | |
Comandon | Ethnoracial Diversification at the Edges of Exclusion | |
Aye | Censuses in Myanmar History | |
Bugenimana et al. | ANALYSIS OF SPATIAL AND TEMPORAL VARIATION OF LAND PRICES IN URBAN | |
Picó | Planning in Puerto Rico |
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 |