TITLE

A novel probabilistic formulation for locating and sizing emergency medical service stations

AUTHOR(S)
Zhang, Zhi-Hai; Li, Kang
PUB. DATE
June 2015
SOURCE
Annals of Operations Research;Jun2015, Vol. 229 Issue 1, p813
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
The paper proposes a novel probabilistic model with chance constraints for locating and sizing emergency medical service stations. In this model, the chance constraints are approximated as second-order cone constraints to overcome computational difficulties for practical applications. The proposed approximations associated with different estimation accuracy of the stochastic nature are meaningful on a practical uncertainty environment. Then, the model is transformed into a conic quadratic mixed-integer program by employing a conic transformation. The resulting model can be efficiently addressed by a commercial optimization package. A special case is also considered and a class of valid inequalities is introduced to improve computational efficiency. Lastly, computational experiences on real data and randomly generated data are reported to illustrate the validity of the program.
ACCESSION #
102620697

 

Related Articles

  • Optimal Cardinality Constrained Portfolio Selection. Jianjun Gao; Duan Li // Operations Research;May/Jun2013, Vol. 61 Issue 3, p745 

    One long-standing challenge in both the optimization and investment communities is to devise an efficient algorithm to select a small number of assets from an asset pool such that a portfolio objective is optimized. This cardinality constrained investment situation naturally arises due to the...

  • Unbounded convex sets for non-convex mixed-integer quadratic programming. Burer, Samuel; Letchford, Adam // Mathematical Programming;Feb2014, Vol. 143 Issue 1/2, p231 

    This paper introduces a fundamental family of unbounded convex sets that arises in the context of non-convex mixed-integer quadratic programming. It is shown that any mixed-integer quadratic program with linear constraints can be reduced to the minimisation of a linear function over a face of a...

  • Global optimization of bilinear programs with a multiparametric disaggregation technique. Kolodziej, Scott; Castro, Pedro; Grossmann, Ignacio // Journal of Global Optimization;Dec2013, Vol. 57 Issue 4, p1039 

    In this paper, we present the derivation of the multiparametric disaggregation technique (MDT) by Teles et al. (J. Glob. Optim., ) for solving nonconvex bilinear programs. Both upper and lower bounding formulations corresponding to mixed-integer linear programs are derived using disjunctive...

  • Perspective Reformulations of the CTA Problem with L2 Distances. Castro, Jordi; Frangioni, Antonio; Gentile, Claudio // Operations Research;Jul/Aug2014, Vol. 62 Issue 4, p891 

    Any institution that disseminates data in aggregated form has the duty to ensure that individual confidential information is not disclosed, either by not releasing data or by perturbing the released data while maintaining data utility. Controlled tabular adjustment (CTA) is a promising technique...

  • Implementation of Mixed-Integer Programming on Embedded System. Novak, Jakub; Chalupa, Petr // Annals of DAAAM & Proceedings;2014, Vol. 25 Issue 1, p1649 

    One of the most widespread modern control strategies is the discrete-time Model Predictive Control (MPC) method which requires the solution of the quadratic programming problem. For systems with binary input variables the quadratic problem is replaced by more challenging Mixed-Integer Quadratic...

  • On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study. Lima, Ricardo; Grossmann, Ignacio // Computational Optimization & Applications;Jan2017, Vol. 66 Issue 1, p1 

    This paper addresses the solution of a cardinality Boolean quadratic programming problem using three different approaches. The first transforms the original problem into six mixed-integer linear programming (MILP) formulations. The second approach takes one of the MILP formulations and relies on...

  • Tight polyhedral approximation for mixed-integer linear programming unit commitment formulations. Jabr, R. A. // IET Generation, Transmission & Distribution;Nov2012, Vol. 6 Issue 11, p1104 

    The perspective reformulation has been recently proposed for constructing tight relaxations of the unit commitment (UC) problem with quadratic cost functions. In this case, it has been shown that the perspective reformulation can be cast as a second-order cone program. Conic quadratic...

  • AN APPROACH FOR THE OPTIMAL SOLUTION OF MILP PROBLEMS. Ubale, P. V. // Bulletin of Pure & Applied Sciences-Mathematics;Jul-Dec2012, Vol. 31E Issue 2, p169 

    This paper describes an algorithm for finding solutions to optimization problems in which some of the variables must take integer values. The solution of discrete optimization problem to optimality is often an immense job requiring very efficient algorithm. In this paper we describe a Branch and...

  • On reduction of the multistage problem of stochastic programming with quantile criterion to the problem of mixed integer linear programming. Kibzun, A.; Khromova, O. // Automation & Remote Control;Apr2014, Vol. 75 Issue 4, p688 

    Consideration was given to the a priori formulation of the multistage problem of stochastic programming with a quantile criterion which is reducible to the two-stage problem. Equivalence of the two-stage problems with the quantile criterion in the a priori and a posteriori formulations was...

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics