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

Item-Location Assignment Using Fuzzy Logic Guided Genetic Algorithms

IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION 2008年第6期12卷 765-780页

作者： Lau, Henry C. W. Chan, T. M. Tsui, W. T. Hong Kong Polytech Univ Dept Ind & Syst Engn Kowloon Hong Kong Peoples R China

In today's logistics environment, large-scale combinatorial problems will inevitably be met during industrial operations. This paper deals with a novel real-world optimization problem, called the item-location assignment problem, faced by a logistics company in Shenzhen, China. The objective of the company in this particular operation is to assign items to suitable locations such that the required sum of the total traveling time of the workers to complete all orders is minimized. A stochastic search technique called fuzzy logic guided genetic algorithms (FLGA) is proposed to solve this operational problem. In GA, a specially designed crossover operation, called a shift and uniform based multi-point (SUMP) crossover, and swap mutation are adopted. The performance of this novel crossover operation is tested and is shown to be more effective by comparing it to other crossover methods. Furthermore, the role of fuzzy logic is to dynamically adjust the crossover and mutation rates after each ten consecutive generations. In order to demonstrate the effectiveness of the FLGA and make comparisons with the FLGA through simulations, various search methods such as branch and bound, standard GA (i.e., without the guide of fuzzy logic), simulated annealing, tabu search, differential evolution, and two modified versions of differential evolution are adopted. Results show that the FLGA outperforms the other search methods in all of the three considered scenarios.

关键词： Genetic algorithms item-location assignment linear integer programming logistics optimization

来源：评论

学校读者我要写书评

暂无评论

Joint optimization of building-envelope and heating-system retrofits at territory scale to enhance decision-aiding

引用

APPLIED ENERGY 2020年第0期264卷 114639-000页

作者： Rogeau, A. Girard, R. Abdelouadoud, Y. Thorel, M. Kariniotakis, G. PSL Univ Res Ctr PERSEE MINES ParisTech CS 102071 Rue Claude Daunesse F-06904 Sophia Antipolis France Ctr Sci & Tech Batiment Direct Energie Environm 84 Ave Jean Jaures F-77447 Marne La Vallee 2 France Ctr Sci & Tech Batiment Direct Technol Informat 84 Ave Jean Jaures F-77447 Marne La Vallee 2 France

Reduction of energy consumption in the building sector has been identified as a major instrument to tackle global climate change and improve sustainability. In this paper, we propose a methodology to address a retrofit planning problem at a community level, with a building resolution. The resulting tool helps local decision-makers identify pertinent actions to improve the environmental behavior of their territories. Two building retrofit levers are considered, namely envelope insulation and heating systems replacement. Retrofit planning is treated here as a single-objective optimization problem aimed at reducing the total costs of retrofit actions by minimizing their net present value. A multidimensional multiple-choice knapsack problem formulation is proposed through the adoption of adequate decision variables. It suitably balances the complexity induced by the large number of potential retrofit action combinations and the number of variables in the problem and permits a linear formulation. An optimization of virtual building stocks is performed to highlight the developed model's capacity to tackle large problems (5,000 buildings) in a few minutes. Finally, three analyses finally are led on a real case-study territory, featuring both appropriate retrofit solutions and building stock information. Long-term evaluation of retrofit strategies over the short-term results in an additional 10% reduction of energy consumption and greenhouse gases emissions and encourages thermal insulation. When targeting a 40% reduction in energy demand, retrofit costs ranging from 20 to 800(sic)/m(2) are observed. Finally, the developed method was used to draw a CO2 abatement cost curve at territory level. A 70% reduction of emissions can be achieved with costs under 50 (sic)/tCO(2)e.

关键词： Energy savings Retrofit linear integer programming Cost optimization Knapsack problem Territory scale

来源：评论

学校读者我要写书评

暂无评论

Self-Scheduling Short-Term Unit Commitment and Loading Problem

引用

IEEE TRANSACTIONS ON POWER SYSTEMS 2016年第1期31卷 133-142页

作者： Seguin, Sara Cote, Pascal Audet, Charles Ecole Polytech Gerad Montreal PQ H3C 3A7 Canada Ecole Polytech Dept Math & Ind Engn Montreal PQ H3C 3A7 Canada Gerad Saguenay PQ G7S 4R5 Canada Rio Tinto Alcan Saguenay PQ G7S 4R5 Canada

This paper presents a new method for solving the short-term unit commitment and loading problem for a specific hydropower system. Dynamic programming is used to compute maximum power output generated by a power plant. This information is then used as input of a two-phase optimization process. The first phase solves the relaxation of a nonlinear mixed-integer program in order to obtain the water discharge, reservoir volume and number of units working at each period in the planning horizon. The second stage solves a linear integer problem to determine which combination of turbines to use at each period. The goal is to maximize total energy produced over all periods of the planning horizon which consists of a week divided in hourly periods. Start-up of turbines are penalized. Numerical experiments are conducted on thirty different test cases for two Rio Tinto Alcan power plants with five turbines each.

