Shuttle vehicle operation optimization scheduling method based on bilevel programming model

By constructing a two-level programming model and combining binary search and genetic algorithm to optimize shuttle operation, the scheduling mismatch caused by physical size and dynamic changes in the circular shuttle system was solved, achieving efficient system operation and resource optimization.

CN119027004AInactive Publication Date: 2024-11-26GANSU CHENGHAI ELECTRONIC INFORMATION TECH CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202410860483.6
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-06-28
Publication Date
2024-11-26
Estimated Expiration
Not applicable · inactive patent

AI Technical Summary

Technical Problem

Existing technologies do not fully consider the physical size and dynamic changes of shuttles in the design and scheduling of circular shuttle systems, resulting in discrepancies between scheduling plans and actual operation, increased congestion, reduced efficiency, and traditional algorithms are difficult to handle complex large-scale scheduling problems.

Method used

An optimization scheduling method based on a bi-level programming model is constructed. Combining a bisection search strategy and a genetic algorithm, a shuttle length constraint is added to evaluate efficiency and analyze dynamic characteristics, thereby optimizing shuttle operation.

Benefits of technology

It achieves comprehensive scheduling optimization from macro to micro levels, improves scheduling flexibility and accuracy, effectively handles complex constraints, and enhances the overall feasibility and long-term efficient operation of the system.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119027004A_ABST
    Figure CN119027004A_ABST
Patent Text Reader

Abstract

The invention discloses a shuttle vehicle operation optimization scheduling method based on a bilevel programming model, which is applied to an annular shuttle vehicle system, and comprises the following steps: constructing the bilevel programming model, and obtaining shuttle vehicle operation schemes under different numbers of shuttle vehicles by using a search strategy based on a bisection method and a genetic algorithm; the bilevel planning model comprises an upper layer model and a lower layer model; a shuttle vehicle length constraint is added to the bilevel planning model, and a search strategy based on a dichotomy and a genetic algorithm are utilized to obtain shuttle vehicle operation schemes under different numbers of shuttle vehicles; and based on the shuttle vehicle operation schemes under different shuttle vehicle numbers before and after increasing the shuttle vehicle length constraint, efficiency evaluation is carried out by using an efficiency evaluation function, and shuttle vehicle operation optimization scheduling is carried out. According to the method, an accurate mathematical model is constructed, an efficient algorithm is adopted for solving, and system efficiency evaluation and optimal scheduling are carried out in combination with actual operation constraints, so that the operation efficiency and the management capability of the logistics industry, especially an automatic stereoscopic warehouse, are improved.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of circular shuttle vehicles, and more specifically to a shuttle vehicle operation optimization scheduling method based on a double-layer programming model. Background Art

[0002] The circular shuttle system refers to a material transportation system that allows multiple shuttles to run along the track in a workshop or automated warehouse at the same time. It is widely used because of its fast moving speed, stable operation and high reliability. How to reasonably dispatch shuttles to effectively solve the transportation congestion problem and thus improve the operating efficiency of the circular shuttle system is an important factor in accelerating the rapid development of the modern logistics industry.

[0003] Currently, existing technical solutions have been widely used in the design and scheduling of circular shuttle systems in automated warehouses and workshop material transportation to improve logistics efficiency. It usually involves the development of shuttle scheduling algorithms, such as first-come-first-served strategy, mixed integer linear programming model, Petri net model, etc., aiming to minimize the outbound time, improve the utilization rate of shuttles and avoid system deadlock. Although these solutions have improved system performance to a certain extent, there are still some defects.

[0004] Moreover, the actual physical dimensions of the shuttle, such as length and dwell time at the service entrance, are not fully considered, which will lead to the scheduling plan not being consistent with the actual operation, increasing congestion and reducing efficiency. There is a lack of comprehensive consideration at the system level. This results in limited optimization effects and failure to fully utilize system resources to achieve global optimization.

[0005] When analyzing the impact of the number of shuttles on system efficiency, only fixed inbound and outbound indicators and operating parameters are used, without fully considering the long-term impact of dynamic changes on the overall efficiency of the system, such as the mismatch between shuttles and static facility configurations causing bottlenecks. Some traditional algorithms, such as those based on system analysis and control or simulation analysis, cannot effectively handle large-scale and complex scheduling problems, especially when the number of shuttles increases, the nonlinear characteristics of the scheduling problem and the complexity of the constraints increase significantly.

[0006] In summary, the current technical solutions have shortcomings in coping with real-time scheduling in complex dynamic environments, comprehensive system optimization, and scheduling models that consider the physical characteristics of shuttle vehicles. Better scheduling strategies and system design methods are needed to improve overall operating efficiency.

