Month: April 2020

Interdependence and Integration among Components of the Airline Scheduling Process: A State-of-the-Art Review

  • Divyam Aggarwal
  • Michael T. M. Emmerich
  • Dhish K. Saxena
    • Categories Airline Optimization, Scheduling, Transportation Tags , , , , , ,

    Over the last few decades, the Airline Scheduling Process (ASP) has received an unprecedented attention from airliners and operations research society. Conventionally, the Airline Scheduling Process is decomposed into four sub-problems namely-Schedule Generation, Fleet Assignment, aircraft Routing, and Crew Scheduling which are solved sequentially in order to incorporate tractability and feasibility in the overall process. … Read more

    Disk matrices and the proximal mapping for the numerical radius

  • X.Y. Han
  • Adrian Lewis
    • Categories Convex Optimization, Semi-definite Programming Tags , , , ,

    Optimal matrices for problems involving the matrix numerical radius often have fields of values that are disks, a phenomenon associated with partial smoothness. Such matrices are highly structured: we experiment in particular with the proximal mapping for the radius, which often maps n-by-n random matrix inputs into a particular manifold of disk matrices that has … Read more

    Iteration-complexity of an inexact proximal accelerated augmented Lagrangian method for solving linearly constrained smooth nonconvex composite optimization problems

  • Jefferson Gonçalves Melo
  • Renato D.C. Monteiro
  • Hairong Wang
    • Categories Constrained Nonlinear Optimization Tags , , ,

    This paper proposes and establishes the iteration-complexity of an inexact proximal accelerated augmented Lagrangian (IPAAL) method for solving linearly constrained smooth nonconvex composite optimization problems. Each IPAAL iteration consists of inexactly solving a proximal augmented Lagrangian subproblem by an accelerated composite gradient (ACG) method followed by a suitable Lagrange multiplier update. It is shown that … Read more

    Data Approximation by L1 Spline Fits with Free Knots

  • Ziteng Wang
  • Manfei Xie
    • Categories Applications - OR and Management Sciences, Applications - Science and Engineering, Nonlinear Optimization

    L1 spline fits are a class of spline models that have shown advantages in approximating irregular and multiscale data. This paper investigates the knot placement problem of L1 spline fits under two scenarios. If the number of knots is given, we propose an augmented Lagrangian method to solve the bilevel L1 spline fit problem and … Read more

    Portfolio-wide Optimization of Pharmaceutical R&D Activities Using Mathematical Programming

  • Jon Dieringer
  • Chrysanthos E. Gounaris
  • Sal Garcia-Munoz
  • Steve Guntz
  • Nikolaos Lappas
  • Shankarraman Vaidyaraman
  • Shekhar Viswanath
  • Hua Wang
    • Categories Scheduling Tags

    The R&D management in any major research pharmaceutical company is constantly faced with the need to make complicated activity scheduling and resource allocation decisions, as they carry out scientific work to develop new therapeutic products. This paper describes how we develop a decision support tool that allows practitioners to determine portfolio-wide optimal schedules in a … Read more

    One transfer per patient suffices: Structural insights about patient-to-room assignment

  • Christina Büsing
  • Sigrid Knust
  • Tabea Brandt
    • Categories Applications - OR and Management Sciences, Combinatorial Optimization Tags , , ,

    While many heuristics have been proposed for the problem of patient-to-room assignment (PRA) with a large variety of different practical constraints, a thorough investigation of the problem’s structure itself has been neglected so far. Therefore, in this paper, we present insights about the basic, underlying combinatorial problem of PRA. At first we consider the problem … Read more

    A Distributionally Robust Optimization Approach for Stochastic Elective Surgery Scheduling with Limited Intensive Care Unit Capacity

  • Rema Padman
  • Karmel S. Shehadeh
    • Categories (Mixed) Integer Linear Programming, Scheduling, Stochastic Programming Tags , , , , ,

    In this paper, we study the decision process of assigning elective surgery patients to available surgical blocks in multiple operating rooms (OR) under random surgery durations, random postoperative length-of-stay in the intensive care unit (ICU), and limited capacity of ICU. The probability distributions of random parameters are assumed to be ambiguous, and only the mean … Read more

    The Multi-Stop Station Location Problem

  • Miriam Ganz
  • Erik Mühmer
  • Felix J. L. Willamowski
    • Categories Approximation Algorithms, Network Optimization, Transportation Tags , , , ,

    We introduce the (directed) multi-stop station location problem. The goal is to install stations such that ordered (multi-)sets of stops can be traversed with respect to range restrictions that are reset whenever a station is visited. Applications arise in telecommunications and transportation, e.g., charging station placement problems. The problem generalizes several network optimization problems such … Read more

    A New Coherent Multivariate Average-Value-at-Risk

  • Kerem Ugurlu
    • Categories Applications - OR and Management Sciences Tags , ,

    A new multivariate performance measure Average-Value-at-Risk, mAVaR αevaluating the sum of N risky assets composing the portfolio of an investor with respect to riskN-dimensional risk level vectorαis proposed. We show that the proposed operator satisfies the four axioms of a coherent risk measure, while reducing to the one variableAverage-Value-at-RiskAVaR, in caseN= 1. In that respect, … Read more

    The Crop Growth Planning Problem in Vertical Farming

  • Enrico Bartolini
  • Alberto Santini
  • Vinicius Greco de Lemos
  • Michael Schneider
    • Categories Scheduling Tags , ,

    In this paper, we study the problem of planning the growth of crops on shelves in vertical farming cabinets under controlled growth conditions. By adjusting temperature, humidity, light, and other environmental conditions in different parts of the cabinets, a planner must ensure that crop growth is able to satisfy some deterministic demand. We prove this … Read more