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

5th International Conference on Industrial and Business Engineering (ICIBE)

作者： Dianawati, Fauzia Kristianto, Joshua Univ Indonesia Depok Indonesia

ISBN: (纸本)9781450376532

Indonesia's logistic performance index in 2018 was ranked 46th in the world, and 5th in the ASEAN region, with the infrastructure sub-indicator was the second lowest of six others. The government added new 200 to the 760 kilometres Trans-Java toll road. It will be equipped with 61 rest areas along the road. In Eid al-Fitr holiday, where traffic increased up to 460%, rest areas were full, resulting in heavy congestion. In this research, integer linear programming (ILP) is used to model the parking layout to determine the optimal parking angle and the parking lot number. The objective is to maximize the parking area capacity. The decision variables are the number of parking rows (X-et,X-theta, X-ep,X-theta, X-e,X-theta, X-ip,(theta), X-i,X-theta) and the number of parking vehicles (N-et,N-theta, N-ep,N-theta, N-e,N-theta, N-ip,(theta), N-ip,N-theta) both based on five parking angles (0 degrees, 30 degrees, 45 degrees, 60 degrees, 90 degrees). The constraints are the width of the parking lot (W), the length (L), and length of area in the middle line (L') and non-negative constraints. The study was conducted at rest area km 207A in Palikanci toll road. The existing parking area was divided into 15 areas to fit the model. The result showed that integer linear programming can enhance the parking capacity, from 41 to 105 buses/trucks and 258 to 473 cars. This research will give impact to business profit of the parking management, reduce toll road traffic congestion, and improve the comfort of the rest area.

关键词： Optimization Parking capacity Rest area integer linear programming Ttransportation infrastructure

来源：评论

学校读者我要写书评

暂无评论

A Novel integer linear programming Formulation for Designing Transparent WDM Optical Core Networks 12

A Novel Integer Linear Programming Formulation for Designing...

引用

12th International Conference on Advanced Technologies for Communications (ATC)

作者： Dao Thanh Hai Phenikaa Univ Fac Comp Sci Hanoi Vietnam

ISBN: (纸本)9781728123929

The explosive growth of Internet traffic driven by the rise and popularity of bandwidth-intensive services such as virtual realities, big data exchanges and artificial intelligence necessitates for a re-consideration of optical transport networks toward greater capital and operational efficiency from both designing, planning and management perspectives. Thanks to mainly the significant advances in transmission technologies and reconfigurable optical add/drop multiplexers, transparent (all-optical) core networks with wavelength-division multiplexing (WDM) technologies have been well-adopted by network operators as costly optical-electrical-optical interfaces are eliminated together with the merit of scalable upgrade. Efficient designing of such transparent networks therefore has been of ever-growing importance as the spectrum capacity has to be optimized while maintaining the efficiency of operations. Conventional approaches based on integer linear programming formulations and/or heuristic algorithms have nevertheless been focused on optimizing a single metric, i.e., wavelength count or wavelength link usage, and doing so possibly poses penalties to the remaining objectives. In addressing this issue, this paper presents a new integer linear programming formulation incorporating both two performance metrics into consideration with an integrated objective function. We then introduce a framework for analyzing and properly setting up the weight coefficients of integrated objective function so as to guarantee the order of optimization. Extensive numerical studies on realistic topologies highlight the effectiveness of our proposal compared to conventional designs based on single objective formulation in the literature.

关键词： Routing and wavelength assignment WDM optical networks integer linear programming Network Optimization Transparent networks

来源：评论

学校读者我要写书评

暂无评论

Mixed integer linear programming Approach to Optimize the Hybrid Renewable Energy System Management for supplying a Stand-Alone Data Center 10

Mixed Integer Linear Programming Approach to Optimize the Hy...

引用

10th International Green and Sustainable Computing Conference (IGSC)

作者： Haddad, Marwa Nicod, Jean Marc Varnier, Christophe Pera, Marie-Cecile Univ Bourgogne Franche Comte FEMTO ST Inst CNRS ENSMMUTBM F-25000 Besancon France Univ Bourgogne Franche Comte CNRS FCLAB FR 3538 F-90010 Belfort France