[0007] Therefore, how to design a shuttle operation optimization scheduling method based on a double-layer planning model to improve the operation efficiency and management capabilities of the logistics industry, especially automated warehouses, is an urgent problem that technicians in this field need to solve. Summary of the invention

[0008] In view of this, the present invention provides a method for optimizing the operation of a shuttle vehicle based on a two-level programming model, which constructs an accurate mathematical model, adopts an efficient algorithm to solve it, and combines actual operation constraints to perform system efficiency evaluation and optimal scheduling.

[0009] In order to achieve the above object, the present invention adopts the following technical solution:

[0010] A shuttle operation optimization scheduling method based on a two-level programming model is applied to a circular shuttle system, comprising:

[0011] S1. Construct a two-level programming model, and use a binary search strategy and a genetic algorithm to obtain shuttle operation plans under different numbers of shuttles; the two-level programming model includes: an upper model and a lower model;

[0012] S2, adding a shuttle length constraint to the bi-level programming model, and using the dichotomy-based search strategy and genetic algorithm to obtain shuttle operation plans under different numbers of shuttles;

[0013] S3. Based on the shuttle operation plan under different numbers of shuttles before and after adding the shuttle length constraint, the efficiency is evaluated using the efficiency evaluation function, and the shuttle operation is optimized and scheduled based on the efficiency evaluation result.

[0014] The method also includes: S4, configuring related fixed static facilities, analyzing the dynamic characteristics of the shuttle, and optimizing the shuttle speed based on the results of the dynamic characteristics analysis.

[0015] Furthermore, in S1, a two-level planning model is constructed, including: defining the upper-level model objective function Z1 to minimize the total completion time:

[0016]

[0017] Among them, i, j and g are the numbers of the shipping port, the import port and the service port respectively, and the service port includes: the shipping port and the import port; p is the shuttle car number; Whether shuttle p chooses to pick up and deliver from outlet i to inlet j in cycle k, is the time it takes for shuttle p to reach service port g in the k cycle;

[0018] The decision variable of the objective function of the upper model is the number of cycle times k.

[0019] Furthermore, the cycle period is the time from the first shuttle vehicle passing from the starting point to the next time it passes the starting point.

[0020] Furthermore, the constraints of the objective function of the upper model include: the value range of the number of cycle times k;

[0021] The value range of the cycle number k is determined based on the shuttle vehicle loading and unloading rules; the picking rules include: the maximum number of picking times and the minimum number of picking times for each shuttle vehicle in a cycle.

[0022] Furthermore, in S1, a two-level planning model is constructed, including: defining the lower-level model objective function Z2 to minimize the total completion time under a given number of cycle cycles:

[0023]

[0024] The decision variable of the objective function of the lower model is whether the shuttle p chooses to pick up and deliver from the shipping port i to the shipping port j in the k cycle period. The time when shuttle p arrives at service port g and the time when the shuttle p leaves the service port g

[0025] Furthermore, the constraints of the objective function of the lower model include:

[0026] Shuttle constraints within the same cycle, shuttle constraints between different cycle periods, supply and demand balance constraints, fixed pick-up and delivery direction constraints and boundary condition constraints.

[0027] Furthermore, in S1, a shuttle operation scheme under different numbers of shuttles is obtained by using a dichotomy-based search strategy and a genetic algorithm, including:

[0028] S11, through the upper model, using a search strategy based on dichotomy, determine the number of cycle times under any number of shuttles;

[0029] S12, based on the number of cycle times, using the lower model, using a genetic algorithm to determine the pick-up and delivery tasks of each shuttle vehicle with the minimum total completion time;

[0030] S13, feeding back the pick-up and delivery tasks of each shuttle vehicle under the minimum total completion time to the upper model, determining the time when each shuttle vehicle arrives at and leaves the service port, and obtaining the shuttle vehicle operation plan;

[0031] S14, determine whether the maximum number of iterations has been reached; if so, proceed to S15;

[0032] Otherwise, based on the shuttle operation plan, the binary search strategy is adopted to determine the number of cycle times, and the process returns to S12;

[0033] S15, repeating the above S11 to S14 until the shuttle operation plans based on different cycle times for all shuttle numbers are output.

[0034] Furthermore, in S2, the shuttle length constraint is:

[0035]

[0036] Where p and n are the shuttle numbers, and p>n, L is the shuttle length, and v is the shuttle speed.

[0037] Furthermore, in S3, the efficiency evaluation function is:

[0038]

[0039] Among them, λ is the efficiency evaluation index.

[0040] It can be seen from the above technical solution that compared with the prior art, the technical solution of the present invention has the following advantages:

[0041] Beneficial effects:

[0042] 1. By building a two-layer planning model, the macro-scheduling cycle arrangement of the shuttle and the micro-service port pick-up and delivery details can be considered at the same time, realizing comprehensive scheduling optimization from macro to micro. The two-layer model structure allows the specific action path and time arrangement of the shuttle to be finely adjusted without sacrificing the overall efficiency of the system, thus improving the flexibility and accuracy of scheduling.

