Search results for "Integer programming"
showing 10 items of 69 documents
GRASP and path relinking for the max–min diversity problem
2010
The max-min diversity problem (MMDP) consists in selecting a subset of elements from a given set in such a way that the diversity among the selected elements is maximized. The problem is NP-hard and can be formulated as an integer linear program. Since the 1980s, several solution methods for this problem have been developed and applied to a variety of fields, particularly in the social and biological sciences. We propose a heuristic method-based on the GRASP and path relinking methodologies-for finding approximate solutions to this optimization problem. We explore different ways to hybridize GRASP and path relinking, including the recently proposed variant known as GRASP with evolutionary p…
The multiple vehicle pickup and delivery problem with LIFO constraints
2015
Abstract This paper approaches a pickup and delivery problem with multiple vehicles in which LIFO conditions are imposed when performing loading and unloading operations and the route durations cannot exceed a given limit. We propose two mixed integer formulations of this problem and a heuristic procedure that uses tabu search in a multi-start framework. The first formulation is a compact one, that is, the number of variables and constraints is polynomial in the number of requests, while the second one contains an exponential number of constraints and is used as the basis of a branch-and-cut algorithm. The performances of the proposed solution methods are evaluated through an extensive comp…
Cut-First Branch-and-Price-Second for the Capacitated Arc-Routing Problem
2012
This paper presents the first full-fledged branch-and-price (bap) algorithm for the capacitated arc-routing problem (CARP). Prior exact solution techniques either rely on cutting planes or the transformation of the CARP into a node-routing problem. The drawbacks are either models with inherent symmetry, dense underlying networks, or a formulation where edge flows in a potential solution do not allow the reconstruction of unique CARP tours. The proposed algorithm circumvents all these drawbacks by taking the beneficial ingredients from existing CARP methods and combining them in a new way. The first step is the solution of the one-index formulation of the CARP in order to produce strong cut…
Fair Transfer Prices of Global Supply Chains in the Process Industry
2016
This work addresses the optimisation of transfer prices for the fair profit distribution among the members involved in a global supply chain in the process industry. A mixed integer linear programming (MILP) model is developed for production and distribution planning of global supply chains, where the optimal transfer prices of products between plants and markets are determined. Two solution approaches are presented for fair solutions using Nash and lexicographic maximin principles. The applicability of the proposed models and approaches are demonstrated by an illustrative example. The results show that both approaches can fairly distribute the whole supply chain’s profit to the members.
Mixed integer optimal compensation: Decompositions and mean-field approximations
2012
Mixed integer optimal compensation deals with optimizing integer- and real-valued control variables to compensate disturbances in dynamic systems. The mixed integer nature of controls might be a cause of intractability for instances of larger dimensions. To tackle this issue, we propose a decomposition method which turns the original n-dimensional problem into n independent scalar problems of lot sizing form. Each scalar problem is then reformulated as a shortest path one and solved through linear programming over a receding horizon. This last reformulation step mirrors a standard procedure in mixed integer programming. We apply the decomposition method to a mean-field coupled multi-agent s…
Integer linear programming in computational biology
2009
Computational molecular biology (bioinformatics) is a young research field that is rich in NP-hard optimization problems. The problem instances encountered are often huge and comprise thousands of variables. Since their introduction into the field of bioinformatics in 1997, integer linear programming (ILP) techniques have been successfully applied to many optimization problems. These approaches have added much momentum to development and progress in related areas. In particular, ILP-based approaches have become a standard optimization technique in bioinformatics. In this review, we present applications of ILP-based techniques developed by members and former members of Kurt Mehlhorn's group.…
Energy Management Systems and tertiary regulation in hierarchical control architectures for islanded microgrids
2015
In this paper, the structure of the highest level of a hierarchical control architecture for micro-grids is proposed. Such structure includes two sub-levels: the Energy Management System, EMS, and the tertiary regulation. The first devoted to energy resources allocation in each time slot based on marginal production costs, the latter aiming at finding the match between production and consumption satisfying the constraints set by the EMS level about the energy production in each time slot. Neglecting the efficiency of the different energy generation systems as well as that of the infrastructure for electrical energy distribution, the problem dealt with by the EMS sub-level is linear and can …
On the Reliability of Optimization Results for Trigeneration Systems in Buildings, in the Presence of Price Uncertainties and Erroneous Load Estimati…
2016
Cogeneration and trigeneration plants are widely recognized as promising technologies for increasing energy efficiency in buildings. However, their overall potential is scarcely exploited, due to the difficulties in achieving economic viability and the risk of investment related to uncertainties in future energy loads and prices. Several stochastic optimization models have been proposed in the literature to account for uncertainties, but these instruments share in a common reliance on user-defined probability functions for each stochastic parameter. Being such functions hard to predict, in this paper an analysis of the influence of erroneous estimation of the uncertain energy loads and pric…
Integer programming models for the pre-marshalling problem
2019
[EN] The performance of shipping companies greatly depends on reduced berthing times. The trend towards bigger ships and shorter berthing times places severe stress on container terminals, which cannot simply increase the available cranes indefinitely. Therefore, the focus is on optimizing existing resources. An effective way of speeding up the loading/unloading operations of ships at the container terminal is to use the idle time before the arrival of a ship for sorting the stored containers in advance. The pre-marshalling problem consists in rearranging the containers placed in a bay in the order in which they will be required later, looking for a sequence with the minimum number of moves…
Symbolic Worst Case Execution Times
2011
In immediate or hard real-time systems the correctness of an operation depends not only upon its logical correctness, but also on the time in which it is computed. In such systems, it is imperative that operations are performed within a given deadline because missing this deadline constitutes the failure of the complete system. Such systems include medical systems, flight control systems and other systems whose failure in responding punctually results in a high economical loss or even in the loss of human lives. These systems are usually analyzed in a sequence of steps in which first, a socalled control flow graph (CFG) is constructed that represents possible program flows. Furthermore, bou…