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

A zero-one integer programming for preventive maintenance scheduling for electricity and distiller plants with production

引用

JOURNAL OF QUALITY IN MAINTENANCE ENGINEERING 2020年第4期26卷 555-574页

作者： Alhamad, Khaled Alhajri, Mohammad Coll Technol Studies Kuwait Kuwait

Purpose The purpose of this paper is to describe a method that has been set up to schedule preventive maintenance (PM) tasks for power and water plants with all constraints such as production and maintenance. Design/methodology/approach The proposed methodology relies on the zero-one integer programming model that finds the maximum number of power and water units available in separate generating units. To verify this, the model was implemented and tested as a case study in Kuwait for the Cogeneration Station. Findings An effective solution can be achieved for scheduling the PM tasks and production at the power and water cogeneration plant. Practical implications The proposed model offers a practical method to schedule PM of power and water units, which are expensive equipment. Originality/value This proposed model is an effective decision-making tool that provides an ideal solution for preventive maintenance scheduling problems for power and water units in a cogeneration plant, effectively and complies with all constraints.

关键词： Optimization Scheduling Preventive maintenance Maintenance planning Maintenance optimization zero-one integer programming

来源：评论

学校读者我要写书评

暂无评论

Combination and placement of sustainable drainage system devices based on zero-one integer programming and schemes sampling

引用

JOURNAL OF ENVIRONMENTAL MANAGEMENT 2019年 238卷 59-63页

作者： Wang, Mingming Wang, Yun Gao, Xuerui Sweetapple, Chris Anhui Univ Technol Sch Architectural & Civil Engn Maxiang Rd Maanshan 243032 Anhui Peoples R China Univ Exeter Coll Engn Math & Phys Sci Ctr Water Syst North Pk Rd Exeter EX4 4QP Devon England

The combination and placement of sustainable drainage systems (SuDS) devices is important for system design, but differing site characteristics and device properties can make this a challenging task. Opinion-based and optimization-based approaches have the disadvantages of subjectivity and excessive computational burden respectively. This paper presents a new framework for SuDS device combination and placement in system design. It integrates zero-one integer programming, random sampling, scheme filtering and cost-effectiveness analysis. The effectiveness of the framework is tested with a SuDS device placement design case in Chizhou city, Anhui province, China. The proposed framework will help to objectively choose the best SuDS device combination and placement scheme for cost-effective implementation.

关键词： Device placement Sustainable drainage systems (SuDS) zero-one integer programming Random sampling Cost-effectiveness analysis

来源：评论

学校读者我要写书评

暂无评论

Combining fuzzy AHP and fuzzy Kano to optimize product varieties for smart cameras: A zero-one integer programming perspective

引用

APPLIED SOFT COMPUTING 2014年 22卷 410-416页

作者： Wang, Chih-Hsuan Wang, Juite Natl Chiao Tung Univ Dept Ind Engn & Management Hsinchu 300 Taiwan Natl Chung Hsing Univ Grad Inst Technol Management Taichung 402 Taiwan

In an era of global customization, dominating the majority market with a single product has become increasingly difficult and almost impossible for most companies. In contrast, they must provide various product varieties that attract diverse customers, particularly when acquiring distinct market segments. In practice, however, most companies cannot effectively reduce the gap between customer requirements and design characteristics, although this impacts the profitability and future growth of companies. Meanwhile, companies often get stuck in the trade-offs between enhancing product varieties and controlling manufacturing costs. Accordingly, this paper proposes a hybrid framework that combines fuzzy analytical hierarchy process (AHP), fuzzy Kano model with zero-one integer programming (ZOIP) to incorporate customer preferences and customer perceptions into the decision-making process of product configuration. Specifically, fuzzy AHP is used to extract customer preferences for core attributes while fuzzy Kano model is utilized to elicit customer perceptions of optional attributes. Finally, by virtue of ZOIP, the optimal product varieties ( smart cameras) for distinct segments are determined by maximizing overall customer utility (OCU) and taking a firm's pricing policy into account. (C) 2014 Elsevier B.V. All rights reserved.

关键词： Customer preference Customer perception Fuzzy analytical hierarchy process Fuzzy Kano model zero-one integer programming

来源：评论

学校读者我要写书评

暂无评论

Trains scheduling problem with multiple lines

引用

SCIENTIFIC REPORTS 2024年第1期14卷 1-20页

作者： Danavulapadu, Venkata Prathap Singamsetty, Purusotham Vellore Inst Technol Sch Adv Sci Dept Math Vellore 632014 Tamil Nadu India