ISBN: (纸本)9781728154169

The trend toward server-side computing and the exploding popularity of Internet services due to the increasing of demand for networking, storage and computation has created a world-wild energetic problem and a significant carbon footprint. These environmental concerns prompt to several green energy initiative aiming either to increase data center efficiency and/or to the use of green energy supply. In this regard, As part of the ANR DATAZERO project, many researchers are working to define main concepts of an autonomous green data center only powered by renewable energies. Thus, the present paper proposes a mixed integer linear program to optimize the commitment of a hybrid energy system composed of wind turbines, solar panels, batteries and hydrogen storage systems. The approach is used to supply a data center demand and takes the weather forecasts into account at the time of optimization. Different time window resolution are applied in order to verify the best time window for decision making.

关键词： Renewable energy supply Operational research integer linear programming Hybrid energy system Energy management Optimization

来源：评论

学校读者我要写书评

暂无评论

Tight Complexity Lower Bounds for integer linear programming with Few Constraints 36

Tight Complexity Lower Bounds for Integer Linear Programming...

引用

36th International Symposium on Theoretical Aspects of Computer Science (STACS)

作者： Knop, Dusan Pilipczuk, Michal Wrochna, Marcin TU Berlin Fac IV Algorithm & Computat Complex Berlin Germany Czech Tech Univ Fac Informat Technol Dept Theoret Comp Sci Prague Czech Republic Univ Warsaw Inst Informat Warsaw Poland Univ Oxford Oxford England

ISBN: (纸本)9783959771009

