CN102930355A - Meal delivery system capable of calculating optimal path during movement process of both parties - Google Patents
Meal delivery system capable of calculating optimal path during movement process of both parties Download PDFInfo
- Publication number
- CN102930355A CN102930355A CN2012104541233A CN201210454123A CN102930355A CN 102930355 A CN102930355 A CN 102930355A CN 2012104541233 A CN2012104541233 A CN 2012104541233A CN 201210454123 A CN201210454123 A CN 201210454123A CN 102930355 A CN102930355 A CN 102930355A
- Authority
- CN
- China
- Prior art keywords
- ordering
- mobile
- data processor
- person
- meal
- 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 discloses a meal delivery system capable of calculating an optimal path during the movement process of both parties; the system comprises mobile meal ordering terminals used by meal orderers, mobile dinning cars dispatched by a selling shop and a central data processor. The system is characterized in that; the meal orderers send location information and meal ordering request data to the central data processor by the mobile meal ordering terminals; the central data processor searches the mobile dinning cars in a shortest path search algorithm and matches the mobile dinning cars nearest to the meal orderers on a golf course; and the mobile dinning cars receive the dispatching of the central data processor and carry out meal delivery requests. The meal delivery system has the following beneficial effects: with the application of the meal delivery system, various shortages of the meal ordering on the common golf course are overcome so that the dinning cars can position the meal orderers accurately on the vast course; and therefore, a lot of labors are saved, the meal delivery time is shortened greatly, the informationization and automation degrees of the management are improved effectively, the service level is promoted and the enjoyment experience of the consumers is enhanced.
Description
Technical field
The present invention relates to the functional area of ordering, relate in particular to a kind of both sides calculate optimal path in moving process food delivery system.
Background technology
In order to satisfy guest's consumption demand off the field, general golf course off the field each half-court can be set one and sells after the match the shop, or vending machine.Each shop of selling after the match will have a people to keep an eye at least, and guest's demand just may be consumed when selling shop or vending machine, because the not responsible commodity of sending with charge free in the shop of selling, or allows the caddie go to buy, in the situation that extremely specially just might send the marshal specially to send thing.Just be that the marshal can send thing, also have a problem, when the marshal sent thing to assigned address, the guest may leave this position.The marshal need to go to seek the guest or the assigned address that contacts again the guest.Relatively lose time.The existing common function of ordering on the market, it also is the record of simple food product, not being applicable to golf course orders after the match, for the guest, do not need deliberately to go to the shop of selling when off the field wanting to do shopping and go to buy, as long as the demand that their proposition will be consumed has been selected the commodity of consuming, someone will find him in the very first time, thing is delivered in face of him.For the court, do not need to arrange special people to keep and off the field sell in the shop, also may not be certain necessarily to someone will go shopping.Saved people can be responsible for multidigit guest food delivery simultaneously.More rational personnel have been carried out distribute utilizing.
Summary of the invention
The present invention is directed to the proposition of above problem, and develop a kind of both sides calculate optimal path in moving process food delivery system, saved human resources, for client provides better service.
A kind of both sides calculate the food delivery system of optimal path in moving process, comprise mobile goods selling vehicle and the central data processor of ordering movement that the person of ordering uses terminal, the shop of selling sending, and described both sides calculate optimal path in moving process food delivery system comprises:
The mobile terminal of ordering, be used for calculating the current positional information of the person of ordering, the transmission person's of ordering the request of ordering and position data show the person's of ordering current location to central data processor at electronic chart, receive and show in real time position and the status information of the mobile goods selling vehicle that comes to serve;
Central data processor, be used for receiving the request of ordering and position data from the mobile terminal of ordering, utilize the nearest after the match mobile goods selling vehicle of Shortest Path Searching Algorithm search and the matching distance person of ordering, and the request of ordering and position data that will the person of ordering send to qualified mobile goods selling vehicle;
Mobile goods selling vehicle is asked and the backward central data processor transmission of position data feedback information for the ordering of the person of ordering that the receiving center data processor sends over, and feedback information comprises to be accepted or the refusal request of ordering.
Preferably, described both sides calculate the food delivery method of optimal path in moving process, may further comprise the steps:
Central data processor is utilized the nearest after the match mobile goods selling vehicle of Shortest Path Searching Algorithm search and the matching distance person of ordering according to the request of ordering and location information data from the mobile terminal of ordering;
The person's of ordering the request of ordering and position data are sent to qualified mobile goods selling vehicle;
Mobile goods selling vehicle sends feedback information to central data processor, and feedback information comprises to be accepted or the refusal request of ordering.
Preferably, the order acquisition methods of location information data of terminal of described movement is: after the mobile terminal of ordering is obtained gps data by the GPS receiver, data layout according to the communications protocol regulation is resolved data, extracts longitude, latitude, longitudinal, latitude direction and positioning states.
Preferably, described both sides calculate the food delivery method of optimal path in moving process, also comprise the steps: when the feedback information that mobile goods selling vehicle sends to central data processor is ordered solicited message for refusal, central data processor continues to utilize Shortest Path Searching Algorithm search and coupling except the nearest after the match mobile goods selling vehicle of other distance persons of ordering, until search out qualified mobile goods selling vehicle.
Preferably, described Shortest Path Searching Algorithm search and the matching distance person's of ordering the method for utilizing may further comprise the steps:
Step 1, judge the node that mobile order terminal and road overlap, judge at first namely whether the mobile terminal of ordering belongs to certain zone, if it is finds the door in this zone, otherwise find the distance moving nearest circuit node of terminal of ordering with regard to the node on all roads of circulating;
Step 2, the node that finds mobile goods selling vehicle and road to overlap, the node by all roads of circulating finds the nearest circuit node of distance moving wheeled sell system;
Step 3, calculate distance, all routes that circulates are judged these two nodes whether on this route, and distance are obtained in circulation;
Step 4, take out the route of bee-line in all distances.
Preferably, calculate the food delivery method of optimal path in the described moving process, adopt the GSM short message mode to send the person's of ordering the request of ordering and position data.
Implement the present invention and have following beneficial effect: use a kind of both sides provided by the invention calculate optimal path in moving process food delivery system, overcome all drawback of common golf course in ordering after the match, so that serving trolley can be in wide court can the precise positioning person of making a reservation, saved a large amount of manpowers, greatly shortened the food delivery time, Effective Raise informationization, the automaticity of management, promoted service level, the enjoyment that has strengthened the consumer is experienced.
Description of drawings
Fig. 1 is overall applicability schematic flow sheet of the present invention;
Fig. 2 is that the present invention calculates the current positional information process flow diagram of the person of ordering;
Fig. 3 is centre data processor workflow diagram of the present invention;
Fig. 4 is that the present invention calculates people road coincidence algorithm flow chart;
Fig. 5 is that the present invention calculates bus or train route coincidence algorithm flow chart;
Fig. 6 is that the present invention calculates the shortest distance route algorithm flow chart.
Embodiment
The invention provides a kind of both sides calculate optimal path in moving process food delivery system, below in conjunction with description of drawings specific embodiments of the present invention.
Fig. 1 is overall applicability schematic flow sheet of the present invention.Wherein, the mobile terminal of ordering is used for calculating the current positional information of the person of ordering, the transmission person's of ordering the request of ordering and position data show the person's of ordering current location to central data processor at electronic chart, receive and show in real time position and the status information of the mobile goods selling vehicle that comes to serve; Central data processor is used for receiving the request of ordering and the position data from the mobile terminal of ordering, utilize the nearest after the match mobile goods selling vehicle of Shortest Path Searching Algorithm search and the matching distance person of ordering, and the request of ordering and position data that will the person of ordering send to qualified mobile goods selling vehicle; Mobile goods selling vehicle is asked and the backward central data processor transmission of position data feedback information for the ordering of the person of ordering that the receiving center data processor sends over, and feedback information comprises to be accepted or the refusal request of ordering.
Concise and to the point step is: send the request of ordering with the GPS location movement of the function terminal of ordering of ordering to central data processor, transmit by wireless.Central data processor is by GPS tracing and positioning function, in conjunction with alley figure, calculate optimum path, to recently and busy mobile goods selling vehicle send the food delivery instruction, receive after the instruction mobile goods selling vehicle and report current present position to the movement terminal of ordering, and rush for the demand place.
Wherein, the application of Geographic Information System is so that our invention can be located each unit more accurately, and emphasis is exactly the making of numerical map.The numerical map element definition has: node, route, zone.Node is the fundamental element of map datum, comprises coordinate (x, y), attribute (circuit node, match play etc.), pointer (node before and after pointing to); Route is the road of describing the court, and the node of storing on every route arrives array; The zone is to be defined in to run into barrier such as mountain, water, sand pit, the place that the people can't walk, be used for finding the node on the nearest road of current location, be defined as ' door ', in each zone in addition definition any point be used for judging use when the people position is whether in the zone.The zone defines with polygonal mode.
Fig. 2 is that the present invention calculates the current positional information process flow diagram of the person of ordering.
The agreement that this example adopts is NMEA0183, and it is that a kind of form is disclosed, represents the agreement of different content with the various ascii strings of CSV.Gps data upgrades coordinate information one time per 1 second, and every string data accounts for delegation, take ASCII character " " be to accord with opening flag as end mark with new line.
After the program of moving on the mobile terminal of ordering receives gps data by the GPS receiver, data layout according to the communications protocol regulation is resolved data, extract longitude, longitudinal, latitude, latitude direction and positioning states, other rejection of data, then judge whether positioning states is effective, if effectively, then submit to data to the position data module.After program GPS receiver parses the longitude and latitude data, data are submitted to this module, data layout be " latitude direction-latitude, longitudinal-longitude " for example " N-103.0898787; E-98.873847 ", this module is sent to the centre data processor with these data with GSM note form.After the mobile terminal of ordering receives the wheeled sell system positional information that the centre data processor sends over, the court map called in internal memory after, with current position with provide the mobile goods selling vehicle of service to be presented in real time on the court electronic chart of oneself.
Fig. 3 is centre data processor workflow diagram of the present invention.Serving trolley among the figure is mobile goods selling vehicle.
The centre data processor is after receiving the request of ordering (comprising simultaneously the person's of ordering current location longitude and latitude data) that the mobile terminal of ordering sends over, seek nearest available serving trolley, after searching nearest idle mobile goods selling vehicle, serving trolley is passed in the request of will ordering, the position data that comprises the person of ordering, hole number, the position of match play (service platform, alley, the fruit mountain range) information, after this mobile goods selling vehicle is received the request of ordering, judging whether can food delivery, if, then reply confirming can food delivery and carry out food delivery, and its state of centre data processor is set to " in the service "; Otherwise the centre data processor is sought other eligible serving trolleys, and namely the near wheeled sell system of the detection range person of ordering second repeats aforesaid operations, until find a mobile goods selling vehicle that can go to service.
Fig. 4 is that the present invention calculates people road coincidence algorithm flow chart, and the people among this figure i.e. the mobile terminal of ordering.
The centre data processor at first obtains the current position of people coordinate, then in numerical map, search All Ranges, the coordinate of the point in the zone and the mobile terminal of ordering is linked to be line segment, whether has intersection point to judge whether the people belongs to certain zone by the limit of judging line segment and arbitrary region.If it is search the door in this zone; Otherwise all routes that just circulate find the circuit node nearest with the people, obtain the node coordinate of people and Lu coincidence with this.
Fig. 5 is that the present invention calculates bus or train route coincidence algorithm flow chart, and the car among this figure is mobile goods selling vehicle.
The centre data processor at first obtains car position coordinate, then searches all route nodes, by calculating the internodal distance of all nodes and car, obtains the shortest node coordinate of distance by all distances relatively.
Fig. 6 is that the present invention calculates the shortest distance route algorithm flow chart, and the car among this figure is mobile goods selling vehicle, and the people among this figure i.e. the mobile terminal of ordering.
The centre data processor is at first obtained the coincidence node on all mobile goods selling vehicles and road and the coincidence node on road, and calculate all mobile goods selling vehicles to the route of the mobile terminal node of ordering according to node pointer, all routes circulate, judge that these two nodes are whether on this route, and calculate the distance of two nodes and road intersection, the follow-up route that will calculate the bee-line in all distances is for use.
The above; only be the better embodiment of the present invention; but protection scope of the present invention is not limited to this; anyly be familiar with those skilled in the art in the technical scope that the present invention discloses; be equal to replacement or change according to technical scheme of the present invention and inventive concept thereof, all should be encompassed within protection scope of the present invention.
Claims (6)
1. both sides calculate the food delivery system of optimal path in moving process, comprise mobile goods selling vehicle and the central data processor of ordering movement that the person of ordering uses terminal, the shop of selling sending, it is characterized in that,
The mobile terminal of ordering, be used for calculating the current positional information of the person of ordering, the transmission person's of ordering the request of ordering and position data show the person's of ordering current location to central data processor at electronic chart, receive and show in real time position and the status information of the mobile goods selling vehicle that comes to serve;
Central data processor, be used for receiving the request of ordering and position data from the mobile terminal of ordering, utilize the nearest after the match mobile goods selling vehicle of Shortest Path Searching Algorithm search and the matching distance person of ordering, and the request of ordering and position data that will the person of ordering send to qualified mobile goods selling vehicle;
Mobile goods selling vehicle is asked and the backward central data processor transmission of position data feedback information for the ordering of the person of ordering that the receiving center data processor sends over, and feedback information comprises to be accepted or the refusal request of ordering.
2. both sides calculate the food delivery method of optimal path in moving process, it is characterized in that, may further comprise the steps:
Central data processor is utilized the nearest after the match mobile goods selling vehicle of Shortest Path Searching Algorithm search and the matching distance person of ordering according to the request of ordering and location information data from the mobile terminal of ordering;
The person's of ordering the request of ordering and position data are sent to qualified mobile goods selling vehicle;
Mobile goods selling vehicle sends feedback information to central data processor, and feedback information comprises to be accepted or the refusal request of ordering.
3. both sides according to claim 2 calculate the food delivery method of optimal path in moving process, it is characterized in that, the acquisition methods of the location information data of the mobile terminal of ordering is: after the mobile terminal of ordering is obtained gps data by the GPS receiver, data layout according to the communications protocol regulation is resolved data, extracts longitude, latitude, longitudinal, latitude direction and positioning states.
According to claim 2 or 3 described both sides in moving process, calculate the food delivery method of optimal path, it is characterized in that, also comprise the steps: when the feedback information that mobile goods selling vehicle sends to central data processor is ordered solicited message for refusal, central data processor continues to utilize Shortest Path Searching Algorithm search and coupling except the nearest after the match mobile goods selling vehicle of other distance persons of ordering, until search out qualified mobile goods selling vehicle.
5. the food delivery method of calculating optimal path in moving process according to claim 2 is characterized in that, utilizes Shortest Path Searching Algorithm search and the matching distance person's of ordering method may further comprise the steps:
Step 1, judge the node that mobile order terminal and road overlap, judge at first namely whether the mobile terminal of ordering belongs to certain zone, if it is finds the door in this zone, otherwise find the distance moving nearest circuit node of terminal of ordering with regard to the node on all roads of circulating;
Step 2, the node that finds mobile goods selling vehicle and road to overlap, the node by all roads of circulating finds the nearest circuit node of distance moving wheeled sell system;
Step 3, calculate distance, all routes that circulates are judged these two nodes whether on this route, and distance are obtained in circulation;
Step 4, take out the route of bee-line in all distances.
6. calculate the food delivery method of optimal path in the moving process according to claim 2, it is characterized in that, adopt the GSM short message mode to send the person's of ordering the request of ordering and position data.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2012104541233A CN102930355A (en) | 2012-11-12 | 2012-11-12 | Meal delivery system capable of calculating optimal path during movement process of both parties |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2012104541233A CN102930355A (en) | 2012-11-12 | 2012-11-12 | Meal delivery system capable of calculating optimal path during movement process of both parties |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN102930355A true CN102930355A (en) | 2013-02-13 |
Family
ID=47645149
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2012104541233A Pending CN102930355A (en) | 2012-11-12 | 2012-11-12 | Meal delivery system capable of calculating optimal path during movement process of both parties |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102930355A (en) |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104992253A (en) * | 2015-07-22 | 2015-10-21 | 程强 | Delivery distribution method and system for food-ordering system |
| CN105262827A (en) * | 2015-10-30 | 2016-01-20 | 上海斐讯数据通信技术有限公司 | Positioning monitoring system and method of O2O service |
| CN105868948A (en) * | 2016-03-25 | 2016-08-17 | 上海斐讯数据通信技术有限公司 | Position real-time monitoring system and method, and meal delivering system |
| WO2017012100A1 (en) * | 2015-07-22 | 2017-01-26 | 程强 | Delivery allocation method and system for food ordering system |
| CN107133848A (en) * | 2017-04-29 | 2017-09-05 | 芜湖酷哇机器人产业技术研究院有限公司 | Linear self service system |
| CN107609996A (en) * | 2017-08-10 | 2018-01-19 | 青岛云盛信息科技有限公司 | Dining car intelligent service platform |
| CN108230098A (en) * | 2017-12-26 | 2018-06-29 | 江苏保千里视像科技集团股份有限公司 | A kind of commodity selling method, device and computer readable storage medium |
| WO2018223495A1 (en) * | 2017-06-07 | 2018-12-13 | 朱小军 | Mobile vending platform and method |
| CN109376952A (en) * | 2018-11-21 | 2019-02-22 | 深圳大学 | A kind of crowdsourcing logistics distribution paths planning method and system based on track big data |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101487721A (en) * | 2009-01-21 | 2009-07-22 | 东北大学 | Method for solving group touring problems by intelligent tour guide system |
| CN101498782A (en) * | 2008-02-02 | 2009-08-05 | 诚实科技股份有限公司 | Position data processing unit and method thereof |
-
2012
- 2012-11-12 CN CN2012104541233A patent/CN102930355A/en active Pending
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101498782A (en) * | 2008-02-02 | 2009-08-05 | 诚实科技股份有限公司 | Position data processing unit and method thereof |
| CN101487721A (en) * | 2009-01-21 | 2009-07-22 | 东北大学 | Method for solving group touring problems by intelligent tour guide system |
Non-Patent Citations (1)
| Title |
|---|
| 朱晓红 等: "GPS智能车辆监控管理系统", 《电子科技》 * |
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104992253A (en) * | 2015-07-22 | 2015-10-21 | 程强 | Delivery distribution method and system for food-ordering system |
| WO2017012100A1 (en) * | 2015-07-22 | 2017-01-26 | 程强 | Delivery allocation method and system for food ordering system |
| CN105262827A (en) * | 2015-10-30 | 2016-01-20 | 上海斐讯数据通信技术有限公司 | Positioning monitoring system and method of O2O service |
| CN105868948A (en) * | 2016-03-25 | 2016-08-17 | 上海斐讯数据通信技术有限公司 | Position real-time monitoring system and method, and meal delivering system |
| CN107133848A (en) * | 2017-04-29 | 2017-09-05 | 芜湖酷哇机器人产业技术研究院有限公司 | Linear self service system |
| WO2018223495A1 (en) * | 2017-06-07 | 2018-12-13 | 朱小军 | Mobile vending platform and method |
| CN107609996A (en) * | 2017-08-10 | 2018-01-19 | 青岛云盛信息科技有限公司 | Dining car intelligent service platform |
| CN108230098A (en) * | 2017-12-26 | 2018-06-29 | 江苏保千里视像科技集团股份有限公司 | A kind of commodity selling method, device and computer readable storage medium |
| CN109376952A (en) * | 2018-11-21 | 2019-02-22 | 深圳大学 | A kind of crowdsourcing logistics distribution paths planning method and system based on track big data |
| CN109376952B (en) * | 2018-11-21 | 2022-10-18 | 深圳大学 | Crowdsourcing logistics distribution path planning method and system based on track big data |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102930355A (en) | Meal delivery system capable of calculating optimal path during movement process of both parties | |
| CN103531025B (en) | A kind of share-car method utilizing line sectionalizing method to carry out match information | |
| RU2682313C2 (en) | System (options) and method (options) of service managing | |
| CN103940441B (en) | A kind of interest point search method and device | |
| CN107527146A (en) | A kind of processing method of cargo transaction information, device, and system | |
| CN106127327A (en) | Dispensing bus station position method and system based on GIS | |
| CN103106571B (en) | A kind of truck haul(ing) supply and demand matching process based on mobile phone position service | |
| CN107464018A (en) | A kind of Distribution path optimization method and device, computer equipment, storage medium | |
| CN104918216A (en) | Advertisement pushing system based on position service and method | |
| CN106170712A (en) | Network-centric location | |
| CN103323011B (en) | Point-to-point guider and the method thereof sharing sight spot information | |
| CN103001991A (en) | Communication method, communication system and communication terminals for electronic commerce | |
| CN103873269A (en) | Group joining method and system | |
| Hong et al. | Crowdsourcing incentives for multi-hop urban parcel delivery network | |
| WO2015013760A1 (en) | Free time activity scheduler | |
| CN102209090A (en) | Advertising information issuing method and system and service platform thereof | |
| CN105070089A (en) | Personalized traffic information service system with man and vehicle collaboration and method | |
| CN111667218A (en) | Intelligent route planning method and system for supply chain logistics distribution | |
| CN104715353A (en) | Internet of Things based logistic control system | |
| CN109711731A (en) | The dispatching method of haulage vehicle | |
| CN107305666A (en) | Car operation route business analysis method and system | |
| CN106355921A (en) | Method for taking taxi based on journey time | |
| CN103106557A (en) | Management system and management method of school bicycles based on Internet of things | |
| CN111652639B (en) | Service recommendation method and system | |
| US20200387869A1 (en) | Delivery system, delivery management system, delivery management device, and delivery management method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| WD01 | Invention patent application deemed withdrawn after publication | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20130213 |