Integer Programming

Optimal Residential Users Coordination Via Demand Response: An Exact Distributed Framework

  • Natalia Alguacil Conde
  • Michael David de Souza Dutra
    • Categories (Mixed) Integer Linear Programming, Energy Tags , , ,

    This paper proposes a two-phase optimization framework for users that are involved in demand response programs. In a first phase, responsive users optimize their own household consumption, characterizing not only their appliances and equipment but also their comfort preferences. Subsequently, the aggregator exploits in a second phase this preliminary noncoordinated solution by implementing a coordination … Read more

    A Column Generation Based Heuristic for the Split Delivery Vehicle Routing Problem with Time Windows

  • Pedro Munari
  • Martin Savelsbergh
    • Categories Applications - OR and Management Sciences, Combinatorial Optimization, Integer Programming

    The vehicle routing problem with time windows (VRPTW) is one of the most studied variants of routing problems. We consider the Split Delivery VRPTW (SDVRPTW), an extension in which customers can be visited multiple times, if advantageous. While this additional flexibility can result in significant cost reductions, it also results in additional modeling and computational … Read more

    Solving the Time Dependent Minimum Tour Duration and Delivery Man Problems with Dynamic Discretization Discovery

  • Mike Hewitt
  • Duc Minh Vu
  • Duc D. Vu
    • Categories (Mixed) Integer Linear Programming, Scheduling, Transportation Tags , , , ,

    In this paper, we present exact methods for solving the Time Dependent Minimum Duration Problem (TDMTDP) and the Time Dependent Delivery Man Problem (TD-DMP). Both methods are based on a Dynamic Discretization Discovery (DDD) approach for solving the Time Dependent Traveling Salesman Problem with Time Windows (TD-TSPTW). Unlike the TD-TSPTW, the problems we consider in … Read more

    Efficient Formulations and Decomposition Approaches for Power Peak Reduction in Railway Traffic via Timetabling

  • Andreas Bärmann
  • Alexander Martin
  • Oskar Schneider
    • Categories Cutting Plane Approaches, Polyhedra, Scheduling Tags , , , ,

    Over the last few years, optimization models for the energy-efficient operation of railway traffic have received more and more attention, particularly in connection with timetable design. In this work, we study the effect of load management via timetabling. The idea is to consider trains as time-flexible consumers in the railway power supply network and to … Read more

    Routing and Wavelength Assignment with Protection: A Quadratic Unconstrained Binary Optimization Approach

  • Merve Bodur
  • Hamed Pouya
  • Oylum Seker
    • Categories 0-1 Programming, Quadratic Programming, Telecommunications

    The routing and wavelength assignment with protection is an important problem in telecommunications. Given an optical network and incoming connection requests, a commonly studied variant of the problem aims to grant maximum number of requests by assigning lightpaths at minimum network resource usage level, while ensuring the provided services remain functional in case of a … Read more

    Conference scheduling: a clustering-based approach

  • Teobaldo Bulhões
  • Anand Subramanian
  • Rubens Correia
    • Categories Integer Programming, Scheduling Tags , ,

    Scheduling the technical sessions of scientific events is an arduous task commonly faced by many organizers worldwide. Due the particularities of each conference, there is no consensus regarding the problem definition, and researchers have tackled each specific case individually. Despite their distinct characteristics, one often expects the sessions to be composed of presentations of similar … Read more

    Solving AC Optimal Power Flow with Discrete Decisions to Global Optimality

  • Kevin-Martin Aigner
  • Robert Burlacu
  • Frauke Liers
  • Alexander Martin
    • Categories (Mixed) Integer Nonlinear Programming, Second-Order Cone Programming Tags , , , , , , ,

    We present a solution framework for general alternating current optimal power flow (AC OPF) problems that include discrete decisions. The latter occur, for instance, in the context of the curtailment of renewables or the switching of power generation units and transmission lines. Our approach delivers globally optimal solutions and is provably convergent. We model AC … Read more

    A branch-and-cut algorithm for the Edge Interdiction Clique Problem

  • Fabio Furini
  • Ivana Ljubić
  • Pablo San Segundo
  • Yanlu Zhao
    • Categories Combinatorial Optimization, Cutting Plane Approaches Tags , , ,

    Given a graph G and an interdiction budget k, the Edge Interdiction Clique Problem (EICP) asks to find a subset of at most k edges to remove from G so that the size of the maximum clique, in the interdicted graph, is minimized. The EICP belongs to the family of interdiction problems with the aim … Read more

    Affinely Adjustable Robust Linear Complementarity Problems

  • Christian Biefel
  • Frauke Liers
  • Martin Schmidt
  • Jan Hendrik Rolfes
    • Categories (Mixed) Integer Linear Programming, Complementarity and Variational Inequalities, Robust Optimization Tags , , , ,

    Linear complementarity problems are a powerful tool for modeling many practically relevant situations such as market equilibria. They also connect many sub-areas of mathematics like game theory, optimization, and matrix theory. Despite their close relation to optimization, the protection of LCPs against uncertainties – especially in the sense of robust optimization – is still in … Read more

    Approximate Submodularity and Its Implications in Discrete Optimization

  • Temitayo Ajayi
  • Andrew J. Schaefer
  • Taewoo Lee
    • Categories (Mixed) Integer Linear Programming, Combinatorial Optimization Tags , , ,

    Submodularity, a discrete analog of convexity, is a key property in discrete optimization that features in the construction of valid inequalities and analysis of the greedy algorithm. In this paper, we broaden the approximate submodularity literature, which so far has largely focused on variants of greedy algorithms and iterative approaches. We define metrics that quantify … Read more