关键词： Hydro unit commitment and loading problem linear integer programming nonlinear programming optimization

来源：评论

学校读者我要写书评

暂无评论

Cyclic circular balanced and strongly balanced crossover designs through integer programming

引用

COMMUNICATIONS IN STATISTICS-THEORY AND METHODS 2016年第4期45卷 859-871页

作者： Mandal, B. N. Parsad, Rajender Gupta, V. K. IASRI Lib Ave New Delhi 110012 India

This article proposes a new linear integer programming approach to obtain cyclic circular balanced and strongly balanced crossover designs for a given number of treatments v, number of periods p, and number of units n. The linear integer programming approach has been used for generating a sequence of treatments to be assigned to the units. Using this approach, cyclic circular balanced and strongly balanced crossover designs for v < 30, p < 5, and 4 or * 4 have been generated, where (*) refers to the number of times each treatment is preceded by every other treatment excluding itself (including itself) depending on whether it is circular balanced or circular strongly balanced. The designs obtained are uniform over periods. A catalogue of designs for v < 30, p < 5, 4 or * 4, p < v with n 100 is given. The designs obtained are universally optimal over the class of all connected designs with a fixed number of treatments, number of periods, and number of sequences.

关键词： Balanced crossover designs Change over designs Crossover designs linear integer programming Strongly balanced crossover designs Primary 62K99 Secondary 65K05

来源：评论

学校读者我要写书评

暂无评论

An Energy-Aware Combinatorial Virtual Machine Allocation and Placement Model for Green Cloud Computing

引用

IEEE ACCESS 2021年 9卷 18625-18648页

作者： Gamsiz, Mustafa Ozer, Ali Haydar Marmara Univ Dept Comp Engn Fac Engn TR-34722 Istanbul Turkey

Resource allocation is an important problem for cloud environments. This paper introduces an energy-aware combinatorial auction-based model for the resource allocation problem in clouds. The proposed model allows users of a cloud to submit their virtual resource requests as bids using the provided bidding language which allows complementarities and substitutabilities among those resources to be declared. The model finds the most profitable mutually satisfiable set of winning bids, and the corresponding allocation of virtual resources to the users while considering the placement of virtual resources to the available physical resources in the cloud by executing an optimization problem. During the optimization, the model also takes account of the non-linear energy requirements of the physical resources based on their utilization levels to find a placement with the lowest energy cost, thus, providing an energy-aware solution to the resource allocation problem. The associated optimization problem is formally defined and formulated using integer programming. Since the optimization problem is intractable, four heuristic methods are also proposed. To evaluate the performance of the model and the proposed heuristic methods, several experiments are conducted on a comprehensive test suite. The results demonstrate the benefits of the proposed model, and the high-quality solutions provided by the proposed methods.

关键词： Cloud computing Resource management Servers Virtual machining Data centers Optimization Computational modeling Cloud computing combinatorial auction energy-aware green cloud heuristic method resource allocation linear integer programming virtual machine consolidation virtual machine placement

来源：评论

学校读者我要写书评

暂无评论

Reconstruction of hv-Convex Sets by Their Coordinate X-Ray Functions

引用

JOURNAL OF MATHEMATICAL IMAGING AND VISION 2014年第3期49卷 569-582页

作者： Nagy, Abris Vincze, Csaba Hungarian Acad Sci Inst Math MTA DE Res Grp Equat Funct & Curves H-4010 Debrecen Hungary Univ Debrecen H-4010 Debrecen Hungary Univ Debrecen Inst Math H-4010 Debrecen Hungary

Gardner and Kiderlen (Adv. Math. 214: 323-343, 2007) presented an algorithm for reconstructing convex bodies from noisy X-ray measurements with a full proof of convergence in 2007. We would like to present some new steps into the direction of reconstructing not necessarily convex bodies by the help of the continuity properties of so-called generalized conic functions. Such a function measures the average taxicab distance of the points from a given compact set K subset of R-N by integration. The basic result (Vincze and Nagy in J. Approx. Theory 164: 371-390, 2012) is that the generalized conic function associated to a compact planar set determines the coordinate X-rays and vice versa. Vincze and Nagy (Submitted to Aequationes Math., 2014) proved continuity properties of the mapping which sends connected compact hv-convex sets having the same axis parallel bounding box to the associated generalized conic functions. We use these results to present an algorithm for the reconstruction of compact connected hv-convex planar bodies given by their coordinate X-rays. The basic method is varied with the quota system scheme. Greedy and anti-greedy versions are also presented with examples.

关键词： Parallel X-ray Generalized conic Geometric tomography linear integer programming

来源：评论

学校读者我要写书评

暂无评论

A neural networks-based approach for strategic planning

引用

INFORMATION & MANAGEMENT 1999年第6期35卷 357-364页

