检索结果-内蒙古大学图书馆

IEEE International Conference on Automation Science and Engineering (CASE)

作者： Prodel, Martin Augusto, Vincent Xie, Xiaolan Jouaneton, Baptiste Lamarsalle, Ludovic Ecole Mines St Etienne Ctr Biomed & Healthcare Engn CNRS UMR LIMOS 6158 St Etienne France Shanghai Jiao Tong Univ Ctr Hlth Care Engn Shanghai Peoples R China Co HEVA St Etienne France

ISBN: (纸本)9781467381833

The analysis of patient pathways from event log is gaining importance in the field of medical information. It provides deep insights about the care process and the ways to improve it. This paper combines optimization and process mining. A new integer linear programming model is proposed to discover the care process at a macroscopic scale from a large-size database. When dealing with health-care data, the main challenge to overcome is the considerable variability of patients' behaviors. An original size constraint and an aggregation method are used to create simple but significant process models. The results of a case study on heart failures confirm the ability of the approach to reveal the process information behind the data.

关键词： integer linear programming Heart Failure event log mining MACROSCOPIC Database Patients

来源：评论

学校读者我要写书评

暂无评论

Energy-Aware Optimal Clustering in Wireless Sensor Network Using integer/linear programming 8

Energy-Aware Optimal Clustering in Wireless Sensor Network U...

引用

8th International Conference on Information Technology and Electrical Engineering (ICITEE)

作者： Eskandari, Zahra Seno, Seyed Amin Hosseini Stiawan, Deris Kerim, Bedine Budiarto, Rahmat Quchan Univ Adv Technol Dept Comp Engn Quchan Iran Ferdowsi Univ Mashhad NW Res Lab Mashhad Iran Univ Sriwijaya Fac Comp Sci Dept Comp Engn Palembang Indonesia Albaha Univ Dept IT Coll CSIT Al Bahah Saudi Arabia Albaha Univ Coll CSIT Dept CIS Al Bahah Saudi Arabia

ISBN: (纸本)9781509041398

clustering is a hierarchical method to data transmission in wireless sensor networks, which has a considerable effect on energy conservation. A balanced and efficient clustering has an important role in these networks. This paper discusses an optimal clustering method in wireless sensor network. Firstly, by considering energy and distance parameters, we model the clustering problem using two techniques, integer linear programming and linear programming. Then we propose a clustering algorithm based on the optimal selected cluster heads. Experimental results shown that linear programming technique has better performance in energy consumption and network lifetime in comparison to the integer linear programming technique.

关键词： wireless sensor network clustering energy efficient integer linear programming linear programming

来源：评论

学校读者我要写书评

暂无评论

Comparison of Some Cutting-Plane Methods for the integer linear programming Problem

引用

Computational Mathematics and Modeling 2015年第2期26卷 244-251页

作者： Shalbuzov, K.D. Moscow State University Moscow Russian Federation

The article proposes a modification of the Gomory cyclic algorithm for the integer linear programming problem. The proposed algorithm is numerically compared with the loop algorithm, the all-integer Gomory algorithm, and Martin’s algorithm with improved choice of the generating row. Comparisons are carried out by running time and by the number of added cutting planes. © 2015, Springer Science+Business Media New York.

关键词： all-integer Gomory algorithm Gomory cutting plane Gomory cyclic algorithms integer linear programming Martin’s algorithm

来源：评论

学校读者我要写书评

暂无评论

Modelling Constraints in School Timetabling using integer linear programming 25

Modelling Constraints in School Timetabling using Integer Li...

引用

International Conference Information Communication Automation Technologies (ICAT)

作者： Ribic, Samir Turcinhozic, Razija Muratovic-Ribic, Amela Univ Sarajevo Fac Elect Engn Zmaja Bosne Bb Sarajevo Bosnia & Herceg Univ Sarajevo Fac Nat Sci & Math Sarajevo Bosnia & Herceg

ISBN: (纸本)9781467381468

integer linear programming is a popular method of generating school timetables. Although computationally simpler, school timetabling is less developed area than university timetabling, because the models which resolve timetabling problems proposed thus far have been adjusted to individual cases differing from country to country. A proposed model meets most of constraints appeared in different school timetabling systems.

关键词： integer linear programming Optimal scheduling

来源：评论

学校读者我要写书评

暂无评论

An integer linear programming Model for the Multiperiod Production Planning of Precast Concrete Beams

引用