We consider the standard ILP FEASIBILITY problem: given an integer linear program of the form {Ax = b, x 0}, where A is an integer matrix with k rows and Ji columns, x is a vector of Ji variables, and b is a vector of k integers, we ask whether there exists x E Ilk that satisfies Ax = b. Each row of A specifies one linear constraint on x;our goal is to study the complexity of ILP FEASIBILITY when both k, the number of constraints, and MAILD.0, the largest absolute value of an entry in A, are small. Papadimitriou [29] was the first to give a fixed-parameter algorithm for ILP FEASIBILITY under parameterization by the number of constraints that runs in time ((MAIL, +1113110.0) " k) lk2). This was very recently improved by Eisenbrand and Weismantel [9], who used the Steinitz lemma to design an algorithm with running time (142410.) (k) "11b112, which was subsequently improved by Jansen and Rohwedder [17] to 0(14241o)k " log MbIfx,. We prove that for {0, 1}-matrices A, the running time of the algorithm of Eisenbrand and Weismantel is probably optimal: an algorithm with running time 2 (k log k) " 14 0Y(k) would contradict the Exponential Time Hypothesis (ETH). This improves previous non-tight lower bounds of Fomin et al. [10]. We then consider integer linear programs that may have many constraints, but they need to be structured in a "shallow" way. Precisely, we consider the parameter dual treedepth of the matrix A, denoted tdD (A), which is the treedepth of the graph over the rows of A, where two rows are adjacent if in some column they simultaneously contain a non-zero entry. It was recently shown by KouteckST 0 (td (A)) et al. [24] that ILP FEASIBILITY can be solved in time 112,1112 D (k loglIblfx,)(9(1). We present a streamlined proof of this fact and prove that, again, this running time is probably optimal: even assuming that all entries of A and b are in {-1, 0, 1}, the existence of an algorithm with running time 2' tdp (A)) " (k + f)(9(1) would contradict the ETH.

关键词： integer linear programming fixed -parameter tractability ETH

来源：评论

学校读者我要写书评

暂无评论

A novel integer linear programming model for routing and spectrum assignment in optical networks

A novel integer linear programming model for routing and spe...

引用

Federated Conference on Computer Science and Information Systems (FedCSIS)

作者： Hadhbi, Youssouf Kerivin, Herve Wagler, Annegret Univ Clermont Auvergne LIMOS UMR 6158 CNRS Clermont Ferrand France

ISBN: (纸本)9788395235788

The routing and spectrum assignment problem is an NP-hard problem that receives increasing attention during the last years. Existing integer linear programming models for the problem are either very complex and suffer from tractability issues or are simplified and incomplete so that they can optimize only some objective functions. The majority of models uses edge path formulations where variables are associated with all possible routing paths so that the number of variables grows exponentially with the size of the instance. An alternative is to use edge node formulations that allow to devise compact models where the number of variables grows only polynomially with the size of the instance. However, all known edge-node formulations are incomplete as their feasible region is a superset of all feasible solutions of the problem and can, thus, handle only some objective functions. Our contribution is to provide the first complete edge-node formulation for the routing and spectrum assignment problem which leads to a tractable integer linear programming model. Indeed, computational results show that our complete model is competitive with incomplete models as we can solve instances of the RSA problem larger than instances known in the literature to optimality within reasonable time and w.r.t. several objective functions. We further devise some directions of future research.

关键词： Routing linear programming Computational modeling integer linear programming Wavelength division multiplexing Optical network units

来源：评论

学校读者我要写书评

暂无评论

integer linear programming for Three-Subset Meet-in-the-Middle Attacks: Application to GIFT 13th

Integer Linear Programming for Three-Subset Meet-in-the-Midd...

引用

13th International Workshop on Security (IWSEC)

作者： Sasaki, Yu NTT Secure Platform Labs 3-9-11 Midori Cho Musashino Tokyo 1808585 Japan

ISBN: (纸本)9783319979168;9783319979151

This article presents a new usage of integer-linearprogramming (ILP) for block-cipher analysis, in particular for automating a procedure to search for optimal independent key bits used in a meet-in-the-middle (MitM) attack. The research is motivated by a recent lightweight block-cipher design GIFT, in which the evaluation by the designers has some room to be improved. The developed tool finds optimal choices of independent key bits, which improves the complexity of the 15-round MitM attack, the current best attack, on GIFT-64 from 2(120) to 2(112).

关键词： GIFT Block cipher Cryptanalysis Symmetric-key Meet-in-the-middle integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Shortest Path Tour Problem Based integer linear programming for Service Chaining in NFV Networks

Shortest Path Tour Problem Based Integer Linear Programming ...

引用

IEEE Conference on Network Softwarization (NetSoft)

作者： Masahiro Sasabe Takanori Hara Graduate School of Science and Technology Nara Institute of Science and Technology 8916-5 Takayama-cho Ikoma Nara Japan

ISBN: (数字)9781728156842

ISBN: (纸本)9781728156859

Network functions virtualization (NFV) is a new paradigm to achieve flexible and agile network services by decoupling network functions from proprietary hardware and running them on generic hardware as virtual network functions (VNFs). In the NFV network, a certain network service can be modeled as a sequence of VNFs, called a service chain. Given a connection request (origin node, destination node, and service chain requirement, which is a sequence of functions), the service chaining problem aims to find an appropriate service path, which starts from the origin and ends with the destination while executing the VNFs at the intermediate nodes in the required order. Some existing work noticed that the service chaining problem was similar to the shortest path tour problem (SPTP). To the best of our knowledge, this is the first work that exactly formulates the service chaining problem as an SPTP-based integer linear program (ILP). Through numerical results, we show the SPTP-based ILP can support 1.30-1.77 times larger scale systems than the existing ILP.

关键词： Hardware Bandwidth Resource management integer linear programming Virtualization Network function virtualization Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

A New Sum Coloring-based integer linear programming for Solving the University Course Timetabling Problem

A New Sum Coloring-based Integer Linear Programming for Solv...

引用

“Organization of Knowledge and Advanced Technologies” (OCTA), International Multi-Conference on:

作者： Olfa Harrabi Jouhaina Chaouachi Siala Institut Supérieur de Gestion de Tunis Université de Tunis 41 Rue de la Liberté-Bouchoucha Bardo Tunisie Institut des Hautes Études Commerciales de Carthage Université de Carthage Rue Victor Hugo 2016 Carthage-Présidence Tunis Tunisie

ISBN: (数字)9781728164038

ISBN: (纸本)9781728164045

The drawing up of university course timetables is an ongoing challenge and laborious task which must be performed by an administrative staff working on the strength of their knowledge to fill a specific institution requirements. This paper proposes a novel integer programming model as an alternative to solve the treated optimization problem. Specifically, we address providing an optimum solution satisfying at most teachers' preferences. The computational results on a real case of study well illustrate a significant performance over the manual process on both computational time and solution quality.

关键词： linear programming integer linear programming Optimization Task analysis Human factors Europe Computational modeling

来源：评论

学校读者我要写书评

暂无评论

Topology optimization of binary structures using integer linear programming

引用

FINITE ELEMENTS IN ANALYSIS AND DESIGN 2018年 139卷 49-61页

作者： Sivapuram, R. Picelli, R. Univ Calif San Diego Struct Engn La Jolla CA 92093 USA Cardiff Univ Cardiff Sch Engn Queens Bldg14-17 Parade Cardiff CF24 3AA S Glam Wales

This work proposes an improved method for gradient-based topology optimization in a discrete setting of design variables. The method combines the features of BESO developed by Huang and Xie [1] and the discrete topology optimization method of Svanberg and Werme [2] to improve the effectiveness of binary variable optimization. Herein the objective and constraint functions are sequentially linearized using Taylor's first order approximation, similarly as carried out in [2]. integer linear programming (ILP) is used to compute globally optimal solutions for these linear optimization problems, allowing the method to accommodate any type of constraints explicitly, without the need for any Lagrange multipliers or thresholds for sensitivities (like the modern BESO [1]), or heuristics (like the early ESO/BESO methods [3]). In the linearized problems, the constraint targets are relaxed so as to allow only small changes in topology during an update and to ensure the existence of feasible solutions for the ILP. This process of relaxing the constraints and updating the design variables by using ILP is repeated until convergence. The proposed method does not require any gradual refinement of mesh, unlike in [2] and the sensitivities every iteration are smoothened by using the mesh-independent BESO filter. Few examples of compliance minimization are shown to demonstrate that mathematical programming yields similar results as that of BESO for volume-constrained problems. Some examples of volume minimization subject to a compliance constraint are presented to demonstrate the effectiveness of the method in dealing with a non-volume constraint. Volume minimization with a compliance constraint in the case of design-dependent fluid pressure loading is also presented using the proposed method. An example is presented to show the effectiveness of the method in dealing with displacement constraints. The results signify that the method can be used for topology optimization problems involvin

关键词： Topology optimization integer linear programming Relaxation Filter Truncation error Compliance Displacement constraint

来源：评论

学校读者我要写书评

暂无评论

An integer linear programming model and Adaptive Genetic Algorithm approach to minimize energy consumption of Cloud computing data centers

引用

COMPUTERS & ELECTRICAL ENGINEERING 2018年 67卷 551-565页

作者： Ibrahim, Huda Aburukba, Raafat O. El-Fakih, Khaled Amer Univ Sharjah Dept Comp Sci & Engn Sharjah 26666 U Arab Emirates

Cloud computing infrastructures are designed to support the accessibility and availability of various services to consumers over the Internet. Data centers hosting Cloud applications consume massive amount of power, contributing to high carbon footprints to the environment. Hence, solutions are needed to minimize the energy consumption. This paper focuses on the development of a dynamic task scheduling algorithm by proposing an integer linear programming (ILP) model that minimizes the energy consumption in a Cloud data center. Furthermore, an Adaptive Genetic Algorithm (GA) is proposed to reflect the dynamic nature of the Cloud environment and to provide a near optimal scheduling solution that minimizes the energy consumption. The proposed adaptive GA is validated by simulating the Cloud infrastructure and conducting a set of performance and quality evaluation study in this environment. The results demonstrate that the proposed solution offers performance gains with regards to response time and in reducing energy consumption. (C) 2018 Elsevier Ltd. All rights reserved.

关键词： Cloud computing Task scheduling Optimization integer linear programming Energy consumption Genetic algorithm Cloud data centers

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：