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

mixed integer linear programming approaches for land use planning that limit urban sprawl

COMPUTERS & INDUSTRIAL ENGINEERING 2016年 102卷 33-43页

作者： Kumar, Piyush Rosenberger, Jay M. Iqbal, Gazi Md Daud TMW Syst 899 Presidential Dr 117 Richardson TX 75081 USA Univ Texas Arlington Dept Ind Mfg & Syst Engn Arlington TX 76019 USA

Sprawl has a detrimental effect on quality of life and the environment. With dwindling resources and increasing populations, we must manage sprawl. Ewing et al. (2000) defined factors to measure sprawl in the present urban structure. The measures are divided into four broad categories, which are density factors, mixed use factors, street factors, and center factors, and can be used in future planning of metro areas. In this research, we develop a mixed integer programming model to optimize land usage subject to sprawl constraints, which are based upon the aforementioned sprawl measures. Due to the large size of the problem, we employ a combination of heuristics and Benders' decomposition similar to one described by Bazaraa and Sherali (1982) to provide an urban planner with suitable land use assignments. We show examples demonstrating how the planner can use this approach to analyze how various factors that affect land use and sprawl measures. Finally, we discuss topics of future research. (C) 2016 Elsevier Ltd. All rights reserved.

关键词： mixed integer linear programming Urban planning Sprawl Benders' decomposition

来源：评论

学校读者我要写书评

暂无评论

mixed integer linear programming models for Flow Shop Scheduling with a demand plan of job types

引用

CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH 2020年第1期28卷 5-23页

作者： Bautista-Valhondo, Joaquin Alfaro-Pozo, Rocio Univ Politecn Cataluna IOC ETSEIB E-08028 Barcelona Spain EAE Business Sch Barcelona 08015 Spain

This paper presents two mixed integer linear programming (MILP) models that extend two basic Flow Shop Scheduling problems: Fm/prmu/Cmax and Fm/block/Cmax. This extension incorporates the concept of an overall demand plan for types of jobs or products. After using an example to illustrate the new problems under study, we evaluated the new models and analyzed their behaviors when applied to instances found in the literature and industrial instances of a case study from Nissan's plant in Barcelona. CPLEX solver was used as a solution tool and obtained acceptable results, allowing us to conclude that MILP can be used as a method for solving Flow Shop Scheduling problems with an overall demand plan.

关键词： Flow Shop Scheduling problem mixed model sequencing problem mixed model assembly lines Overall demand plan mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

mixed integer linear programming for quality of service optimization in Clouds

引用

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE 2017年 71卷 1-17页

作者： Guerout, Tom Gaoua, Yacine Artigues, Christian Da Costa, Georges Lopez, Pierre Monteil, Thierry Univ Toulouse LAAS CNRS INSA Toulouse France IRIT Toulouse Univ 118 Route Narbonne F-31062 Toulouse 9 France

The analysis of the Quality of Service (QoS) level in a Cloud Computing environment becomes an attractive research domain as the utilization rate is daily higher and higher. Its management has a huge impact on the performance of both services and global Cloud infrastructures. Thus, in order to find a good trade-off, a Cloud provider has to take into account many QoS objectives, and also the manner to optimize them during the virtual machines allocation process. To tackle this complex challenge, this article proposed a multiobjective optimization of four relevant Cloud QoS objectives, using two different optimization methods: a Genetic Algorithm (GA) and a mixed integer linear programming (MILP) approach. The complexity of the virtual machine allocation problem is increased by the modeling of Dynamic Voltage and Frequency Scaling (DVFS) for energy saving on hosts. A global mixed-integer non linear programming formulation is presented and a MILP formulation is derived by linearization. A heuristic decomposition method, which uses the MILP to optimize intermediate objectives, is proposed. Numerous experimental results show the complementarity of the two heuristics to obtain various trade-offs between the different QoS objectives. (C) 2017 Elsevier B.V. All rights reserved.

关键词： Cloud Computing Quality of Service Multiobjective optimization mixed integer linear programming Genetic Algorithm DVFS

来源：评论

学校读者我要写书评

暂无评论

mixed integer linear programming Model for Integrating Cell Formation, Group Layout and Group Scheduling

Mixed Integer Linear Programming Model for Integrating Cell ...

引用

IEEE International Conference on Industrial Technology (ICIT)

作者： Fahmy, Sherif A. Amer Univ Middle East Dept Ind Engn Kuwait Kuwait

ISBN: (纸本)9781479978007