[0043] 2. Using a binary search strategy to find the optimal solution for the upper-level planning, it can efficiently find the global optimal solution when facing nonlinear or large-scale problems. Combining genetic algorithms to solve the lower-level nonlinear programming problems can effectively handle complex constraints and nonlinear relationships, ensuring the quality and efficiency of the solution.

[0044] 3. The shuttle length constraint was added to the model to make the model closer to actual operating conditions. Considering the mutual influence of shuttles in physical space, the time interval constraint of arriving at and leaving the service port was added, and the scheduling strategy was optimized by simulating real scenarios, which improved the overall feasibility of the system.

[0045] 4. By comparing the efficiency before and after adding the shuttle length constraint, and using the efficiency evaluation function for quantitative evaluation, we can intuitively see the specific impact of the scheduling strategy on system performance. Based on these evaluation results, more reasonable shuttle investment decisions can be made. This feedback mechanism promotes the continuous optimization of the system and ensures long-term efficient operation. BRIEF DESCRIPTION OF THE DRAWINGS

[0046] In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are only embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on the provided drawings without paying creative work.

[0047] Figure 1 A flow chart of a method for optimizing shuttle operation scheduling based on a double-layer programming model provided in an embodiment of the present invention;

[0048] Figure 2 A schematic diagram of the structure of a circular shuttle system provided by an embodiment of the present invention;

[0049] Figure 3 A schematic diagram of the comparison between the total completion time and the congestion time when the number of shuttle vehicles provided in the embodiment of the present invention is 3;

[0050] Figure 4 A schematic diagram of the comparison between the total completion time and the congestion time when the number of shuttle vehicles provided in the embodiment of the present invention is 6;

[0051] Figure 5 A schematic diagram of the comparison between the total completion time and the congestion time when the number of shuttle vehicles provided in the embodiment of the present invention is 9;

[0052] Figure 6 A schematic diagram comparing the total completion time and the total congestion time when the number of shuttle vehicles provided in the embodiment of the present invention is 3 without considering the vehicle length and considering the vehicle length;

[0053] Figure 7 A schematic diagram comparing the total completion time and the total congestion time when the number of shuttle vehicles provided in the embodiment of the present invention is 6 without considering the vehicle length and considering the vehicle length;

[0054] Figure 8 A schematic diagram comparing the total completion time and the total congestion time when the number of shuttle vehicles provided in an embodiment of the present invention is 9 without considering the vehicle length and considering the vehicle length;

[0055] Fig. 9 A schematic diagram of the effectiveness of the operation of the shuttle system provided in an embodiment of the present invention when the number of shuttles is 3 without considering the length of the shuttle and considering the length of the shuttle;

[0056] Fig.10 A schematic diagram of the effectiveness of the operation of the shuttle system provided in an embodiment of the present invention when the number of shuttles is 6 without considering the length of the shuttles and considering the length of the shuttles;

[0057] Fig.11 A schematic diagram of the effectiveness of the operation of the shuttle system when the number of shuttles provided in an embodiment of the present invention is 9 without considering the length of the shuttles and considering the length of the shuttles. DETAILED DESCRIPTION

[0058] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0059] like Figure 1 As shown, this embodiment provides a shuttle operation optimization scheduling method based on a two-level programming model, which is applied to a circular shuttle system, including:

[0060] S1. Construct a two-level programming model and use a binary search strategy and genetic algorithm to obtain shuttle operation plans under different numbers of shuttles. The two-level programming model includes an upper model and a lower model.

[0061] S2. Add the shuttle length constraint to the bi-level programming model, and use the binary search strategy and genetic algorithm to obtain the shuttle operation plan under different numbers of shuttles.

[0062] S3. Based on the shuttle operation plan under different numbers of shuttles before and after adding the shuttle length constraint, the efficiency is evaluated using the efficiency evaluation function, and the shuttle operation is optimized and scheduled based on the efficiency evaluation result.

[0063] S4. Fix the configuration of relevant static facilities, analyze the dynamic characteristics of the shuttle, and optimize the shuttle speed based on the results of the dynamic characteristics analysis.

[0064] The above method improves the operation efficiency and management capabilities of the logistics industry, especially the automated warehouses, by constructing an accurate mathematical model, using an efficient algorithm to solve the problem, and combining actual operational constraints to evaluate system efficiency and optimize scheduling.

[0065] The above steps and related features are further described in detail below:

[0066] In this embodiment S1, a two-level programming model is constructed, and the length of the shuttle is not considered. The position of the shuttle is represented by a "mass point", and the mass point of the shuttle is the geometric center of the shuttle in the length direction.

