CN116739315B - Door and window order dispatching method and device, electronic equipment and storage medium - Google Patents
Door and window order dispatching method and device, electronic equipment and storage medium Download PDFInfo
- Publication number
- CN116739315B CN116739315B CN202311019959.5A CN202311019959A CN116739315B CN 116739315 B CN116739315 B CN 116739315B CN 202311019959 A CN202311019959 A CN 202311019959A CN 116739315 B CN116739315 B CN 116739315B
- Authority
- CN
- China
- Prior art keywords
- order
- dispatch
- information
- orders
- alternative
- 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
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; 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/06313—Resource planning in a project environment
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; 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/06316—Sequencing of tasks or work
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; 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 OR CALCULATING; 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/0832—Special goods or special handling procedures, e.g. handling of hazardous or fragile goods
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; 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—Managing shopping lists, e.g. compiling or processing purchase lists
- G06Q30/0635—Managing shopping lists, e.g. compiling or processing purchase lists replenishment orders; recurring orders
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02P—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS
- Y02P90/00—Enabling technologies with a potential contribution to greenhouse gas [GHG] emissions mitigation
- Y02P90/30—Computing systems specially adapted for manufacturing
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Entrepreneurship & Innovation (AREA)
- Development Economics (AREA)
- Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- General Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- Marketing (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- Operations Research (AREA)
- Educational Administration (AREA)
- Game Theory and Decision Science (AREA)
- Accounting & Taxation (AREA)
- Finance (AREA)
- Life Sciences & Earth Sciences (AREA)
- Biodiversity & Conservation Biology (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The application provides a door and window order dispatch method, a device, electronic equipment and a storage medium, which relate to the technical field of order dispatch and are characterized in that: comprising the following steps: acquiring first space occupation information of each order in a dispatch form; calculating the residual space information in the carriage according to the first space occupation information; when the residual space information is larger than a preset value, screening out first orders meeting the requirements from the to-be-dispatched orders according to the first dispatch time, the first dispatch place and the residual space information of each order in the dispatch form; adding the first order to the dispatch form. The door and window order dispatching method, the door and window order dispatching device, the electronic equipment and the storage medium have the advantage of high delivery efficiency.
Description
Technical Field
The application relates to the technical field of order dispatch, in particular to a door and window order dispatch method, a door and window order dispatch device, electronic equipment and a storage medium.
Background
The door and window belongs to highly customized products, and in general, after the door and window is manufactured, a user is notified of the delivery time, and then the door and window is delivered to the door according to the delivery time, wherein part of users need to receive goods at a designated time due to limited time, and part of users have relatively loose time and can receive goods within a certain time range.
In the existing scheme, the goods of the reserved user are generally sent preferentially, and then the goods of the other users are sent in the spare time, but the sending plan is often required to be manually formulated according to various factors, the formulated sending plan is often imperfect, time and labor are wasted, and the problems of insufficient time utilization, low delivery efficiency, incapability of timely delivering and the like easily occur.
In view of the above problems, improvements are needed.
Disclosure of Invention
The invention aims to provide a door and window order dispatching method, a door and window order dispatching device, electronic equipment and a storage medium, and the door and window order dispatching method and the device have the advantage of high delivery efficiency.
In a first aspect, the present application provides a method for dispatching an order of a door or window, which has the following technical scheme:
comprising the following steps:
acquiring first space occupation information of each order in a dispatch form;
calculating the residual space information in the carriage according to the first space occupation information;
when the residual space information is larger than a preset value, screening out first orders meeting the requirements from the to-be-dispatched orders according to the first dispatch time, the first dispatch place and the residual space information of each order in the dispatch form;
adding the first order to the dispatch form.
Firstly, a dispatch form is established, then, the residual space information of a carriage is calculated through the first space occupation information of each order of the dispatch form, when the residual space information is larger than a preset value, the first order is screened out from the orders to be dispatched according to the first dispatch time, the first dispatch place and the residual space information of each order, so that the number of the orders in single transportation is improved as much as possible, and the beneficial effect of high delivery efficiency is achieved.
Further, in the present application, the to-be-dispatched order includes a second dispatch location and second space occupation information;
the step of screening the first order meeting the requirement from the to-be-dispatched orders according to the first dispatch time, the first dispatch place and the residual space information of each order in the dispatch form comprises the following steps:
acquiring the first dispatch time and the first dispatch place of two adjacent orders in the dispatch form;
obtaining the time interval information of dispatch according to the adjacent two first dispatch times;
respectively calculating time information required by the two first dispatch places to reach the second dispatch place to obtain first time information and second time information;
When the sum of the first time information and the second time information is smaller than the time interval information, the corresponding order to be dispatched is used as an alternative order;
and screening the order with the second space occupation information smaller than the residual space information from the alternative orders according to the residual space information to serve as the first order.
Through the technical scheme, the dispatching orders can be newly increased as much as possible under the condition that the dispatching of the original orders is not influenced, so that the delivery efficiency is improved under the condition that the on-time dispatching of the original orders is ensured.
Further, in the present application, the step of adding the first order to the dispatch form includes:
distributing second dispatch time to the first order according to the two first dispatch times, the first time information and the second time information of two adjacent orders in the dispatch form, so that the second dispatch time tends to be close to the intermediate value of the two first dispatch times;
after assigning a second dispatch time to the first order, the first order is added to the dispatch form.
The second dispatch times are moved closer to the middle of the two first dispatch times in order to subsequently filter out more first orders. In addition, the second dispatch time tends to approach to the intermediate value of the two first dispatch times, so that enough time allowance can be reserved, and the fact that on-time dispatch is not possible due to an emergency is prevented.
Further, in the present application, after adding the first order to the dispatch form, the method further includes:
a secondary priority label is set for the first order.
Further, in the present application, the step of screening, from the candidate orders according to the remaining space information, the order with the second space occupation information smaller than the remaining space information as the first order includes:
acquiring the residual space information;
when the residual space information is smaller than a second preset value, immediately screening an order with the second space occupation information smaller than the residual space information from the alternative orders according to the residual space information as the first order after the corresponding order to be dispatched is taken as the alternative order;
when the residual space information is larger than or equal to the second preset value, after one or more alternative orders are selected from a plurality of to-be-dispatched orders, an order with the second space occupation information smaller than the residual space information is selected from the alternative orders according to the residual space information to serve as the first order;
the second preset value is greater than the preset value.
Further, in the present application, the step of screening, from the candidate orders according to the remaining space information, the order with the second space occupation information smaller than the remaining space information as the first order includes:
when a plurality of alternative orders are provided, sorting the plurality of alternative orders according to the size of the second space occupation information;
and screening orders with the second space occupation information smaller than the residual space information from the alternative orders according to the residual space information from small to large or from large to small as the first order.
Further, in the present application, the step of screening, from the candidate orders, the order with the second space occupation information smaller than the remaining space information in order from small to large or from large to small according to the remaining space information, as the first order includes:
screening orders with the second space occupation information smaller than the residual space information from the alternative orders according to the residual space information in order from small to large to obtain alternative first orders;
acquiring the quantity and/or space occupation of the alternative first orders;
Screening orders with the second space occupation information smaller than the residual space information from the alternative orders according to the residual space information from the large order to the small order to serve as alternative second orders;
acquiring the quantity and/or the space occupation of the alternative second order;
and taking the alternative first order or the alternative second order as the first order according to the quantity and/or the space occupation of the alternative first order and the quantity and/or the space occupation of the alternative second order.
In a second aspect, the present application further provides a door and window order sending device, including:
the acquisition module is used for acquiring first space occupation information of each order in the dispatch form;
the calculation module is used for calculating the residual space information in the carriage according to the first space occupation information;
the screening module is used for screening out first orders meeting the requirements from the to-be-dispatched orders according to the first dispatch time, the first dispatch place and the residual space information of each order in the dispatch form when the residual space information is larger than a preset value;
and the adding module is used for adding the first order to the dispatch form.
In a third aspect, the present application also provides an electronic device comprising a processor and a memory storing computer readable instructions which, when executed by the processor, perform the steps of the above method.
In a fourth aspect, the present application also provides a computer readable storage medium having stored thereon a computer program which, when executed by a processor, performs the steps of the above method.
As can be seen from the above, according to the door and window order dispatching method, device, electronic equipment and storage medium provided by the application, firstly, a dispatching form is established, then the residual space information of a carriage is calculated through the first space occupation information of each order of the dispatching form, and when the residual space information is larger than a preset value, the first order is screened out from the to-be-dispatched orders according to the first dispatching time, the first dispatching place and the residual space information of each order, so that the number of the orders in single transportation is improved as much as possible, and the beneficial effect of high delivery efficiency is achieved.
Drawings
Fig. 1 is a flowchart of a door and window order sending method provided in the present application.
Fig. 2 is a schematic structural diagram of a door and window order sending device provided in the present application.
Fig. 3 is a schematic structural diagram of an electronic device provided in the present application.
In the figure: 210. an acquisition module; 220. a computing module; 230. a screening module; 240. adding a module; 310. a processor; 320. a memory.
Description of the embodiments
The following description of the embodiments of the present application will be made clearly and fully with reference to the accompanying drawings, in which it is evident that the embodiments described are only some, but not all, of the embodiments of the present application. The components of the present application, as generally described and illustrated in the figures herein, may be arranged and designed in a wide variety of different configurations. Thus, the following detailed description of the embodiments of the present application, as provided in the accompanying drawings, is not intended to limit the scope of the application, as claimed, but is merely representative of selected embodiments of the application. All other embodiments, which can be made by those skilled in the art based on the embodiments of the present application without making any inventive effort, are intended to be within the scope of the present application.
It should be noted that: like reference numerals and letters denote like items in the following figures, and thus once an item is defined in one figure, no further definition or explanation thereof is necessary in the following figures. Meanwhile, in the description of the present application, the terms "first", "second", and the like are used only to distinguish the description, and are not to be construed as indicating or implying relative importance.
Referring to fig. 1, a method for dispatching an order of a door or window specifically includes:
S110, acquiring first space occupation information of each order in a dispatch form;
s120, calculating residual space information in the carriage according to the first space occupation information;
s130, when the residual space information is larger than a preset value, screening out first orders meeting the requirements from the to-be-dispatched orders according to the first dispatch time, the first dispatch place and the residual space information of each order in the dispatch form;
s140, adding the first order to the dispatch form.
The dispatch form may be generated according to the reservation information of the user, that is, all the initial dispatch forms include reservation orders, and the reservation orders reserve orders for the user for delivering goods in a designated time, and priority is required for ensuring dispatch.
That is, the method of the present application further comprises:
acquiring reservation information;
and generating a dispatch form according to the reservation information.
The core concept of the method is that firstly, a dispatch form is generated according to reservation information, the reserved order can be dispatched on time, and on the basis, a first order meeting the requirements is screened out of the to-be-dispatched order, so that the quantity of dispatched orders is increased as much as possible.
In some embodiments, the destination of the dispatch vehicle may be set as the last dispatch order in the dispatch form, the off-duty time is taken as the first dispatch time, the destination location is taken as the first dispatch place, and the first space occupation information is zero.
The order to be reserved is guaranteed to be sent on time in the application, because the size and the occupied space of the door and window are large, and particularly the weight and the size of the door and window are large in some large-scale custom doors and windows, users often need to arrange personnel to carry, so that the necessity of on time sending is high.
The first space occupation information refers to space occupied by goods corresponding to orders, in general, doors and windows are highly customized products, the space occupied by the doors and windows corresponding to each order may be different, specifically, two-dimensional codes can be attached to packages of each order, the two-dimensional codes can contain the first space occupation information of the order, and the two-dimensional codes can be scanned when the goods are delivered from a warehouse to obtain the first space occupation information.
The remaining space information refers to the space left in the car after loading the order in the dispatch form, and generally, the higher the utilization rate is if the car is fully loaded, however, in the actual dispatch process, the higher the utilization rate is often difficult to realize, because the car is generally not fully loaded due to various factors such as dispatch places and dispatch time, and the weight of doors and windows is heavy, and if the dispatch completion condition cannot be guaranteed, the car is fully loaded, and the unloading difficulty occurs in the dispatch process.
It is worth noting that in the dispatch process of doors and windows, the conventional dispatch is quite different from conventional dispatch, the conventional dispatch is usually dispatched from the express stations, the express stations are densely distributed, and each express station covers a smaller area, so that in the conventional dispatch process, a carriage can be filled as much as possible, the dispatch time is short because the dispatch area is limited, all goods can be dispatched even if the carriage is filled, and in addition, for the conventional dispatch, dispatch vehicles are often required to be filled with the goods for many times at the express stations in one working day, and the goods are dispatched for many times.
For door and window dispatch, the door and window is often dispatched directly from the production factory, and the problem that the dispatching area span is large is usually caused, if only the carriage is full, the situation that some orders cannot be dispatched is likely to occur, and the door and window corresponding to the orders which cannot be dispatched often affects the unloading of other doors and windows.
Therefore, for the dispatch of doors and windows, the carriage cannot be filled as simply as conventional express dispatch, and in the prior art, each order needs to be arranged manually, which is time-consuming and labor-consuming and is prone to error.
In this regard, when the remaining space information is greater than the preset value, the present application provides that the first order meeting the requirement is found out by screening from the to-be-dispatched orders according to the first dispatch time, the first dispatch location and the remaining space occupation information of each order in the dispatch form, and then the first order is added to the dispatch form for dispatch.
The preset value is a preset value, and is used as a judging condition for screening from the to-be-dispatched orders, in some specific embodiments, the preset value may be an average value of first space occupation information of each order, when the remaining space information is greater than the preset value, it indicates that the door and window may be continuously loaded, and in addition, the preset value may be set as a minimum value of space occupation in the historical orders.
The first order meeting the requirements is found out by screening the first dispatch time, the first dispatch place and the residual space occupation information of each order in the dispatch form from the to-be-dispatched orders, and the purpose is to screen out the orders which can be dispatched from the to-be-dispatched orders on the basis of ensuring dispatch of each order in the dispatch form, namely, the dispatch of the first order meeting the requirements does not influence dispatch of the existing orders in the dispatch form.
According to the scheme, the dispatch forms are firstly established, then the residual space information of the carriage is calculated through the first space occupation information of each order of the dispatch forms, and when the residual space information is larger than the preset value, the first order is screened out from the to-be-dispatched orders according to the first dispatch time, the first dispatch place and the residual space information of each order, so that the number of the orders in single transportation is improved as much as possible, and the beneficial effect of high delivery efficiency is achieved.
Specifically, the to-be-dispatched order comprises a second dispatch place and second space occupation information;
the step of screening the first orders meeting the requirements from the to-be-dispatched orders according to the first dispatch time, the first dispatch place and the residual space information of each order in the dispatch form comprises the following steps:
acquiring first dispatch time and a first dispatch place of two adjacent orders in a dispatch form;
obtaining the time interval information of dispatch according to the adjacent two first dispatch times;
respectively calculating time information required by two first dispatch places to reach a second dispatch place to obtain first time information and second time information;
when the sum of the first time information and the second time information is smaller than the time interval information, the corresponding order to be dispatched is used as an alternative order;
And screening orders with second space occupation information smaller than the residual space information from the candidate orders according to the residual space information to serve as first orders.
The purpose of the present application is to ensure that other orders are dispatched as many as possible under the condition of on-time dispatch of orders in the original dispatch form, and the initial order in the dispatch form may be a reservation order generated according to reservation information of a user, so that on-time dispatch of the order needs to be preferentially ensured.
On the basis, the first order is screened from the to-be-dispatched orders by using the first dispatch time, the first dispatch location and the first space occupation information of each order in the dispatch form, specifically, when the sum of the first time information and the second time information is smaller than the time interval information, the corresponding to-be-dispatched order is used as an alternative order, that is, the dispatch of the order in the dispatch form cannot be influenced by the dispatch of the alternative order, then the order with the second space occupation information smaller than the residual space information is screened from the alternative order as the first order, and accordingly, the doors and windows corresponding to the first order can be ensured to be loaded in a carriage.
For example, in the dispatch form, there are two adjacent orders, order a and order B, where the first dispatch time for order a is eight am, the first dispatch location is a, the first dispatch time for order B is ten am, and the first dispatch location is B.
The to-be-dispatched order comprises an order C and an order D, wherein a second dispatch place of the order C is a place C, second space occupation information is 1 m×1 m, a second dispatch place of the order D is a place D, and second space occupation information is 1 m×2 m×1 m.
The remaining space information is 2 meters×2 meters, and the preset value is 1 cubic meter.
At this time, since the remaining space information is 8 cubic meters and is larger than the preset value, the first order meeting the requirement is screened from the to-be-dispatched orders according to the first dispatch time, the first dispatch place and the remaining space occupation information.
Specifically, the time interval information is obtained according to two first dispatch times of the order a and the order b, wherein the first dispatch time of the order a is eight am, the first dispatch time of the order b is ten am, and the time interval information is 3 hours.
And respectively calculating time information required by the first dispatch site of the order a and the order b to reach the second dispatch site to obtain first time information and second time information.
For the order C to be dispatched, it is necessary to calculate the first time information of the point a reaching the point C and the second time information of the point C reaching the point B, and assuming that the first time information is 1 hour and the second time information is also 1 hour, the sum of the first time information and the second time information is 2 hours and less than the time interval information is 3 hours, and at this time, the order C is taken as an alternative order.
For the order D to be dispatched, the first time information that the point a reaches the point D and the second time information that the point D reaches the point B need to be calculated, and assuming that the first time information is 0.5 hour and the second time information is also 1 hour, the sum of the first time information and the second time information is 1.5 hours and is less than the time interval information for three hours, and at this time, the order D is taken as an alternative order.
At this time, both the order c and the order d are taken as alternative orders, and the second space occupation information of the order c is 1 m×1 m, which is smaller than the remaining space information of 2 m×2 m, so the order c can be taken as the first order.
Further, in some of these embodiments, the step of adding the first order to the dispatch form includes:
distributing second dispatch time to the first order according to the two first dispatch times, the first time information and the second time information of two adjacent orders in the dispatch form, so that the second dispatch time tends to be close to the intermediate value of the two first dispatch times;
after assigning the second dispatch time to the first order, the first order is added to the dispatch form.
After the first order is screened, the first order can be further dispatched on the premise that each order in the dispatch form can be guaranteed to be dispatched on time, so that dispatch time needs to be allocated to the first order, specifically, second dispatch time is allocated to the first order according to two first dispatch times, first time information and second time information of two adjacent orders in the dispatch form, and the second dispatch time tends to be close to the intermediate value of the two first dispatch times.
Taking the above-mentioned embodiment as an example, taking the order C as the first order, the first dispatch time of the order a is eight am, the first dispatch time of the order B is ten am, the first dispatch time information is 1 h, and the second dispatch time information is 1 h, where it is necessary to ensure that enough time remains from the C place of the order C to the B place of the order B, that is, it is necessary to ensure that the second dispatch time information is provided, since the first dispatch time of the order B is ten am, the second dispatch time is 1 h, the dispatch time of the order C cannot be later than ten am, on the basis, the second dispatch time tends to approach a median value of the two first dispatch times, the first dispatch time of the order a is eight am, the first dispatch time of the order B is ten am, the median value is nine thirty am, and the thirty am is not more than ten am, and the second dispatch time of the order B is thirty am.
Wherein the second dispatch times are moved closer to the middle value of the two first dispatch times for the purpose of screening more first orders for subsequent use.
For example, taking the above embodiment as an example, after order C is added to the dispatch form as the first order, the screening of order D may continue assuming that 0.5 hours is required for site a to reach site D and 0.8 hours is required for site D to reach site C.
If the second dispatch time allocated to order C is thirty minutes at nine am, the time interval information between order C and order a is 1.5 hours, in which case the first time information for the A site to reach the D site is 0.5 hours, the second time information for the D site to reach the C site is 0.8 hours, the sum of the first time information and the second time information is 1.3 hours, and less than the time interval information is 1.5 hours, so order D can be added to the dispatch form as an alternative order and subsequently as the first order.
If the second dispatch time allocated to the order C is only 1 hour according to the arrival of the place a at the place C, and the second dispatch time is determined to be nine am, the time interval information of the order a and the order C becomes 1 hour after the order C is added to the dispatch form, and at this time, since 0.5 hour is required to arrive at the place D from the place a, 0.8 hour is required to arrive at the place C from the place D, and the time exceeds 1 hour, at this time, the order D cannot be selected and added to the dispatch form.
In addition, the second dispatch time tends to approach to the intermediate value of the two first dispatch times, so that enough time allowance can be reserved, and the fact that on-time dispatch is not possible due to an emergency is prevented.
The second sending time is made to approach to the middle value of the two first sending times, specifically, when the interval between the middle value and the first sending time is larger than the second time information, the middle value is taken as the second sending time, and when the interval between the middle value and the first sending time is smaller than or equal to the second time information, the time point that the first sending time is earlier than the second sending time is taken as the second sending time.
Further, in some of these embodiments, after adding the first order to the dispatch form, further comprising:
a secondary priority label is set for the first order.
In the scheme of the application, firstly, the dispatch of each order in the original dispatch form is required to be satisfied, the orders belong to reservation orders, dispatch time is reserved, so that the timeliness of dispatch is required to be ensured, on the basis, a first order meeting the requirement is further screened, and the first order is added to the dispatch form to be dispatched, so that dispatch efficiency is improved, however, various events which cause time extension often occur in the actual dispatch process, and the more the dispatch orders are increased, the more obvious the influence is caused by time extension accumulation.
Taking the above example as an example, the second dispatch time of the order C is originally nine thirty am, the first dispatch time of the order B is eleven am, the time interval between them is 1.5 hours, and the second time information from the order C to the location B is 1 hour, that is, the order B can be dispatched after the order C is dispatched normally, however, in the actual dispatch process, there is a possibility that the dispatch of the order C is affected by various factors, and the dispatch of the order B should be abandoned when the dispatch of the order C is not completed at ten am. Thus, the first order is provided with a secondary priority label indicating that its dispatch priority is relatively low.
Further, in some embodiments, the step of screening the candidate order for the first order based on the remaining space information for an order having second space usage information less than the remaining space information includes:
acquiring residual space information;
when the residual space information is smaller than a second preset value, immediately screening an order with second space occupation information smaller than the residual space information from the alternative orders according to the residual space information as a first order after the corresponding to-be-dispatched order is used as the alternative order;
When the residual space information is larger than or equal to a second preset value, after one or more alternative orders are screened out from the plurality of to-be-dispatched orders, an order with second space occupation information smaller than the residual space information is screened out of the alternative orders according to the residual space information to serve as a first order;
the second preset value is greater than the preset value.
The second preset value is a preset value, and specifically, the second preset value may be an average value of historical order space occupation of integer multiple, such as two times, three times, and the like.
When the residual space information is smaller than the second preset value, the residual space information is smaller, and even if the first order meeting the requirements can be screened from the to-be-dispatched orders, the quantity of the screened first orders is limited, so that after one to-be-dispatched order is screened as an alternative order, whether the second space occupation information of the alternative order is smaller than the residual space information is immediately judged, if so, the second space occupation information is used as the first order, and because the residual space information is smaller, the quantity of the first orders which can be screened finally is small, and therefore, a large quantity of alternative orders do not need to be screened from the to-be-dispatched orders, the calculation resources can be saved, and the efficiency is improved.
And if the remaining space information is greater than or equal to the second preset value, it indicates that the remaining space information is greater, and a greater number of first orders or first orders with greater second space occupation information can be accommodated, and at this time, how to utilize the remaining space information to the greatest extent should be considered.
In this regard, the present application proposes to screen one or more candidate orders from the to-be-dispatched orders, and then screen the first order from the candidate orders according to the remaining space information.
The condition that one candidate order is selected from the to-be-dispatched orders is that only one order can be used as the candidate order in the to-be-dispatched orders.
For example, the remaining space information is 2 m×2 m, and both the order e and the order f may be alternative orders, wherein the second space occupation information of the order e is 1 m×1 m, and the second space occupation information of the order f is 1.5 m×2 m.
At this time, if according to some embodiments described above, after the corresponding to-be-dispatched order is taken as the candidate order, an order with the second space occupation information smaller than the remaining space information is screened from the candidate orders according to the remaining space information as the first order, if the first screened order is the order e, the order e is taken as the first order, and at this time, the order f is not taken as the first order to be added into the dispatch form.
If one or more alternative orders are selected from the multiple to-be-dispatched orders, then an order with second space occupation information smaller than the residual space information is selected from the alternative orders according to the residual space information to serve as a first order, namely, after the order e and the order f are selected to serve as alternative orders, the first order is selected from the alternative orders, at the moment, the space occupation sizes of the order e and the order f can be compared, and the order f is taken as the first order, so that the space utilization rate can be effectively improved.
Further, in some embodiments, the step of screening the candidate order for the first order based on the remaining space information for an order having second space usage information less than the remaining space information includes:
when a plurality of alternative orders are provided, sorting the plurality of alternative orders according to the size of the second space occupation information;
and screening orders with second space occupation information smaller than the residual space information from the alternative orders according to the residual space information from small to large or from large to small as first orders.
In some embodiments described above, in order to improve the space utilization, it is proposed that when the remaining space information is greater than or equal to the second preset value, a plurality of candidate orders are screened first, and then a first order is screened from the plurality of candidate orders.
Therefore, in this embodiment, it is proposed that, in some embodiments, when there are a plurality of candidate orders, the plurality of candidate orders are ordered in the order from small to large according to the second space occupation information, and then the first orders are screened in the order from small to large, so that the number of the first orders can be increased as much as possible, that is, the number of the dispatched orders can be increased as much as possible.
For example, the remaining space information is 2 m×2 m, and the order g, the order h, and the order i may all be alternative orders, where the second space occupation information of the order g is 2 m×2 m×1.5 m, the second space occupation information of the order h is 2 m×2 m×1 m, and the second space occupation information of the order i is 2 m×2 m×0.5 m.
According to some embodiments described above, after taking the order g, the order h and the order i as the candidate orders, the order with the largest space utilization rate may be selected as the first order, specifically, if the selection is only performed according to the size of the second space occupation information, the order g is selected as the first order, and once the order g is selected as the first order, the order h and the order i cannot be screened as the first order any more.
According to the scheme of the embodiment, the first orders can be sorted according to the second space occupation information from small to large, and the first orders are screened according to the order from small to large.
That is, the result of the sorting is the order i, the order h and the order g, the order i is first taken as the first order, then the order h is screened, the order h is still possibly screened as the first order, and if both the order i and the order h are screened as the first order, the quantity of the dispatched orders is increased relative to taking the order g as the first order.
It should be noted that, in the above embodiment, when the order h is screened again after the order i is taken as the first order, the order h may not be successfully taken as the first order because the dispatch time cannot meet the requirement, and at this time, only the order i may be screened as the first order, and the space utilization is reduced compared with the order g taken as the first order.
Thus, further, the method comprises:
screening orders with second space occupation information smaller than the residual space information from the alternative orders according to the residual space information from small to large as alternative first orders;
acquiring the quantity and/or the space occupation of the alternative first orders;
Screening orders with second space occupation information smaller than the residual space information from the alternative orders according to the residual space information from large to small as alternative second orders;
acquiring the quantity and/or the space occupation of the alternative second orders;
and taking the alternative first order or the alternative second order as the first order according to the quantity and/or the space occupation of the alternative first order and the quantity and/or the space occupation of the alternative second order.
Through the technical scheme, the space utilization rate can be improved to the greatest extent.
Wherein, as one of the preferable modes, the number of the first orders can be used as the first orders according to the number of the first orders and the number of the second orders.
In one of the preferred modes, the space occupation can be used as the first order according to the space occupation of the alternative first order and the space occupation of the alternative second order.
Wherein, as one of the preferred modes, in the step of taking the alternative first order or the alternative second order as the first order according to the quantity and space occupation of the alternative first order and the quantity and space occupation of the alternative second order, a proportionality coefficient may be set for the quantity and space occupation, for example, the ratio of the quantity and the space occupation of the alternative first order is 0.6:0.4, the ratio of the number of alternative second orders to the space occupation is 0.6:0.4.
For example, in one embodiment, the original dispatch forms include order a, order b, and order c.
And screening orders with second space occupation information smaller than the residual space information from the alternative orders according to the residual space information from small to large as alternative first orders, wherein the alternative first orders comprise an order d, an order f, an order h and an order i.
And screening orders with second space occupation information smaller than the residual space information from the alternative orders according to the residual space information from large to small, wherein the alternative second orders are selected as alternative second orders, and the alternative second orders comprise an order e and an order g.
At this time, since the number of the candidate first orders is greater than the number of the candidate second orders, the candidate first orders are added to the dispatch form as the first orders, specifically, in some embodiments, a new dispatch form is obtained after the first orders are added to the dispatch form, and the new dispatch form may specifically be the order a, the order f, the order d, the order b, the order h, the order i, and the order c.
The core concept of the method is that firstly, a dispatch form is generated according to reservation information, the reserved order can be dispatched on time, and on the basis, a first order meeting the requirements is screened out of the to-be-dispatched order, so that the quantity of dispatched orders is increased as much as possible. In some of the embodiments described above, it is proposed to set a secondary priority tag to the first order so that the dispatch of the first order may be abandoned during the dispatch in order to ensure that the dispatch of the original order. In addition, the order in the dispatch form can be divided into an original order and a newly added order, wherein the original order is a reserved order, the newly added order is an order after the first order is added into the dispatch form, the dispatch time of the original order needs to be ensured, and the newly added order can relatively fluctuate within a certain range, so when the first order meeting the requirement is screened out from the to-be-dispatched orders according to the first dispatch time, the first dispatch place and the residual space information of each order in the dispatch form, if the newly added order exists in two adjacent orders, when the corresponding to-be-dispatched order is not taken as a candidate order, the time interval information can be adjusted, the dispatch time of the newly added order is adjusted under the condition that the dispatch of the original order is not influenced, the time interval information is changed, and the to-be-dispatched order is screened as far as possible into the candidate order.
In a second aspect, referring to fig. 2, the present application further provides a door and window order sending device, including:
an obtaining module 210, configured to obtain first space occupation information of each order in the dispatch form;
a calculating module 220, configured to calculate remaining space information in the vehicle compartment according to the first space occupation information;
the screening module 230 is configured to screen a first order meeting the requirement from the to-be-dispatched orders according to the first dispatch time, the first dispatch location and the remaining space information of each order in the dispatch form when the remaining space information is greater than a preset value;
the adding module 240 is configured to add the first order to the dispatch form.
According to the scheme, the dispatch forms are firstly established, then the residual space information of the carriage is calculated through the first space occupation information of each order of the dispatch forms, and when the residual space information is larger than the preset value, the first order is screened out from the to-be-dispatched orders according to the first dispatch time, the first dispatch place and the residual space information of each order, so that the number of the orders in single transportation is improved as much as possible, and the beneficial effect of high delivery efficiency is achieved.
In addition, in other preferred embodiments, a door and window order sending device provided in the present application may perform any one of the steps of the above method.
In a third aspect, referring to fig. 3, the present application also provides an electronic device comprising a processor 310 and a memory 320, the memory 320 storing computer readable instructions which, when executed by the processor 310, perform the steps in the above method.
Through the foregoing, the processor 310 and the memory 320 are interconnected and communicate with each other through a communication bus and/or other form of connection mechanism (not shown), the memory 320 storing computer readable instructions executable by the processor 310, which when executed by the electronic device, the processor 310 executes the computer readable instructions to perform the method in any of the alternative implementations of the foregoing embodiments to perform the following functions: acquiring first space occupation information of each order in a dispatch form; calculating the residual space information in the carriage according to the first space occupation information; when the residual space information is larger than a preset value, screening out first orders meeting the requirements from the to-be-dispatched orders according to the first dispatch time, the first dispatch place and the residual space information of each order in the dispatch form; the first order is added to the dispatch form.
In a fourth aspect, the present application also provides a computer readable storage medium having stored thereon a computer program which, when executed by a processor, performs the steps of the above method.
By the above technical solution, the computer program, when executed by the processor, performs the method in any of the alternative implementations of the above embodiments to implement the following functions: acquiring first space occupation information of each order in a dispatch form; calculating the residual space information in the carriage according to the first space occupation information; when the residual space information is larger than a preset value, screening out first orders meeting the requirements from the to-be-dispatched orders according to the first dispatch time, the first dispatch place and the residual space information of each order in the dispatch form; the first order is added to the dispatch form.
The storage medium may be implemented by any type of volatile or nonvolatile Memory device or combination thereof, such as static random access Memory (Static Random Access Memory, SRAM), electrically erasable Programmable Read-Only Memory (Electrically Erasable Programmable Read-Only Memory, EEPROM), erasable Programmable Read-Only Memory (Erasable Programmable Read Only Memory, EPROM), programmable Read-Only Memory (PROM), read-Only Memory (ROM), magnetic Memory, flash Memory, magnetic disk, or optical disk.
In the embodiments provided in the present application, it should be understood that the disclosed apparatus and method may be implemented in other manners. The above-described apparatus embodiments are merely illustrative, for example, the division of the units is merely a logical function division, and there may be other manners of division in actual implementation, and for example, multiple units or components may be combined or integrated into another system, or some features may be omitted, or not performed. Alternatively, the coupling or direct coupling or communication connection shown or discussed with each other may be through some communication interface, device or unit indirect coupling or communication connection, which may be in electrical, mechanical or other form.
Further, the units described as separate units may or may not be physically separate, and units displayed as units may or may not be physical units, may be located in one place, or may be distributed over a plurality of network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
Furthermore, functional modules in various embodiments of the present application may be integrated together to form a single portion, or each module may exist alone, or two or more modules may be integrated to form a single portion.
The foregoing is merely exemplary embodiments of the present application and is not intended to limit the scope of the present application, and various modifications and variations may be suggested to one skilled in the art. Any modification, equivalent replacement, improvement, etc. made within the spirit and principles of the present application should be included in the protection scope of the present application.
Claims (6)
1. A door and window order dispatch method, comprising:
acquiring reservation information;
generating a dispatch form according to the reservation information;
acquiring first space occupation information of each order in a dispatch form;
calculating the residual space information in the carriage according to the first space occupation information;
when the residual space information is larger than a preset value, screening out first orders meeting the requirements from the to-be-dispatched orders according to the first dispatch time, the first dispatch place and the residual space information of each order in the dispatch form;
adding the first order to the dispatch form;
the to-be-dispatched order comprises a second dispatch place and second space occupation information;
the step of screening the first order meeting the requirement from the to-be-dispatched orders according to the first dispatch time, the first dispatch place and the residual space information of each order in the dispatch form comprises the following steps:
Acquiring the first dispatch time and the first dispatch place of two adjacent orders in the dispatch form;
obtaining the time interval information of dispatch according to the adjacent two first dispatch times;
respectively calculating time information required by the two first dispatch places to reach the second dispatch place to obtain first time information and second time information;
when the sum of the first time information and the second time information is smaller than the time interval information, the corresponding order to be dispatched is used as an alternative order;
screening orders with the second space occupation information smaller than the residual space information from the alternative orders according to the residual space information to serve as the first orders;
the step of screening the order with the second space occupation information smaller than the residual space information from the alternative orders according to the residual space information as the first order comprises the following steps:
acquiring the residual space information;
when the residual space information is smaller than a second preset value, immediately screening an order with the second space occupation information smaller than the residual space information from the alternative orders according to the residual space information as the first order after the corresponding order to be dispatched is taken as the alternative order;
When the residual space information is larger than or equal to the second preset value, after one or more alternative orders are selected from a plurality of to-be-dispatched orders, an order with the second space occupation information smaller than the residual space information is selected from the alternative orders according to the residual space information to serve as the first order;
the second preset value is larger than the preset value;
the step of screening the order with the second space occupation information smaller than the residual space information from the alternative orders according to the residual space information as the first order comprises the following steps:
when a plurality of alternative orders are provided, sorting the plurality of alternative orders according to the size of the second space occupation information;
screening orders with the second space occupation information smaller than the residual space information from the alternative orders according to the residual space information from small to large or from large to small as the first order;
the step of screening the order with the second space occupation information smaller than the residual space information from the alternative orders according to the residual space information from small to large or from large to small as the first order comprises the following steps:
Screening orders with the second space occupation information smaller than the residual space information from the alternative orders according to the residual space information in order from small to large to obtain alternative first orders;
acquiring the quantity and/or space occupation of the alternative first orders;
screening orders with the second space occupation information smaller than the residual space information from the alternative orders according to the residual space information from the large order to the small order to serve as alternative second orders;
acquiring the quantity and/or the space occupation of the alternative second order;
and taking the alternative first order or the alternative second order as the first order according to the quantity and/or the space occupation of the alternative first order and the quantity and/or the space occupation of the alternative second order.
2. The door and window order dispatch method of claim 1, wherein the step of adding the first order to the dispatch form comprises:
distributing second dispatch time to the first order according to the two first dispatch times, the first time information and the second time information of two adjacent orders in the dispatch form, so that the second dispatch time tends to be close to the intermediate value of the two first dispatch times; after assigning a second dispatch time to the first order, the first order is added to the dispatch form.
3. The door and window order dispatch method of claim 2, wherein after adding the first order to the dispatch form, further comprising:
a secondary priority label is set for the first order.
4. A door and window order dispatching device for performing the steps of the method of any one of claims 1 to 3, comprising:
the acquisition module is used for acquiring reservation information; generating a dispatch form according to the reservation information; acquiring first space occupation information of each order in a dispatch form;
the calculation module is used for calculating the residual space information in the carriage according to the first space occupation information;
the screening module is used for screening out first orders meeting the requirements from the to-be-dispatched orders according to the first dispatch time, the first dispatch place and the residual space information of each order in the dispatch form when the residual space information is larger than a preset value;
and the adding module is used for adding the first order to the dispatch form.
5. An electronic device comprising a processor and a memory storing computer readable instructions which, when executed by the processor, perform the steps of the method of any of claims 1 to 3.
6. A computer readable storage medium, on which a computer program is stored, characterized in that the computer program, when being executed by a processor, runs the steps in the method according to any one of claims 1 to 3.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311019959.5A CN116739315B (en) | 2023-08-14 | 2023-08-14 | Door and window order dispatching method and device, electronic equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311019959.5A CN116739315B (en) | 2023-08-14 | 2023-08-14 | Door and window order dispatching method and device, electronic equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN116739315A CN116739315A (en) | 2023-09-12 |
| CN116739315B true CN116739315B (en) | 2024-03-15 |
Family
ID=87910119
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311019959.5A Active CN116739315B (en) | 2023-08-14 | 2023-08-14 | Door and window order dispatching method and device, electronic equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116739315B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117252503B (en) * | 2023-11-15 | 2024-03-15 | 佛山市南海区微高软件有限公司 | Door and window dispatching information generation method and device, electronic equipment and storage medium |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113780650A (en) * | 2021-09-06 | 2021-12-10 | 杭州拼便宜网络科技有限公司 | Transport capacity locking method, device, equipment and storage medium |
| CN113807780A (en) * | 2021-09-04 | 2021-12-17 | 刘伟 | Cold chain transportation method in big data environment and gas column bag for cold chain transportation |
-
2023
- 2023-08-14 CN CN202311019959.5A patent/CN116739315B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113807780A (en) * | 2021-09-04 | 2021-12-17 | 刘伟 | Cold chain transportation method in big data environment and gas column bag for cold chain transportation |
| CN113780650A (en) * | 2021-09-06 | 2021-12-10 | 杭州拼便宜网络科技有限公司 | Transport capacity locking method, device, equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN116739315A (en) | 2023-09-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US5265006A (en) | Demand scheduled partial carrier load planning system for the transportation industry | |
| US20170132563A1 (en) | Delivery Area Management Method | |
| CN105913206A (en) | Distributed warehoused cargo scheduling system and method | |
| CN110322172A (en) | Inventory's dispatching method, device and computer readable storage medium | |
| CN111768149A (en) | Express logistics network planning optimization method and system | |
| CN110782208A (en) | Distribution task pushing method and device, electronic equipment and storage medium | |
| CN109670684B (en) | Freight vehicle scheduling method based on time window and electronic equipment | |
| CN116739315B (en) | Door and window order dispatching method and device, electronic equipment and storage medium | |
| CN111105084A (en) | Logistics information processing method, device and equipment and computer storage medium | |
| CN113379102A (en) | Multi-network trunk transport optimization method, computer equipment and storage medium | |
| CN116307306B (en) | Intelligent scheduling method, device, equipment and storage medium based on big data | |
| CN110826951A (en) | Transportation line stowage method and device, electronic equipment and computer readable medium | |
| CN110751433B (en) | Order distribution method and device, electronic equipment and storage medium | |
| CN110363476A (en) | Warehousing allocation processing method and device | |
| CN111126643B (en) | Reservation method and reservation device of platform and readable storage medium | |
| CN113592275B (en) | Freight dispatching method, computer readable storage medium and computer equipment | |
| CN102073940A (en) | Station platform dynamic distribution method and system during on-line reservation of supplier | |
| CN110705946A (en) | Cargo assembling method and cargo assembling system | |
| CN112581058A (en) | Logistics control and management method | |
| CN115271573A (en) | Goods distribution method, apparatus, computer equipment and storage medium | |
| CN109784816A (en) | Express delivery distribution method and device | |
| CN113534751A (en) | Method, device and system for scheduling transport equipment, storage medium and electronic equipment | |
| CN114881542B (en) | Enterprise position distribution method and device, electronic equipment and storage medium | |
| CN111815012A (en) | Rental car platform center warehouse parking space allocation method, electronic equipment and storage medium | |
| CN116136973A (en) | Method and device for dispatching network appointment orders and electronic equipment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |