CN110334976B - Computer-implemented baggage retrieval system and method - Google Patents

Computer-implemented baggage retrieval system and method Download PDF

Info

Publication number
CN110334976B
CN110334976B CN201910293993.9A CN201910293993A CN110334976B CN 110334976 B CN110334976 B CN 110334976B CN 201910293993 A CN201910293993 A CN 201910293993A CN 110334976 B CN110334976 B CN 110334976B
Authority
CN
China
Prior art keywords
baggage
information
order
customer
client
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201910293993.9A
Other languages
Chinese (zh)
Other versions
CN110334976A (en
Inventor
安小龙
赵志为
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Zhao Zhiwei
Original Assignee
Individual
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Individual filed Critical Individual
Priority to CN201910293993.9A priority Critical patent/CN110334976B/en
Publication of CN110334976A publication Critical patent/CN110334976A/en
Application granted granted Critical
Publication of CN110334976B publication Critical patent/CN110334976B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • 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/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
    • G06Q10/083—Shipping
    • 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
    • G06Q30/00—Commerce
    • G06Q30/06—Buying, selling or leasing transactions
    • G06Q30/0601—Electronic shopping [e-shopping]
    • G06Q30/0633—Lists, e.g. purchase orders, compilation or processing
    • G06Q30/0635—Processing of requisition or of purchase orders
    • 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
    • G06Q30/00—Commerce
    • G06Q30/06—Buying, selling or leasing transactions
    • G06Q30/0601—Electronic shopping [e-shopping]
    • G06Q30/0639—Item locations
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/12—Protocols specially adapted for proprietary or special-purpose networking environments, e.g. medical networks, sensor networks, networks in vehicles or remote metering networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/50—Network services
    • H04L67/51—Discovery or management thereof, e.g. service location protocol [SLP] or web services
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/50—Network services
    • H04L67/52—Network services specially adapted for the location of the user terminal
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
    • H04W4/02—Services making use of location information
    • H04W4/029—Location-based management or tracking services
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
    • H04W4/30—Services specially adapted for particular environments, situations or purposes
    • H04W4/40—Services specially adapted for particular environments, situations or purposes for vehicles, e.g. vehicle-to-pedestrians [V2P]

Landscapes

  • Engineering & Computer Science (AREA)
  • Business, Economics & Management (AREA)
  • Signal Processing (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Economics (AREA)
  • Finance (AREA)
  • Accounting & Taxation (AREA)
  • General Business, Economics & Management (AREA)
  • Theoretical Computer Science (AREA)
  • Strategic Management (AREA)
  • Development Economics (AREA)
  • Physics & Mathematics (AREA)
  • Marketing (AREA)
  • General Physics & Mathematics (AREA)
  • Human Resources & Organizations (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Health & Medical Sciences (AREA)
  • Computing Systems (AREA)
  • General Health & Medical Sciences (AREA)
  • Medical Informatics (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Tourism & Hospitality (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The invention provides a computer-implemented baggage picking and delivering system and a method, wherein the system consists of a client, a server and a driver, and is communicated and connected in a network mode to process a large number of customer baggage picking and delivering orders.

Description

Computer-implemented baggage retrieval system and method
Technical Field
The present invention relates to a baggage retrieving and delivering system and method, and more particularly, to a baggage retrieving and delivering system and method implemented by a computer.
Background
In travel, luggage has been a problem of headache, especially for travelers who drag their home with their mouth. Even today with very developed traffic, a distance still exists from airports, high-speed rail stations to hotels or at home, and especially in different places, public transportation means are often needed between a foothold point and the airports or the high-speed rail stations, if many pieces of luggage are carried, people are often embarrassed when the old and the children need to be cared for, and some travelers can only get out of high-price taxi taking or use hotel pickup service to avoid the disconcement of the journey. How to economically and rapidly solve the problem of headache luggage in the travel process has important significance for improving the travel experience of people and the travel quality.
At present, a system and a method specially aiming at baggage picking and delivering are not available, and particularly, a system and a method for picking and delivering baggage, which are realized by adopting a computer and are efficient, fast and economical. Providing such a system and method is of great interest for improving the quality of life of people.
Disclosure of Invention
The invention fills the blank of the prior art and provides a computer-implemented baggage picking and delivering system and method.
The invention is realized by the following technical scheme:
a computer-implemented baggage handling system, comprising a client, a driver side, a server side:
the client comprises an input module and a communication and calculation module, and is used for sending the baggage fetching request information to the server, receiving the baggage fetching information sent by the server and providing the client position to the server;
the driver side comprises an input module and a communication and calculation module, and is used for receiving the baggage picking-up information sent by the server side, providing the vehicle position for the server side and modifying the baggage picking-up information;
the server side comprises a server and is used for receiving and processing the baggage fetching request information sent by the client side, dispatching the baggage fetching request and sending the dispatched result to the driver side and the client side;
the client, the driver and the server are connected through a network. The network connection may take all available forms in the prior art, including mobile cellular networks, wiFi networks, NB-IoT/LoRa low power wide area networks.
Further, the client and the driver are intelligent mobile devices, such as intelligent bracelets, mobile phones and computers.
Further, the client and the driver side also comprise a positioning module and a data storage module.
A computer-implemented baggage retrieval method comprising the steps of:
step 1: the client sends luggage taking and sending request information to the server to generate a luggage taking and sending order of the client;
step 2: after the server collects the information sent by the client, judging whether the information can be accepted or not: if the order is not acceptable, changing the order state into refusal and notifying the client; if the current customer orders are judged to be acceptable, unified dispatching is carried out on all the current customer orders, and dispatching results are respectively sent to a driver side and a client side: the dispatching result sent to the driver side comprises: a sequence of transport travel locations including baggage taking locations and baggage delivering locations, customer information, baggage information; the scheduling result sent to the client side comprises: current customer order status and predicted delivery Li Shijian;
step 3: the driver side sequentially accesses the driving places according to the driving place sequence of the transport means in the step 2, receives corresponding baggage at the baggage taking place, updates the order state of the corresponding customer order to be in delivery, and sends the order information back to the service side in real time; the corresponding baggage is offloaded at the delivery Li Dedian, returned to the customer, the status of the order is modified to completed, and the order information is sent back to the customer in real time. The order state also comprises that the baggage is being fetched, the fetched baggage is sent to an airport and the like, a driver can update according to actual conditions, and meanwhile, the client side can also view the position information of the driver in real time.
Further, in the step 3, when the driver takes the baggage, firstly checking whether the baggage information is matched with the order information, if not, modifying the order in the driver end to be the baggage information is not matched, sending the baggage information back to the server end, and prompting the client to communicate or modify the order by the server end; if yes, extracting the corresponding baggage, and modifying the corresponding order state into the extracted baggage; before the corresponding baggage is unloaded by the delivery Li Dedian and the customer is returned, the customer identity is verified according to the customer identity information submitted by the customer.
Further, in the step 3, a baggage specialist is further provided, after the driver unloads the corresponding baggage in the delivery line Li Dedian, the baggage specialist receives the baggage in the delivery line Li Dedian, verifies the identity of the customer according to the customer identity information submitted by the customer terminal, returns the baggage to the customer, and modifies the order status to be completed.
Further, in the step 3, the driver can store the corresponding baggage in the automatic container after unloading the corresponding baggage by the delivery Li Dedian, or store the corresponding baggage in the automatic container by a baggage officer, and modify the status of the order to be completed.
Further, the baggage retrieving request information in step 1 includes a baggage retrieving time location, a baggage delivering time location, customer travel information, customer identity information, customer contact information, baggage quantity information, baggage warranty information, baggage verification information, baggage handing-over information, and remark information;
further, in the step, the driver side uploads the order information to the server side in real time, the server side sends the order information to the client side in real time, and the client side checks the luggage state in real time and predicts the luggage taking time and the luggage delivering time. The order state also comprises that the baggage is being fetched, the fetched baggage is sent to an airport and the like, a driver can update according to actual conditions, and meanwhile, the client side can also view the position information of the driver in real time.
Further, in the step 2, when the server side returns a reject order result to the client side and returns an order modification suggestion to the client side, the suggestion includes: modifying the baggage transferring mode, the baggage transferring time, the baggage transferring place, the baggage taking place and the baggage taking time.
Further, the scheduling method in the step 2 is as follows: the baggage picking order submitted by the customer contains n baggage picking destinations, and the baggage picking task is completed by m transportation means, including a destination allocation scheduling step and a destination access sequence scheduling step:
the destination allocation and scheduling step divides n destinations into m cluster sets through clusters, allocates the m cluster sets to m transport means, and each transport means corresponds to one cluster set, wherein the clusters enable the baggage taking place and the baggage delivering line Li Dedian to be the same in the baggage taking order received by the same transport means;
the target access sequence scheduling step allocates an access sequence for the target points in each cluster set, and the transport means where the cluster set is located accesses according to the allocation sequence to complete the baggage delivering task.
The system and the method fill the blank of the baggage picking and delivering system and the method with the unified dispatching function, solve the baggage picking and delivering problem faced by people in traveling by adopting a computer-implemented mode, and solve the baggage picking and delivering problem in traveling efficiently, quickly and economically by intensively solving the baggage picking and delivering order requirement with large quantity through effective steps.
Detailed Description
In this section, the technical solution of the present invention will be further explained and explained. It should be noted that the present embodiment is only for explanation and illustration, and is not to be construed as limiting the invention, and the embodiments of the invention are not limited to one or more of the following.
Example 1
A computer-implemented baggage handling system, comprising a client, a driver side, a server side:
the client comprises an input module and a communication and calculation module, and is used for sending the baggage fetching request information to the server, receiving the baggage fetching information sent by the server and providing the client position to the server; the customer generates luggage taking and sending request information through the input module, the communication and calculating module sends the request to the server and receives the luggage taking and sending information sent by the server; the communication and computation module is also responsible for processing customer-generated baggage retrieval request data.
The driver side comprises an input module and a communication and calculation module, and is used for receiving the baggage picking-up information sent by the server side, providing the vehicle position for the server side and modifying the baggage picking-up information; the input module is connected with the communication and calculation module, a driver receives the luggage taking and sending information sent by the service end through the communication and calculation module, the communication and calculation module is also responsible for processing data in the driver end of the passenger, and the driver modifies the luggage taking and sending information and modifies the luggage taking and sending state through the input module.
The server side comprises a server and is used for receiving and processing the baggage fetching request information sent by the client side, dispatching the baggage fetching request and sending the dispatched result to the driver side and the client side;
the client, the driver and the server are connected through a network. The network connection mode adopts a WiFi network.
The client and the driver are intelligent hand rings.
The client and the driver end also comprise a positioning module and a data storage module. The positioning module of the client side is used for reading the real-time position of the client so as to determine the position of the luggage, and the positioning module of the driver side is used for reading the real-time position of the luggage. The data storage module is used for storing historical data, process data and the like.
Example 2
A computer-implemented baggage retrieval method comprising the steps of:
step 1: the client sends luggage taking and sending request information to the server to generate a luggage taking and sending order of the client; the baggage taking and sending request information comprises a baggage taking time place, a baggage sending time place, customer travel information such as a flight number, a high-speed railway shift, customer identity information such as a certificate number, a customer contact mode, baggage quantity information, baggage warranty information, baggage verification information such as a photo or a text description, a baggage handing-over mode and remark information; the baggage arrival time is obtained by subtracting the baggage picking time and the baggage delivering time in the customer order.
Step 2: after the server collects the information sent by the client, judging whether the information can be accepted or not: judging whether the principle can be completed within the baggage picking time required by the customer order, if not, changing the order state into refusal and notifying the customer end; if the judgment can be completed, uniformly scheduling all the current customer orders, and respectively transmitting scheduling results to a driver side and a client side: the dispatching result sent to the driver side comprises: a sequence of travel locations for a vehicle, comprising a baggage taking location and a baggage delivering location, each location comprising latitude and longitude coordinates and a location name, customer information, baggage information, the customer information and the baggage information comprising: customer identity information, contact information, guest remark information, number of pieces of luggage, photos of luggage, and delivery mode; the scheduling result sent to the client side comprises: current customer order status and predicted delivery Li Shijian;
step 3: the driver side sequentially accesses the driving places according to the vehicle driving place sequence in the step 2, receives corresponding baggage at the baggage taking place, updates the order state of the corresponding customer order to be in delivery, and sends the order information, including the order state, the driver contact mode and the position information, back to the service side in real time; the corresponding baggage is offloaded at the delivery Li Dedian, returned to the customer, the status of the order is modified to completed, and the order information is sent back to the customer in real time.
Example 3
The difference from example 2 is that: in the embodiment, in the step 3, when the driver takes the baggage, firstly checking whether the baggage information is matched with the order information, if not, modifying the order in the driver end to be the baggage information is not matched, sending the baggage information back to the server end, and prompting the client to communicate or modify the order by the server end; if yes, extracting the corresponding baggage, and modifying the corresponding order state into the extracted baggage; before the corresponding baggage is unloaded by the delivery Li Dedian and the customer is returned, the customer identity is verified according to the customer identity information submitted by the customer.
Example 4
The difference from example 3 is that: in the step 3, a baggage specialist is further provided, after the driver unloads the corresponding baggage in the delivery Li Dedian, the baggage specialist receives the baggage in the delivery Li Dedian, verifies the identity of the customer according to the customer identity information submitted by the customer terminal, returns the baggage to the customer, and modifies the order status to be completed.
Alternatively, the corresponding baggage is unloaded by the driver at the delivery Li Dedian and then stored in the automated container, or the baggage specialist is stored in the automated container, and the status of the order is modified to be completed. The customer can then complete the baggage order by going to the automated container to retrieve the corresponding baggage.
Example 5
The difference from embodiment 2 is that in this embodiment, in the step, the driver side uploads the order information to the server side in real time, the server side sends the order information to the client side in real time, and the client side checks the status of the baggage and predicts the time of taking the baggage and delivering the baggage. Wherein the order status includes: waiting for confirmation, rejecting the order, waiting for receipt of the baggage, being transported, having been delivered to the destination, the baggage having been successfully picked up.
Example 6
The difference from example 2 is that: in this embodiment, in the step 2, when the server side returns a reject order result to the client side and returns an order modification suggestion to the client side, the suggestion includes: modifying the baggage transferring mode, the baggage transferring time, the baggage transferring place, the baggage taking place and the baggage taking time.
Example 7
The difference from embodiment 2 is that, in this embodiment, the method for uniformly scheduling all current customer orders described in step 2 is as follows: the baggage picking order submitted by the customer contains n baggage picking destinations, and the baggage picking task is completed by m transportation means, including a destination allocation scheduling step and a destination access sequence scheduling step:
the destination allocation and scheduling step divides n destinations into m cluster sets through clusters, allocates the m cluster sets to m transport means, and each transport means corresponds to one cluster set, wherein the clusters enable the baggage taking place and the baggage delivering line Li Dedian to be the same in the baggage taking order received by the same transport means;
the target access sequence scheduling step allocates an access sequence for the target points in each cluster set, and the transport means where the cluster set is located accesses according to the allocation sequence to complete the baggage delivering task.
Specifically, the destination allocation scheduling step includes the following steps:
1.1 taking arbitrary m destinations, wherein the destinations comprise taking initial positions of baggage and baggage places or m transport means as cluster heads, and carrying out k-means clustering to obtain m clustering sets, wherein k is-
The usage distance of means clustering is space cost or time cost;
1.2, counting the repetition times of the baggage delivering places in each clustering set obtained in the step 1.1, and taking the place with the largest repetition times as a main destination of the clustering set;
when m is greater than or equal to n: if all n destinations become the main destination of at least one transport, destination allocation scheduling is completed, i.e. the order to which the destination belongs is allocated; the method comprises the steps of carrying out a first treatment on the surface of the If at least one destination does not become the main destination of one or more transportation means, counting the occurrence times of the destination in all cluster sets, and modifying the main destination of the cluster set with the largest occurrence times of the destination into the destination until all n destinations become the main destination of at least one transportation means;
when m < n: setting a destination k with the highest occurrence number in each cluster set as a main destination, wherein k is increased from 1 until all n destinations become the main destination of at least one transport means;
1.3, setting a non-primary destination in each cluster set as n_d, setting a cluster set with a primary destination as n_d as m_d, comparing the shortest distance between the non-primary destination in each cluster set and a cluster set with the primary destination as n_d, wherein the place comprises a baggage taking place and a baggage delivering place, and if the shortest distance is smaller than the average distance between the place and other places in the current cluster set, moving the place n_d from the current cluster set to the cluster set m_d; thus, the clustering is completed.
The step 1.3 may also be to compare the time difference between the places in each cluster set between the non-primary destination n_d and the cluster set m_d with the primary destination n_d, specifically: setting the main destination of the clustering set J as d, for a place e (setting the destination corresponding to the place as q) with the destination not being d in the clustering set J, calculating the shortest distance from e to the place in the clustering set L with the main destination of q, and if the shortest distance is smaller than the average distance from e to the place in the clustering set J, moving e from the J set to the L; and repeating the step until the set of all orders is no longer changed and clustering is completed.
The k-means clustering in the step 1.1 uses the space cost as the running time between the destinations or the distance between the destinations; the destination includes baggage and travel Li Dedian, i.e., the location where each vehicle needs to pass; the driving time is estimated by the distance and road condition, and is directly read by an interface provided by navigation software at present, such as hundred degrees and high germany.
The k-means cluster in step 1.1 uses the time cost from the time cost to the time difference between the arrival time required for each baggage retrieval order.
The destination access sequence scheduling step comprises the following steps:
2.1, p destinations are arranged in each cluster set, the destinations comprise baggage taking places and delivery lines Li Dedian, travel time between the current place of the transport means and all the destinations without assigned access sequences is compared one by one, the destination with the shortest travel time is taken as the next station access place and assigned access sequence, and the place is taken as the current place of the transport means, and the steps are repeated until all the p destinations are assigned corresponding access sequences;
2.2 calculating the time tp of arrival of the transport at each destination according to the destination access sequence allocated in step 2.1, and calculating the difference td between tp and the time tr required by the order, the required time for the order being the required arrival time provided when the customer submitted the baggage retrieval information, i.e. generated the baggage retrieval order, and the total completion time Ta:the total completion time refers to the total time for the transport to sequentially access all destinations according to the assigned access order; the travel time is directly read by an interface provided by the navigation software as described above, such as hundred degrees, germany.
2.3 define the exclusion set Q and initialize to the null set:
for all destinations excluding the set Q, when td is less than or equal to 0, keeping the current access order unchanged; when td > 0: the access order of the destinations is advanced by 1 bit, and then td and the total completion time Ta of all the destinations are recalculated:
if td decreases and Ta does not increase, the next advance is effected and step 2.2 is returned;
if td decreases but Ta increases, the forward movement is not effective, i.e. the forward movement is not performed, the original access sequence is kept, and then the next purpose is calculated by returning to the step 2.2;
if td is not reduced, the forward shift is not effective, i.e. the forward shift is not performed, the destination is added into the exclusion set Q, and the step returns to the step 2.2;
2.4, comparing whether the expected arrival time tp of all the destinations in each cluster set is within the order requirement time tr, if yes, finishing the steps, and finishing the distribution and scheduling of the destination access sequence; if not, the destination with the largest tr-tp value is rejected, and the step is carried out again until the estimated access time tp of the destination in all the cluster sets is within the required time tr, and the order corresponding to the rejected destination is refused.
The step 2.3 may also be performed in the following manner:
setting the baggage arrival time threshold to Td:
define the exclusion set Q and initialize to the null set: for all destinations excluding the set Q, when Td is less than or equal to Td, keeping the current access order unchanged; when Td > Td: the access order of the destinations is advanced by 1 bit, and then td and the total completion time Ta of all the destinations are recalculated:
if td decreases and Ta does not increase, the next advance is effected and step 2.2 is returned;
if td decreases but Ta increases, the advance is not effective, i.e., no advance is performed;
if td is not reduced, the forward shift is not effective, the destination is added into the exclusion set Q, and the step returns to the step 2.2;
2.4, comparing whether the expected arrival time tp of all the destinations in each cluster set is within the order request time tr-Td, if yes, finishing the steps; if not, the destination with the largest tr-tp value is rejected and then is compared again until the expected access time tp of the destination in all the cluster sets is within the required time tr, and the order corresponding to the rejected destination is refused.
An order merging step is performed before the destination allocation scheduling step and the destination access scheduling step are performed: when the order with the same place and different required delivery time (if the time difference is not greater than T, two orders are combined, the earlier time requirement is taken as the time requirement of the combined order, the time requirement is the time requirement submitted by the customer in the baggage taking and delivering order, the place is the same as the place where baggage is taken and the delivering Li Dedian, any place of one order is the same as any place of other orders, T is a manual set value, and the time is determined to be half an hour according to the conditions of the specific order on the same day, road conditions and the like.

Claims (8)

1. A computer-implemented baggage handling method, characterized by:
the method comprises the following steps of client side, driver side and service side: the client comprises an input module and a communication and calculation module, and is used for sending the baggage fetching request information to the server, receiving the baggage fetching information sent by the server and providing the client position to the server; the driver side comprises an input module and a communication and calculation module, and is used for receiving the baggage picking-up information sent by the server side, providing the vehicle position for the server side and modifying the baggage picking-up information; the server side comprises a server and is used for receiving and processing the baggage fetching request information sent by the client side, dispatching the baggage fetching request and sending the dispatched result to the driver side and the client side; the client, the driver and the server are connected through a network; the client and the driver are intelligent mobile equipment; the client and the driver end also comprise a positioning module and a data storage module;
the method comprises the following steps:
step 1: the client sends luggage taking and sending request information to the server to generate a client order;
step 2: after the server collects the information sent by the client, judging whether the information can be accepted or not: if the order is not acceptable, changing the order state into refusal and notifying the client; if the current customer orders are judged to be acceptable, unified dispatching is carried out on all the current customer orders, and dispatching results are respectively sent to a driver side and a client side: the dispatching result sent to the driver side comprises: a sequence of transport travel locations including baggage taking locations and baggage delivering locations, customer information, baggage information; the scheduling result sent to the client side comprises: current customer order status and predicted delivery Li Shijian;
step 3: the driver side sequentially accesses the driving places according to the driving place sequence of the transport means in the step 2, receives corresponding baggage at the baggage taking place, updates the order state of the corresponding customer order to be in delivery, and sends the order information back to the service side in real time; the corresponding baggage is offloaded at the delivery Li Dedian, returned to the customer, the status of the order is modified to completed, and the order information is sent back to the customer in real time.
2. A computer-implemented baggage retrieving method according to claim 1, wherein: in the step 3, when the driver takes the baggage, firstly checking whether the baggage information is matched with the order information, if not, modifying the order in the driver end into the baggage information which is not matched, sending the baggage information back to the server end, and prompting the client to communicate or modify the order by the server end; if yes, extracting the corresponding baggage, and modifying the corresponding order state into the extracted baggage; before the corresponding baggage is unloaded by the delivery Li Dedian and the customer is returned, the customer identity is verified according to the customer identity information submitted by the customer.
3. A computer-implemented baggage retrieving method according to claim 1, wherein: in the step 3, a baggage specialist is further provided, after the driver unloads the corresponding baggage in the delivery Li Dedian, the baggage specialist receives the baggage in the delivery Li Dedian, verifies the identity of the customer according to the customer identity information submitted by the customer terminal, returns the baggage to the customer, and modifies the order status to be completed.
4. A computer-implemented baggage retrieving method according to claim 1 or 3, wherein: in step 3, the driver can deposit the corresponding baggage in the automatic container after the corresponding baggage is unloaded by the delivery Li Dedian, or the baggage specialist can deposit the corresponding baggage in the automatic container, and the order state is modified to be completed.
5. A computer-implemented baggage retrieving method according to claim 1, wherein:
the baggage retrieving request information described in step 1 includes a baggage retrieving time point, a baggage delivering time point, customer travel information, customer identity information, customer contact information, baggage amount information, baggage warranty information, baggage verification information, baggage handover information, and remark information.
6. A computer-implemented baggage retrieving method according to claim 1, wherein:
in the step, the driver side uploads order information to the server side in real time, the server side sends the order information to the client side in real time, and the client side checks the luggage state in real time and predicts the time of taking and delivering luggage.
7. A computer-implemented baggage retrieving method according to claim 1, wherein: in the step 2, when the server side returns a reject order result to the client side and returns an order modification suggestion to the client side, the suggestion includes: modifying the baggage transferring mode, the baggage transferring time, the baggage transferring place, the baggage taking place and the baggage taking time.
8. A computer-implemented baggage retrieving method according to claim 1, wherein: the scheduling method in the step 2 is as follows: the baggage picking order submitted by the customer contains n baggage picking destinations, and the baggage picking task is completed by m transportation means, including a destination allocation scheduling step and a destination access sequence scheduling step:
the destination allocation and scheduling step divides n destinations into m cluster sets through clusters, allocates the m cluster sets to m transport means, and each transport means corresponds to one cluster set, wherein the clusters enable the baggage taking place and the baggage delivering line Li Dedian to be the same in the baggage taking order received by the same transport means;
the target access sequence scheduling step allocates an access sequence for the target points in each cluster set, and the transport means where the cluster set is located accesses according to the allocation sequence to complete the baggage delivering task.
CN201910293993.9A 2019-04-12 2019-04-12 Computer-implemented baggage retrieval system and method Active CN110334976B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910293993.9A CN110334976B (en) 2019-04-12 2019-04-12 Computer-implemented baggage retrieval system and method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910293993.9A CN110334976B (en) 2019-04-12 2019-04-12 Computer-implemented baggage retrieval system and method

Publications (2)

Publication Number Publication Date
CN110334976A CN110334976A (en) 2019-10-15
CN110334976B true CN110334976B (en) 2023-09-12

Family

ID=68139002

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910293993.9A Active CN110334976B (en) 2019-04-12 2019-04-12 Computer-implemented baggage retrieval system and method

Country Status (1)

Country Link
CN (1) CN110334976B (en)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111127176B (en) * 2020-02-13 2023-12-15 杭州老爸评测科技股份有限公司 Intelligent ordering method based on leasing system
CN112686602A (en) * 2020-12-29 2021-04-20 安徽运通达物流科技有限公司 Transport platform waybill information pushing method
CN116227776A (en) * 2023-05-06 2023-06-06 好停车(北京)信息技术有限公司天津分公司 Article conveying method, article conveying device, storage medium and electronic equipment

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107093050A (en) * 2017-06-15 2017-08-25 上海汽车集团股份有限公司 A kind of vehicle dispatching method and system
KR20180023316A (en) * 2016-08-25 2018-03-07 주식회사 아이트립 System and method for delivering baggage based on identifier
CN107808208A (en) * 2017-11-01 2018-03-16 飞友科技有限公司 A kind of flight luggage delivery shifts to an earlier date reservation system and its method of work
CN108074050A (en) * 2018-02-13 2018-05-25 广州小享科技有限公司 A kind of share-car method and system based on flight
CN109345161A (en) * 2018-08-29 2019-02-15 广西大学 A kind of delivery assignment method towards monetary value flow

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20180232685A1 (en) * 2017-02-16 2018-08-16 Uphill Holdings LLC Method for lading operations and delivery of cargo
US20180350024A1 (en) * 2017-06-06 2018-12-06 At&T Intellectual Property I, L.P. Baggage Management for Mobility-As-A-Service

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20180023316A (en) * 2016-08-25 2018-03-07 주식회사 아이트립 System and method for delivering baggage based on identifier
CN107093050A (en) * 2017-06-15 2017-08-25 上海汽车集团股份有限公司 A kind of vehicle dispatching method and system
CN107808208A (en) * 2017-11-01 2018-03-16 飞友科技有限公司 A kind of flight luggage delivery shifts to an earlier date reservation system and its method of work
CN108074050A (en) * 2018-02-13 2018-05-25 广州小享科技有限公司 A kind of share-car method and system based on flight
CN109345161A (en) * 2018-08-29 2019-02-15 广西大学 A kind of delivery assignment method towards monetary value flow

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
基于多目标优化的机场行李运输车辆调度问题研究;衡红军;晏晓东;王芳;李海丰;;计算机应用与软件;第34卷(第02期);第87-92页 *

Also Published As

Publication number Publication date
CN110334976A (en) 2019-10-15

Similar Documents

Publication Publication Date Title
CN109791672B (en) System and method for processing simultaneous carpooling request
CN110334976B (en) Computer-implemented baggage retrieval system and method
CN105070044B (en) Dynamic scheduling method for customized buses and car pooling based on passenger appointments
Campbell Hub location and the p-hub median problem
CN106156961B (en) Vehicle scheduling method and device
US20150379437A1 (en) Method and system for on-demand transportation services
US20180032964A1 (en) Transportation system and method for allocating frequencies of transit services therein
US20190043000A1 (en) System for pairing uav and truck to make uav complete goods delivey and method thereof
CN104077912B (en) Taxi intelligent share-car method based on gunz
CN109635980B (en) Method and system for allocating order of vehicle
CN108960976B (en) Method, device and storage medium for processing reservation order
CN107767322B (en) Carpooling method and device
US9074904B1 (en) Method for solving carpool matching problem and carpool server using the same
WO2021190137A1 (en) System and method for determining routing by learned selective optimization
CN105678485A (en) System and method for smart passenger and freight transportation
US20210004929A1 (en) Distributed ridesharing vehicle management
US20210201218A1 (en) Baggage delivery system and method
CN108764804B (en) Warehouse-free parcel transportation method and device by using taxi
CN106529857A (en) Logistic dispensing business management method
US20180315018A1 (en) Methods and systems for managing shipment of products from a distribution center
WO2022232237A1 (en) Capacity management for a fleet routing service
CN111553548A (en) Goods picking method and device
CN113177752B (en) Route planning method and device and server
US20210390479A1 (en) Vehicle allocation plan device, vehicle allocation plan system, and vehicle allocation plan program
TWI701635B (en) System and method for providing transport service

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
TA01 Transfer of patent application right

Effective date of registration: 20230810

Address after: 610000, No. two, section 4, Jianshe North Road, Chengdu, Sichuan, Chenghua District

Applicant after: Zhao Zhiwei

Address before: No. 1807, 18th Floor, Building 1, No. 530, Middle Section, Tianfu Avenue, Chengdu High-tech Zone, China (Sichuan) Free Trade Pilot Zone, Chengdu, Sichuan, 610000

Applicant before: Chengdu Service Student Technology Co.,Ltd.

TA01 Transfer of patent application right
GR01 Patent grant
GR01 Patent grant