[0067] like Figure 2 As shown, each pickup (delivery) port is a regular geometric shape, and the specific location of the pickup is the center of the straight line. The inlet and outlet ports on each side are evenly distributed on the edge of the track (straight part), and the service ports are numbered in sequence according to the shuttle operation order:

[0068] Side A: Inlet Collection O A ={1,2}, the set of shipping ports D A ={11.12,13}; Side B: Purchase port set O B ={4,6,8,10}, outlet set D B ={3,5,7,9}; Starting point number: virtual pickup point, number 14.

[0069] At the same time, the shuttle operation cycle is the time from the first shuttle from the starting point to the next time it passes the starting point. Each shuttle can only transport one item at a time. The maximum number of pick-up and delivery times of the shuttle in each cycle is 2, and the number of operation cycles of each shuttle does not exceed the number of operation cycles of the first shuttle.

[0070] The two-level programming model in this embodiment solves the minimum total completion time under the condition that the operating cycle of each shuttle vehicle is set to be the same. For example: in the last cycle with a transport task, if only the first a shuttle vehicles need to be operated to complete the task of picking up and delivering all the remaining goods, the remaining b shuttle vehicles are still defined as not stationary at the starting point, but continue to run following the first a vehicle, thus ensuring that the operating cycle of each shuttle vehicle is the same. However, at this time, the b vehicles are in an empty state, which is not a reasonable phenomenon. Therefore, this drawback is overcome by introducing 0-1 decision variables in the process of model establishment.

[0071] Construct a two-level planning model, including:

[0072] Define the upper model objective function Z1 to minimize the total completion time. The decision variable of the upper model objective function is the number of cycles k.

[0073]

[0074] Among them, i, j and g are the numbers of the shipping port, the import port and the service port respectively. The service port includes: shipping port and import port; p is the shuttle car number; Whether shuttle p chooses to pick up and deliver from outlet i to inlet j in cycle k, is the time it takes for shuttle p to reach service port g in k cycles.

[0075] The constraints of the objective function of the upper model include: the range of the number of cycle times k;

[0076] The value range of the number of cycle times k is determined based on the shuttle vehicle loading and unloading rules; the picking rules include: the maximum number of picking times and the minimum number of picking times for each shuttle vehicle in a cycle.

[0077] The number of cycles k is:

[0078]

[0079] Among them, d g is the total quantity of goods at cargo port g, O is the set of cargo ports, and N is the number of shuttle vehicles.

[0080] The objective function Z1 considers the time it takes for the last vehicle to complete the pickup and delivery operation. Given a range of cycle numbers, the optimal number of operating cycle cycles K is determined to minimize the final delivery completion time. For situations where the number of cycle cycles may be too large, this implementation uses the method of multiplying the completion time with the decision variable of whether the actual pickup and delivery is completed, ensuring that the searched time is the actual final delivery time and is obtained after the lower-level optimization.

[0081] Define the lower model objective function Z2 to minimize the total completion time under a given number of cycle cycles:

[0082]

[0083] The decision variable of the objective function of the lower model is whether shuttle p chooses to pick up and deliver from outlet i to inlet j in the k cycle. The time when shuttle p arrives at service port g and the time when the shuttle p leaves the service port g

[0084] Taking into account the complexity of the shuttle's coupling in time and space, the constraints of the objective function of the lower model are respectively the shuttle constraints within the same cycle, the shuttle constraints between different cycle periods, the supply and demand balance constraints, the fixed pick-up and delivery direction constraints and the boundary condition constraints.

[0085] The shuttle constraints within the same cycle solve the pick-up and delivery selection of the shuttle in each cycle and the pick-up and delivery sequence relationship between the shuttles, ensuring the consistency between the pick-up and delivery selection of the shuttle in each cycle and the arrival and departure time at each service port, and ensuring that there is no overtaking between shuttles; the shuttle constraints between different cycle cycles solve the relationship between the end time of the previous cycle (arrival time at the starting point) and the arrival and departure time of the service port in this cycle; the supply and demand balance constraints solve the supply and demand balance problem; the fixed pick-up and delivery direction constraints solve the problem of fixed pick-up and delivery location combinations; and the boundary condition constraints are the basis for estimating the time when the shuttle arrives at the service port according to the cycle in the two-level programming model.

[0086] 1) Constraints on shuttles within the same cycle;

[0087] In each cycle, the shuttle-related constraints mainly include the selection of pick-up and delivery locations and the arrival and departure times between shuttles. The constraints to be satisfied include:

[0088] ① Limitation on the number of pick-up and delivery times in each cycle;

[0089] In order to ensure that the number of service points selected by each shuttle in each cycle is limited, a pick-up and delivery quantity constraint is constructed:

[0090]

