An effective spare part supply system planning is essential to achieve a high capital asset availability. We investigate the design problem of a repair shop in a single echelon repairable multi-item spare parts supply...
详细信息
the multi-objective integerprogramming problems in large scale are considered time consuming. In the past, mathematical structures were used that can get benefits of high processing powers and parallel processing. th...
详细信息
ISBN:
(纸本)9781424458288;9789774033964
the multi-objective integerprogramming problems in large scale are considered time consuming. In the past, mathematical structures were used that can get benefits of high processing powers and parallel processing. the Branch and Bound (B&B) algorithm is one of the most used methods to solve combinatorialoptimization problems. A general approach to generate all non-dominated solutions of the multi-objective integerprogramming (MOIP) Problem is developed. In this paper, a supervisor-master-sub-master-worker algorithm to solve large scale integer multi-objective problems that can get the benefits of mathematical structures and high processing powers has been proposed. this approach addresses several issues related to the characteristics of the algorithm itself and the properties of parallel computing systems. From the solved benchmark example this algorithm proved to provide a considerable high performance. Results show that a consistently better efficiency can be achieved in solving integer equations, providing reduction of time.
Planning and resource management are important aspects of a company's operational sustainability. With good management, companies can achieve their targets while minimizing operational costs. the same goes for hos...
详细信息
We consider First-Order Hybrid Petri Nets (FOHPN), a model that consists of continuous places holding fluid, discrete places containing a non-negative integer number of tokens, and transitions, either discrete or cont...
详细信息
We consider First-Order Hybrid Petri Nets (FOHPN), a model that consists of continuous places holding fluid, discrete places containing a non-negative integer number of tokens, and transitions, either discrete or continuous. this Petri net model reveals itself to be particularly suited to modeling manufacturing systems and its control can be efficiently framed as a conflict resolution policy that aims at optimizing a given objective function. the use of linear algebra leads to sensitivity analysis that allows one to study how changes in the structure of the model influence the optimal behavior. It further enables us to determine admissible ranges of variation for some design parameters in order to improve the optimal myopic solution.
Constraints applied on classic frequent patterns are too strict and may cause interesting patterns to be missed. Hence, researchers have proposed to mine a more relaxed version of frequent patterns, where transactions...
详细信息
Constraints applied on classic frequent patterns are too strict and may cause interesting patterns to be missed. Hence, researchers have proposed to mine a more relaxed version of frequent patterns, where transactions are allowed to miss some items in the itemset they support. Patterns exhibiting such "faults" are called frequent fault-tolerant patterns (FFT-patterns) if they are significant in number. In this paper, the term "pattern" is distinguished from "item-set" as referring to a pair (tidset x itemset). Unlike classical frequent patterns, the number of FFT-patterns grows exponentially not only withthe number of items, but also withthe number of transactions. Since the latter may reach millions, mining FFT-patterns by enumerating them becomes infeasible. Hence, the challenge is to represent FFT-patterns concisely without losing any useful information. To address this, we draw on the observation that, in transactional databases, the transactions themselves are not important from the data mining point-of-view;i.e. researchers are interested in finding itemsets contained in lots of transactions, rather than in the transactions per se. therefore, we propose to mine only the frequent itemsets along withthe statistical information of the supporting transaction sets, rather than enumerate entire FFT-patterns. then we present our approach - the BIAS framework, consisting of Backtracking algorithm, integer Linear programming (ILP) constraints, and aggregation statistics to solve this problem. Algorithms under this framework not only increase the efficiency of the FFT-patterns mining process by more than an order of magnitude, but also provide a more comprehensive analysis of FFT-Patterns.
暂无评论