Railway transport becomes a more popular transportation in many countries due to its large capacity, low energy consumption, and benign environment. The passenger train service planning is the key of rail operations system balance demand. In this paper, we propose mixed binary linear programming formulation for optimize route, frequency, stop schedule, assignment simultaneously. addition, analy...

In a recent work, Muter et al. (2013a) identified and characterized a general class of linear programming (LP) problems known as problems with column-dependent-rows (CDR-problems). These LPs feature two sets of constraints with mutually exclusive groups of variables in addition to a set of structural linking constraints, in which variables from both groups appear together. In a typical CDR-prob...

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...

Over the years, various techniques have been proposed to speed up the classical Benders decomposition algorithm. The work presented in the literature has focused mainly on either reducing the number of iterations of the algorithm or on restricting the solution space of the decomposed problems. In this article, a new strategy for Benders algorithm is proposed and applied to two case studies in o...

This paper proposes a simplified solution procedure to the model presented by Akinc and Roodman. The Benders’ decomposition procedure for analyzing this model has been developed, and its shortcomings have been highlighted. Here, the special nature of the problem is exploited which allowed us to develop a new algorithm through surrogating method. The two methods are compared by several numerical...

This paper presents an application of Benders decomposition to deal with the complexities in the simultaneous Generation Expansion Planning (GEP) and Transmission Expansion Planning (TEP). Unlike the power system operation fields of study, the power system planning methods are not expected to be fast. However, it is always preferable to speed up computations to provide more analysis options for...

This paper examines Benders decomposition for a useful class of variational inequality (VI) problems that can model, e.g., economic equilibrium, games or traffic equilibrium. The dual of the given VI is defined. Benders decomposition of the

The renowned nursing shortage has attracted much attention from national level law makers, state legislatures, commercial organizations, and researchers due to its direct impact on the quality of patient care. High workloads and undesirable schedules are two major issues that cause nurses’ job dissatisfaction. The focus of this paper is to find nondominated solutions to an integrated nurse staf...