[0091] Among them, (i,j) is the pairing combination of purchase point i and delivery point j, and OD is the pairing set of purchase point and delivery point;

[0092] This constraint ensures that each shuttle serves at least one restocking point and at most two restocking points in any operation cycle.

[0093] ② Overlapping constraints on the paths of a single shuttle within a cycle;

[0094] In order to prevent the paths from conflicting when the same shuttle serves two delivery points, a single shuttle path overlap constraint is constructed within the cycle:

[0095]

[0096] Among them, i and i1 are the numbers of the shipping ports, j and j1 are the numbers of the import ports, Whether shuttle p chooses to pick up and deliver from outlet i to inlet j in cycle k, Whether the shuttle p chooses to pick up and deliver from the shipping port i1 to the shipping port j1 in the k cycle;

[0097] ③ Constraints on the shuttle pick-up and delivery sequence within the cycle;

[0098] Since the shuttle running track is a single-line track, each shuttle is not allowed to overtake each other during operation. In order to ensure that the running order of the shuttle does not change in each cycle, the shuttle pick-up and delivery order constraints in the cycle are constructed:

[0099]

[0100] Since the influence of the shuttle length is not considered and the shuttle's running speed is fixed, the shuttle can only be jammed between service points. This constraint stipulates that for a given cycle k and service point g, the time when the preceding shuttle p leaves service point g must be less than or equal to the time when the succeeding shuttle p+1 leaves, thereby ensuring the running order between the shuttles.

[0101] ④Constraints on the arrival and departure time of service points within the cycle;

[0102] Since the shuttle needs a certain amount of loading and unloading time when serving at the incoming and outgoing points, in order to ensure the consistency between the service point selection and the arrival and departure time of the shuttle at each service point, the arrival and departure time association constraints of the service points within the cycle are constructed:

[0103]

[0104] Among them, t L / U is the time for one loading and unloading, tt(j,j+1) is the pure running time from the shipping port j to the service point g;

[0105] The first two sets of constraints ensure that the time when the p-th shuttle leaves the i-th and j-th service points in any cycle k is greater than or equal to the sum of the time when the shuttle arrives at the service point and the required loading and unloading service time. In addition, the last two sets of constraints ensure the time when the shuttle leaves the previous service point and arrives at the subsequent service point in any cycle, ensuring that a continuous shuttle space-time path is generated for each shuttle.

[0106] 2) Shuttle constraints between different cycle periods;

[0107] In order to ensure the association between the end time of the previous cycle (arrival at the starting point) and the time between the service ports of this cycle, for two consecutive cycles, the shuttle connection constraints between cycles are constructed:

[0108]

[0109] 3) Supply and demand balance constraints;

[0110] In order to ensure that all goods can be picked up and delivered, and to ensure the matching relationship between the pick-up point and the delivery point, the supply and demand balance mainly considers the satisfaction relationship between the demand and supply side of the transportation problem. According to the requirements of the question, the supply and demand balance constraints in both directions are satisfied:

[0111] Cargo balance of B→A:

[0112]

[0113] Cargo balance from A to B:

[0114]

[0115] 4) Fixed pick-up and delivery direction constraints:

[0116] The goods from side A to side B must meet the constraints of fixed pick-up and delivery port matching. At the same time, there are two directions of pick-up and delivery (pick-up and delivery on opposite sides), and there is no pick-up and delivery of goods on the same side. Therefore, the following constraints exist:

[0117] A→B fixed pick-up and delivery constraints:

[0118]

[0119] A→B pickup direction constraints:

[0120]

[0121] B→A pickup direction constraint:

[0122]

[0123] 5) Boundary condition constraints:

[0124] The boundary conditions are set to provide a reference time standard for calculating the arrival and departure times of each service point. Taking the starting point as the initial timing point, and setting the arrival and departure times of the starting point to 0, we have:

[0125]

[0126] The above lower-level model aims to minimize the time to complete the delivery task under a given number of operating cycles. It is a nonlinear mathematical programming model with pick-up and delivery selection and arrival and departure time decisions as variables, and establishes a constraint framework for the cyclical operation of the shuttle system from the time and space dimensions.

[0127] To sum up, the entire two-level programming model established is:

[0128]

[0129] The two-level programming model is a nested two-level programming model. The upper-level objective function generates the number of cycles that constrain the lower-level decision-making, and the lower-level optimizes the operation of the shuttle in the shuttle system from the time and space dimensions under a given cycle, and passes the optimal result to the upper-level model. The upper-level model updates the number of cycles based on the solution of the lower-level model, and continues to pass it to the lower-level model, and cycles in sequence until the objective function value of the upper-level model of the lower-level model reaches a balanced solution, that is, the solutions of the upper and lower-level objective functions are equal (theoretically, or close enough), and no longer change.

