Results 1 - 10 of 199

Iterative MILP methods for vehicle-control problems

by Matthew G. Earl, Senior Member - IEEE Transactions on Robotics
"... Abstract—Mixed-integer linear programming (MILP) is a powerful tool for planning and control problems because of its modeling capability and the availability of good solvers. However, for large models, MILP methods suffer computationally. In this paper, we present iterative MILP algorithms that addr ..."
Abstract - Cited by 20 (0 self) - Add to MetaCart
Abstract—Mixed-integer linear programming (MILP) is a powerful tool for planning and control problems because of its modeling capability and the availability of good solvers. However, for large models, MILP methods suffer computationally. In this paper, we present iterative MILP algorithms

Submodular Minimization in the Context of Modern LP and MILP Methods and Solvers

by Andrew Orso , Jon Lee , Siqian Shen
"... Abstract. We consider the application of mixed-integer linear programming (MILP) solvers to the minimization of submodular functions. We evaluate common large-scale linear-programming (LP) techniques (e.g., column generation, row generation, dual stabilization) for solving a LP reformulation of the ..."
Abstract - Add to MetaCart
of the submodular minimization (SM) problem. We present heuristics based on the LP framework and a MILP solver. We evaluated the performance of our methods on a test bed of min-cut and matroidintersection problems formulated as SM problems.

SUBMITTED TO THE IEEE TRANSACTIONS ON ROBOTICS 1 Iterative MILP Methods for Vehicle Control Problems

by Matthew G. Earl
"... Abstract Mixed integer linear programming (MILP) is a powerful tool for planning and control problems because of its modeling capability and the availability of good solvers. However, for large models, MILP methods suffer computationally. In this paper, we present iterative MILP algorithms that add ..."
Abstract - Add to MetaCart
Abstract Mixed integer linear programming (MILP) is a powerful tool for planning and control problems because of its modeling capability and the availability of good solvers. However, for large models, MILP methods suffer computationally. In this paper, we present iterative MILP algorithms

SCHEDULING OF MULTIPURPOSE BATCH PLANTS WITH DIFFERENT STORAGE POLICIES: A COMPARATIVE STUDY BETWEEN S-GRAPH AND MILP METHODS

by C. A. Méndeza, S. Ferrer-nadala, F. Friedlerb, L. Puigjanera
"... Batch plants are the best option to manufacture relatively small quantities of speciality chemicals, pharmaceuticals and agrochemicals high-value products with variable demand patterns. The most general case corresponds to the so-called multipurpose batch plants where a wide variety of products with ..."
Abstract - Add to MetaCart
of this inherent operational flexibility, highly efficient optimization methods are needed to deal rigorously with industrial-scale short-term production scheduling problems. Different MILP-based scheduling models have been proposed to manage the complexity of multipurpose batch processes. MILP formulations

Algorithms for hybrid MILP/CP models for a class of optimization problems

by Vipul Jain, Ignacio E. Grossmann - INFORMS Journal on Computing , 2001
"... The goal of this paper is to develop models and methods that use complementary strengths of Mixed Integer Linear Programming (MILP) and Constraint Programming (CP) techniques to solve problems that are otherwise intractable if solved using either of the two methods. The class of problems considered ..."
Abstract - Cited by 98 (12 self) - Add to MetaCart
The goal of this paper is to develop models and methods that use complementary strengths of Mixed Integer Linear Programming (MILP) and Constraint Programming (CP) techniques to solve problems that are otherwise intractable if solved using either of the two methods. The class of problems considered

MILP formulation for islanding of power networks,”

by P A Trodden , W A Bukhsh , A Grothey , K I M Mckinnon - Edinburgh Research Group in Optimization, School of Mathematics, University of Edinburgh, Tech. Rep. ERGO , 2011
"... Abstract In this paper, a mathematical formulation for the islanding of power networks is presented. Given an area of uncertainty in the network, the proposed approach uses mixed integer linear programming to isolate uncertain components and create islands, by intentionally (i) cutting lines, (ii) ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
) shedding loads and (iii) switching generators, while maximizing load supply. A key feature of the new method is that network constraints are explicitly included in the MILP problem, resulting in balanced, steadystate feasible DC solutions. A subsequent AC optimal load shedding optimization on the islanded

HYBRID LAGRANGIAN-MILP APPROACHES FOR UNIT . . .

by A. Frangioni, C. Gentile, F. Lacalandra , 2007
"... The short-term Unit Commitment (UC) problem in hydro-thermal power generation is a fundamental problem in short-term electrical generation scheduling. Historically, Lagrangian techniques have been used to tackle this large-scale, difficult Mixed-Integer NonLinear Program (MINLP); this requires being ..."
Abstract - Add to MetaCart
of piecewise-linear functions, so that UC can be approximated by a Mixed-Integer Linear Program (MILP); in particular, using a recently developed class of valid inequalities for the problem, called “Perspective Cuts”, significant improvements have been obtained in the efficiency and effectiveness

AN MILP Model for Heat Exchanger Networks Retrofit

by Andres Barbaro. B, Miguel Bagajewicz. B, Narumon Vipanurata, Kitipat Siemanonda
"... This paper addresses the problem of automatically determining the optimal economic retrofit of heat exchanger networks. It is a rigorous MILP (Mixed Integer Linear Programming) approach that considers rearrangement of the existing heat exchanger units, heat transfer area addition and new exchanger i ..."
Abstract - Add to MetaCart
This paper addresses the problem of automatically determining the optimal economic retrofit of heat exchanger networks. It is a rigorous MILP (Mixed Integer Linear Programming) approach that considers rearrangement of the existing heat exchanger units, heat transfer area addition and new exchanger

MILP-based Placement and Routing for Dataflow Architecture

by Michael Healy, Mongkol Ekpanyapong, Sung Kyu Lim
"... Abstract — Dataflow architectures provide an abundance of computing units that can be statically or dynamically configured to match the computing requirements of the given application. Wire delay has a reduced impact in dataflow architectures because only neighboring architectural entities are allow ..."
Abstract - Add to MetaCart
time of the given application represented by a dataflow graph under architectural constraints. We propose a hierarchical method to handle the complexity of the initial MILP formulation. Our profile-driven MILP algorithm reduces the total execution time of benchmark applications compared

MILP formulation and polynomial time algorithm for an aircraft scheduling problem

by Alexandre M. Bayen, Jiawei Zhang, Claire J. Tomlin, Yinyu Ye , 2003
"... This article presents a polynomial time algorithm used for solving a MILP formulation of a scheduling problem applicable to Air Trac Control. We rst relate the general MILP (which we believe to be NPHard) to the Air Trac Control problem. This MILP can be solved with CPLEX without guarantee on th ..."
Abstract - Cited by 11 (2 self) - Add to MetaCart
on the running time. We show that a speci c case of the Air Trac Control problem, which is of interest on its own right, admits an exact polynomial-time algorithm. Our method reduces the feasibility of the MILP to a single machine scheduling problem, and embeds the solution algorithm in a bisection algorithm
Results 1 - 10 of 199