Robust Inventory Routing with Flexible Time Window Allocation

This paper studies a robust maritime inventory routing problem with time windows and stochastic travel times. One of the novelties of the problem is that the length and placement of the time windows are also decision variables. Such problems arise in the design and negotiation of long-term delivery contracts with customers who require on-time deliveries … Read more

A Semidefinite Opimization Approach to the Target Visitation Problem

We propose an exact algorithm for the Target Visitation Problem (TVP). The (TVP) is a composition of the Linear Ordering Problem and the Traveling Salesman Problem. It has several military and non-military applications, where two important, often competing factors are the overall distance traveled (e.g. by an unmanned aerial vehicle) and the visiting sequence of … Read more

The impact of wind uncertainty on the strategic valuation of distributed electricity storage

The intermittent nature of wind energy generation has introduced a new degree of uncertainty to the tactical planning of energy systems. Short-term energy balancing decisions are no longer (fully) known, and it is this lack of knowledge that causes the need for strategic thinking. But despite this observation, strategic models are rarely set in an … Read more

New Lower Bounds for Semi-online Scheduling on Two Uniform Machines with Known Optimum

This problem is about to schedule a number of jobs of different lengths on two uniform machines with given speeds 1 and s ≥ 1, so that the overall finishing time, i.e. the makespan, is earliest possible. We consider a semi- online variant introduced (for equal speeds) by Azar and Regev, where the jobs are … Read more

The Continuous Time Service Network Design Problem

Consolidation carriers transport shipments that are small relative to trailer capacity. To be cost-effective, the carrier must consolidate shipments, which requires coordinating their paths in both space and time, i.e., the carrier must solve a Service Network Design problem. Most service network design models rely on discretization of time, i.e., instead of determining the exact … Read more

Information Gap Decision Theory Based OPF With HVDC Connected Wind Farms

A method for solving the optimal power flow (OPF) problem including HVDC connected offshore wind farms is presented in this paper. Different factors have been considered in the proposed method, namely, voltage source converter (VSC-HVDC) and line-commutated converter high-voltage DC (LCC-HVDC) link constraints, doubly fed induction generators’ (DFIGs) capability curve as well as the uncertainties … Read more

Stochastic Real-Time Scheduling of Wind-thermal Generation Units in an Electric Utility

The objective of dynamic economic dispatch (DED) problem is to find the optimal dispatch of generation units in a given operation horizon to supply a pre-specified demand, while satisfying a set of constraints. In this paper, an efficient method based on Optimality Condition Decomposition (OCD) technique is proposed to solve the DED problem in real-time … Read more

Real Options: A Survey

This survey paper provides an overview of real options, in particular the connection with financial options, valuation methods (analytical methods vs numerical methods based on simulation, lattice approximations to stochastic processes and finite-difference methods) and a wide array of application areas, from R&D to operations management to renewable energy project selection. CitationTechnical report, Lehigh University, … Read more

Variational principles with generalized distances and applications to behavioral sciences

This paper has a two-fold focus on proving that the quasimetric and the weak $\tau$-distance versions of the Ekeland variational principle are equivalent in the sense that one implies the other and on presenting the need of such extensions for possible applications in the formation and break of workers hiring and firing routines. ArticleDownload View … Read more

Generalized Dual Face Algorithm for Linear Programming

As a natural extension of the dual simplex algorithm, the dual face algorithm performed remarkably in computational experiments with a set of Netlib standard problems. In this paper, we generalize it to bounded-variable LP problems via local duality. CitationDepartment of Mathematics, Southeast University, Nanjing, 210096, China, 12/2014ArticleDownload View PDF