[0130] Based on the above two-level programming model, the shuttle operation schemes with different numbers of shuttles are obtained by using a binary search strategy and a genetic algorithm, including:

[0131] S11, through the upper model, using a search strategy based on dichotomy, determine the number of cycle times under any number of shuttles;

[0132] S12, based on the number of cycle times, using the lower model, using a genetic algorithm to determine the pick-up and delivery tasks of each shuttle vehicle with the minimum total completion time;

[0133] S13, feeding back the pick-up and delivery tasks of each shuttle vehicle under the minimum total completion time to the upper model, determining the time when each shuttle vehicle arrives at and leaves the service port, and obtaining the shuttle vehicle operation plan;

[0134] S14, determine whether the maximum number of iterations has been reached; if so, proceed to S15;

[0135] Otherwise, based on the shuttle operation plan, a search strategy based on dichotomy is adopted to determine the number of cycle times, and then return to S12;

[0136] S15, repeating the above S11 to S14 until the shuttle operation plans based on different cycle times for all shuttle numbers are output.

[0137] In this embodiment, the parameter settings of the shuttle system are specifically as follows:

[0138] Track length (straight line) 94 meters, track length (curve) 6 meters, shuttle speed 1.5 meters / second, shuttle length 1.3 meters, number of inlets (side A) 2, number of inlets (side B) 4, number of outlets (side A) 3, number of outlets (side B) 4, loading and unloading time 10 seconds.

[0139] like Figure 3-Figure 5 As shown in the figure, the shuttle operation schemes when the number of shuttles is 3, 6, and 9 are solved; and the minimum total completion time and congestion time under the shuttle operation scheme are obtained. When the number of shuttles is 3, the minimum number of cycles is 131, the minimum total completion time is 33274 seconds, and the total congestion time of the shuttle is 7827 seconds; when the number of shuttles is 6, the minimum number of cycles is 52, the minimum total completion time is 16328 seconds, and the total congestion time of the shuttle is 6240 seconds; when the number of shuttles is 9: the minimum number of cycles is 35, the minimum total completion time is 13310 seconds, and the total congestion time of the shuttle is 6520 seconds.

[0140] In S2, the upper model is the same as the upper model of the two-level programming model in S1 above, and the upper decision is still to determine the number of shuttle operation cycles. For the lower model, the decision variables are still to determine the selection scheme of each shuttle service port and the arrival and departure time at each service port under the premise of a given number of shuttle operation cycles. Due to the further consideration of the influence of the length of the shuttle, with the midpoint of the shuttle as the center, the distance between each shuttle needs to be at least the length of one shuttle to ensure the safety of the shuttle operation.

[0141] In addition, due to the balanced running speed of the shuttles, it is only necessary to ensure that the time when the subsequent shuttle arrives at the service point and the time when the previous shuttle leaves the service point maintain a necessary time interval. At the same time, due to the influence of the length of the shuttle, it is necessary not only to limit the time interval between it and the adjacent subsequent shuttle to arrive at the service point, but also to limit the time when the shuttle arrives at the service point with other subsequent shuttles to avoid conflicts between shuttles.

[0142] Therefore, the shuttle length constraint is constructed as:

[0143]

[0144] Where p and n are the shuttle numbers, and p>n, L is the shuttle length, and v is the shuttle speed.

[0145] This constraint ensures that the time it takes for a subsequent shuttle to arrive at a service point is greater than or equal to the sum of the time it takes for the previous shuttle to leave the service point and the necessary interval time. The necessary interval time is the minimum interval between shuttles divided by the speed of the shuttle. Specifically, for the next-to-next shuttle, the distance is the distance between the center points of the two shuttles, that is, the length of one shuttle. For the (pn)th shuttle in the subsequent sequence, that is, the pth car, the safe interval between it and the car is (pn) shuttle lengths.

[0146] In addition, in terms of the service port numbering method, given the number of operating cycles, the service ports can be numbered in sequence according to the operating cycle and the operating direction. For example, if the service point in the first cycle is numbered 3, then in the second cycle, the service port number becomes 3 + the number of service ports, and the inlet and outlet ports are also defined using the set representation method. This method can clearly represent the operating sequence of the shuttle during the entire operation period.

[0147] After constructing the shuttle length constraint, the binary search strategy and genetic algorithm in S1 are used to obtain the shuttle operation plan under different numbers of shuttles. The shuttle operation plan when the number of shuttles is 3, 6, and 9 is solved; and the minimum total completion time and congestion time under the shuttle operation plan are obtained.

[0148] like Figure 6-Figure 8 As shown, the total completion time and total congestion time are compared when the total number of shuttle vehicles is 3, 6, and 9, regardless of the vehicle length, and with the vehicle length taken into account:

