CN103593729A - Dynamical grouping method for travelling - Google Patents
Dynamical grouping method for travelling Download PDFInfo
- Publication number
- CN103593729A CN103593729A CN201310517593.4A CN201310517593A CN103593729A CN 103593729 A CN103593729 A CN 103593729A CN 201310517593 A CN201310517593 A CN 201310517593A CN 103593729 A CN103593729 A CN 103593729A
- Authority
- CN
- China
- Prior art keywords
- group
- distance
- tourism
- tourist
- threshold value
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Landscapes
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention provides a dynamical grouping method for travelling. Before travelling, all travelers are grouped preliminarily, and a group leader is elected; during travelling, a client terminal collects the position of members of the travel groups and the position of each group and sends the positions to a server terminal; the server terminal calculates the first distance Lij between one member of the travel groups and the position of the group to which the member belongs, and the minimum distance between the member of the travel groups and the position of other groups, namely the second distance Sjh; if the Lij is larger than the distance threshold value Mi and the Sjh is smaller than the distance threshold value Mh, the member is divided into a new group; if the Lij is larger than the distance threshold value Mi, the Sjh is larger than the distance threshold value Mh, and the time threshold value T is exceeded, the member is regarded to be in a falling behind state; if the first distance Lij between one member of the travel groups and the position of the group to which the member belongs does not exceed the distance threshold value Mi, a person can return the step of collecting the position of the members of the travel group. By means of the dynamical grouping method for travelling, management burdens of managers can be relieved effectively, management efficiency is improved, and meanwhile the degree of freedom of the members of the travel groups in the travelling process can be improved.
Description
Technical field
The present invention is about a kind of group technology, particularly relevant for a kind of tourism Dynamic Packet method.
Background technology
Now in tourist group's tourism process, by conducting a sightseeing tour or the person in overall of tourist group manages whole team, sometimes tourist group's number is too many, in tourism process due to the member of tourist group acts presumptuously or tourism process in emergency situations, only by conducting a sightseeing tour or the person in overall of tourist group manages whole tourist group and easily causes the phenomenon that the efficiency of management is low, simultaneously in tradition tourism, in order to prevent falling behind, all members of tourist group must closely be centered around guide or the person in overall of tourist group around, greatly reduce the degree of freedom of the member of tourist group in tourism process.
Summary of the invention
For the problems referred to above, the invention provides a kind of tourism Dynamic Packet method, comprise:
S1: tentatively divide into groups before tourism and select group leader;
S2: client gathers all members' of tourist group position and the group position of group and sends to server end;
S3: server end calculates the first distance L ij of the group position of the member Yu Qi of tourist group place group, judges whether to exceed distance threshold Mi, if so, carries out step S4, if not, returns to step S2;
S4: server end calculates the distance of the member of this tourist group and every other group's group position successively, selects minimum distance as second distance Sjh, judges that Sjh whether in distance threshold Mh, if so, carries out step S5, if not, skips to step S6;
S5: by its minute in new group;
S6: do the processing of falling behind;
Wherein, the first distance L ij is member j in i group and the distance of i group group position, and i represents i group, and j represents all members' of tourist group numbering; That distance of value minimum in each distance value of group position of the member of second distance tourist group and other groups, second distance Sjh just represents the distance of the member j of tourist group distance h group, and threshold value Mi, Mh represent respectively the threshold value of i group and h group, and h is not equal to i.
According to above-mentioned tourism Dynamic Packet method, the initial packet list of being specified the member of tourist group in step S1 by supvr.
According to above-mentioned tourism Dynamic Packet method, in step S2, calculate group position and organize all members' of tourist group center for this.
According to above-mentioned tourism Dynamic Packet method, step S2Zhong group position is group leader position.
According to above-mentioned tourism Dynamic Packet method, step S3 middle distance threshold value Mi is fixed value.
According to above-mentioned tourism Dynamic Packet method, it is entirely not identical that each organizes distance threshold Mi.
According to above-mentioned tourism Dynamic Packet method, step S3 middle distance threshold value Mi is dynamic adjusted value.
According to above-mentioned tourism Dynamic Packet method, step S6 judges whether to exceed time threshold T, if exceed, does the processing of falling behind, if do not exceed, returns to step 2.
The tourism Dynamic Packet method that invention provides, before tourism, all passengers are tentatively divided into groups and select group leader, in tourism process, client gathers all members' of tourist group position and the group position of group and sends to server end, by server end, calculated the member Yu Qi of tourist group place group group position the first distance L ij and with the minor increment of the distance of other group's group positions, second distance Ljh, if Lij is greater than distance threshold Mi and Ljh is less than distance threshold Mh, by its minute in new group, if Lij is greater than distance threshold Mi, while Ljh is also greater than distance threshold Mh, and exceed time threshold T and do the processing of falling behind, if the first distance L ij of the group position of the member Yu Qi of tourist group place group does not exceed distance threshold Mi, return to the member's of Resurvey tourist group position.Tourism Dynamic Packet method provided by the invention is compared tradition by conducting a sightseeing tour or the person in overall of tourist group manages whole tourist group, grouping management can effectively alleviate gerentocratic administrative burden, improve the efficiency of management, promote the degree of freedom of the member of tourist group in tourism process simultaneously.
Accompanying drawing explanation
Fig. 1 is tourism Dynamic Packet method flow diagram provided by the invention.
Embodiment
For making that object of the present invention, feature and function thereof are had to further understanding, hereby coordinate embodiment to be described in detail as follows.
The invention provides a kind of tourism Dynamic Packet method, comprise:
S1: tentatively divide into groups before tourism and select group leader;
S2: client gathers all members' of tourist group position and the group position of each group and sends to server end;
S3: server end calculates the first distance L ij of the group position of the member Yu Qi of tourist group place group, judges whether to exceed distance threshold Mi, if so, carries out step S4, if not, returns to step S2;
S4: server end calculates the distance of the member of this tourist group and every other group's group position successively, selects minimum distance as second distance Sjh, judges that Sjh whether in distance threshold Mh, if so, carries out step S5, if not, skips to step S6;
S5: by its minute in new group;
S6: do the processing of falling behind.
The first distance refers to the distance of the group position of the member of tourist group and own place group, second distance refers to the distance of the group position of the member of tourist group and other groups, above-mentioned, the first distance L ij is the distance of the group position of member j in i group and i group, i represents i group, and j represents all members' of tourist group numbering; Second distance is that distance of the value minimum in each distance values of group position of the member of tourist group and other groups, second distance Sjh means the distance of the member j of tourist group distance h group, threshold value Mi, Mh represent respectively the threshold value of i group and h group, and h is not equal to i.Before tourism, all members of tourist group are tentatively divided into groups and select group leader, choosing of group leader can be that tourism experience is the abundantest, or the decision of drawing lots, the present invention does not limit, in tourism process, client gathers all members' of tourist group position and the group position of each group and sends it to server end, by server end, calculated the member Yu Qi of tourist group place group group position the first distance L ij and with the minor increment of the distance of other group's group positions, second distance Sjh namely, if Lij is greater than distance threshold Mi and Sjh is less than distance threshold Mh, by its minute in new h group, if Lij is greater than distance threshold Mi and Sjh is greater than distance threshold Mh, do the processing of falling behind.
According to above-mentioned tourism Dynamic Packet method, in step S1, supvr specifies the member's of tourist group initial packet list.All members' of tourist group list all carries out label, and order is 1,2,3 ... j, supvr can the responsible official of tourist group or tourism guide, and all members of tourist group are carried out to designated packet, concrete every group of several individuals can be definite according to actual conditions, and the present invention does not limit.
Further, in step S2, calculate group position and organize all members' of tourist group center for this.Client sends to server end after gathering all members' of tourist group position, by server end, according to the preliminary grouping before tourism, calculates the center of the member of tourist group position of each group as the group position of group.Such as, in a certain tourist group, in the member of tourist group A, B, the preliminary grouping of tri-members of C before tourism, be divided into one group, A, B, C tri-people's transverse and longitudinal coordinate is respectively S (A)=(50,160), S (B)=(52,158), S (C)=(51,162), after calculating mean value, the group position of group is ((50+52+51)/3, (160+158+162)/3)=(51,160), that is, the group position of final definite A, B, C San Ren place group is that transverse and longitudinal coordinate is the position of (51,160).Or, behind the client collection all members' of tourist group position, sending to server end, server end is using the group leader's of each group position as group position.
According to above-mentioned tourism Dynamic Packet method, step S3 middle distance threshold value Mi is fixed value or dynamic adjusted value.Distance threshold Mi can set a fixed value in original state, uses all the time this distance threshold Mi in tourism process; Also can in tourism process, according to circumstances dynamically adjust distance threshold Mi, for example, bad in weather condition, or visitor's number is more concentrated at a certain sight spot, in order to guarantee better to manage each group, distance threshold can be set as within the scope of 10 meters, if the judgement member's of tourist group positional distance group position exceeds 10 meters, judge that the member of tourist group need to divide into groups or judge whether to fall behind again, if the judgement member's of tourist group positional distance guide's position, within the scope of 10 meters, does not need it again to divide into groups.On the contrary, weather condition is better, or when a certain sight spot visitor people is relatively less, distance threshold can be set as within the scope of 20 meters, if the judgement member's of tourist group positional distance group position exceeds 20 meters, judge that the member of tourist group need to divide into groups or judge whether to fall behind again, if the judgement member's of tourist group positional distance guide's position is within the scope of 20 meters, do not need it again to divide into groups.Occurrence the present invention of this Threshold does not limit.
In actual tourism process, because all members of tourist group present position is different, the requirement of the threshold value of adjusting the distance Mi is also different, can require to set every group of incomplete identical value according to different distance thresholds, the distance threshold Mi that all i groups can be set is not identical, the distance threshold that some group in all groups also can be set is identical, does not limit herein.
Further, referring to Fig. 1, step S6 judges whether to exceed time threshold T, if exceed, does the processing of falling behind, if do not exceed, returns to step 2.In tourism process, client gathers all members' of tourist group position and the group position of each group and sends to server end, by server end, calculated the member Yu Qi of Mei Zu tourist group place group group position the first distance L ij and with the second distance Ljh of the group position of other groups, if Lij is greater than the distance threshold Mi of i group and the distance threshold Mh that Sjh is less than h group, by its minute in new h group, if Lij is greater than the distance threshold Mi of i group and time that Sjh is greater than the distance threshold Mh of h group has surpassed time threshold T, do the processing of falling behind.Particularly, whether the distance L ij that server calculates the group position of each own place of member's distance group in group exceeds the distance threshold Mi of this group, if exceed, calculate and exceed the minor increment in this group (i.e. i group) member of distance threshold Mi and the distance of other each group positions simultaneously, in the distance threshold Mh that namely whether second distance is organized at h apart from Sjh, if in threshold value Mh, added new h group, if judge Lij, Sjh is greater than respectively the distance threshold Mi of i group and the distance threshold Mh of h group, and the time of server statistics exceeds time threshold T, do the processing of falling behind, the information about firms of falling behind is issued the supvr of tourist group, by supvr, adjust in time tour schedule arrangement.Illustrate, guide G leads 1, 2, 3 San Ge groups, all members of tourist group are numbered 1, 2, 3, 4, 5, 6, 7, 8, the member of 9, the 1 groups is numbered 1, 2, 3 member, group leader is the member of numbering 1, the member of the 2nd group is numbered 4, 5, 6 member, group leader is for numbering 4 member, and the member of the 3rd group has numbering 7, 8, 9 member, group leader is numbering 7 member, supposes in tourism process the 1st, 2, the group position of 3 groups is respectively group leader's position, if in tourism way, it is 2 member and first distance L 12 of the 1st group at its place that server calculates numbering, L12=10 rice, exceed the distance threshold M1 of the 1st group, M1=8 rice, start timing simultaneously, if in time threshold T, such as T is 15 minutes, server calculates the distance be numbered 2 member and the group position of the 2nd group and the distance that is numbered the group position of 2 member and the 3rd group, the distance of judging the group position that is numbered 2 member and the 3rd group is minimum, using the distance that is numbered 2 member and the 3rd group of group position as second distance, and judge the distance threshold M3 that second distance L23 is less than the 3rd group, for example, L23=6 rice, M3=8 rice, the member of tourist group who is numbered 2 is joined to the 3rd group, if in time threshold T, do not detect yet and be numbered 2 member and add original group or new group, in Ze Dui tourist group, be numbered 2 the member processing of falling behind.Send to guide G to adjust in time personnel placement or tour schedule arrangement the member's that falls behind information.
The tourism Dynamic Packet method that invention provides, before tourism, all passengers are tentatively divided into groups and select group leader, in tourism process, client gathers all members' of tourist group position and the group position of group and sends to server end, by server end, calculated the member Yu Qi of tourist group place group group position the first distance L ij and with the minor increment of the distance of other group's group positions, be second distance Sjh, if Lij is greater than distance threshold Mi and Sjh is less than distance threshold Mh, by its minute in new group, if Lij is greater than distance threshold Mi, while Sjh is also greater than distance threshold Mh, and exceed time threshold T and do the processing of falling behind, if the first distance L ij of the group position of the member Yu Qi of tourist group place group does not exceed distance threshold Mi, return to the member's of Resurvey tourist group position.Tourism Dynamic Packet method provided by the invention is compared tradition by conducting a sightseeing tour or the person in overall of tourist group manages whole tourist group, grouping management can effectively alleviate gerentocratic administrative burden, improve the efficiency of management, promote the degree of freedom of the member of tourist group in tourism process simultaneously.
Claims (8)
1. a tourism Dynamic Packet method, is characterized in that, this tourism Dynamic Packet method comprises:
S1: tentatively divide into groups before tourism and select group leader;
S2: client gathers all members' of tourist group position and the group position of group and sends to server end;
S3: server end calculates the first distance L ij of the group position of the member Yu Qi of tourist group place group, judges whether to exceed distance threshold Mi, if so, carries out step S4, if not, returns to step S2;
S4: server end calculates the distance of the member of this tourist group and every other group's group position successively, selects minimum distance as second distance Sjh, judges that Sjh whether in distance threshold Mh, if so, carries out step S5, if not, skips to step S6;
S5: by its minute in new group;
S6: do the processing of falling behind;
Wherein, the first distance L ij is member j in i group and the distance of i group group position, and i represents i group, and j represents all members' of tourist group numbering; That distance of value minimum in each distance value of group position of the member of second distance tourist group and other groups, second distance Sjh just represents the distance of the member j of tourist group distance h group, and threshold value Mi, Mh represent respectively the threshold value of i group and h group, and h is not equal to i.
2. tourism Dynamic Packet method according to claim 1, is characterized in that, is specified the member's of tourist group initial packet list in step S1 by supvr.
3. tourism Dynamic Packet method according to claim 1, is characterized in that, calculates group position and organize all members' of tourist group center for this in step S2.
4. tourism Dynamic Packet method according to claim 1, is characterized in that, step S2Zhong group position is group leader position.
5. tourism Dynamic Packet method according to claim 1, is characterized in that, step S3 middle distance threshold value Mi is fixed value.
6. tourism Dynamic Packet method according to claim 5, is characterized in that, it is entirely not identical that each organizes distance threshold Mi.
7. tourism Dynamic Packet method according to claim 1, is characterized in that, step S3 middle distance threshold value Mi is dynamic adjusted value.
8. tourism Dynamic Packet method according to claim 1, is characterized in that, step S6 judges whether to exceed time threshold T, if exceed, does the processing of falling behind, if do not exceed, returns to step 2.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310517593.4A CN103593729A (en) | 2013-10-28 | 2013-10-28 | Dynamical grouping method for travelling |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310517593.4A CN103593729A (en) | 2013-10-28 | 2013-10-28 | Dynamical grouping method for travelling |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN103593729A true CN103593729A (en) | 2014-02-19 |
Family
ID=50083858
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310517593.4A Pending CN103593729A (en) | 2013-10-28 | 2013-10-28 | Dynamical grouping method for travelling |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103593729A (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107103502A (en) * | 2017-03-07 | 2017-08-29 | 阿里巴巴集团控股有限公司 | A kind of sequence information determines method and apparatus |
| WO2018040671A1 (en) * | 2016-08-31 | 2018-03-08 | 无锡知谷网络科技有限公司 | Classification method and electronic device for activity target group |
| CN112330498A (en) * | 2020-10-22 | 2021-02-05 | 马上游科技股份有限公司 | Method and system for carrying out grouping management based on tourist positions |
| CN113490140A (en) * | 2021-07-05 | 2021-10-08 | 南京领创信息科技有限公司 | Method for detecting abnormal position of group member |
| WO2022227419A1 (en) * | 2021-04-27 | 2022-11-03 | 深圳市慧鲤科技有限公司 | Multi-user assembling method and apparatus, and electronic device, storage medium, computer program and computer program product |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2006276380A (en) * | 2005-03-29 | 2006-10-12 | Hitachi Ltd | Group member location information sharing system, and server device thereof and portable terminal |
| CN101067654A (en) * | 2007-05-10 | 2007-11-07 | 南京师范大学 | Travelling group team management system based mobile positioning technique and GIS |
| CN101854582A (en) * | 2009-03-31 | 2010-10-06 | 北京首科软件及系统集成有限责任公司 | Touring team management terminal and method |
| CN102571866A (en) * | 2010-12-30 | 2012-07-11 | 上海博泰悦臻电子设备制造有限公司 | Dynamic vehicle companion club building method and system |
-
2013
- 2013-10-28 CN CN201310517593.4A patent/CN103593729A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2006276380A (en) * | 2005-03-29 | 2006-10-12 | Hitachi Ltd | Group member location information sharing system, and server device thereof and portable terminal |
| CN101067654A (en) * | 2007-05-10 | 2007-11-07 | 南京师范大学 | Travelling group team management system based mobile positioning technique and GIS |
| CN101854582A (en) * | 2009-03-31 | 2010-10-06 | 北京首科软件及系统集成有限责任公司 | Touring team management terminal and method |
| CN102571866A (en) * | 2010-12-30 | 2012-07-11 | 上海博泰悦臻电子设备制造有限公司 | Dynamic vehicle companion club building method and system |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2018040671A1 (en) * | 2016-08-31 | 2018-03-08 | 无锡知谷网络科技有限公司 | Classification method and electronic device for activity target group |
| CN107103502A (en) * | 2017-03-07 | 2017-08-29 | 阿里巴巴集团控股有限公司 | A kind of sequence information determines method and apparatus |
| CN107103502B (en) * | 2017-03-07 | 2020-06-30 | 阿里巴巴集团控股有限公司 | Order information determining method and device |
| US11107145B2 (en) | 2017-03-07 | 2021-08-31 | Advanced New Technologies Co., Ltd. | Order determination method, non-transitory computer-readable medium and system in an unmanned store |
| CN112330498A (en) * | 2020-10-22 | 2021-02-05 | 马上游科技股份有限公司 | Method and system for carrying out grouping management based on tourist positions |
| WO2022227419A1 (en) * | 2021-04-27 | 2022-11-03 | 深圳市慧鲤科技有限公司 | Multi-user assembling method and apparatus, and electronic device, storage medium, computer program and computer program product |
| CN113490140A (en) * | 2021-07-05 | 2021-10-08 | 南京领创信息科技有限公司 | Method for detecting abnormal position of group member |
| CN113490140B (en) * | 2021-07-05 | 2023-07-07 | 南京领创信息科技有限公司 | Method for detecting abnormal position of group member |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103593729A (en) | Dynamical grouping method for travelling | |
| CN104700159A (en) | Monitoring and early warning system for rail transit passenger flow | |
| CN106875314A (en) | A kind of Urban Rail Transit passenger flow OD method for dynamic estimation | |
| CN108961747A (en) | A kind of urban road traffic state information extracting method under incomplete bayonet data qualification | |
| CN105427594A (en) | Bidirectional-getting-on-passenger-flow-based obtaining method and system for bus section passenger flow volume | |
| CN105225481A (en) | A kind of acquisition method of real-time road condition information and system | |
| CN103634807A (en) | WIFI data hotspot cell data monitoring method and WLAN deployment ordering method and device | |
| CN103869192A (en) | Smart power grid line loss detection method and system | |
| CN108334831A (en) | A kind of monitoring image processing method, monitoring terminal and system | |
| CN107861098A (en) | A kind of intelligent court alignment system and method | |
| CN105470954B (en) | A kind of power transmission line dynamic capacity increase system | |
| CN104994138A (en) | Positioning device, positioning system and data transmission method | |
| CN106789347A (en) | A kind of method that alarm association and network fault diagnosis are realized based on alarm data | |
| CN108200566A (en) | A kind of flow congestion's method for early warning and device | |
| CN110493146A (en) | A kind of Edge intelligence network aware platform and control method | |
| CN106991804B (en) | Urban public transport working condition construction method based on multi-line coupling | |
| CN104346839A (en) | Electronic employee attendance system based on local area network | |
| CN113935595B (en) | Urban rail transit road network peak large passenger flow dredging system | |
| CN109272760B (en) | Online detection method for abnormal data value of SCATS system detector | |
| CN111063049A (en) | Power grid line engineering attendance checking method and system | |
| CN105118310A (en) | Video-based single-point self-optimization signal control method and device | |
| CN105489010A (en) | System and method for monitoring and analyzing fast road travel time reliability | |
| CN103617582A (en) | Method for determining members falling behind in traveling | |
| CN106790474A (en) | A kind of energy data real-time acquisition system and acquisition method | |
| CN106803937A (en) | A kind of double-camera video frequency monitoring method and system with text log |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20140219 |
|
| RJ01 | Rejection of invention patent application after publication |