Enhanced Dynamic Discretization Discovery for the Continuous Time Load Plan Design Problem

2019 ◽  
Vol 53 (6) ◽  
pp. 1731-1750 ◽  
Author(s):  
Mike Hewitt
Keyword(s):  
Continuous Time ◽  
Design Problem ◽  
Plan Design ◽  
Load Plan

H ∞ Control for Continuous-Time Switched Linear Systems

2010 ◽  
Vol 132 (4) ◽  
Author(s):  
Grace S. Deaecto ◽  
José C. Geromel
Keyword(s):  
Feedback Control ◽  
Linear Systems ◽  
Output Feedback ◽  
Continuous Time ◽  
Design Problem ◽  
State Feedback ◽  
Output Feedback Control ◽  
Control Design ◽  
Linear Matrix ◽  
Switched Linear Systems

This paper deals with the output feedback H∞ control design problem for continuous-time switched linear systems. More specifically, the main goal is to design a switching rule together with a dynamic full order linear controller to satisfy a prespecified H∞ level defined by the L2 gain from the input to the output signal. Initially, the state feedback version of this problem is solved in order to put in evidence the main difficulties we have to face toward the solution of the output feedback control design problem. The results reported in this paper are based on the so called Lyapunov–Metzler inequalities, which express a sufficient condition for switched linear systems global stability. The solution of the previously mentioned output feedback control design problem through a linear matrix inequality based method is the main contribution of the present paper. An academic example borrowed from literature is used for illustration.

The Continuous-Time Service Network Design Problem

2017 ◽  
Vol 65 (5) ◽  
pp. 1303-1321 ◽  
Author(s):  
Natashia Boland ◽  
Mike Hewitt ◽  
Luke Marshall ◽  
Martin Savelsbergh
Keyword(s):  
Network Design ◽  
Continuous Time ◽  
Design Problem ◽  
Network Design Problem ◽  
Service Network ◽  
Time Service ◽  
Service Network Design

Interval-Based Dynamic Discretization Discovery for Solving the Continuous-Time Service Network Design Problem

2020 ◽  
Author(s):  
Luke Marshall ◽  
Natashia Boland ◽  
Martin Savelsbergh ◽  
Mike Hewitt
Keyword(s):  
Network Design ◽  
Continuous Time ◽  
Design Problem ◽  
Network Models ◽  
Network Design Problem ◽  
Full Time ◽  
Service Network ◽  
Time Service ◽  
Service Network Design ◽  
Time Expanded Network

We introduce an effective and efficient iterative algorithm for solving the continuous-time service network design problem. The algorithm achieves its efficiency by carefully and dynamically refining partially time-expanded network models so that only a small number of small integer programs, defined over these networks, need to be solved. An extensive computational study shows that the algorithm performs well in practice, often using time-expanded network models with size much less than 1% (in terms of number of variables and constraints) of a full time-expanded network model. The algorithm is inspired by and has many similarities to the dynamic discretization discovery algorithm introduced in Boland et al. [Boland N, Hewitt M, Marshall L, Savelsbergh M (2017) The continuous-time service network design problem. Oper. Res. 65(5):1303–1321.], but generates smaller partially time-expanded models, produces high-quality solutions more quickly, and converges more quickly.

Improved Load Plan Design Through Integer Programming Based Local Search

2013 ◽  
Vol 47 (3) ◽  
pp. 412-427 ◽  
Author(s):  
Alan Erera ◽  
Michael Hewitt ◽  
Martin Savelsbergh ◽  
Yang Zhang
Keyword(s):  
Integer Programming ◽  
Local Search ◽  
Plan Design ◽  
Load Plan

On the observer design problem for continuous-time switched linear systems with unknown switchings

2015 ◽  
Vol 352 (4) ◽  
pp. 1595-1612 ◽  
Author(s):  
David Gómez-Gutiérrez ◽  
Sergej Čelikovský ◽  
Antonio Ramírez-Treviño ◽  
Bernardino Castillo-Toledo
Keyword(s):  
Linear Systems ◽  
Continuous Time ◽  
Design Problem ◽  
Observer Design ◽  
Switched Linear Systems

Communities, Co-ops, and Clubs: Social Capital and Incentives in Large Collective Organizations

2021 ◽  
Vol 13 (3) ◽  
pp. 29-69
Author(s):  
Joshua A. Jacobs ◽  
Aaron M. Kolb ◽  
Curtis R. Taylor
Keyword(s):  
Social Capital ◽  
Steady State ◽  
Continuous Time ◽  
Design Problem ◽  
Poor Performance ◽  
Organization Design ◽  
Steady State Distribution ◽  
State Distribution ◽  
Performance Tracking ◽  
Monetary Transfers

We study a continuous-time organization design problem. Each member’s output is an imperfect signal of his underlying effort, and each member’s utility from remaining in the organization is endogenous to other members’ efforts. Monetary transfers are assumed infeasible. Incentives can be provided only through two channels: expulsion following poor performance and respite following good performance. We derive the steady state distribution of members’ continuation utilities for arbitrary values of the initial and maximum continuation utilities and then optimize these values according to organizational objectives. An optimally designed organization can be implemented by associating continuation utilities with a performance-tracking reputation system. (JEL Z13, D23, D86, P13, D82)

Improved Integer Programming-Based Neighborhood Search for Less-Than-Truckload Load Plan Design

2016 ◽  
Vol 50 (4) ◽  
pp. 1360-1379 ◽  
Author(s):  
Kathleen Lindsey ◽  
Alan Erera ◽  
Martin Savelsbergh
Keyword(s):  
Integer Programming ◽  
Neighborhood Search ◽  
Plan Design ◽  
Load Plan
Sign in / Sign up

Export Citation Format

Share Document