[0149] When the length of the vehicle body is taken into consideration, N=3, and the minimum cycle period K=131: the total completion time and total congestion time considering the length of the vehicle are significantly greater than the corresponding total completion time and congestion time without considering the length of the vehicle, and the difference between the two is 393s. When the length of the vehicle body is taken into consideration, N=6, and the minimum cycle period K=52, the total completion time and total congestion time considering the length of the vehicle are significantly greater than the corresponding total completion time and congestion time without considering the length of the vehicle, and the difference between the two is 624s. When the length of the vehicle body is taken into consideration, N=9, and the minimum cycle period K=35, the total completion time and total congestion time considering the length of the vehicle are significantly greater than the corresponding total completion time and congestion time without considering the length of the vehicle, and the difference between the two is 945s.

[0150] The above S1-S2 integrates the bi-level programming model, the binary search strategy and the genetic algorithm, and cleverly connects the order constraints between shuttles by dividing the operation cycle. This solution can not only calibrate the order between shuttles by cycle identification, but also decompose the entire scheduling process into a periodic decision-making process. Adopting the idea of ​​rolling optimization, the decision of the shuttle in the system is optimized step by step according to the cycle, and each cycle is connected through the time connection relationship between the cycles, rolling approaching the global optimal solution of the optimization problem.

[0151] In this embodiment S3, based on the technical solutions in S1 and S2 above, the efficiency evaluation index λ of the circular shuttle vehicle in system operation related to the total completion time and the total congestion time is used to evaluate the efficiency:

[0152]

[0153] Among them, λ is the efficiency evaluation index.

[0154] like Figure 9-11 As shown in the figure, when the number of vehicles is constant, as the cycle K increases, the λ value gradually increases. Among them, when the number of shuttle vehicles in operation is 3: at the minimum cycle (K = 131), λ is 75.58%; at the maximum cycle (K = 207), λ is 99.96%. When the number of shuttle vehicles in operation is 6: at the minimum cycle (K = 52), λ is 59.51%; at the maximum cycle (K = 104), λ is 95.32%. When the number of shuttle vehicles in operation is 9: at the minimum cycle (K = 35), λ is 47.63%; at the maximum cycle (K = 70), λ is 75.82%. Obviously, the operating efficiency of the system is not proportional to the number of shuttle vehicles.

[0155] Based on all the technical solutions under the above-mentioned different numbers of shuttle vehicles in operation and different cycle times, when the number of shuttle vehicles in operation is 3 and the maximum cycle is K=207, the system reaches an operating efficiency of 99.96%. Under this technical solution, the operation of the circular shuttle system is close to optimal, which can effectively reduce waiting time and energy consumption and improve production efficiency.

[0156] In this embodiment S4, the relevant static facilities are fixed, the dynamic characteristics of the shuttle are analyzed, and the speed of the shuttle is optimized based on the results of the dynamic characteristics analysis.

[0157] Under the condition that the relevant static facility configuration (the shuttle body length, the number and relative position of the inlet and outlet ports, the length of the track, etc.) remains unchanged, the influence of the shuttle's dynamic characteristics on the efficiency of the shuttle pick-up and delivery system is analyzed in detail.

[0158] The speed of the shuttle is set to 1 m / s, 1.5 m / s, and 2 m / s respectively, and the operation status of the shuttle in the system and its impact on the task completion time are calculated. The data analysis results show that the working efficiency of the shuttle is an important factor restricting the transportation capacity of the system. When the number of cycles is small, the speed becomes a factor affecting the efficiency of the system. However, as the number of cycles increases, the impact of speed on completion time and congestion time becomes weaker and weaker, and the bottleneck restricting the system capacity becomes the static facility resource configuration of the system. To systematically optimize the operating efficiency of the system, it is necessary to control the coupling relationship between dynamic carriers and static facility configuration from the perspective of the overall system.

[0159] The technical solution of this embodiment integrates a two-level programming model, a binary search strategy and a genetic algorithm, and proposes a comprehensive and efficient optimization scheduling strategy for the circular shuttle system.

[0160] Through in-depth customization and dynamic adjustment of the shuttle operation plan, not only the system operation efficiency and resource utilization are improved, but also the safety and stability of the operation are guaranteed. Through refined constraint setting and iterative optimization process, the solution can be flexibly adapted in complex operating environments to achieve the optimal configuration of the number of shuttles, operation cycle and task scheduling. The integrated dynamic characteristic analysis and speed optimization further tap the system potential and maximize the overall throughput and economic benefits.

[0161] In this specification, each embodiment is described in a progressive manner, and each embodiment focuses on the differences from other embodiments. The same or similar parts between the embodiments can be referred to each other. For the system disclosed in the embodiment, since it corresponds to the method disclosed in the embodiment, the description is relatively simple, and the relevant parts can be referred to the method part.

[0162] The above description of the disclosed embodiments enables one skilled in the art to implement or use the present invention. Various modifications to these embodiments will be apparent to one skilled in the art, and the general principles defined herein may be implemented in other embodiments without departing from the spirit or scope of the present invention. Therefore, the present invention will not be limited to the embodiments shown herein, but rather to the widest scope consistent with the principles and novel features disclosed herein.

Claims

1. A shuttle operation optimization scheduling method based on a two-level programming model, applied to a circular shuttle system, characterized in that: include: S1. Construct a two-level programming model and use a binary search strategy and genetic algorithm to obtain shuttle operation plans under different numbers of shuttles. The two-layer planning model includes: an upper layer model and a lower layer model; S2, adding a shuttle length constraint to the bi-level programming model, and using the dichotomy-based search strategy and genetic algorithm to obtain shuttle operation plans under different numbers of shuttles; S3. Based on the shuttle operation plan under different numbers of shuttles before and after adding the shuttle length constraint, the efficiency is evaluated using the efficiency evaluation function, and the shuttle operation is optimized and scheduled based on the efficiency evaluation result.

2. According to claim 1, a shuttle operation optimization scheduling method based on a two-level programming model is characterized in that: Also includes: S4. Fix the configuration of relevant static facilities, analyze the dynamic characteristics of the shuttle, and optimize the shuttle speed based on the results of the dynamic characteristics analysis.

3. The shuttle operation optimization scheduling method based on the two-level programming model according to claim 1 is characterized in that: In S1, a two-level planning model is constructed, including: defining the upper-level model objective function Z1 to minimize the total completion time: Among them, i, j and g are the numbers of the shipping port, the import port and the service port respectively, and the service port includes: the shipping port and the import port; p is the shuttle car number; Whether shuttle p chooses to pick up and deliver from outlet i to inlet j in cycle k, is the time it takes for shuttle p to reach service port g in the k cycle; The decision variable of the objective function of the upper model is the number of cycle times k.

4. The method for optimizing shuttle operation based on a two-level programming model according to claim 3 is characterized in that: The cycle period is the time from the first shuttle vehicle passing through the starting point to the next time it passes through the starting point.

5. The method for optimizing shuttle operation based on a two-level programming model according to claim 3 is characterized in that: The constraints of the objective function of the upper model include: the value range of the number of cycle times k; The value range of the cycle number k is determined based on the shuttle vehicle loading and unloading rules; the picking rules include: the maximum number of picking times and the minimum number of picking times for each shuttle vehicle in a cycle.

6. The method for optimizing shuttle operation based on a two-level programming model according to claim 1 is characterized in that: In S1, a two-level planning model is constructed, including: defining the lower-level model objective function Z2 to minimize the total completion time under a given number of cycle cycles: The decision variable of the objective function of the lower model is whether the shuttle p chooses to pick up and deliver from the shipping port i to the shipping port j in the k cycle period. The time when shuttle p arrives at service port g and the time when the shuttle p leaves the service port g 7. The method for optimizing shuttle operation based on a two-level programming model according to claim 6 is characterized in that: The constraints of the objective function of the lower model include: Shuttle constraints within the same cycle, shuttle constraints between different cycle periods, supply and demand balance constraints, fixed pick-up and delivery direction constraints and boundary condition constraints.

8. The method for optimizing shuttle operation based on a two-level programming model according to claim 1 is characterized in that: In S1, a search strategy based on dichotomy and a genetic algorithm are used to obtain shuttle operation schemes under different numbers of shuttles, including: S11, through the upper model, using a search strategy based on dichotomy, determine the number of cycle times under any number of shuttles; S12, based on the number of cycle times, using the lower model, using a genetic algorithm to determine the pick-up and delivery tasks of each shuttle vehicle with the minimum total completion time; S13, feeding back the pick-up and delivery tasks of each shuttle vehicle under the minimum total completion time to the upper model, determining the time when each shuttle vehicle arrives at and leaves the service port, and obtaining the shuttle vehicle operation plan; S14, determine whether the maximum number of iterations has been reached; if so, proceed to S15; Otherwise, based on the shuttle operation plan, the binary search strategy is adopted to determine the number of cycle times, and the process returns to S12; S15, repeating the above S11 to S14 until the shuttle operation plans based on different cycle times for all shuttle numbers are output.

9. The method for optimizing shuttle operation based on a two-level programming model according to claim 1 is characterized in that: In S2, the shuttle length constraint is: Where p and n are the shuttle numbers, and p>n, L is the shuttle length, and v is the shuttle speed.

10. The method for optimizing shuttle operation based on a two-level programming model according to claim 1, characterized in that: In S3, the efficiency evaluation function is: Among them, λ is the efficiency evaluation index.