Cellular manufacturing systems (CMS) are production systems that typically comprise a number of manufacturing cells served by a centralized material handling system. Designing such systems includes three major decisions;cell formation (CF), group layout (GL), and group scheduling (GS). Traditionally, these three decisions have been dealt with separately, which has usually lead to less than optimal system performance. In this paper, a new mixed integer linear programming (MILP) model is proposed for the integrated CF, GL and GS problem, to efficiently design and operate CMSs. The model solves the integrated problem, taking into consideration intercellular and intracellular transportation times to determine the optimal cell formation, layout of machines and schedule of parts on the machines, simultaneously. Sequence-dependent set up times are also considered in the model. The performance of the model is tested by solving problems previously introduced in the literature considering two objectives;minimizing the makespan or minimizing the mean flow time in the system. The results show that the proposed model is efficient in solving small to medium-sized problems.

关键词： mixed integer linear programming cellular manufacturing systems cell formation group scheduling group layout

来源：评论

学校读者我要写书评

暂无评论

mixed integer linear programming Formulation for Optimal Reactive Compensation and Voltage Control of Distribution Power Systems

Mixed Integer Linear Programming Formulation for Optimal Rea...

引用

2017 IEEE Power & Energy Society General Meeting

作者： Castrillon, Jhon A. Giraldo, Juan S. Castro, Carlos A. Univ Estadual Campinas Campinas SP Brazil

ISBN: (纸本)9781538622124

This work proposes a mixed integer linear program. ming (MILP) formulation, based on a linear power flow that has recently been proposed in the literature, for the reactive power compensation of distribution networks through the optimal selection of capacitor banks (CB) as well as the optimal tap selection of voltage regulators (VRs) and on load tap changers (OLTCs) in order to maintain the system voltages within hounds. In the proposed formulation the voltage dependent load model is taken into account and the objective is to minimize the supply energy cost on a day-long time period. In order to evaluate the proposed model, several simulations are shown for a 34-bus radial distribution system. The results are duly discussed.

关键词： linear power flow load model mixed integer linear programming optimal reactive compensation voltage control distribution systems

来源：评论

学校读者我要写书评

暂无评论

mixed integer linear programming Models for Scheduling Elective Surgical Procedures 20th

Mixed Integer Linear Programming Models for Scheduling Elect...

引用

20th International Conference on Computational Science and Its Applications (ICCSA)

作者： Hortencio, Hanna Pamplona Ronconi, Debora Pretti Univ Sao Paulo Dept Prod Engn EP USP Av Prof Almeida Prado 128Cidade Univ BR-05508900 Sao Paulo Brazil

ISBN: (纸本)9783030588083;9783030588076

The problem of scheduling surgeries consists of allocating patients and resources to each surgical stage, considering the patient's needs, as well as sequencing and timing constraints. This problem is classified as NP-hard and has been widely discussed in the literature for the past 60 years. Nevertheless, many authors do not take into account the multiple stages and resources required to address the complex aspects of operating room management. The general goal of this paper is to propose a mathematical model to represent and solve this problem. Computational tests were also performed to compare the proposed model with a similar model from the literature, with a 64% average reduction in computational time.

关键词： Scheduling Surgery mixed integer linear programming Multiple resources Multiple stages

来源：评论

学校读者我要写书评

暂无评论

mixed integer linear programming Based Large Neighborhood Search Approaches for the Directed Feedback Vertex Set Problem 9th

Mixed Integer Linear Programming Based Large Neighborhood Se...

引用

9th International Conference on Metaheuristics and Nature Inspired Computing (META)

作者： Bresich, Maria Varga, Johannes Raidl, Guenther R. Limmer, Steffen TU Wien Inst Log & Computat Vienna Austria Honda Res Inst Europe GmbH D-63073 Offenbach Germany

ISBN: (纸本)9783031692567;9783031692574

A directed feedback vertex set (DFVS) of a directed graph is a subset of vertices whose removal makes the graph acyclic. Finding a DFVS of minimum cardinality is the goal of the directed feedback vertex set problem, an NP-hard combinatorial optimization problem. We first consider two mixed integer linear programming (MILP) models for this problem, which, when solved with Gurobi, are effective on graphs of small to medium complexity but do not scale well to large instances. Aiming at better scalability and higher robustness over a large variety of graphs, we investigate a large neighborhood search (LNS) in which a destroy operator removes randomly chosen nodes from an incumbent DFVS and one of the MILP models is used for repair. Regarding the destroy operator, finding a best degree of destruction is challenging. A main contribution lies in proposing several selection strategies for this parameter as well as a strategy for choosing the more promisingMILP model for repair. We evaluate the performance of the MILP models and different LNS variants on benchmark instances and compare the approaches to each other as well as to state-of-the-art procedures. Results show that our LNS variants yield clearly better solutions on average than standalone MILP solving. Even though our approaches cannot outperform the state-of-the-art, we gain valuable insights on beneficially configuring such a MILP-based LNS.

