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.展开更多
Approaches based on integer linear programming have been recently proposed for topology optimization in wireless sensor networks. They are, however, based on over-theoretical, unrealistic models. Our aim is to show th...Approaches based on integer linear programming have been recently proposed for topology optimization in wireless sensor networks. They are, however, based on over-theoretical, unrealistic models. Our aim is to show that it is possible to accommodate realistic models for energy consumption and communication protocols into integer linear programming. We analyze the maximum lifetime broadcasting topology problem and we present realistic models that are also shown to provide efficient and practical solving tools. We present a strategy to substantially speed up the convergence of the solving process of our algorithm. This strategy introduces a practical drawback, however, in the characteristics of the optimal solutions retrieved. A method to overcome this drawback is discussed. Computational experiments are reported.展开更多
This paper gives integer linear programming (ILP) models for scheduling the League Phase of one of the most popular professional club competitions in the world, UEFA Champion’s League. There are 36 teams in the compe...This paper gives integer linear programming (ILP) models for scheduling the League Phase of one of the most popular professional club competitions in the world, UEFA Champion’s League. There are 36 teams in the competition, but each team plays only 8 other teams in the League Phase. Thus, the difficulty or ease of a team’s opponents, known as strength of schedule (SOS), compared to other teams will be different. Our main ILP model aims to minimize the maximum difference between SOS of any two teams, thus making the schedule as fair as possible. We also give a model for creating a timetable of all the matchups obtained by the first model. The models were implemented and tested using optimization software AMPL. Our main model obtained a schedule with a difference 0.4 between the highest and the lowest SOS, while that difference is 19 for the actual 2024-2025 competition. Thus, our model returns a schedule that is significantly fairer compared to the actual competition.展开更多
With the rapid development of highway construction and formation of the highway network in China,the man- agement of pavement maintenance and rehabilitation （MR） activities has become important.In this paper,four di...With the rapid development of highway construction and formation of the highway network in China,the man- agement of pavement maintenance and rehabilitation （MR） activities has become important.In this paper,four discrete optimization models are proposed for different parties involved in the management system： government,highway agent,con- tractor and the common users.These four optimal decision models are formulated as linear integer programming problems with binary decision variables.The objective function and constraints are based on the pavement performance and prediction model using the pavement condition index （PCI）.Numerical experiments are carried out with the data from a highway system in Sichuan Province which show the feasibility and effectiveness of the proposed models.展开更多
Ensuring the safe evacuation of miners during fire emergencies in the shortest possible time is one of the most critical aspects of underground mining operations.Despite advances in mining evacuation methods,little re...Ensuring the safe evacuation of miners during fire emergencies in the shortest possible time is one of the most critical aspects of underground mining operations.Despite advances in mining evacuation methods,little research has been conducted on mine vehicles in this context.This study proposed a vehicle-augmented evacuation integer programming(VEIP)model to minimize the total evacuation cost as a function of the required evacuation time during fire emergencies.This approach aims to minimize the risk of miners being exposed to dangerous fire conditions by strategically integrating mine vehicles into the evacuation procedure.The approach determines the optimal evacuation path for each miner,considering factors such as available mine vehicles,miners’locations,refuge chambers,and fresh-air bases.To validate the effectiveness of the developed VEIP model,a case study was conducted using the mine layout of the Turquoise Ridge Underground Mine in the United States.Furthermore,a statistical comparison was conducted between the VEIP model and the evacuation integer programming(EIP)model,tailored to evacuation on foot,to emphasize vehicles’influence on the evacuation process.The results showed that integrating mine vehicles into evacuation procedures significantly reduces the total evacuation time.A cost savings analysis in the VEIP model revealed that the evacuation time savings increase exponentially as the number of miners present during evacuation increases.The potential benefits of using mine vehicles to improve the efficiency of evacuation from underground mine fires were highlighted in this study.展开更多
Embryonic Array(EA) with different configuration methods will directly affect its reliability and hardware consumption. At present, EA configuration design is lack of quantitative analysis method. In order to reasonab...Embryonic Array(EA) with different configuration methods will directly affect its reliability and hardware consumption. At present, EA configuration design is lack of quantitative analysis method. In order to reasonably optimize EA configuration design, an EA configuration optimization design method is proposed, which is based on the constraints of EA hardware consumption and reliability. Through the analysis of EA working process and composition, quantitative analysis of EA reliability and hardware consumption are completed. Based on the constraints of EA hardware consumption and reliability, the mathematical model of EA configuration optimization design is established, which transfers EA configuration optimization design into an integer nonlinear programming model problem. According to the difference of the fitness value of individual waiting for mutation in population, adaptive mutation operator and crossover operator are selected, and a novel Modified Adaptive Differential Evolution(MADE) algorithm is proposed,which is used to solve EA configuration optimization design problem. Simulation experiments and analysis indicate that the MADE is able to effectively improve the speed, accuracy and stability of algorithm. Moreover, the proposed EA configuration optimization design method can select the most reasonable EA configuration design, and play an important guiding role in EA optimization design.展开更多
The circle geometric constraint model （CGCM） was put forward for resolving the open-pit mine ore-matching problems （OMOMP）. By adopting the approaches of graph theory, block model of blasted piles was abstracted i...The circle geometric constraint model （CGCM） was put forward for resolving the open-pit mine ore-matching problems （OMOMP）. By adopting the approaches of graph theory, block model of blasted piles was abstracted into a set of nodes and directed edges, which were connected together with other nodes in the range of circle constraints, to describe the mining sequence. Also, the constructing method of CGCM was introduced in detail. The algorithm of CGCM has been realized in the DIM1NE system, and applied to a short-term （5 d） program calculation for ore-matching of a cement limestone mine in Hebei Province, China. The applications show that CGCM can well describe the mining sequence of ore blocks and its mining geometric constraints in the process of mining blasted piles. This model, which is applicable for resolving OMOMP under complicated geometric constraints with accurate results, provides effective ways to solve the problems of open-pit ore-matching.展开更多
This paper gives integer linear programming models for scheduling doubles tennis group competitions. The goal is to build a fair and competitive schedule for all players. Our basic model achieves that for each player ...This paper gives integer linear programming models for scheduling doubles tennis group competitions. The goal is to build a fair and competitive schedule for all players. Our basic model achieves that for each player the average ranking of his partners in all matches is as close as possible to the average ranking of his opponents in all matches. One of the variations of the basic model provides that each matchup is fair and competitive. We also give models for the case when the number of players is 4n<span style="font-family:;" "=""> </span><span style="font-family:;" "="">+</span><span style="font-family:;" "=""> </span><span style="font-family:;" "="">2, and thus one of the matches has to be singles. Our models were implemented and tested using optimization software AMPL. Computational results along with schedules for some typical situations are also given the paper.</span>展开更多
基金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.
文摘Approaches based on integer linear programming have been recently proposed for topology optimization in wireless sensor networks. They are, however, based on over-theoretical, unrealistic models. Our aim is to show that it is possible to accommodate realistic models for energy consumption and communication protocols into integer linear programming. We analyze the maximum lifetime broadcasting topology problem and we present realistic models that are also shown to provide efficient and practical solving tools. We present a strategy to substantially speed up the convergence of the solving process of our algorithm. This strategy introduces a practical drawback, however, in the characteristics of the optimal solutions retrieved. A method to overcome this drawback is discussed. Computational experiments are reported.
文摘This paper gives integer linear programming (ILP) models for scheduling the League Phase of one of the most popular professional club competitions in the world, UEFA Champion’s League. There are 36 teams in the competition, but each team plays only 8 other teams in the League Phase. Thus, the difficulty or ease of a team’s opponents, known as strength of schedule (SOS), compared to other teams will be different. Our main ILP model aims to minimize the maximum difference between SOS of any two teams, thus making the schedule as fair as possible. We also give a model for creating a timetable of all the matchups obtained by the first model. The models were implemented and tested using optimization software AMPL. Our main model obtained a schedule with a difference 0.4 between the highest and the lowest SOS, while that difference is 19 for the actual 2024-2025 competition. Thus, our model returns a schedule that is significantly fairer compared to the actual competition.
基金Project supported by the National Natural Science Foundation of China (Grant No.70671064)
文摘With the rapid development of highway construction and formation of the highway network in China,the man- agement of pavement maintenance and rehabilitation （MR） activities has become important.In this paper,four discrete optimization models are proposed for different parties involved in the management system： government,highway agent,con- tractor and the common users.These four optimal decision models are formulated as linear integer programming problems with binary decision variables.The objective function and constraints are based on the pavement performance and prediction model using the pavement condition index （PCI）.Numerical experiments are carried out with the data from a highway system in Sichuan Province which show the feasibility and effectiveness of the proposed models.
基金funded by the National Institute for Occupational Health and Safety under grant U60OH012351an Artificially Intelligent Mining Systems(AIMS)Capacity Building Project under contract number 75D30119C06044 for safer and healthier automated operations.
文摘Ensuring the safe evacuation of miners during fire emergencies in the shortest possible time is one of the most critical aspects of underground mining operations.Despite advances in mining evacuation methods,little research has been conducted on mine vehicles in this context.This study proposed a vehicle-augmented evacuation integer programming(VEIP)model to minimize the total evacuation cost as a function of the required evacuation time during fire emergencies.This approach aims to minimize the risk of miners being exposed to dangerous fire conditions by strategically integrating mine vehicles into the evacuation procedure.The approach determines the optimal evacuation path for each miner,considering factors such as available mine vehicles,miners’locations,refuge chambers,and fresh-air bases.To validate the effectiveness of the developed VEIP model,a case study was conducted using the mine layout of the Turquoise Ridge Underground Mine in the United States.Furthermore,a statistical comparison was conducted between the VEIP model and the evacuation integer programming(EIP)model,tailored to evacuation on foot,to emphasize vehicles’influence on the evacuation process.The results showed that integrating mine vehicles into evacuation procedures significantly reduces the total evacuation time.A cost savings analysis in the VEIP model revealed that the evacuation time savings increase exponentially as the number of miners present during evacuation increases.The potential benefits of using mine vehicles to improve the efficiency of evacuation from underground mine fires were highlighted in this study.
基金supported by the National Natural Science Foundation of China(Nos.61372039 and 61601495)
文摘Embryonic Array(EA) with different configuration methods will directly affect its reliability and hardware consumption. At present, EA configuration design is lack of quantitative analysis method. In order to reasonably optimize EA configuration design, an EA configuration optimization design method is proposed, which is based on the constraints of EA hardware consumption and reliability. Through the analysis of EA working process and composition, quantitative analysis of EA reliability and hardware consumption are completed. Based on the constraints of EA hardware consumption and reliability, the mathematical model of EA configuration optimization design is established, which transfers EA configuration optimization design into an integer nonlinear programming model problem. According to the difference of the fitness value of individual waiting for mutation in population, adaptive mutation operator and crossover operator are selected, and a novel Modified Adaptive Differential Evolution(MADE) algorithm is proposed,which is used to solve EA configuration optimization design problem. Simulation experiments and analysis indicate that the MADE is able to effectively improve the speed, accuracy and stability of algorithm. Moreover, the proposed EA configuration optimization design method can select the most reasonable EA configuration design, and play an important guiding role in EA optimization design.
基金Project(2011AA060407) supported by the National High Technology Research and Development Program of ChinaProject(51074073) supported by the National Natural Science Foundation of China
文摘The circle geometric constraint model （CGCM） was put forward for resolving the open-pit mine ore-matching problems （OMOMP）. By adopting the approaches of graph theory, block model of blasted piles was abstracted into a set of nodes and directed edges, which were connected together with other nodes in the range of circle constraints, to describe the mining sequence. Also, the constructing method of CGCM was introduced in detail. The algorithm of CGCM has been realized in the DIM1NE system, and applied to a short-term （5 d） program calculation for ore-matching of a cement limestone mine in Hebei Province, China. The applications show that CGCM can well describe the mining sequence of ore blocks and its mining geometric constraints in the process of mining blasted piles. This model, which is applicable for resolving OMOMP under complicated geometric constraints with accurate results, provides effective ways to solve the problems of open-pit ore-matching.
文摘This paper gives integer linear programming models for scheduling doubles tennis group competitions. The goal is to build a fair and competitive schedule for all players. Our basic model achieves that for each player the average ranking of his partners in all matches is as close as possible to the average ranking of his opponents in all matches. One of the variations of the basic model provides that each matchup is fair and competitive. We also give models for the case when the number of players is 4n<span style="font-family:;" "=""> </span><span style="font-family:;" "="">+</span><span style="font-family:;" "=""> </span><span style="font-family:;" "="">2, and thus one of the matches has to be singles. Our models were implemented and tested using optimization software AMPL. Computational results along with schedules for some typical situations are also given the paper.</span>
