We consider the design of a multicommodity flow network, in which point-topoint demands are routed across the network subject to link capacity restrictions. Such a design must build enough capacity and diverse routing paths through the network to ensure that feasible multicommodity flows continue to exist, even when components of the network fail. In this paper, we examine several methodologies...

The design of telecommunication network with capacity constraints of links, routers and ports of routers is considered in this paper. Specially, we limit each demand flow traversed through a pre-specified maximal number of links (called hops) under node failure scenarios in IP layer network. Such a design must be the most cost-effective and ensure that feasible flows continue to exist even when...

This paper considers a three-stage fixed charge transportation problem regarding stochastic demand and price. The objective of the problem is to maximize the profit for supplying demands. Three kinds of costs are presented here: variable costs that are related to amount of transportation cost between a source and a destination. Fixed charge exists whenever there is a transfer from a source to a...

This paper presents a new bi-level multi-objective model to valorize the microgrid (MG) flexibility based on flexible power management system. It considers presence of renewable and resources including demand response program (DRP), energy storage system integrated unit electric spring with vehicles (EVs) parking (IUEE). The proposed in upper-level maximizes expected profit subject constraints....

An algorithm incorporating the logarithmic barrier into the Benders decomposition technique is proposed for solving two-stage stochastic programs. Basic properties concerning the existence and uniqueness of the solution and the underlying path are studied. When applied to problems with a nite number of scenarios, the algorithm is shown to converge globally and to run in polynomial-time.

Hub location problem (HLP) is one of the most important problems in the areas of logistics and telecommunication network design. In this paper we address the bi-objective non-strict single allocation hub location problem (BONSSAHLP). The non-strict property of this problem which allows establishment of direct links between pairs of non-hub nodes makes it somehow different from the conventional ...

This paper presents a stochastic optimization model and efficient decomposition algorithm for multi-site capacity planning under the uncertainty of the TFT-LCD industry. The objective of the stochastic capacity planning is to determine a robust capacity allocation and expansion policy hedged against demand uncertainties because the demand forecasts faced by TFT-LCD manufacturers are usually ina...

The interdependency of power systems and natural gas is being reinforced by the emerging power-to-gas facilities (PtGs), existing gas-fired generators. To jointly improve efficiency security under diverse uncertainties from renewable energy resources load demands, it essential to co-optimise these two for day-ahead market clearance. A data-driven integrated electricity-gas system stochastic co-...

We use logic-based Benders decomposition to minimize tardiness in single-facility scheduling problems with many jobs and long time horizons. Release dates and due dates are given. A mixed integer linear programming (MILP) based master problem allocates jobs to segments of the time horizon, and a constraint programming (CP) based subproblem schedules the jobs in each segment.