We consider a network design problem in which flow bifurcations are allowed. The demand data are assumed to be uncertain, and the uncertainties of demands are expressed by an uncertainty set. The goal is to install facilities on the edges at minimum cost. The solution should be able to deliver any of the demand requirements defined in the uncertainty set. We propose an exact solution algorithm ...

The production routing problem (PRP) is a generalization of the inventory routing problem and concerns the production and distribution of a single product from a production plant to multiple customers using capacitated vehicles in a discrete and finite time horizon. In this study, we consider the stochastic PRP with demand uncertainty in two-stage and multi-stage decision processes. The decisio...

in this paper, a new model is proposed for the integrated logistics network designing problem. in many research papers in this area, it is assumed that there is only one option for the capacity of each facility in the network. however, this is not a realistic assumption because generally there may be many possible options for the capacity of the facility that is being established. usually the c...

Generalized Benders decomposition (GBD) is a globally optimal algorithm for mixed integer nonlinear programming (MINLP) problems, which are NP-hard and can be widely found in the area of wireless resource allocation. The main idea GBD decomposing an MINLP problem into primal master problem, iteratively solved until their solutions converge. However, direct implementation time- memory-consuming....

In this paper, we study chance constrained mixed integer program with consideration of recourse decisions and their incurred cost, developed on a finite discrete scenario set. Through studying a non-traditional bilinear mixed integer formulation, we derive its linear counterparts and show that they could be stronger than existing linear formulations. We also develop a variant of Jensen’s inequa...

We address the balancing problem of transfer lines in this paper to find the optimal line balancing that minimizes the nonproductive time. We focus on the tool change time and face orientation change time both of which influence the makespane. We consider machine capacity limitations and technological constraints associated with the manufacturing process of auto cylinder heads. The problem is r...

The classical 1962 Benders decomposition scheme is a traditional approach for solving mixed-integer problems such as the uncapacitated facility location problem. Subsequent research has been focused on finding better cutting-plane generation schemes to reduce the solution process time. Pareto-optimal cuts are typically preferred because no other cut can dominate them. However, the Pareto-optim...

We study a class of two-stage stochastic integer programs with general integer variables in both stages and finitely many realizations of the uncertain parameters. Based on Benders’ method, we propose a decomposition algorithm that utilizes Gomory cuts in both stages. The Gomory cuts for the second-stage scenario subproblems are parameterized by the first-stage decision variables, i.e., they ar...