关键词： Large neighborhood search Mathematical programming mixed integer linear programming Directed feedback vertex set problem

来源：评论

学校读者我要写书评

暂无评论

mixed integer linear programming Formulation for the Taxi Sharing Problem 1

引用

1st International Conference on Smart Cities (Smart-CT)

作者： Ben-Smida, Houssem E. Krichen, Saoussen Chicano, Francisco Alba, Enrique Univ Tunisia LARODEC Tunis Tunisia Univ Malaga Dept Lenguajes & Ciencias Computac Malaga Spain

ISBN: (数字)9783319395951

ISBN: (纸本)9783319395944;9783319395951

Given a group of people traveling from the same origin to multiple destinations, the Taxi Sharing Problem consists in assigning taxis to each person such that the total cost spent by the group of people is minimized. This problem arises in the context of Smart Mobility, where the resources of a city must be optimized to save costs and pollution while the mobility services are improved for the citizens. We propose a mixed integer linear programming formulation as an accurate way to solve the problem of taxi sharing. We empirically analyze our formulation solving different real-like instances of the problem with 9 to 69 people.

关键词： Taxi Sharing Problem mixed integer linear programming Smart Mobility Smart City

来源：评论

学校读者我要写书评

暂无评论

STL and wSTL control synthesis: A disjunction-centric mixed-integer linear programming approach

引用

NONlinear ANALYSIS-HYBRID SYSTEMS 2025年 56卷

作者： Cardona, Gustavo A. Kamale, Disha Vasile, Cristian-Ioan Lehigh Univ Dept Mech Engn & Mech Bethlehem PA 18015 USA

This paper introduces an efficient optimization-based control synthesis methodology tailored for Signal Temporal Logic (STL) and its extension, weighted Signal Temporal Logic (wSTL). While STL captures Boolean and temporal operators, wSTL further allows users to express preferences and priorities over concurrent and sequential tasks denoted by weights over logical and temporal operators along with satisfaction times. The proposed approach utilizes mixed integer linear programming (MILP) for synthesis with both STL and wSTL formulae. We introduce efficient disjunction-centric encodings for STL and wSTL that capture both qualitative and quantitative semantics. This encoding minimizes the number of variables and constraints necessary to represent STL and wSTL formulae by efficiently handling conjunction operations (e.g., conjunction, always operators) and only introducing variables when disjunction operations are used (e.g., disjunction, eventually). Multiple case studies are conducted to demonstrate the proposed methodology's operation and computational efficiency for the control synthesis with STL and wSTL specifications. While non-linear dynamics and predicates can be considered using piecewise linear functions, this work focuses on linear predicates and dynamics. We show how cost functions involving potentially conflicting objectives expressed in terms of states, controls, and satisfaction robustness impact the solutions to the control synthesis problem for STL and wSTL. We conduct a sensitivity analysis of weights used in wSTL formulae, offering detailed insights into how these weights modulate solutions for given formulae. Finally, the time performance of the disjunction-centric encodings for both STL and wSTL is compared against state-of-the-art frameworks, comprehensively evaluating their efficiency and practical applicability.

关键词： Signal Temporal Logic Control synthesis mixed integer linear programming Disjunction-centric encoding

来源：评论

学校读者我要写书评

暂无评论

Heuristic algorithms for the inverse mixed integer linear programming problem

引用

JOURNAL OF GLOBAL OPTIMIZATION 2011年第3期51卷 463-471页

作者： Duan, Zhaoyang Wang, Lizhi Iowa State Univ Dept Ind & Mfg Syst Engn Ames IA 50011 USA

The recent development in inverse optimization, in particular the extension from the inverse linear programming problem to the inverse mixed integer linear programming problem (InvMILP), provides more powerful modeling tools but also presents more challenges to the design of efficient solution techniques. The only reported InvMILP algorithm, referred to as Alg(InvMILP), although finitely converging to global optimality, suffers two limitations that greatly restrict its applicability: it is time consuming and does not generate a feasible solution except for the optimal one. This paper presents heuristic algorithms that are designed to be implemented and executed in parallel with Alg(InvMILP) in order to alleviate and overcome its two limitations. Computational experiments show that implementing the heuristic algorithm on one auxiliary processor in parallel with Alg(InvMILP) on the main processor significantly improves its computational efficiency, in addition to providing a series of improving feasible upper bound solutions. The additional speedup of parallel implementation on two or more auxiliary processors appears to be incremental, but the upper bound can be improved much faster.

关键词： Inverse optimization mixed integer linear programming Parallel computing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：