JOURNAL OF CONSTRUCTION ENGINEERING AND MANAGEMENT 2015年第10期141卷 04015029-04015029页

作者： Prata, Bruno de Athayde Pitombeira-Neto, Anselmo Ramalho de Moraes Sales, Caio Juca Univ Fed Ceara Dept Ind Engn BR-60440554 Fortaleza Ceara Brazil

Unlike conventional beams, which are cast in the construction site, precast beams are cast in a production line in a beam factory. Their use may considerably reduce the completion time of construction projects, making them attractive to public housing. A key factor for the success of their use is the ability of efficiently producing them, which depends on the quality of the production planning. The objective of this paper is to propose an integer linear programming model for the precast concrete beams production problem. It is first shown that this problem is isomorphic to the well-known multiperiod cutting stock problem. The objective function is the minimization of the production loss of a production order, subject to the available capacity of forms used to cast the beams. A case study is presented with data of a real scale instance, so as to demonstrate the applicability of the model in industrial settings. The proposed model was implemented and ran on the CPLEX solver, which reached an optimal solution within an acceptable running time. The results indicate that significant gains may be achieved in terms of reduction of planning time through the application of the proposed model. (C) 2015 American Society of Civil Engineers.

关键词： Precast concrete beams Production planning integer linear programming Quantitative methods

来源：评论

学校读者我要写书评

暂无评论

An integer linear programming approach to the single and bi-objective Next Release Problem

引用

INFORMATION AND SOFTWARE TECHNOLOGY 2015年第Sep.期65卷 1-13页

作者： Veerapen, Nadarajen Ochoa, Gabriela Harman, Mark Burke, Edmund K. Univ Stirling Comp Sci & Math Stirling FK9 4LA Scotland UCL Dept Comp Sci London WC1E 6BT England

Context: The Next Release Problem involves determining the set of requirements to implement in the next release of a software project. When the problem was first formulated in 2001, integer linear programming, an exact method, was found to be impractical because of large execution times. Since then, the problem has mainly been addressed by employing metaheuristic techniques. Objective: In this paper, we investigate if the single-objective and hi-objective Next Release Problem can be solved exactly and how to better approximate the results when exact resolution is costly. Methods: We revisit integer linear programming for the single-objective version of the problem. In addition, we integrate it within the Epsilon-constraint method to address the bi-objective problem. We also investigate how the Pareto front of the bi-objective problem can be approximated through an anytime deterministic integer linear programming-based algorithm when results are required within strict run-time constraints. Comparisons are carried out against NSGA-II. Experiments are performed on a combination of synthetic and real-world datasets. Findings: We show that a modern integer linear programming solver is now a viable method for this problem. Large single objective instances and small hi-objective instances can be solved exactly very quickly. On large bi-objective instances, execution times can be significant when calculating the complete Pareto front. However, good approximations can be found effectively. Conclusion: This study suggests that (1) approximation algorithms can be discarded in favor of the exact method for the single-objective instances and small bi-objective instances, (2) the integer linear programming-based approximate algorithm outperforms the NSGA-II genetic approach on large hi-objective instances, and (3) the run times for both methods are low enough to be used in real-world situations. (C) 2015 The Authors. Published by Elsevier B.V.

关键词： integer linear programming Multi-objective optimization Next Release Problem Requirements optimization Search based software engineering

来源：评论

学校读者我要写书评

暂无评论

A linear integer programming Method for Section Location in Distribution Networks Under Multiple Faults 4

A Linear Integer Programming Method for Section Location in ...

引用

4th International Conference on Intelligent Power and Systems, ICIPS 2024

作者： Wang, Qiujie Gan, Dewei Ji, Chenxu Xiao, Hao Tan, Hong China Three Gorges University College of Electrical Engineering and New Energy Yichang China

ISBN: (纸本)9798331532765

Existing linearized section location methods for distribution networks are only applicable to single faults. In response, this paper proposes a linear integer programming method for section location in distribution networks that is suitable for multiple faults. Firstly, based on fault-tolerant mechanism analysis, a switch function tailored for multiple faults is developed. Secondly, the method incorporates phasor measurement unit (PMU) information fault information into the section location process, constructing a logical model for section location in distribution networks. Finally, by applying three transformation principles between logical and algebraic relationships, the logical model is converted into a linear integer programming model, which is solved using MATLAB+CPLEX. Case studies demonstrate that the proposed linear integer programming method for section location in distribution networks achieves fast location speed and robust fault tolerance, making it suitable for both single and multiple faults. © 2024 IEEE.