作者： Chien, TW Lin, C Tan, B Lee, WC CUNY Bernard M Baruch Coll Dept Management Zicklin Sch Business New York NY 10010 USA Natl Cheng Kung Univ Dept Ind Engn Tainan 70101 Taiwan Natl Cheng Kung Univ Dept Business Adm Tainan 70101 Taiwan

We establish a systematic approach that incorporates neural networks in conjunction with portfolio matrices to assist managers in evaluating and forming strategic plans. Based on the principle of dispersing risks, we also provide a linear integer programming model, which helps in allocating the annual budget optimally among proposed strategies. The approach has been successfully implemented for a major food industry leader in Taiwan for its annual strategic planning. Although a particular portfolio matrix model was adopted in our approach, the framework proposed here can be modified to incorporate other strategy-evaluation measures. (C) 1999 Elsevier Science B.V. All rights reserved.

关键词： neural networks strategic planning linear integer programming portfolio matrices

来源：评论

学校读者我要写书评

暂无评论

Liveness-enforcing supervisor design for a class of generalised petri net models of flexible manufacturing systems

引用

IET CONTROL THEORY AND APPLICATIONS 2007年第4期1卷 955-967页

作者： Li, Z. Zhang, J. Zhao, M. Xidian Univ Sch Electromech Engn Xian 710071 Peoples R China

The importance of siphons is well recognised in the analysis and control of deadlocks in Petri nets. Deadlock prevention problems are considered for (SPR)-P-4, a class of generalised Petri nets, that can model well a large class of flexible manufacturing systems (FMS). Siphons in a plant net model are divided into elementary and dependent ones. Deadlock prevention is achieved by adding monitors (control places) to make every elementary siphon satisfy the maximal controlled-siphon property. Conditions are developed under which a dependent siphon is maximally controlled when its elementary siphons are so. The max-controllability of a dependent siphon is ensured by properly supervising the control depth variables of its elementary siphons via linear integer programming techniques. Compared with existing methods, this policy requires a much smaller number of supervisory monitors. Finally, the application of this approach is illustrated by an FMS example.

关键词： controllability linear programming generalised Petri net linear integer programming deadlock prevention flexible manufacturing system liveness-enforcing supervisor design Petri nets max-controllability flexible manufacturing systems siphons integer programming

来源：评论

学校读者我要写书评

暂无评论

Using quality function deployment for collaborative product design and optimal selection of module mix

引用

COMPUTERS & INDUSTRIAL ENGINEERING 2012年第4期63卷 1030-1037页

作者： Wang, Chih-Hsuan Chen, Hun-Nan Natl Chiao Tung Univ Dept Ind Engn & Management Hsinchu Taiwan

In response to fast-growing and rapidly-changing markets, launching new products faster than competitors cannot only assist firms in acquiring larger market share but also reducing development lead time, significantly. However, owing to its intrinsically uncertain properties of managing NPD (new product development), manufacturing companies often struggle with the dilemma of increasing product variety or controlling manufacturing complexity. In this study, a fuzzy MCDM (multi-criteria decision making) based QFD (quality function deployment) which integrates fuzzy Delphi. fuzzy DEMATEL (decision making trial and evaluation laboratory), with LIP (linear integer programming) is proposed to assist an enterprise in fulfilling collaborative product design and optimal selection of module mix when aiming at multi-segments. In particular, Fuzzy Delphi is adopted to gather marketing information from invited customers and their assessments of marketing requirements are pooled to reach a consensus;fuzzy DEMATEL is utilized to derive the priorities of technical attributes in a market-oriented manner;and LIP is used to maximize product capability with consideration of supplier's budget constraints of manufacturing resources. Furthermore, a real case study on developing various types of sport and water digital cameras is demonstrated to validate the proposed approach. (C) 2012 Elsevier Ltd. All rights reserved.

关键词： QED NPD Fuzzy Delphi Fuzzy DEMATEL linear integer programming

来源：评论

学校读者我要写书评

暂无评论

A linearization method for quadratic minimum spanning tree problem

引用

INTERNATIONAL JOURNAL OF FUZZY SYSTEMS 2008年第4期10卷 287-291页

作者： Yu, Jing-Rung Shi, Ren-Xiang Sheu, Her-Jiun Natl Chi Nan Univ Dept Informat Management Puli Nantou Hsien Taiwan

The crisp and fuzzy quadratic minimum spanning tree (Q-MST) problem can be formulated as a linear, model, and thus, the global optimum can be obtained by the proposed method. Conventionally, the Q-MST problem, which contains a quadratic term in the objective function, is solved by genetic algorithm and other heuristic methods. However, these methods cannot guarantee to obtain a global optimal solution. To address this issue, the proposed method transforms the quadratic term into linear formulations for crisp and fuzzy Q-MST problems, and yields the global optimum solutions by linear integer programming. Two examples are given to demonstrate the proposed method in greater detail.

关键词： linear integer programming Network optimization Quadratic minimum spanning tree

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：