期刊文献+
任意字段
题名或关键词
题名
关键词
摘要
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息
共找到3,611篇文章
< 1 2 … 181 >
每页显示 20 50 100
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
显示方式：
Mixed integer programming modeling for the satellite three-dimensional component assignment and layout optimization problem 认领 引用
1
作者 Yufeng XIA Xianqi CHEN +3 位作者 Zhijia LIU Weien ZHOU Wen YAO Zhongneng ZHANG 《Chinese Journal of Aeronautics》 SCIE EI CAS CSCD 2025年第6期427-447,共21页
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. 展开更多
关键词 Mixed integer programming modeling Three-dimensional component assignment Layout optimization Phi-function Finite-rectangle method
暂未订购 下载PDF
Regular control surfaces of a toric patch and integer programming 认领 引用
2
作者 WANG Han ZHU Chun-gang 《Applied Mathematics(A Journal of Chinese Universities)》 SCIE CSCD 2025年第4期853-867,共15页
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. 展开更多
关键词 toric patch regular control surfaces integer programming regular decompositions state poly-tope
暂未订购 下载PDF
A Mixed-Integer Programming Formulation for a Simplified Model of the Double Row Layout Problem 认领 引用
3
作者 GUAN Jian LIN Geng +1 位作者 FENG Huibin RUAN Zhiqiang 《Wuhan University Journal of Natural Sciences》 CAS CSCD 2023年第5期433-440,共8页
The double row layout problem(DRLP)is to assign facilities on two rows in parallel so that the total cost of material handling among facilities is minimized.Since it is vital to save cost and enhance productivity,the ... The double row layout problem(DRLP)is to assign facilities on two rows in parallel so that the total cost of material handling among facilities is minimized.Since it is vital to save cost and enhance productivity,the DRLP plays an important role in many application fields.Nevertheless,it is very hard to handle the DRLP because of its complex model.In this paper,we consider a new simplified model for the DRLP(SM-DRLP)and provide a mixed integer programming(MIP)formulation for it.The continuous decision variables of the DRLP are divided into two parts:start points of double rows and adjustable clearances between adjacent facilities.The former one is considered in the new simplified model for the DRLP with the purpose of maintaining solution quality,while the latter one is not taken into account with the purpose of reducing computational time.To evaluate its performance,our SM-DRLP is compared with the model of a general DRLP and the model of another simplified DRLP.The experimental results show the efficiency of our proposed model. 展开更多
关键词 facility layout mixed integer programming double row layout problem production optimization manufacturing design
暂未订购 下载PDF
Evaluation of Integer Programming Solvers to Improve the Efficiency of Individual Work Planning 认领 引用
4
作者 Keiichi Takahashi 《Open Journal of Modelling and Simulation》 2025年第1期51-64,共14页
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. 展开更多
关键词 Mixed Integer Programming Scheduling Optimization Work Planning Book Scanning Gantt Chart
暂未订购 下载PDF
An overview of mathematical programming solvers:Theory,development,and recent advances 认领 引用
5
作者 Lei HUANG Fan XIAO +2 位作者 Dongdong GE Wotao YIN Zhe LIANG 《ENGINEERING Management》 CSCD 2026年第1期1-16,共16页
Mathematical programming solvers are software tools designed to solve real‑world problems using mathematical programming algorithms.This survey explores the evolution of optimization technologies,from traditional meth... Mathematical programming solvers are software tools designed to solve real‑world problems using mathematical programming algorithms.This survey explores the evolution of optimization technologies,from traditional methods such as the simplex algorithm and branch‑and‑bound techniques to modern advancements that are facilitated by parallel computing,GPU acceleration,and AI algorithms.We also emphasize the recent emergence of mathematical programming solvers developed by research institutes and companies headquartered in China as major players,who have achieved remarkable success in benchmarks when compared to established solvers.This article provides a comprehensive overview of the theoretical foundations,historical progress,and emerging trends in mathematical programming solvers,offering valuable insights for both researchers and practitioners in the field. 展开更多
关键词 survey mathematical programming solver linear programming mixed‑integer programming nonlinear programming
暂未订购 下载PDF
Hybrid particle swarm optimization with chaotic search for solving integer and mixed integer programming problems 认领 引用 被引量：21
6
作者 谭跃 谭冠政 邓曙光 《Journal of Central South University》 SCIE EI CAS 2014年第7期2731-2742,共12页
A novel chaotic search method is proposed,and a hybrid algorithm combining particle swarm optimization(PSO) with this new method,called CLSPSO,is put forward to solve 14 integer and mixed integer programming problems.... A novel chaotic search method is proposed,and a hybrid algorithm combining particle swarm optimization(PSO) with this new method,called CLSPSO,is put forward to solve 14 integer and mixed integer programming problems.The performances of CLSPSO are compared with those of other five hybrid algorithms combining PSO with chaotic search methods.Experimental results indicate that in terms of robustness and final convergence speed,CLSPSO is better than other five algorithms in solving many of these problems.Furthermore,CLSPSO exhibits good performance in solving two high-dimensional problems,and it finds better solutions than the known ones.A performance index(PI) is introduced to fairly compare the above six algorithms,and the obtained values of(PI) in three cases demonstrate that CLSPSO is superior to all the other five algorithms under the same conditions. 展开更多
关键词 particle swarm optimization chaotic search integer programming problem mixed integer programming problem
暂未订购 下载PDF
Solution for integer linear bilevel programming problems using orthogonal genetic algorithm 认领 引用 被引量：10
7
作者 Hong Li Li Zhang Yongchang Jiao 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2014年第3期443-451,共9页
An integer linear bilevel programming problem is firstly transformed into a binary linear bilevel programming problem, and then converted into a single-level binary implicit programming. An orthogonal genetic algorith... An integer linear bilevel programming problem is firstly transformed into a binary linear bilevel programming problem, and then converted into a single-level binary implicit programming. An orthogonal genetic algorithm is developed for solving the binary linear implicit programming problem based on the orthogonal design. The orthogonal design with the factor analysis, an experimental design method is applied to the genetic algorithm to make the algorithm more robust, statistical y sound and quickly convergent. A crossover operator formed by the orthogonal array and the factor analysis is presented. First, this crossover operator can generate a smal but representative sample of points as offspring. After al of the better genes of these offspring are selected, a best combination among these offspring is then generated. The simulation results show the effectiveness of the proposed algorithm. 展开更多
关键词 integer linear bilevel programming problem integer optimization genetic algorithm orthogonal experiment design
暂未订购 下载PDF
Scheduling Step-Deteriorating Jobs on Parallel Machines by Mixed Integer Programming 认领 引用 被引量：5
8
作者 郭鹏 程文明 +1 位作者 曾鸣 梁剑 《Journal of Donghua University(English Edition)》 EI CAS 2015年第5期709-714,719,共6页
Production scheduling has a major impact on the productivity of the manufacturing process. Recently, scheduling problems with deteriorating jobs have attracted increasing attentions from researchers. In many practical... Production scheduling has a major impact on the productivity of the manufacturing process. Recently, scheduling problems with deteriorating jobs have attracted increasing attentions from researchers. In many practical situations,it is found that some jobs fail to be processed prior to the pre-specified thresholds,and they often consume extra deteriorating time for successful accomplishment. Their processing times can be characterized by a step-wise function. Such kinds of jobs are called step-deteriorating jobs. In this paper,parallel machine scheduling problem with stepdeteriorating jobs( PMSD) is considered. Due to its intractability,four different mixed integer programming( MIP) models are formulated for solving the problem under consideration. The study aims to investigate the performance of these models and find promising optimization formulation to solve the largest possible problem instances. The proposed four models are solved by commercial software CPLEX. Moreover,the near-optimal solutions can be obtained by black-box local-search solver LocalS olver with the fourth one. The computational results show that the efficiencies of different MIP models depend on the distribution intervals of deteriorating thresholds, and the performance of LocalS olver is clearly better than that of CPLEX in terms of the quality of the solutions and the computational time. 展开更多
关键词 parallel machine step-deterioration mixed integer programming(MIP) scheduling models total completion time
暂未订购 下载PDF
Optimal set integer programming algorithm for multiple maneuvering targets tracking in clutter 认领 引用 被引量：2
9
作者 Xiaoyan Fu Yingmin Jia Xiaohe Liu 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2013年第4期555-563,共9页
The aim of this paper is to solve the problems of multitarget tracking in clutter. Firstly, the data association of measurement-to-target is formulated as an integer programming problem. Through using the linear progr... The aim of this paper is to solve the problems of multitarget tracking in clutter. Firstly, the data association of measurement-to-target is formulated as an integer programming problem. Through using the linear programming （LP） based branchand-bound method and adjusting the constraint conditions, an optimal set integer programming （OSIP） algorithm is then proposed for tracking multiple non-maneuvering targets in clutter. For the case of maneuvering targets, this paper introduces the OSIP algorithm into the filtering step of the interacting multiple model （IMM） algorithm resulting in the IMM based on OSIP algorithm. Extensive Monte Carlo simulations show that the presented algorithms can obtain superior estimations even in the case of high density noises. 展开更多
关键词 data association target tracking integer programming clutter.
暂未订购 下载PDF
Two-parameters quasi-filled function algorithm for nonlinear integer programming 认领 引用 被引量：3
10
作者 WANG Wei-xiang SHANG You-lin ZHANG Lian-sheng 《Journal of Zhejiang University-SCIENCE A》 EI CAS 2006年第12期2083-2087,共5页
A quasi-filled function for nonlinear integer programming problem is given in this paper. This function contains two parameters which are easily to be chosen. Theoretical properties of the proposed quasi-filled functi... A quasi-filled function for nonlinear integer programming problem is given in this paper. This function contains two parameters which are easily to be chosen. Theoretical properties of the proposed quasi-filled function are investigated. Moreover, we also propose a new solution algorithm using this quasi-filled function to solve nonlinear integer programming problem in this paper. The examples with 2 to 6 variables are tested and computational results indicated the efficiency and reliability of the pro- posed quasi-filled function algorithm. 展开更多
关键词 Integer programming Local minimizer Global minimizer Filled function Global optimization
暂未订购 下载PDF
A Green Mixed Integer Linear Programming Model for Optimization of Byproduct Gases in Iron and Steel Industry 认领 引用 被引量：12
11
作者 Hai-ning KONG 《Journal of Iron and Steel Research International》 SCIE CAS CSCD 2015年第8期681-685,共5页
Byproduct gas is an important secondary energy in iron and steel industry, and its optimization is vital to cost reduction. With the development of iron and steel industry to be more eco-friendly, it is necessary to c... Byproduct gas is an important secondary energy in iron and steel industry, and its optimization is vital to cost reduction. With the development of iron and steel industry to be more eco-friendly, it is necessary to construct an integrated optimized system, taking economics, energy consumption and environment into consideration. Therefore, the environmental cost caused by pollutants discharge should be factored in total cost when optimizing byproduct gas distribution. A green mixed integer linear programming （MILP） model for the optimization of byproduct gases was established to reduce total cost, including both operation cost and environmental cost. The operation cost included penalty for gas deviation, costs of fuel and water consumption, holder booster trip penalty, and so forth; while the environmental cost consisted of penalties for both direct and indirect pollutants discharge. Case study showed that the proposed model brought an optimum solution and 2.2% of the total cost could be reduced compared with previous one. 展开更多
关键词 green mixed integer linear programming environmental cost optimization iron and steel industry byproduct gas
暂未订购 下载PDF
One-parameter quasi-filled function algorithm for nonlinear integer programming 认领 引用 被引量：3
12
作者 尚有林 韩伯顺 《Journal of Zhejiang University-SCIENCE A》 CAS 2005年第4期305-310,共6页
A definition of the quasi-filled function for nonlinear integer programming problem is given in this paper. A quasi-filled function satisfying our definition is presented. This function contains only one parameter. Th... A definition of the quasi-filled function for nonlinear integer programming problem is given in this paper. A quasi-filled function satisfying our definition is presented. This function contains only one parameter. The properties of the pro- posed quasi-filled function and the method using this quasi-filled function to solve nonlinear integer programming problem are also discussed in this paper. Numerical results indicated the efficiency and reliability of the proposed quasi-filled function algo- rithm. 展开更多
关键词 Integer programming Local minimizer Global minimizer Filled function Global optimization
暂未订购 下载PDF
A One-parameter Filled Function Method for Nonlinear Integer Programming 认领 引用 被引量：2
13
作者 尚有林 杨永建 梁玉梅 《Journal of Donghua University(English Edition)》 EI CAS 2005年第4期1-4,共4页
This paper gives a new definition of the filled function for nonlinear integer programming problem. A filled function satisfying our definition is presented. This function contains only one parameter. The properties o... This paper gives a new definition of the filled function for nonlinear integer programming problem. A filled function satisfying our definition is presented. This function contains only one parameter. The properties of the proposed filled function and the method using this filled function to solve nonlinear integer programming problem are also discussed. Numerical results indicate the efficiency and reliability of the proposed filled function algorithm. 展开更多
关键词 integer programming local minimizer global minimizer filled function global optimization
暂未订购 下载PDF
General Exact Penalty Functions in Integer Programming 认领 引用 被引量：1
14
作者 白富生 张连生 吴至友 《Journal of Shanghai University(English Edition)》 2004年第1期19-23,共5页
In this paper, the general exact penalty functions in integer programming were studied. The conditions which ensure the exact penalty property for the general penalty function with one penalty parameter were given and... In this paper, the general exact penalty functions in integer programming were studied. The conditions which ensure the exact penalty property for the general penalty function with one penalty parameter were given and a general penalty function with two parameters was proposed. 展开更多
关键词 integer programming exact penalty function penalty parameter.
暂未订购 下载PDF
A Modified Algorithm for Nonliear Integer Programming 认领 引用 被引量：2
15
作者 孙会霞 《Chinese Quarterly Journal of Mathematics》 2002年第3期24-29,共6页
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 thi... 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. 展开更多
关键词 random search integer programming optimal soluti on reliability
暂未订购 下载PDF
Revision of stratified OWL ontologiesbased on integer linear programming 认领 引用
16
作者 Ji Qiu Qi Guilin Boutouhami Khaoula 《Journal of Southeast University(English Edition)》 EI CAS 2020年第1期1-7,共7页
To revise stratified web ontology language(OWL)ontologies,the kernel revision operator is extended by defining novel conflict stratification and the incision function based on integer linear programming(ILP).The ILP-b... To revise stratified web ontology language(OWL)ontologies,the kernel revision operator is extended by defining novel conflict stratification and the incision function based on integer linear programming(ILP).The ILP-based model considers an optimization problem of minimizing a linear objective function which is suitable for selecting the minimal number of axioms to remove when revising ontologies.Based on the incision function,a revision algorithm is proposed to apply ILP to all minimal incoherence-preserving subsets(MIPS).Although this algorithm can often find a minimal number of axioms to remove,it is very time-consuming to compute MIPS.Thus,an adapted revision algorithm to deal with unsatisfiable concepts individually is also given.Experimental results reveal that the proposed ILP-based revision algorithm is much more efficient than the commonly used algorithm based on the hitting set tree.In addition,the adapted algorithm can achieve higher efficiency,while it may delete more axioms. 展开更多
关键词 ontology revision inconsistency handling semantic web integer linear programming
暂未订购 下载PDF
Stochastic level-value approximation for quadratic integer convex programming 认领 引用
17
作者 彭拯 邬冬华 《Applied Mathematics and Mechanics(English Edition)》 SCIE EI 2008年第6期801-809,共9页
We propose a stochastic level value approximation method for a quadratic integer convex minimizing problem in this paper. This method applies an importance sampling technique, and make use of the cross-entropy method ... We propose a stochastic level value approximation method for a quadratic integer convex minimizing problem in this paper. This method applies an importance sampling technique, and make use of the cross-entropy method to update the sample density functions. We also prove the asymptotic convergence of this algorithm, and report some numerical results to illuminate its effectiveness. 展开更多
关键词 quadratic integer convex programming stochastic level value approximation cross-entropy method asymptotic convergence
暂未订购 下载PDF
An Exact Virtual Network Embedding Algorithm Based on Integer Linear Programming for Virtual Network Request with Location Constraint 认领 引用 被引量：3
18
作者 Zeheng Yang Yongan Guo 《China Communications》 SCIE CSCD 2016年第8期177-183,共7页
Network virtualization is known as a promising technology to tackle the ossification of current Internet and will play an important role in the future network area. Virtual network embedding(VNE) is a key issue in net... Network virtualization is known as a promising technology to tackle the ossification of current Internet and will play an important role in the future network area. Virtual network embedding(VNE) is a key issue in network virtualization. VNE is NP-hard and former VNE algorithms are mostly heuristic in the literature.VNE exact algorithms have been developed in recent years. However, the constraints of exact VNE are only node capacity and link bandwidth.Based on these, this paper presents an exact VNE algorithm, ILP-LC, which is based on Integer Linear Programming(ILP), for embedding virtual network request with location constraints. This novel algorithm is aiming at mapping virtual network request(VNR) successfully as many as possible and consuming less substrate resources.The topology of each VNR is randomly generated by Waxman model. Simulation results show that the proposed ILP-LC algorithm outperforms the typical heuristic algorithms in terms of the VNR acceptance ratio, at least 15%. 展开更多
关键词 network virtualization virtual network embedding exact VNE algorithm integer linear Programming location constraint VNR acceptance ratio
暂未订购 下载PDF
A Two-Objective Integer Programming Model for the Location of Waste Transfer Station and Landfill in IoT Environment: Shenzhen City is Taken as an Example 认领 引用
19
作者 HU Bin XUE Heqiang FANG Yuan 《Wuhan University Journal of Natural Sciences》 CAS CSCD 2020年第1期1-11,共11页
In the traditional environment, the factors for considering the location of the waste transfer station and the landfill are relatively fixed, and the scale of the problem is small. But in Internet of Things(IoT) envir... In the traditional environment, the factors for considering the location of the waste transfer station and the landfill are relatively fixed, and the scale of the problem is small. But in Internet of Things(IoT) environment, the waste storage in the household waste can be monitored in real time, the environmental data can be collected by means of emerging information technology, and the residents are more sensitive to the environmental pollution of the waste. Under such conditions, the method for location of traditional waste disposal facilities needs to be redeveloped to obtain a waste transfer station and landfill site that are suitable for the IoT environment. For this reason, a two-objective integer programming model is designed. The two objectives are lowest cost and minimum impact of waste on residents. The expectations of city managers and residents are considered into the modeling. Through the simulation experiments on different scale problems, the integration method for integer programming model and simulation system is verified to solve the location of waste transfer stations in IoT environment. 展开更多
关键词 location of waste transfer station Internet of Things (IoT) integer programming model simulation
暂未订购 下载PDF
A new heuristic algorithm for general integer linear programming problems 认领 引用 被引量：1
20
作者 高培旺 《Journal of Chongqing University》 2006年第3期170-174,共5页
A new heuristic algorithm is proposed for solving general integer linear programming problems. In the algorithm, the objective function hyperplane is used as a cutting plane, and then by introducing a special set of a... A new heuristic algorithm is proposed for solving general integer linear programming problems. In the algorithm, the objective function hyperplane is used as a cutting plane, and then by introducing a special set of assistant sets, an efficient heuristic search for the solution to the integer linear program is carried out in the sets on the objective function hyperplane. A simple numerical example shows that the algorithm is efficient for some problems, and therefore, of practical interest. 展开更多
关键词 integer linear programming objective function hyperplane cutting plane heuristic algorithm
暂未订购 下载PDF
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
上一页 1 2 … 181 下一页 到第 页
在线咨询 使用帮助 返回顶部 意见反馈