关键词： integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Development of a linear integer programming Model for Solving Cutting Stock Problem in the Manufacturing Industry 17

Development of a Linear Integer Programming Model for Solvin...

引用

17th CIRP Conference on Intelligent Computation in Manufacturing Engineering, CIRP ICME 2023

作者： Daniyan, Ilesanmi Ayodeji, Peter Sesan Ale, Felix Adeodu, Adefemi Mpofu, Khumbulani Department of Mechanical & Mechatronics Engineering Achievers University Owo Nigeria Department of Industrial & Production Engineering Federal University of Technology Akure Nigeria Department of Engineering & Space Systems National Space Research and Development Agency Abuja Nigeria Department of Mechanical Engineering University of South Africa Florida South Africa Department of Industrial Engineering Tshwane University of Technology Pretoria0001 South Africa

Cutting stock problem is a problem generally encountered in many manufacturing industries such as the furniture, clothing, glass production, leather, paper, textile, metals industries amongst others most especially during mass production. The problem usually arises during roll slitting whereby a large role is to be cut into smaller pieces. The challenge may be further compounded due to constraints and different variants that arises from product customization, process and machinery as well as customer requirements and quality issues. To address this problem, this study develops a linear integer programming technique and provides a practical guided approach. First mathematical formulation (having objective function and constraints) comprising of a list of q orders, that requires p j pieces was formulated and a list of all possible cuts combination of configuration and patterns were derived. The linear integer program was solved in the MATLAB 2022 environment. The results indicated that the large rolls can be cut into the desired length, number, patterns and configuration in a time effective manner using the developed linear integer programming technique. The results further show that for the total wastes generated was 24 for the optimal solutions. This number of wastes can be considered to be minimal considering the volume of demand and patterns generated from the stock material. Furthermore, 6 out of the 7 pattern optimal solutions generated zero waste. This study provides theoretical and empirical findings that can assist the manufacturing industries in minimizing time and cost variables while addressing stock cutting problems. © 2024 Elsevier B.V.. All rights reserved.

关键词： integer linear programming

来源：评论

学校读者我要写书评

暂无评论

The Quantitative Analysis of Equipment Operational Test Credibility Based on Dynamic programming and 0-1 integer linear programming

The Quantitative Analysis of Equipment Operational Test Cred...

引用

International Conference on Industrial Informatics, Computing Technology, Intelligent Technology, Industrial Information Integration (ICIICII)

作者： Zhen Lei Yan Sun Yun-han Song Dong Li Department of Scientific Research Academy of Armored Force Engineering Beijing China Department of Equipment Command and Administration Academy of Armored Force Engineering Beijing China

ISBN: (纸本)9781467383134

This paper takes the operational test credibility as the analysis object, designs multi-stage test patterns through quantitative decision analysis, thus maximizes the system test credibility. A dynamic programming based model for the credibility of equipment operational test is established. In addition, a method based on the 0-1 integer linear programming is also used and transformed to fit for the minimum path problem. The experimental results indicate that the methods proposed by this paper are effective and advanced.

关键词： integer linear programming Dynamic programming Mathematical model Reliability Test equipment linear programming Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Energy-aware optimal clustering in wireless sensor network using integer/linear programming

Energy-aware optimal clustering in wireless sensor network u...

引用

International Conference on Information Technology and Electrical Engineering (ICITEE)

作者： Zahra Eskandari Seyed Amin Hosseini Seno Deris Stiawan Bedine Kerim Rahmat Budiarto Dept. of Comp. Eng. Quchan University of Advanced Technology Iran N/W Research Lab. Ferdowsi University of Mashhad Iran Dept. of Comp. Eng. Universitas Sriwijaya Palembang Indonesia Dept. of IT College Albaha University Saudi Arabia Dept. of CIS College Albaha University Saudi Arabia

ISBN: (纸本)9781509041404

Clustering is a hierarchical method to data transmission in wireless sensor networks, which has a considerable effect on energy conservation. A balanced and efficient clustering has an important role in these networks. This paper discusses an optimal clustering method in wireless sensor network. Firstly, by considering energy and distance parameters, we model the clustering problem using two techniques, integer linear programming and linear programming. Then we propose a clustering algorithm based on the optimal selected cluster heads. Experimental results shown that linear programming technique has better performance in energy consumption and network lifetime in comparison to the integer linear programming technique.

关键词： Clustering algorithms linear programming integer linear programming Algorithm design and analysis Energy consumption Optimization Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：