This study explores the problem of train scheduling (or) train timetabling and its impact on the administration of railway management. This is a highly dependable and effective public transportation system. The problem considers both single and multiple tracks along with multiple platforms with varying train capacities (like speed, passengers, and so on). Let the tracks link two major stations source and destination with intermediate stations. A subset of intermediate stations will function as junctions. A finite number of trains be available at the source for the passengers/cargo transit movements. The profit which is generated from the shipment of passengers between a pair of stations is known in advance. The train's travel time between the stations and halting time at the stations are predefined. The arrival and departure times at the stations are calculated through the travel time and halting time. All the trains should starts from the source station and continue the journey through the intermediate stations to reach the destination station. Overtaking of the trains is permitted only at the intermediate stations. The trains must make a halt at one or more intermediate stations before reaching the destination. Now the objective is to find the best train operating schedule that maximizes the profit within the admissible travel time threshold. A zero-one integer linear programming is used to model this problem mathematically. For a better understanding of this problem, a case study is considered from the Indian railway network with two major stations Chennai and Hyderabad. A branch and bound \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$(B\&B)$$\end{document} algorithm is proposed to determine an optimal operating schedule. In addition, the experiments are carried out on a wide range

关键词： Train scheduling Routing Branch and bound algorithm zero-one integer programming

来源：评论

学校读者我要写书评

暂无评论

Combining solutions of the optimum satisfiability problem using evolutionary tunneling

Combining solutions of the optimum satisfiability problem us...

引用

作者： da Silva, Rodrigo Ferreira Brno University of Technology

The optimum satisfiability problem involves determining values for Boolean variables to satisfy a Boolean expression, while maximizing the sum of coefficients associated with the variables chosen to be true. Existing literature has identified a tabu search heuristic as the best method to deal with hard instances of the problem. This paper combines the tabu search with a simple evolutionary heuristic based on the idea of tunneling between local optima. When combining a set of solutions, variables with common values in all solutions are identified and fixed. The remaining free variables in the problem may be decomposed into several independent subproblems, so that parts of the solutions combined can be extracted and combined in an improved solution. This solution can be further improved by applying the tabu search in an improvement stage. The value of the new heuristic is demonstrated in extensive computational experiments on both existing and new test instances.

关键词： zero-one integer programming boolean optimization metaheuristic tabu search adaptive memory programming recombination operator

来源：评论

学校读者我要写书评

暂无评论

01IP and QUBO: Optimization Methods for Redundancy Allocation in Complex Systems 23

01IP and QUBO: Optimization Methods for Redundancy Allocatio...

引用

23rd International Conference on System Theory, Control and Computing (ICSTCC)

作者： Leon, Florin Cascaval, Petru Gheorghe Asachi Tech Univ Isai Dept Comp Sci & Engn Iasi Romania

ISBN: (纸本)9781728106991

This paper addresses the issue of optimal allocation of spare modules in complex series-parallel redundant systems in order to achieve a required reliability with minimal cost. To solve this problem, two optimization techniques are considered: zero-one integer programming (01IP) and Quadratic Unconstrained Binary optimization (QUBO). The results are compared with those given by an approximate analytical method based on Lagrange multipliers. For large systems, the numerical results presented show that the 01IP and QUBO methods give better solutions. A comparative time complexity analysis of 01IP and QUBO is also presented.

关键词： active redundancy cost minimization in reliability allocation zero-one integer programming quadratic unconstrained binary optimization

来源：评论

学校读者我要写书评

暂无评论

A finite dominating set of cardinality O(k) and a witness set of cardinality O(n) for 1.5D terrain guarding problem

引用

ANNALS OF OPERATIONS RESEARCH 2017年第1-2期254卷 37-46页

作者： Elis, Haluk Bilkent Univ Dept Ind Engn TR-06800 Ankara Turkey

1.5 dimensional (1.5D) terrain is characterized by a piecewise linear curve. Locating minimum number of guards on the terrain (T) to cover/guard the whole terrain is known as 1.5D terrain guarding problem. Approximation algorithms and a polynomial-time approximation scheme have been presented for the problem. The problem has been shown to be NP-Hard. In the problem, the set of possible guard locations and the set of points to be guarded are uncountable. To solve the problem to optimality, a finite dominating set (FDS) of size and a witness set of size have been presented, where n is the number of vertices on T. We show that there exists an even smaller FDS of cardinality and a witness set of cardinality O(n), where k is the number of convex points. Convex points are vertices with the additional property that between any two convex points the piecewise linear curve representing the terrain is convex. Since it is always true that for 2 and since it is possible to construct terrains such that , the existence of an FDS with cardinality O(k) and a witness set of cardinality of leads to the reduction of decision variables and constraints respectively in the zero-one integer programming formulation of the problem.

