CN114742500A - Intelligent logistics scheduling management method and system based on geographical position information - Google Patents
Intelligent logistics scheduling management method and system based on geographical position information Download PDFInfo
- Publication number
- CN114742500A CN114742500A CN202210356851.4A CN202210356851A CN114742500A CN 114742500 A CN114742500 A CN 114742500A CN 202210356851 A CN202210356851 A CN 202210356851A CN 114742500 A CN114742500 A CN 114742500A
- Authority
- CN
- China
- Prior art keywords
- order
- transportation
- vehicle
- delivery
- orders
- 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
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
- G06Q10/0835—Relationships between shipper or supplier and carriers
- G06Q10/08355—Routing methods
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/29—Geographical information databases
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06311—Scheduling, planning or task assignment for a person or group
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- 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
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Human Resources & Organizations (AREA)
- Theoretical Computer Science (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- General Physics & Mathematics (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- Marketing (AREA)
- Development Economics (AREA)
- Entrepreneurship & Innovation (AREA)
- Databases & Information Systems (AREA)
- Operations Research (AREA)
- Tourism & Hospitality (AREA)
- Accounting & Taxation (AREA)
- Finance (AREA)
- Quality & Reliability (AREA)
- Remote Sensing (AREA)
- Data Mining & Analysis (AREA)
- General Engineering & Computer Science (AREA)
- Educational Administration (AREA)
- Game Theory and Decision Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
- Traffic Control Systems (AREA)
Abstract
The application relates to the field of logistics transportation, in particular to an intelligent logistics scheduling management method and system based on geographical location information. The method comprises the following steps: acquiring a delivery order: receiving a plurality of delivery orders sent by each merchant; matching idle vehicles: receiving a dispatching request of each transport vehicle; acquiring order information of a first order and sending the order information to a first idle vehicle; continuously distributing delivery orders: taking the delivery destination of the first order as a reference destination of the first idle vehicle; generating a preset transportation route from an off-line storage point to a reference destination; acquiring accompanying orders; stopping the allocation of the dispatch order: sending the accompanying order to a first idle vehicle; automatically accumulating the rest delivery orders to form a new order sending sequence; and repeating the step of matching the idle vehicles and the continuous distribution dispatching orders to dispatch the orders for the order idle vehicles in the preset sequence. The transportation efficiency of logistics vehicles from the storage point to the delivery point under the line is effectively improved.
Description
Technical Field
The application relates to the field of logistics transportation, in particular to an intelligent logistics scheduling management method and system based on geographical location information.
Background
The logistics industry is an artery and basic industry for national economic development, and the development degree of the logistics industry becomes one of important marks for measuring the modernization degree and the comprehensive national strength of a country. With the continuous progress of logistics technology and the continuous expansion of the application field of artificial intelligence, intelligence gradually becomes an important direction for the development of logistics transportation systems.
In order to improve the transportation efficiency, when the system receives orders one by one, the orders are firstly accumulated in the system, and when the orders are accumulated to a certain number, the system forms a corresponding transportation route according to the distance between the transportation destination and the off-line storage point; and the logistics vehicle transports the orders one by one to the corresponding delivery points according to the transportation route generated by the system.
The system combines a plurality of orders according to the order receiving time to form a transportation route, the system only defines the transportation sequence according to the distance between the transportation destination and the storage point under the line, and orders with different transportation directions in the same transportation route easily exist, so that the transportation efficiency of the logistics vehicle is reduced.
Disclosure of Invention
In order to improve the transportation efficiency of logistics vehicles from storage points to delivery points under the lines, the application provides an intelligent logistics scheduling management method and system based on geographic position information.
In a first aspect, the intelligent logistics scheduling management method based on geographical location information provided by the application adopts the following technical scheme:
the intelligent logistics scheduling management method based on the geographic position information comprises the following steps:
acquiring a delivery order: receiving a plurality of delivery orders sent by each merchant; arranging the plurality of delivery orders according to an order issuing sequence and acquiring a first order positioned at the head in the order issuing sequence;
matching idle vehicles: receiving a dispatching request of each transport vehicle; arranging the plurality of dispatching requests according to a preset sequence and acquiring a first idle vehicle positioned at the head in the preset sequence;
acquiring order information of a first order and sending the order information to a first idle vehicle; the order information comprises a delivery destination;
continuously distributing delivery orders: taking the delivery destination of the first order as a reference destination of the first idle vehicle;
generating a preset transportation route from an off-line storage point to a reference destination;
acquiring accompanying orders; the accompanying orders are delivery orders with delivery destinations positioned in a preset transportation route in the order issuing sequence;
stopping the allocation of the dispatch order: sending the accompanying order to a first idle vehicle;
automatically accumulating the rest delivery orders to form a new order sending sequence;
and repeating the step of matching the idle vehicles and the continuous distribution dispatching orders to dispatch the orders for the order idle vehicles in the preset sequence.
By adopting the technical scheme, the idle vehicles are matched with the orders with delivery; and the delivery destination of the first order is used as the reference destination of the idle vehicle, so that the delivery destinations of the orders received by the idle vehicle are all located on the same transportation route, the orders are delivered towards different directions by the same transportation vehicle, and the transportation efficiency of the logistics vehicle from the warehousing point to the delivery point is improved.
Optionally, presetting a limit bearing capacity V0; the method also comprises the following steps after the step of acquiring the accompanying order:
acquiring the carrying capacity V1 of the current idle vehicle; the bearing capacity V1 comprises the size of a bearing space of a current idle vehicle and the bearing limit weight;
the order information also comprises the consumed bearing capacity V2 of goods in the current order; the load capacity V2 includes the size and weight of the current cargo;
acquiring the residual bearing capacity V3 of the current idle vehicle; v3= V1-V2;
judging whether V3 is smaller than V0;
if V3 is greater than V0; repeating the step to obtain accompanying orders;
if V3 is less than or equal to V0; the stop step obtains the accompanying order and the start execution step stops allocating the dispatch order.
By adopting the technical scheme, after any accompanying order is obtained, the residual bearing capacity of the current idle vehicle is obtained in real time, and whether the residual bearing capacity is lower than the limit bearing capacity is judged; if the vehicle speed is lower than the set speed, the dispatching of the free vehicle is stopped, and the overload of the transport vehicle is prevented.
Optionally, the step of stopping the allocation of the dispatch order further includes the following steps:
transportation supervision: acquiring a real-time transportation route;
comparing the real-time transportation route with a preset transportation route;
if the real-time transportation route is inconsistent with the preset transportation route, sending a first transportation abnormity alarm to the corresponding transportation vehicle; acquiring the consumed transportation time length L1 of the real-time transportation route and the consumed transportation time length L2 of the preset transportation route;
comparison of L1 and L2;
if L1 is greater than L2, a second transportation anomaly alarm is sent to the supervision module; the second transportation anomaly alert includes a real-time transportation route and transportation vehicle information to travel the current real-time transportation route.
By adopting the technical scheme, the system automatically generates transportation routes for brand-new delivery destinations; however, in actual transportation, the original transportation route is easily influenced by reasons such as traffic accidents, temporary road maintenance and the like, and cannot be continuously used, a transport driver needs to search for a new transportation route, and when the transport driver changes the route, a worker/the transport driver is reminded through a first transportation abnormity alarm, and the current transportation route deviates; so that the system starts acquiring the real-time transportation route according to the first transportation alarm so as to store the real-time transportation route; if the implementation transportation route at the moment can be used by other transportation vehicles relative to the preset transportation route, the comparison of the transportation time of the real-time running route of the transportation vehicles is carried out when the transportation vehicles are not transported according to the preset transportation route, and if the transportation time is longer, a second transportation abnormity alarm is sent to the supervision module on the transportation vehicles to prompt the transportation drivers to run to the corresponding delivery destinations.
Optionally, the step of transportation supervision further includes the following steps:
and (3) illegal parking supervision:
inquiring illegal vehicle information; the illegal parking vehicle information comprises a vehicle license plate and an illegal parking place;
importing the illegal parking place into a forbidden parking list;
receiving dispatch arrival information; the delivery arrival information is sent after the transportation vehicle arrives at any delivery destination;
acquiring and storing a stopping place of a current transport vehicle;
judging whether the parking place of the current transport vehicle is positioned in the parking forbidding list or not;
and if so, sending a stopping prohibition prompt to the corresponding transport vehicle.
By adopting the technical scheme, the vehicle parking place which is sent to is obtained and stored, so that continuous illegal parking events are prevented when other follow-up transport vehicles are parked, and unnecessary fines generated when the transport vehicles are parked are reduced.
Optionally, the step of violation supervision further includes the following steps:
and if the stop place of the current transport vehicle is not positioned in the stop order, importing the stop place of the current transport vehicle into the stop list.
By adopting the technical scheme, the parking lot list is imported for the parking places without fines, so that subsequent transport vehicles can conveniently dispatch orders to the parking places, the system can conveniently recommend to transport drivers according to the current nearest parking places in the parking lot list, and the occurrence of illegal parking events is further reduced.
Optionally, the step of sending the prohibition prompt to the corresponding transportation vehicle further includes the following steps:
and acquiring a recommended parking place which is closest to the current transport vehicle parking place in the stop list and generating the recommended parking place to the current transport vehicle.
By adopting the technical scheme, the system can recommend the transport driver according to the parking spot closest to the current parking spot in the parking list, so that the occurrence of illegal parking events is further reduced.
Optionally, the step of transportation supervision further includes the following steps:
if L1 is less than or equal to L2, then the current real-time haul route is stored as the alternate recommended haul route.
By adopting the technical proposal, the utility model has the advantages that,
in a second aspect, the intelligent logistics scheduling management system based on the geographical location information provided by the application adopts the following technical scheme:
intelligent logistics scheduling management system based on geographical location information includes: the control end executes the intelligent logistics scheduling management method based on the geographical position information;
the merchant terminal is used for sending a delivery order to the control terminal;
the transportation end is used for receiving a transportation route and a delivery order to be transported; for sending the dispatching request to the control terminal.
By adopting the technical scheme, the merchant installs the merchant terminal, and when the order needs to be dispatched, the merchant sends the dispatching order to the control terminal through the merchant terminal; the control end receives the dispatching orders sent by each merchant and sequences the dispatching orders according to the dispatching sequence, and meanwhile, the transportation end is operated by a transportation driver to send dispatching requests into the control end; the control end arranges the plurality of order dispatching requests according to a preset sequence; the corresponding number of delivery orders are distributed to the corresponding transport vehicles, so that the dispatching management of the system is completed, the occurrence of events such as order grabbing and menu selection of the transport vehicles is reduced, in addition, the occurrence of order missing events can be reduced, and the transportation efficiency of the logistics vehicles from the offline storage points to the delivery points is improved.
In a third aspect, the computer apparatus provided in the present application adopts the following technical solutions:
the computer device comprises a processor, a memory and a computer program which is stored in the memory and can run on the processor, and when the processor executes the computer program, the intelligent logistics scheduling management method based on the geographical location information is realized.
By adopting the technical scheme, the computer device capable of implementing the intelligent logistics scheduling management method based on the geographical location information is provided.
In a fourth aspect, the computer-readable storage medium provided by the present application adopts the following technical solutions:
a computer-readable storage medium storing a computer program; when being executed by a processor, the computer program realizes the intelligent logistics scheduling management method based on the geographical location information.
By adopting the technical scheme, a carrier of a computer program of the intelligent logistics scheduling management method based on the geographical position information is provided.
To sum up, the application comprises at least the following beneficial technical effects:
taking the delivery destination of the first order as the reference destination of the idle vehicle, so as to ensure that the delivery destinations of the orders received by the idle vehicle are all positioned on the same transportation route, thereby reducing the delivery of the orders by the same transportation vehicle in different directions;
the control end arranges the dispatching requests according to a preset sequence; the corresponding number of delivery orders are distributed to the corresponding transport vehicles, so that scheduling management of the system is completed, the occurrence of events such as order grabbing and menu selecting of the transport vehicles is reduced, the occurrence of order missing events can be reduced, and the transport efficiency of logistics vehicles from off-line storage points to delivery points is improved.
Drawings
Fig. 1 is a block flow diagram of a logistics scheduling management system in an embodiment of the present application;
fig. 2 is a flow frame of an intelligent logistics scheduling management method in an embodiment of the present application;
description of reference numerals: 1. a control end; 2. a merchant terminal; 3. and a transportation end.
Detailed Description
In order to make the objects, technical solutions and advantages of the present application more apparent, the present application is further described in detail below with reference to fig. 1-2 and the embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the present application and are not intended to limit the present application.
Referring to fig. 1, the intelligent logistics scheduling management system based on geographical location information includes a control end 1, a transportation end 3 and a transportation end 3; wherein:
the control end 1 is used for the merchant end 2 and the transportation end 3 to access and can be a webpage, an APP, an applet and the like;
the merchant terminals 2 are provided for multiple merchants to use, and are used for sending delivery orders to the control terminal 1, and before the orders are sent, the merchants can input corresponding information of the delivery orders through the merchant terminals 2;
the transport end 3 is provided with a plurality of transport ends, can be used by a plurality of transport drivers, and can be applets, APPs and the like installed on mobile equipment; the system is used for receiving a transportation route and a delivery order to be transported; and is also used for sending a dispatching request to the control end 1.
In addition, the transport end 3 feeds the current transport node back to the control end 1 in real time; the merchant terminal 2 can also obtain the transportation details of the corresponding delivery order in real time through the control terminal 1.
Based on the same inventive concept, the embodiment of the application also discloses an intelligent logistics scheduling management method based on the geographic position information.
Referring to fig. 2, the intelligent logistics scheduling management method based on geographical location information includes the following steps:
s100: a dispatch order is obtained.
Specifically, step S100 includes the steps of:
s110: receiving a plurality of delivery orders sent by each merchant terminal 2;
for example, the merchant can register a corresponding system merchant account by itself to perform ordering operation in the system; sending a delivery order to be transported to a control terminal 1, and simultaneously inputting corresponding delivery order information, wherein the delivery order information comprises a delivery destination, the weight of goods and the bearing capacity consumed by the goods; in the embodiment, the load bearing capacity of the goods is calculated according to the space volume occupied by the goods; when receiving the corresponding delivery order, the control terminal 1 obtains the corresponding delivery order information.
S120: and arranging the delivery orders according to the order issuing sequence and acquiring a first order positioned at the head in the order issuing sequence.
For example, if the delivery order a needs to be transported from the current off-line storage point to point X (delivery destination), the transportation distance is 8 km;
the delivery order B needs to be transported to a Y point (delivery destination) from the current off-line storage point, and the transportation distance is 3 kilometers;
the delivery order C needs to be transported to a Z point (delivery destination) from a current off-line storage point, and the transportation distance is 6 kilometers;
in this embodiment, the order issuing sequence is to screen orders with a transportation distance of more than a specific distance (in this embodiment, the specific distance is 5 kilometers), sort the orders in order from small to large according to the transportation distance, and sort the orders with a transportation distance of 5 kilometers, including orders below kilometers, in order from small to large according to the transportation distance, and sort the orders in order according to the transportation distance; the control end 1 receives three ABC orders at the same time; the order sending sequence in the preferred list is C, A, and the dispatch order C is the first order at the head; dispatch order B is listed in the alternate list.
In another embodiment, the order sending sequence is to preliminarily classify the dispatching destinations of the three ABC orders according to local administrative regions; taking all orders in the same administrative area and within a certain period of time as a large order; then, the control end 1 sorts the data according to the distance between the corresponding administrative region and the current administrative region from small to large and forms a list; the empty vehicles are sequentially consumed for large orders in the dispatch list.
S200: matching the idle vehicles.
Specifically, step S200 includes the steps of:
s210: receiving a dispatching request of each transport vehicle;
specifically, each transport driver can register a corresponding system transport account by himself and then send a request for dispatching in the system; meanwhile, inputting transportation information of driving a transportation vehicle, wherein the transportation information comprises a vehicle license plate number, vehicle limited load capacity, vehicle container size and the like; and when the control terminal 1 receives the corresponding order dispatching request, the control terminal simultaneously acquires the transportation information of the corresponding transportation vehicle.
S220: arranging the plurality of dispatching requests according to a preset sequence and acquiring a first idle vehicle positioned at the head in the preset sequence;
specifically, the control end 1 performs sequencing according to the sending time of the order dispatching request to form a transportation list; the vehicle which first sends the order dispatching request to the control end 1 is the first idle vehicle at the head.
Step S100 and step S200 can be performed simultaneously.
S300: and matching orders.
Specifically, step S300 includes the steps of:
s310: acquiring order information of a first order and sending the order information to a first idle vehicle; the order information includes a delivery destination;
for example, matching a first free vehicle with a first order; in this embodiment, the dispatch order Z is sent to the first idle vehicle, and at this time, the dispatch order X in the preferred list is used as a new first order located at the head for matching with the new first idle vehicle.
S400: the dispatch order is continuously allocated.
Specifically, step S400 includes the steps of:
s410: and taking the delivery destination of the first order as a reference destination of the first idle vehicle.
For example, the current first order (i.e., delivery order C) is matched with the first idle vehicle, and the delivery destination Z point is the base destination of the current first idle vehicle.
S420: a preset transportation route from an under-line storage point to a reference destination is generated in the control end 1;
for example, the transportation route from the current offline storage point to the point Z is used as the preset transportation route, and the control end 1 sends the preset transportation route to the first idle vehicle.
S430: acquiring accompanying orders;
specifically, the order is a delivery order with a delivery destination positioned in a preset transportation route in the order issuing sequence; if the transportation order is not overlarge, any transportation vehicle can receive a plurality of delivery orders at the same time; therefore, the delivery order (along with the order) to be transported needs to be continuously obtained for the current first transportation vehicle, so as to improve the transportation efficiency of the transportation vehicle; the delivery destinations along with the orders are all located on a preset transportation route.
In another embodiment, the closest distance of the accompanying order from the current preset transportation route may also be preset, and a delivery order with an order sending sequence having a distance from the preset transportation route smaller than the closest distance is obtained as the accompanying order to be sent to the first idle vehicle, and then step S440 is executed.
S440: and judging whether to continue to acquire the accompanying order.
S441: a preset limit carrying capacity V0.
Specifically, a bearing allowance is required to be set for each transport vehicle to prevent the vehicles from being overloaded, so that the transport safety of the transport vehicles and various delivery orders is improved; and the goods can be prevented from being completely extruded in the transport compartment, so that the loss generated in the process of transporting the goods is reduced.
For example, if the current carrying capacity of the transport vehicle is 1T; the current transportation vehicle can transport 20 pieces of regular cargo (50 KG) at a time; the preset limit bearing capacity V0 is 40KG, and after the current first idle vehicle obtains 19 accompanying orders, the remaining bearing capacity is 50 KG; after the 20 th accompanying order (50 KG) is obtained, the remaining bearing capacity is 0 KG; if the remaining bearing capacity is less than 40KG, stopping acquiring the accompanying orders, and acquiring only 19 accompanying orders by the current first idle vehicle; a certain load-bearing margin can be reserved for some goods with larger packages and uneven weight distribution.
S442: acquiring the carrying capacity V1 of the current idle vehicle; the bearing capacity V1 includes the size of the bearing space of the currently empty vehicle, the bearing limit weight.
Specifically, in this embodiment, the order information further includes the consumed carrying capacity V2 of the goods in the current order; the load capacity V2 includes the size and weight of the current cargo.
S443: acquiring the residual bearing capacity V3 of the current idle vehicle; v3= V1-V2;
s444: judging whether V3 is smaller than V0;
if V3 is greater than V0; the step S430 is repeatedly performed;
if V3 is less than or equal to V0; step S430 is stopped and step S500 is started.
For example, the preset limit bearing capacity V0 is 40KG, and the current first transportation vehicle acquires a first order, where the cargo weight of the first order is 60 KG; the current carrying capacity V1 of the transport vehicle is 1T; then the current V2 is considered to be 60 KG; v3=1T-60KG =1940KG > V0; repeatedly executing the step S430;
the control end 1 repeats the step S430 and continues to obtain the accompanying order in the order issuing sequence;
acquiring an N accompanying order, wherein the weight of the N accompanying order is 1850 KG; then the current V2 is considered to be 1850+60=1910 KG; v3=1T-1910KG =90KG > V0, then the step S430 is repeated;
in one embodiment, the (N + 1) th accompanying order is obtained, and the weight of the goods of the (N + 1) accompanying orders is 1930 KG; then current V2 is considered to be 1930+60=1990 KG; v3=1T-1990KG =10KG < V0; the N pieces of accompanying orders and the first order are sent to the current first idle vehicle, and step S430 is stopped, and step S500 is performed.
In another embodiment, the (N + 1) th accompanying order is obtained, and the cargo weight of the (N + 1) accompanying order is 1900 KG; then the current V2 is considered to be 1900+60=1960 KG; v3=1T-1960KG =40KG = V0; the N +1 pieces of accompanying order and the first order are sent to the current first idle vehicle, and step S430 is stopped, and step S500 is performed.
S500: stopping allocation of dispatch orders:
specifically, step S500 includes the steps of:
s510: sending the accompanying order to a first idle vehicle;
s520: automatically accumulating the rest delivery orders to form a new order issuing sequence;
and repeating the steps S200-S400 to dispatch the order for the idle vehicles in the preset sequence.
S600: and (5) transportation supervision.
Specifically, step S600 includes the steps of:
s610: acquiring a real-time transportation route;
s620: comparing the real-time transportation route with a preset transportation route;
if the real-time transportation route is inconsistent with the preset transportation route, sending a first transportation abnormity alarm to the corresponding transportation vehicle; acquiring the consumed transportation time length L1 of the real-time transportation route and the consumed transportation time length L2 of the preset transportation route;
s621: comparison of L1 and L2;
if L1 is greater than L2, a second transportation anomaly alarm is sent to the supervision module; the supervision module can be used as a plug-in unit installed on the transportation end 3, and the supervision module is wirelessly connected with the control end 1.
The second traffic anomaly alert includes a real-time traffic route and traffic vehicle information for traveling the current real-time traffic route.
If L1 is less than or equal to L2, then the current real-time haul route is stored as the alternate recommended haul route.
When any transport vehicle reaches any dispatch destination, step S700 is executed.
S700: and (4) illegal parking supervision.
Specifically, step S700 includes the steps of:
s710: inquiring illegal vehicle information;
specifically, the illegal parking vehicle information includes a license plate of the vehicle and an illegal parking place.
For example, the control end 1 imports corresponding illegal parking information in the interval period, and the illegal parking information is issued by a corresponding supervision department.
S720: and importing the illegal parking place into the forbidden list.
For example, if the current transportation vehicle stops near a certain delivery destination for unloading, the current location is not detected as an illegal location in time; but still monitored by equipment such as an electronic eye and the like and included in a system of a supervision department, the corresponding illegal parking place is imported into the forbidden parking list in the control end 1 so as to be convenient for a driver of a subsequent transport vehicle to check.
S730: receiving dispatch arrival information;
specifically, the delivery arrival information is sent from the transportation vehicle to an arbitrary delivery destination, and then sent from the transportation terminal 3 to the control terminal 1.
S740: acquiring and storing a stopping place of a current transport vehicle;
specifically, the control section receives the stopping place of the current transportation vehicle and stores it so as to subsequently perform step S740.
S750: judging whether the parking place of the current transport vehicle is positioned in the parking forbidding list;
and if so, sending a stopping prohibition prompt to the corresponding transport vehicle.
And acquiring a recommended parking place which is closest to the current transport vehicle parking place in the stop list and generating the recommended parking place to the current transport vehicle.
If not, the parking place of the current transport vehicle is imported into the parking list.
So that the subsequent transport driver can select the corresponding position in the stop list to carry out the stop place for unloading.
The present application also provides a computer readable storage medium, which is stored with instructions that when loaded and executed by a processor, implement the above steps.
The computer-readable storage medium includes, for example: various media capable of storing program codes, such as a usb disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk, or an optical disk.
Based on the same inventive concept, embodiments of the present application provide a computer apparatus, which includes a memory and a processor, where the memory stores thereon a computer program that can be loaded by the processor and execute the above method.
It can be clearly understood by those skilled in the art that, for convenience and simplicity of description, the foregoing division of the functional modules is merely used as an example, and in practical applications, the foregoing function distribution may be performed by different functional modules according to needs, that is, the internal structure of the device is divided into different functional modules to perform all or part of the above-described functions. For the specific working processes of the system, the apparatus and the unit described above, reference may be made to the corresponding processes in the foregoing method embodiments, and details are not described here again.
In the several embodiments provided in the present application, it should be understood that the disclosed system, apparatus and method may be implemented in other manners. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the modules or units is only one logical division, and there may be other divisions when actually implemented, for example, a plurality of units or components may be combined or may be integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.
The integrated unit, if implemented in the form of a software functional unit and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solutions of the present application, which are essential or contributing to the prior art, or all or part of the technical solutions may be embodied in the form of a software product, which is stored in a storage medium and includes several instructions for causing a computer device (which may be a personal computer, a server, a network device, or the like) or a processor (processor) to execute all or part of the steps of the methods described in the embodiments of the present application. And the aforementioned storage medium includes: u disk, removable hard disk, read only memory, random access memory, magnetic or optical disk, etc. for storing program codes.
The above embodiments are only used to describe the technical solutions of the present application in detail, but the above embodiments are only used to help understanding the method and the core idea of the present application, and should not be construed as limiting the present application. Those skilled in the art should also appreciate that various modifications and substitutions can be easily made without departing from the scope of the present disclosure.
Claims (8)
1. The intelligent logistics scheduling management method based on the geographic position information is characterized by comprising the following steps:
acquiring a delivery order: receiving a plurality of delivery orders sent by each merchant terminal (2); arranging the plurality of delivery orders according to an order issuing sequence and acquiring a first order positioned at the head in the order issuing sequence;
matching idle vehicles: receiving a request for dispatching orders of each transport vehicle; arranging the plurality of dispatching requests according to a preset sequence and acquiring a first idle vehicle positioned at the head in the preset sequence;
acquiring order information of a first order and sending the order information to a first idle vehicle; the order information comprises a delivery destination;
continuously distributing delivery orders: taking the delivery destination of the first order as a reference destination of the first idle vehicle;
generating a preset transportation route from an off-line storage point to a reference destination;
acquiring accompanying orders; the accompanying orders are delivery orders with delivery destinations in a preset transportation route in the order issuing sequence;
stopping allocation of dispatch orders: sending the accompanying order to a first idle vehicle;
automatically accumulating the rest delivery orders to form a new order sending sequence;
and repeating the steps to match the idle vehicles with the continuous distribution delivery orders to carry out delivery for the order-oriented idle vehicles in the preset sequence.
2. The intelligent logistics scheduling management method based on geographical location information of claim 1, wherein a preset limit bearing capacity V0; the method also comprises the following steps after the step of acquiring the accompanying order:
acquiring the carrying capacity V1 of the current idle vehicle; the bearing capacity V1 comprises the size of a bearing space of a current idle vehicle and the bearing limit weight;
the order information also comprises the bearing capacity V2 consumed by goods in the current order; the load capacity V2 includes the size and weight of the current cargo;
acquiring the residual bearing capacity V3 of the current idle vehicle; v3= V1-V2;
judging whether V3 is smaller than V0;
if V3 is greater than V0; repeating the step to obtain accompanying orders;
if V3 is less than or equal to V0; the stop step obtains the accompanying order and the start execution step stops allocating the dispatch order.
3. The intelligent logistics scheduling management method based on geographical location information as claimed in claim 1, wherein the step of stopping allocation of dispatch orders further comprises the following steps:
transportation supervision: acquiring a real-time transportation route;
comparing the real-time transportation route with a preset transportation route;
if the real-time transportation route is inconsistent with the preset transportation route, sending a first transportation abnormity alarm to the corresponding transportation vehicle; acquiring the consumed transportation time length L1 of the real-time transportation route and the consumed transportation time length L2 of the preset transportation route;
comparison of L1 and L2;
if L1 is greater than L2, a second transportation anomaly alarm is sent to the supervision module; the second transportation anomaly alert includes a real-time transportation route and transportation vehicle information to travel the current real-time transportation route.
4. The intelligent logistics scheduling management method based on geographical location information as claimed in claim 3, wherein the step of transportation supervision further comprises the following steps:
and (3) illegal parking supervision:
inquiring illegal vehicle information; the illegal parking vehicle information comprises a vehicle license plate and an illegal parking place;
importing the illegal parking place into a forbidden parking list;
receiving dispatch arrival information; the delivery arrival information is sent after the transportation vehicle arrives at any delivery destination;
acquiring and storing a stopping place of a current transport vehicle;
judging whether the parking place of the current transport vehicle is positioned in the parking forbidding list or not;
and if so, sending a stopping prohibition prompt to the corresponding transport vehicle.
5. The intelligent logistics scheduling management method based on geographical location information as claimed in claim 4, wherein the step of violation supervision further comprises the following steps:
and if the stopping place of the current transport vehicle is not located in the order forbidden list, importing the stopping place of the current transport vehicle into the stop-and-go list.
6. The intelligent logistics scheduling management method based on geographical location information of claim 5, wherein the step of sending the prohibition prompt to the corresponding transportation vehicle further comprises the following steps:
and acquiring a recommended parking place which is closest to the current transport vehicle parking place in the stop list and generating the recommended parking place to the current transport vehicle.
7. The intelligent logistics scheduling management method based on geographical location information as claimed in claim 3, wherein the step of transportation supervision further comprises the following steps:
if L1 is less than or equal to L2, then the current real-time haul route is stored as the alternate recommended haul route.
8. Intelligent logistics scheduling management system based on geographical position information, characterized by, include:
the control end (1) executes the intelligent logistics scheduling management method based on the geographical location information according to any one of the claims 1-7;
the merchant terminal (2) is used for sending a delivery order to the control terminal (1);
the transportation terminal (3) is used for receiving a transportation route and a delivery order to be transported; for sending a dispatching request to the control terminal (1).
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210356851.4A CN114742500A (en) | 2022-04-06 | 2022-04-06 | Intelligent logistics scheduling management method and system based on geographical position information |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210356851.4A CN114742500A (en) | 2022-04-06 | 2022-04-06 | Intelligent logistics scheduling management method and system based on geographical position information |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN114742500A true CN114742500A (en) | 2022-07-12 |
Family
ID=82278730
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210356851.4A Pending CN114742500A (en) | 2022-04-06 | 2022-04-06 | Intelligent logistics scheduling management method and system based on geographical position information |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114742500A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116644942A (en) * | 2023-07-24 | 2023-08-25 | 山东车拖车网络科技有限公司 | Automatic trailer service matching method |
| CN116797123A (en) * | 2023-08-28 | 2023-09-22 | 深圳市明心数智科技有限公司 | Logistics management and early warning method, system and medium |
-
2022
- 2022-04-06 CN CN202210356851.4A patent/CN114742500A/en active Pending
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116644942A (en) * | 2023-07-24 | 2023-08-25 | 山东车拖车网络科技有限公司 | Automatic trailer service matching method |
| CN116644942B (en) * | 2023-07-24 | 2023-10-24 | 山东车拖车网络科技有限公司 | Automatic trailer service matching method |
| CN116797123A (en) * | 2023-08-28 | 2023-09-22 | 深圳市明心数智科技有限公司 | Logistics management and early warning method, system and medium |
| CN116797123B (en) * | 2023-08-28 | 2024-02-23 | 深圳市明心数智科技有限公司 | Logistics management and early warning method, system and medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN114742500A (en) | Intelligent logistics scheduling management method and system based on geographical position information | |
| US6453298B2 (en) | Method of operating a vehicle redistribution system based upon predicted ride demands | |
| CN103308052B (en) | Charge point notification system and car-mounted device | |
| US6317720B1 (en) | Shared vehicle deployment and reallocation using predicted and current demand location and transit data | |
| CN109978444A (en) | Storage dispatching method and system, storage medium, electronic equipment | |
| CN111401735A (en) | Intelligent queuing method, device, equipment and storage medium for logistics vehicles | |
| WO2015018309A1 (en) | Location-based taxi information communication service system, terminals and method | |
| CN107871175A (en) | A kind of vehicle and goods matching distribute leaflets method and device | |
| CN114862226B (en) | Warehouse logistics intelligent scheduling and loading and unloading management method and system | |
| CN110414895A (en) | Vehicle dispatch system and method | |
| CN102316414A (en) | Remote vehicle monitoring method and system | |
| CN113408773A (en) | Transport vehicle charging scheduling control method and device | |
| CN112950041A (en) | Shared vehicle scheduling method, device, storage medium and computer program product | |
| CN102938198A (en) | Public transportation distribution method and public transportation system | |
| CN115923570A (en) | Charging management method, device, system, electronic device and storage medium | |
| CN112465384A (en) | Transportation capacity scheduling method and device, computer equipment and computer readable storage medium | |
| CN112214021A (en) | Automatic parking method, device, electronic equipment and computer readable storage medium | |
| CN110717711A (en) | Logistics distribution method and system | |
| JP2000289807A (en) | Physical distribution information control system in recycling waste household electric appliances | |
| CN113808381B (en) | Public transport scheduling method, server and storage medium | |
| CN112874538B (en) | Control method of unmanned vehicle, and computer device | |
| CN108846616A (en) | Logistics distribution information processing method and system | |
| CN114063583A (en) | Intelligent logistics method based on Internet of things technology | |
| CN113554250A (en) | Information processing method and device for transport vehicle | |
| JP2003233655A (en) | Delivery truck traveling management system and method for it |
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 |