Incorporating uncertainty in optimal decision making: Integrating mixed integer programming and simulation to solve combinatorial problems

C.T. Bauer College of Business, Department of DISC, 334 Melcher Hall, 4800 Calhoun Road, University of Houston, Houston, TX 77204-6021, USA
Computers & Industrial Engineering (Impact Factor: 1.69). 02/2009; 56(1):106-112. DOI: 10.1016/j.cie.2008.04.003
Source: DBLP

ABSTRACT We introduce a novel methodology that integrates optimization and simulation techniques to obtain estimated global optimal solutions to combinatorial problems with uncertainty such as those of facility location, facility layout, and scheduling. We develop a generalized mixed integer programming (MIP) formulation that allows iterative interaction with a simulation model by taking into account the impact of uncertainty on the objective function value of previous solutions. Our approach is generalized, efficient, incorporates the impact of uncertainty of system parameters on performance and can easily be incorporated into a variety of applications. For illustration, we apply this new solution methodology to the NP-hard multi-period multi-product facility location problem (MPP-FLP). Our results show that, for this problem, our iterative procedure yields up to 9.4% improvement in facility location-related costs over deterministic optimization and that these cost savings increase as the variability in demand and supply uncertainty are increased.

  • Source
    • "Similar to our problem, Syam (2008) formulates a facility location model with staff allocation considerations in order to minimize the expected waiting times in the service facilities and uses a Lagrangian relaxation method to solve the problem. We use a similar optimization framework as Vardar et al. (2006) and Acar et al. (2009) to locate POD sites with uncertain performance to design a robust response system for a major public health concern. An emergency such as an influenza outbreak or a bioterrorist attack may require PODs to perform well on several performance measures. "
    [Show abstract] [Hide abstract]
    ABSTRACT: We formulate a p-median facility location model with a queuing approximation to determine the optimal locations of a given number of dispensing sites (Point of Dispensing-PODs) from a predetermined set of possible locations and the optimal allocation of staff to the selected locations. Specific to an anthrax attack, dispensing operations should be completed in 48 hours to cover all exposed and possibly exposed people. A nonlinear integer programming model is developed and it formulates the problem of determining the optimal locations of facilities with appropriate facility deployment strategies, including the amount of servers with different skills to be allocated to each open facility. The objective of the mathematical model is to minimize the average transportation and waiting times of individuals to receive the required service. The mathematical model has waiting time performance measures approximated with a queuing formula and these waiting times at PODs are incorporated into the p-median facility location model. A genetic algorithm is developed to solve this problem. Our computational results show that appropriate locations of these facilities can significantly decrease the average time for individuals to receive services. Consideration of demographics and allocation of the staff decreases waiting times in PODs and increases the throughput of PODs. When the number of PODs to open is high, the right staffing at each facility decreases the average waiting times significantly. The results presented in this paper can help public health decision makers make better planning and resource allocation decisions based on the demographic needs of the affected population.
    Biocontrol Science and Technology 10/2014; 4(4). DOI:10.1080/19488300.2014.965394 · 0.73 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: Closure of facilities is quite common among both business firms and public sector institutions like hospitals and schools. Although the facilities location problem has been studied extensively in the literature, not much attention has been paid to the closure of facilities. Unlike the location problem, the existing facilities and the corresponding network impose additional constraints on the closure or elimination of facilities and to highlight the difference between the two, we have called this the facilities delocation problem. In this article, we study a firm with an existing distribution network with known retailer and distributor locations that needs to downsize or shrink its distribution chain due to other business reasons. However, it is not a reallocation of demand nodes among the retained distributors. An important condition stipulates that all demand nodes must continue to get their supplies from their respective current distributors except when the current source itself is delocated, and only such uprooted demand nodes will be supplied by a different but one of the retained suppliers. We first describe the delocation problem and discuss its characteristics. We formulate the delocation problem as an integer linear programming problem and demonstrate its formulation and solution on a small problem. Finally, we discuss the solution and its implications for the distribution network.
    International Journal of Systems Science 03/2010; 41(3):271-280. DOI:10.1080/00207720903326860 · 1.58 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: For a container terminal system, efficient berth and quay crane (QC) schedules have great impact on the improvement of both operation efficiency and customer satisfaction. In this paper we address both berth and quay crane scheduling problems in a simultaneous way, with uncertainty of container handling time. The berth is of discrete type and vessels arrive dynamically with different service priorities. Besides we assume QCs can move to other berths before finishing processing on currently assigned vessels, adding more flexibility to the terminal system. A mixed integer programming model is established, and a simulation based Genetic Algorithm (GA) search procedure is applied to generate robust berth and QC schedule proactively. Computational experiment shows the satisfied performance of our developed algorithm.
    European Journal of Operational Research 12/2010; 207(3):1327-1340. DOI:10.1109/ICCIE.2009.5223886 · 1.84 Impact Factor
Show more