[Objectives]This study was conducted to achieve rapid and accurate detection of protein content in rice with a particle size of 1.0 mm.[Methods]A multi-model fusion strategy was proposed on the basis of Stacking ensem...[Objectives]This study was conducted to achieve rapid and accurate detection of protein content in rice with a particle size of 1.0 mm.[Methods]A multi-model fusion strategy was proposed on the basis of Stacking ensemble learning.A base learner pool was constructed,containing Partial Least Squares(PLS),Support Vector Machine(SVM),Deep Extreme Learning Machine(DELM),Random Forest(RF),Gradient Boosting Decision Tree(GBDT),and Multilayer Perceptron(MLP).PLS,DELM,and Linear Regression(LR)were used as meta-learner candidates.Employing integer coding technology,systematic dynamic combinations of base learners and meta-learners were generated,resulting in a total of 40 non-repetitive fusion models.The optimal combination was selected through a comprehensive evaluation based on multiple assessment indicators.[Results]The combination"PLS-DELM-MLP-LR"(code 1367)achieved coefficients of determination of 0.9732 and 0.9780 on the validation set and independent test set,respectively,with relative root mean square errors of 2.35%and 2.36%,and residual predictive deviations of 6.1075 and 6.7479,respectively.[Conclusions]The Stacking fusion model significantly enhances the predictive accuracy and robustness of spectral quantitative analysis,providing an efficient and feasible solution for modeling complex agricultural product spectral data.展开更多
To conduct marine surveys,multiple unmanned surface vessels(Multi-USV)with different capabilities perform collaborative mapping in multiple designated areas.This paper proposes a task allocation algorithm based on int...To conduct marine surveys,multiple unmanned surface vessels(Multi-USV)with different capabilities perform collaborative mapping in multiple designated areas.This paper proposes a task allocation algorithm based on integer linear programming(ILP)with flow balance constraints,ensuring the fair and efficient distribution of sub-areas among USVs and maintaining strong connectivity of assigned regions.In the established gridmap,a search-based path planning algorithm is performed on the sub-areas according to the allocation scheme.It uses the greedy algorithm and the A*algorithm to achieve complete coverage of the barrier-free area and obtain an efficient trajectory of each USV.The greedy algorithm enables fast local traversal of unvisited grids,while the A*algorithm ensures navigation to escape from deadlock areas and maintains global path continuity.The comparison of task allocation results proves that the task allocation algorithm based on ILP improves the mapping efficiency and task distribution fairness.The proposed allocation method and result analysis provide a certain reference for the practical application ofMulti-USV to perform survey tasks collaboratively.展开更多
The flexible job shop scheduling problem(FJSP)is commonly encountered in practical manufacturing environments.A product is typically built by assembling multiple jobs during actual manufacturing.AGVs are normally used...The flexible job shop scheduling problem(FJSP)is commonly encountered in practical manufacturing environments.A product is typically built by assembling multiple jobs during actual manufacturing.AGVs are normally used to transport the jobs from the processing shop to the assembly shop,where they are assembled.Therefore,studying the integrated scheduling problem with its processing,transportation,and assembly stages is extremely beneficial and significant.This research studies the three-stage flexible job shop scheduling problem with assembly and AGV transportation(FJSP-T-A),which includes processing jobs,transporting them via AGVs,and assembling them.A mixed integer linear programming(MILP)model is established to obtain optimal solutions.As the MILP model is challenging for solving large-scale problems,a novel co-evolutionary algorithm(NCEA)with two different decoding methods is proposed.In NCEA,a restart operation is developed to improve the diversity of the population,and a multiple crossover strategy is designed to improve the quality of individuals.The validity of the MILP model is proven by analyzing its complexity.The effectiveness of the restart operator,multiple crossovers,and the proposed algorithm is demonstrated by calculating and analyzing the RPI values of each algorithm's results within the time limit and performing a paired t-test on the average values of each algorithm at the 95%confidence level.This paper studies FJSP-T-A by minimizing the makespan for the first time,and presents a MILP model and an NCEA with two different decoding methods.展开更多
The rapid evolution of unmanned aerial vehicle(UAV)technology and autonomous capabilities has positioned UAV as promising last-mile delivery means.Vehicle and onboard UAV collaborative delivery is introduced as a nove...The rapid evolution of unmanned aerial vehicle(UAV)technology and autonomous capabilities has positioned UAV as promising last-mile delivery means.Vehicle and onboard UAV collaborative delivery is introduced as a novel delivery mode.Spatiotemporal collaboration,along with energy consumption with payload and wind conditions play important roles in delivery route planning.This paper introduces the traveling salesman problem with time window and onboard UAV(TSPTWOUAV)and emphasizes the consideration of real-world scenarios,focusing on time collaboration and energy consumption with wind and payload.To address this,a mixed integer linear programming(MILP)model is formulated to minimize the energy consumption costs of vehicle and UAV.Furthermore,an adaptive large neighborhood search(ALNS)algorithm is applied to identify high-quality solutions efficiently.The effectiveness of the proposed model and algorithm is validated through numerical tests on real geographic instances and sensitivity analysis of key parameters is conducted.展开更多
Toric patch is a kind of rational multisided patch,which is associated with a finite integer lattice points set A.A set of weights is defined which depend on a parameter according to regular decomposition of A.When al...Toric patch is a kind of rational multisided patch,which is associated with a finite integer lattice points set A.A set of weights is defined which depend on a parameter according to regular decomposition of A.When all weights of the patch tend to infinity,we obtain the limiting form of toric patch which is called its regular control surface.The diferent weights may induce the diferent regular control surfaces of the same toric patch.It prompts us to consider that how many regular control surfaces of a toric patch.In this paper,we study the regular decompositions of A by using integer programming method firstly,and then provide the relationship between all regular decompositions of A and corresponding state polytope.Moreover,we present that the number of regular control surfaces of a toric patch associated with A is equal to the number of regular decompositions of A.An algorithm to calculate the number of regular control surfaces of toric patch is provided.The algorithm also presents a method to construct all of the regular control surfaces of a toric patch.At last,the application of proposed result in shape deformation is demonstrated by several examples.展开更多
This study proposes a novel approach to optimizing individual work schedules for book digitization using mixed-integer programming (MIP). By leveraging the power of MIP solvers, we aimed to minimize the overall digiti...This study proposes a novel approach to optimizing individual work schedules for book digitization using mixed-integer programming (MIP). By leveraging the power of MIP solvers, we aimed to minimize the overall digitization time while considering various constraints and process dependencies. The book digitization process involves three key steps: cutting, scanning, and binding. Each step has specific requirements and limitations such as the number of pages that can be processed simultaneously and potential bottlenecks. To address these complexities, we formulate the problem as a one-machine job shop scheduling problem with additional constraints to capture the unique characteristics of book digitization. We conducted a series of experiments to evaluate the performance of our proposed approach. By comparing the optimized schedules with the baseline approach, we demonstrated significant reductions in the overall processing time. In addition, we analyzed the impact of different weighting schemes on the optimization results, highlighting the importance of identifying and prioritizing critical processes. Our findings suggest that MIP-based optimization can be a valuable tool for improving the efficiency of individual work schedules, even in seemingly simple tasks, such as book digitization. By carefully considering specific constraints and objectives, we can save time and leverage resources by carefully considering specific constraints and objectives.展开更多
Satellite Component Layout Optimization(SCLO) is crucial in satellite system design.This paper proposes a novel Satellite Three-Dimensional Component Assignment and Layout Optimization(3D-SCALO) problem tailored to en...Satellite Component Layout Optimization(SCLO) is crucial in satellite system design.This paper proposes a novel Satellite Three-Dimensional Component Assignment and Layout Optimization(3D-SCALO) problem tailored to engineering requirements, aiming to optimize satellite heat dissipation while considering constraints on static stability, 3D geometric relationships between components, and special component positions. The 3D-SCALO problem is a challenging bilevel combinatorial optimization task, involving the optimization of discrete component assignment variables in the outer layer and continuous component position variables in the inner layer,with both influencing each other. To address this issue, first, a Mixed Integer Programming(MIP) model is proposed, which reformulates the original bilevel problem into a single-level optimization problem, enabling the exploration of a more comprehensive optimization space while avoiding iterative nested optimization. Then, to model the 3D geometric relationships between components within the MIP framework, a linearized 3D Phi-function method is proposed, which handles non-overlapping and safety distance constraints between cuboid components in an explicit and effective way. Subsequently, the Finite-Rectangle Method(FRM) is proposed to manage 3D geometric constraints for complex-shaped components by approximating them with a finite set of cuboids, extending the applicability of the geometric modeling approach. Finally, the feasibility and effectiveness of the proposed MIP model are demonstrated through two numerical examples"and a real-world engineering case, which confirms its suitability for complex-shaped components and real engineering applications.展开更多
International freedom of the air(traffic rights)is a key resource for airlines to carry out international air transport business.An efficient and reasonable traffic right resource allocation within a country between a...International freedom of the air(traffic rights)is a key resource for airlines to carry out international air transport business.An efficient and reasonable traffic right resource allocation within a country between airlines can affect the quality of a country’s participation in international air transport.In this paper,a multi-objective mixed-integer programming model for traffic rights resource allocation is developed to minimize passenger travel mileages and maximize the number of traffic rights resources allocated to hub airports and competitive carriers.A hybrid heuristic algorithm combining the genetic algorithm and the variable neighborhood search is devised to solve the model.The results show that the optimal allocation scheme aligns with the principle of fairness,indicating that the proposed model can play a certain guiding role in and provide an innovative perspective on traffic rights resource allocation in various countries.展开更多
Non-Abelian topological insulators are characterized by matrix-valued,non-commuting topological charges with regard to more than one energy gap.Their descriptions go beyond the conventional topological band theory,in ...Non-Abelian topological insulators are characterized by matrix-valued,non-commuting topological charges with regard to more than one energy gap.Their descriptions go beyond the conventional topological band theory,in which an additive integer like the winding or Chern number is endowed separately with each(degenerate group of)energy band(s).In this work,we reveal that Floquet(time-periodic)driving could not only enrich the topology and phase transitions of non-Abelian topological matter,but also induce bulk-edge correspondence unique to nonequilibrium setups.Using a one-dimensional,three-band model as an illustrative example,we demonstrate that Floquet driving could reshuffle the phase diagram of the non-driven system,yielding both gapped and gapless Floquet band structures with non-Abelian topological charges.Moreover,by dynamically tuning the anomalous Floquet π-quasienergy gap,non-Abelian topological transitions inaccessible to static systems could arise,leading to much more complicated relations between non-Abelian topological charges and Floquet edge states.These discoveries put forth periodic driving as a powerful scheme of engineering non-Abelian topological phases and incubating unique non-Abelian band topology beyond equilibrium.展开更多
As commercial drone delivery becomes increasingly popular,the extension of the vehicle routing problem with drones(VRPD)is emerging as an optimization problem of inter-ests.This paper studies a variant of VRPD in mult...As commercial drone delivery becomes increasingly popular,the extension of the vehicle routing problem with drones(VRPD)is emerging as an optimization problem of inter-ests.This paper studies a variant of VRPD in multi-trip and multi-drop(VRP-mmD).The problem aims at making schedules for the trucks and drones such that the total travel time is minimized.This paper formulate the problem with a mixed integer program-ming model and propose a two-phase algorithm,i.e.,a parallel route construction heuristic(PRCH)for the first phase and an adaptive neighbor searching heuristic(ANSH)for the second phase.The PRCH generates an initial solution by con-currently assigning as many nodes as possible to the truck–drone pair to progressively reduce the waiting time at the rendezvous node in the first phase.Then the ANSH improves the initial solution by adaptively exploring the neighborhoods in the second phase.Numerical tests on some benchmark data are conducted to verify the performance of the algorithm.The results show that the proposed algorithm can found better solu-tions than some state-of-the-art methods for all instances.More-over,an extensive analysis highlights the stability of the pro-posed algorithm.展开更多
An improved method based on the Tikhonov regularization principle and the precisely known reference station coordinate is proposed to design the regularized matrix. The ill-conditioning of the normal matrix can be imp...An improved method based on the Tikhonov regularization principle and the precisely known reference station coordinate is proposed to design the regularized matrix. The ill-conditioning of the normal matrix can be improved by the regularized matrix. The relative floating ambiguity can be computed only by using the data of several epochs. Combined with the LAMBDA method, the new approach can correctly and quickly fix the integer ambiguity and the success rate is 100% in experiments. Through using measured data sets from four mediumlong baselines, the new method can obtain exact ambiguities only by the Ll-frequency data of three epochs. Compared with the existing methods, the improved method can solve the ambiguities of the medium-long baseline GPS network RTK only using L1-frequency GPS data.展开更多
Based on the analysis to the random sear ch algorithm of LUUS, a modified random directed integer search algorithm (MRDI SA) is given for first time. And a practical example is given to show that the adva ntage of th...Based on the analysis to the random sear ch algorithm of LUUS, a modified random directed integer search algorithm (MRDI SA) is given for first time. And a practical example is given to show that the adva ntage of this kind of algorithm is the reliability can’t be infuenced by the ini tial value X (0) and the start search domain R (0) . Besides, i t can be applied to solve the higher dimensional constrained nonlinear integer p rogramming problem.展开更多
In order to increase the hardware utilization and minimize the chip area a multi-transform coding architecture which includes 4 ×4 forward integer transform 4 ×4 inverse integer transform 4 ×4 Hadamard ...In order to increase the hardware utilization and minimize the chip area a multi-transform coding architecture which includes 4 ×4 forward integer transform 4 ×4 inverse integer transform 4 ×4 Hadamard transform and 2 ×2 Hadamard transform is proposed. By simplifying these transforms and exploring their similarities the proposed design merges the architectures processing individual transforms into a high-performance multi-transform coding architecture.Using a semiconductor manufacturing international corporation SMIC 0.18 μm complementary metal oxide semiconductor CMOS technology the proposed architecture achieves the maximum operating clock frequency of 200 MHz and the throughput rate of 800 ×106 pixel/s with the hardware cost of 3 704 gates.The results demonstrate that the data throughput rate per unit area DTUA of this design is at least 40.28%higher than that of the reference design.This design can meet the requirements of real-time decoding digital cinema video 4 096 ×2 048@30 Hz at 62.9 MHz which helps to reduce the power consumption.展开更多
文摘[Objectives]This study was conducted to achieve rapid and accurate detection of protein content in rice with a particle size of 1.0 mm.[Methods]A multi-model fusion strategy was proposed on the basis of Stacking ensemble learning.A base learner pool was constructed,containing Partial Least Squares(PLS),Support Vector Machine(SVM),Deep Extreme Learning Machine(DELM),Random Forest(RF),Gradient Boosting Decision Tree(GBDT),and Multilayer Perceptron(MLP).PLS,DELM,and Linear Regression(LR)were used as meta-learner candidates.Employing integer coding technology,systematic dynamic combinations of base learners and meta-learners were generated,resulting in a total of 40 non-repetitive fusion models.The optimal combination was selected through a comprehensive evaluation based on multiple assessment indicators.[Results]The combination"PLS-DELM-MLP-LR"(code 1367)achieved coefficients of determination of 0.9732 and 0.9780 on the validation set and independent test set,respectively,with relative root mean square errors of 2.35%and 2.36%,and residual predictive deviations of 6.1075 and 6.7479,respectively.[Conclusions]The Stacking fusion model significantly enhances the predictive accuracy and robustness of spectral quantitative analysis,providing an efficient and feasible solution for modeling complex agricultural product spectral data.
基金supported in part by the International Science and Technology Project of Guangzhou Development District under Grant 2023GH08the Science and Technology Development Fund,MSAR,under Grants 0029/2022/AGJ and 0029/2023/RIA1the Program of Guangdong under Grant 2023A0505020003.
文摘To conduct marine surveys,multiple unmanned surface vessels(Multi-USV)with different capabilities perform collaborative mapping in multiple designated areas.This paper proposes a task allocation algorithm based on integer linear programming(ILP)with flow balance constraints,ensuring the fair and efficient distribution of sub-areas among USVs and maintaining strong connectivity of assigned regions.In the established gridmap,a search-based path planning algorithm is performed on the sub-areas according to the allocation scheme.It uses the greedy algorithm and the A*algorithm to achieve complete coverage of the barrier-free area and obtain an efficient trajectory of each USV.The greedy algorithm enables fast local traversal of unvisited grids,while the A*algorithm ensures navigation to escape from deadlock areas and maintains global path continuity.The comparison of task allocation results proves that the task allocation algorithm based on ILP improves the mapping efficiency and task distribution fairness.The proposed allocation method and result analysis provide a certain reference for the practical application ofMulti-USV to perform survey tasks collaboratively.
基金Supported by National Natural Science Foundation of China(Grant Nos.52205529 and 62303204)the Youth Innovation Team Program of Shandong Higher Education Institution(Grant No.2023KJ206)the Guangyue Youth Scholar Innovation Talent Program support received from Liaocheng University(Grant No.LCUGYTD2022-03)。
文摘The flexible job shop scheduling problem(FJSP)is commonly encountered in practical manufacturing environments.A product is typically built by assembling multiple jobs during actual manufacturing.AGVs are normally used to transport the jobs from the processing shop to the assembly shop,where they are assembled.Therefore,studying the integrated scheduling problem with its processing,transportation,and assembly stages is extremely beneficial and significant.This research studies the three-stage flexible job shop scheduling problem with assembly and AGV transportation(FJSP-T-A),which includes processing jobs,transporting them via AGVs,and assembling them.A mixed integer linear programming(MILP)model is established to obtain optimal solutions.As the MILP model is challenging for solving large-scale problems,a novel co-evolutionary algorithm(NCEA)with two different decoding methods is proposed.In NCEA,a restart operation is developed to improve the diversity of the population,and a multiple crossover strategy is designed to improve the quality of individuals.The validity of the MILP model is proven by analyzing its complexity.The effectiveness of the restart operator,multiple crossovers,and the proposed algorithm is demonstrated by calculating and analyzing the RPI values of each algorithm's results within the time limit and performing a paired t-test on the average values of each algorithm at the 95%confidence level.This paper studies FJSP-T-A by minimizing the makespan for the first time,and presents a MILP model and an NCEA with two different decoding methods.
基金Fundamental Research Funds for the Central Universities(2024JBZX038)National Natural Science F oundation of China(62076023)。
文摘The rapid evolution of unmanned aerial vehicle(UAV)technology and autonomous capabilities has positioned UAV as promising last-mile delivery means.Vehicle and onboard UAV collaborative delivery is introduced as a novel delivery mode.Spatiotemporal collaboration,along with energy consumption with payload and wind conditions play important roles in delivery route planning.This paper introduces the traveling salesman problem with time window and onboard UAV(TSPTWOUAV)and emphasizes the consideration of real-world scenarios,focusing on time collaboration and energy consumption with wind and payload.To address this,a mixed integer linear programming(MILP)model is formulated to minimize the energy consumption costs of vehicle and UAV.Furthermore,an adaptive large neighborhood search(ALNS)algorithm is applied to identify high-quality solutions efficiently.The effectiveness of the proposed model and algorithm is validated through numerical tests on real geographic instances and sensitivity analysis of key parameters is conducted.
基金Supported by the National Natural Science Foundation of China(12001327,12071057)。
文摘Toric patch is a kind of rational multisided patch,which is associated with a finite integer lattice points set A.A set of weights is defined which depend on a parameter according to regular decomposition of A.When all weights of the patch tend to infinity,we obtain the limiting form of toric patch which is called its regular control surface.The diferent weights may induce the diferent regular control surfaces of the same toric patch.It prompts us to consider that how many regular control surfaces of a toric patch.In this paper,we study the regular decompositions of A by using integer programming method firstly,and then provide the relationship between all regular decompositions of A and corresponding state polytope.Moreover,we present that the number of regular control surfaces of a toric patch associated with A is equal to the number of regular decompositions of A.An algorithm to calculate the number of regular control surfaces of toric patch is provided.The algorithm also presents a method to construct all of the regular control surfaces of a toric patch.At last,the application of proposed result in shape deformation is demonstrated by several examples.
文摘This study proposes a novel approach to optimizing individual work schedules for book digitization using mixed-integer programming (MIP). By leveraging the power of MIP solvers, we aimed to minimize the overall digitization time while considering various constraints and process dependencies. The book digitization process involves three key steps: cutting, scanning, and binding. Each step has specific requirements and limitations such as the number of pages that can be processed simultaneously and potential bottlenecks. To address these complexities, we formulate the problem as a one-machine job shop scheduling problem with additional constraints to capture the unique characteristics of book digitization. We conducted a series of experiments to evaluate the performance of our proposed approach. By comparing the optimized schedules with the baseline approach, we demonstrated significant reductions in the overall processing time. In addition, we analyzed the impact of different weighting schemes on the optimization results, highlighting the importance of identifying and prioritizing critical processes. Our findings suggest that MIP-based optimization can be a valuable tool for improving the efficiency of individual work schedules, even in seemingly simple tasks, such as book digitization. By carefully considering specific constraints and objectives, we can save time and leverage resources by carefully considering specific constraints and objectives.
基金supported by the National Natural Science Foundation of China(No.92371206)the Postgraduate Scientific Research Innovation Project of Hunan Province,China(No.CX2023063).
文摘Satellite Component Layout Optimization(SCLO) is crucial in satellite system design.This paper proposes a novel Satellite Three-Dimensional Component Assignment and Layout Optimization(3D-SCALO) problem tailored to engineering requirements, aiming to optimize satellite heat dissipation while considering constraints on static stability, 3D geometric relationships between components, and special component positions. The 3D-SCALO problem is a challenging bilevel combinatorial optimization task, involving the optimization of discrete component assignment variables in the outer layer and continuous component position variables in the inner layer,with both influencing each other. To address this issue, first, a Mixed Integer Programming(MIP) model is proposed, which reformulates the original bilevel problem into a single-level optimization problem, enabling the exploration of a more comprehensive optimization space while avoiding iterative nested optimization. Then, to model the 3D geometric relationships between components within the MIP framework, a linearized 3D Phi-function method is proposed, which handles non-overlapping and safety distance constraints between cuboid components in an explicit and effective way. Subsequently, the Finite-Rectangle Method(FRM) is proposed to manage 3D geometric constraints for complex-shaped components by approximating them with a finite set of cuboids, extending the applicability of the geometric modeling approach. Finally, the feasibility and effectiveness of the proposed MIP model are demonstrated through two numerical examples"and a real-world engineering case, which confirms its suitability for complex-shaped components and real engineering applications.
基金supported by the National Natural Science Foundation of Chinathe Civil Aviation Administration of China (U2333206).
文摘International freedom of the air(traffic rights)is a key resource for airlines to carry out international air transport business.An efficient and reasonable traffic right resource allocation within a country between airlines can affect the quality of a country’s participation in international air transport.In this paper,a multi-objective mixed-integer programming model for traffic rights resource allocation is developed to minimize passenger travel mileages and maximize the number of traffic rights resources allocated to hub airports and competitive carriers.A hybrid heuristic algorithm combining the genetic algorithm and the variable neighborhood search is devised to solve the model.The results show that the optimal allocation scheme aligns with the principle of fairness,indicating that the proposed model can play a certain guiding role in and provide an innovative perspective on traffic rights resource allocation in various countries.
基金supported by the National Natural Science Foundation of China(Grant Nos.12275260 and 11905211)the Fundamental Research Funds for the Central Universities(Grant No.202364008)the Young Talents Project of Ocean University of China。
文摘Non-Abelian topological insulators are characterized by matrix-valued,non-commuting topological charges with regard to more than one energy gap.Their descriptions go beyond the conventional topological band theory,in which an additive integer like the winding or Chern number is endowed separately with each(degenerate group of)energy band(s).In this work,we reveal that Floquet(time-periodic)driving could not only enrich the topology and phase transitions of non-Abelian topological matter,but also induce bulk-edge correspondence unique to nonequilibrium setups.Using a one-dimensional,three-band model as an illustrative example,we demonstrate that Floquet driving could reshuffle the phase diagram of the non-driven system,yielding both gapped and gapless Floquet band structures with non-Abelian topological charges.Moreover,by dynamically tuning the anomalous Floquet π-quasienergy gap,non-Abelian topological transitions inaccessible to static systems could arise,leading to much more complicated relations between non-Abelian topological charges and Floquet edge states.These discoveries put forth periodic driving as a powerful scheme of engineering non-Abelian topological phases and incubating unique non-Abelian band topology beyond equilibrium.
文摘As commercial drone delivery becomes increasingly popular,the extension of the vehicle routing problem with drones(VRPD)is emerging as an optimization problem of inter-ests.This paper studies a variant of VRPD in multi-trip and multi-drop(VRP-mmD).The problem aims at making schedules for the trucks and drones such that the total travel time is minimized.This paper formulate the problem with a mixed integer program-ming model and propose a two-phase algorithm,i.e.,a parallel route construction heuristic(PRCH)for the first phase and an adaptive neighbor searching heuristic(ANSH)for the second phase.The PRCH generates an initial solution by con-currently assigning as many nodes as possible to the truck–drone pair to progressively reduce the waiting time at the rendezvous node in the first phase.Then the ANSH improves the initial solution by adaptively exploring the neighborhoods in the second phase.Numerical tests on some benchmark data are conducted to verify the performance of the algorithm.The results show that the proposed algorithm can found better solu-tions than some state-of-the-art methods for all instances.More-over,an extensive analysis highlights the stability of the pro-posed algorithm.
文摘An improved method based on the Tikhonov regularization principle and the precisely known reference station coordinate is proposed to design the regularized matrix. The ill-conditioning of the normal matrix can be improved by the regularized matrix. The relative floating ambiguity can be computed only by using the data of several epochs. Combined with the LAMBDA method, the new approach can correctly and quickly fix the integer ambiguity and the success rate is 100% in experiments. Through using measured data sets from four mediumlong baselines, the new method can obtain exact ambiguities only by the Ll-frequency data of three epochs. Compared with the existing methods, the improved method can solve the ambiguities of the medium-long baseline GPS network RTK only using L1-frequency GPS data.
文摘Based on the analysis to the random sear ch algorithm of LUUS, a modified random directed integer search algorithm (MRDI SA) is given for first time. And a practical example is given to show that the adva ntage of this kind of algorithm is the reliability can’t be infuenced by the ini tial value X (0) and the start search domain R (0) . Besides, i t can be applied to solve the higher dimensional constrained nonlinear integer p rogramming problem.
基金The National Key Technology R&D Program of China during the 12th Five Year Plan Period(No.2013BAJ05B03)
文摘In order to increase the hardware utilization and minimize the chip area a multi-transform coding architecture which includes 4 ×4 forward integer transform 4 ×4 inverse integer transform 4 ×4 Hadamard transform and 2 ×2 Hadamard transform is proposed. By simplifying these transforms and exploring their similarities the proposed design merges the architectures processing individual transforms into a high-performance multi-transform coding architecture.Using a semiconductor manufacturing international corporation SMIC 0.18 μm complementary metal oxide semiconductor CMOS technology the proposed architecture achieves the maximum operating clock frequency of 200 MHz and the throughput rate of 800 ×106 pixel/s with the hardware cost of 3 704 gates.The results demonstrate that the data throughput rate per unit area DTUA of this design is at least 40.28%higher than that of the reference design.This design can meet the requirements of real-time decoding digital cinema video 4 096 ×2 048@30 Hz at 62.9 MHz which helps to reduce the power consumption.
