We consider the integer L-shaped method for two-stage stochastic integer programs. To improve the performance of the algorithm, we present and combine two strategies. First, to avoid timeconsuming exact evaluations of the second-stage cost function, we propose a simple modification that alternates between linear and mixed-integer subproblems. Then, to better approximate the shape of the second-stage cost function, we present a general framework to generate optimality cuts via a cut-generating linear program which considers information from all solutions found up to any given stage of the method. In order to address the impact of the proposed approaches, we report computational results on two classes of stochastic integer problems.
In this work, we introduce and study the forbidden-vertices problem. Given a polytope P and a subset X of its vertices, we study the complexity of linear optimization over the subset of vertices of P that are not contained in X. This problem is closely related to finding the k-best basic solutions to a linear problem. We show that the complexity of the problem changes significantly depending on the encoding of both P and X. We provide additional tractability results and extended formulations when P has binary vertices only. Some applications and extensions to integral polytopes are discussed.
In this paper, we present a system that Compañía Sud Americana de Vapores (CSAV), one of the world's largest shipping companies, developed to support its decisions for repositioning and stocking empty containers. CSAV's main business is shipping cargo in containers to clients worldwide. It uses a fleet of about 700,000 TEU containers of different types, which are carried by both CSAV-owned and third-party ships. Managing the container fleet is complex; CSAV must make thousands of decisions each day. In particular, imbalances exist among the regions. For example, China often has a deficit of empty containers and is a net importer; Saudi Arabia often has a surplus and is a net exporter. CSAV and researchers from the University of Chile developed the Empty Container Logistics Optimization System (ECO) to manage this imbalance. ECO's multicommodity, multiperiod model manages the repositioning problem, whereas an inventory model determines the safety stock required at each location. CSAV uses safety stock to ensure high service levels despite uncertainties, particularly in the demand for containers. A hybrid forecasting system supports both the inventory and the multicommodity network flow model. Major improvements in data gathering, real-time communications, and automation of data handling were needed as input to the models. A collaborative Web-based optimization framework allows agents from different zones to interact in decision making. The use of ECO led to direct savings of $81 million for CSAV, a reduction in inventory stock of 50 percent, and an increase in container turnover of 60 percent. Moreover, the system helped CSAV to become more efficient and to overcome the 2008 economic crisis.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.