关键词： Finite dominating sets Location Terrain guarding problem zero-one integer programming

来源：评论

学校读者我要写书评

暂无评论

TERRAIN VISIBILITY AND GUARDING PROBLEMS

TERRAIN VISIBILITY AND GUARDING PROBLEMS

引用

作者： Haluk Elis Bilkent University

学位级别：博士

Watchtowers are located on terrains to detect fires, military units are deployed to watch the terrain to prevent infiltration, and relay stations are placed such that no dead zone is present on the terrain to maintain uninterrupted communication. In this thesis, any entity that is capable of observing or sensing a piece of land or an object on the land is referred to as a guard. Thus, watchtowers, military units and relay stations are guards and so are sensors, observers (human beings), cameras and the like. Observing, seeing, covering and guarding will mean the same. The viewshed of a given guard on a terrain is defined to be those portions of the terrain visible to the guard and the calculation of the viewshed of the guard is referred to as the viewshed problem. Locating minimum number of guards on a terrain (T) such that every point on the terrain is guarded by at least one of the guards is known as terrain guarding problem (TGP). Terrains are generally represented as regular square grids (RSG) or triangulated irregular networks (TIN). In this thesis, we study the terrain guarding problem and the viewshed problem on both representations. The first problem we deal with is the 1.5 dimensional terrain guarding problem (1.5D TGP). 1.5D terrain is a cross-section of a TIN and is characterized by a piecewise linear curve. The problem has been shown to be NP-Hard. To solve the problem to optimality, a finite dominating set (FDS) of size O(n 2 ) and a witness set of size O(n 2 ) have been presented earlier, where n is the number of vertices on T. An FDS is a finite set of points that contains an optimal solution to an optimization problem possibly with an uncountable feasible set. A witness set is a discretization of the terrain, and thus a finite set, such that guarding of the elements of the witness set implies guarding of T. We show that there exists an FDS, composed of convex points and dip points, with cardinality O(n). We also prove that there exist witness sets of

关键词： Terrain guarding problem viewshed problem terrain approximation location problems finite dominating sets witness sets blocking path problem zero-one integer programming

来源：评论

学校读者我要写书评

暂无评论

Preventive maintenance scheduling of multi-cogeneration plants using integer programming

引用

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY 2008年第4期59卷 503-509页

作者： Alardhi, M. Labib, A. W. Univ Manchester Sch Mech Aerosp & Civil Engn Manchester M60 1QD Lancs England Univ Portsmouth Portsmouth Hants England

Maintenance scheduling of cogeneration plants, which produce both electric power and desalinated water, is a typical complex process with long-term operations and planning problems. The plants' maintenance scheduling process has to determine the appropriate schedule for preventive maintenance, while satisfying all the system constraints and maintaining adequate system availability. It is an optimization problem and the maintenance and system constraints include the crew constraint, maintenance window constraint and time limitation constraint. In this paper, an integer linear-programming model, which has been developed, is described which schedules the preventive maintenance tasks in a multi-cogeneration plant. Results of a test example of such a plant situated in Kuwait are presented to show the applicability of the approach.

关键词： cogeneration plant maintenace scheduling zero-one integer programming preventive maintenance

来源：评论

学校读者我要写书评

暂无评论

A data mining approach to product assortment and shelf space allocation

引用

EXPERT SYSTEMS WITH APPLICATIONS 2007年第4期32卷 976-986页

作者： Mu-Chen Chen Chia-Ping Lin Natl Chiao Tung Univ Inst Traff & Transportat Taipei 10012 Taiwan SAS Taipei Taiwan

In retailing, a variety of products compete to be displayed in the limited shelf space since it has a significant effect on demands. To affect customers' purchasing decisions, retailers properly make decisions about which products to display (product assortment) and how much shelf space to allocate the stocked products (shelf space allocation). In the previous studies, researchers usually employed the space elasticity to optimize product assortment and space allocation models. The space elasticity is usually used to construct the relationship between shelf space and product demand. However, the large number of parameters requiring to estimate and the he non-linear nature of space elasticity can reduce the efficacy of the space elasticity based models. This paper utilizes a popular data mining approach, association rule mining, instead of space elasticity to resolve the product assortment and allocation problems in retailing. In this paper, the multi-level association rule mining is applied to explore the relationships between products as well as between product categories. Because association rules are obtained by directly analyzing the transaction database, they can generate more reliable information to shelf space management. (C) 2006 Elsevier Ltd. All rights reserved.

关键词： shelf space management data mining multi-level association rules zero-one integer programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：