Wiley: Naval Research Logistics (NRL): Table of Contents
Table of Contents for Naval Research Logistics (NRL). List of articles from both the latest and EarlyView issues.
https://onlinelibrary.wiley.com/loi/15206750?af=R
Wiley: Naval Research Logistics (NRL): Table of Contents
Wiley
en-US
Naval Research Logistics (NRL)
Naval Research Logistics (NRL)
https://onlinelibrary.wiley.com/cms/attachment/34b10d80-5082-4771-bfb9-ea3b52659818/default_cover.jpg
https://onlinelibrary.wiley.com/loi/15206750?af=R
Mean residual life of coherent systems consisting of multiple types of dependent components
Abstract
Mean residual life is a useful dynamic characteristic to study reliability of a system. It has been widely considered in the literature not only for single unit systems but also for coherent systems. This article is concerned with the study of mean residual life for a coherent system that consists of multiple types of dependent components. In particular, the survival signature based generalized mixture representation is obtained for the survival function of a coherent system and it is used to evaluate the mean residual life function. Furthermore, two mean residual life functions under different conditional events on components’ lifetimes are also defined and studied.
Serkan
Eryilmaz
,
Frank P.A.
Coolen
,
Tahani
Coolen‐Maturi
http://feedproxy.google.com/~r/wileyonlinelibrary/nav/~3/VGObgKdCzQg/nav.21782
Volume 65, Issue 1, Page 86-97, February 2018.

]]>
Naval Research Logistics (NRL), Volume 65, Issue 1, Page 86-97, February 2018. <br/>
Mean residual life of coherent systems consisting of multiple types of dependent components
doi:10.1002/nav.21782
Naval Research Logistics (NRL)
2018-03-07T08:00:00Z
Naval Research Logistics (NRL)
65
1
2018-03-07T08:00:00Z
2018-03-07T08:00:00Z
10.1002/nav.21782
https://onlinelibrary.wiley.com/doi/abs/10.1002/nav.21782?af=R
https://onlinelibrary.wiley.com/doi/abs/10.1002/nav.21782?af=R
Simple paths with exact and forbidden lengths
Abstract
We study new decision and optimization problems of finding a simple path between two given vertices in an arc weighted directed multigraph such that the path length is equal to a given number or it does not fall into the given forbidden intervals (gaps). A fairly complete computational complexity classification is provided and exact and approximation algorithms are suggested.
Alexandre
Dolgui
,
Mikhail Y.
Kovalyov
,
Alain
Quilliot
http://feedproxy.google.com/~r/wileyonlinelibrary/nav/~3/tPSD61KPvHk/nav.21783
Volume 65, Issue 1, Page 78-85, February 2018.

]]>
Naval Research Logistics (NRL), Volume 65, Issue 1, Page 78-85, February 2018. <br/>
Simple paths with exact and forbidden lengths
doi:10.1002/nav.21783
Naval Research Logistics (NRL)
2018-03-14T07:00:00Z
Naval Research Logistics (NRL)
65
1
2018-03-14T07:00:00Z
2018-03-14T07:00:00Z
10.1002/nav.21783
https://onlinelibrary.wiley.com/doi/abs/10.1002/nav.21783?af=R
https://onlinelibrary.wiley.com/doi/abs/10.1002/nav.21783?af=R
Mixed rules in multi‐issue allocation situations
Abstract
Multi‐issue allocation situations study problems where an estate must be divided among a group of agents. The claim of each agent is a vector specifying the amount claimed by each agent on each issue. We present a two‐stage rule. First, we divide the estate among the issues following the constrained equal awards rule. Second, the amount assigned to each issue is divided among the agents in proportion to their demands on this issue. We apply the rule to two real‐world problems: the distribution of natural resources between countries and the distribution of budget for education and research between universities.
Gustavo
Bergantiños
,
Jose María
Chamorro
,
Leticia
Lorenzo
,
Silvia
Lorenzo‐Freire
http://feedproxy.google.com/~r/wileyonlinelibrary/nav/~3/fyCzkHb7PRA/nav.21785
Volume 65, Issue 1, Page 66-77, February 2018.

]]>
Naval Research Logistics (NRL), Volume 65, Issue 1, Page 66-77, February 2018. <br/>
Mixed rules in multi‐issue allocation situations
doi:10.1002/nav.21785
Naval Research Logistics (NRL)
2018-03-22T07:00:00Z
Naval Research Logistics (NRL)
65
1
2018-03-22T07:00:00Z
2018-03-22T07:00:00Z
10.1002/nav.21785
https://onlinelibrary.wiley.com/doi/abs/10.1002/nav.21785?af=R
https://onlinelibrary.wiley.com/doi/abs/10.1002/nav.21785?af=R
Dynamic pricing and replenishment: Optimality, bounds, and asymptotics
Abstract
In many applications, managers face the problem of replenishing and selling products during a finite time horizon. We investigate the problem of making dynamic and joint decisions on product replenishment and selling in order to improve profit. We consider a backlog scenario in which penalty cost (resulting from fulfillment delay) and accommodation cost (resulting from shortage at the end of the selling horizon) are incurred. Based on continuous‐time and discrete‐state dynamic programming, we study the optimal joint decisions and characterize their structural properties. We establish an upper bound for the optimal expected profit and develop a fluid policy by resorting to the deterministic version of the problem (ie, the fluid problem). The fluid policy is shown to be asymptotically optimal for the original stochastic problem when the problem size is sufficiently large. The static nature of the fluid policy and its lack of flexibility in matching supply with demand motivate us to develop a “target‐inventory” heuristic, which is shown, numerically, to be a significant improvement over the fluid policy. Scenarios with discrete feasible sets and lost‐sales are also discussed in this article.
Yongbo
Xiao
http://feedproxy.google.com/~r/wileyonlinelibrary/nav/~3/i8z59Bz7sgc/nav.21786
Volume 65, Issue 1, Page 3-25, February 2018.

]]>
Naval Research Logistics (NRL), Volume 65, Issue 1, Page 3-25, February 2018. <br/>
Dynamic pricing and replenishment: Optimality, bounds, and asymptotics
doi:10.1002/nav.21786
Naval Research Logistics (NRL)
2018-03-29T07:00:00Z
Naval Research Logistics (NRL)
65
1
2018-03-29T07:00:00Z
2018-03-29T07:00:00Z
10.1002/nav.21786
https://onlinelibrary.wiley.com/doi/abs/10.1002/nav.21786?af=R
https://onlinelibrary.wiley.com/doi/abs/10.1002/nav.21786?af=R
Steady‐state diffusion approximations for discrete‐time queue in hospital inpatient flow management
Abstract
In this article, we analyze a discrete‐time queue that is motivated from studying hospital inpatient flow management, where the customer count process captures the midnight inpatient census. The stationary distribution of the customer count has no explicit form and is difficult to compute in certain parameter regimes. Using the Stein's method framework, we identify a continuous random variable to approximate the steady‐state customer count. The continuous random variable corresponds to the stationary distribution of a diffusion process with state‐dependent diffusion coefficients. We characterize the error bounds of this approximation under a variety of system load conditions—from lightly loaded to heavily loaded. We also identify the critical role that the service rate plays in the convergence rate of the error bounds. We perform extensive numerical experiments to support the theoretical findings and to demonstrate the approximation quality. In particular, we show that our approximation performs better than those based on constant diffusion coefficients when the number of servers is small, which is relevant to decision making in a single hospital ward.
Jiekun
Feng
,
Pengyi
Shi
http://feedproxy.google.com/~r/wileyonlinelibrary/nav/~3/Q2Ng2fLbHF0/nav.21787
Volume 65, Issue 1, Page 26-65, February 2018.

]]>
Naval Research Logistics (NRL), Volume 65, Issue 1, Page 26-65, February 2018. <br/>
Steady‐state diffusion approximations for discrete‐time queue in hospital inpatient flow management
doi:10.1002/nav.21787
Naval Research Logistics (NRL)
2018-04-06T07:00:00Z
Naval Research Logistics (NRL)
65
1
2018-04-06T07:00:00Z
2018-04-06T07:00:00Z
10.1002/nav.21787
https://onlinelibrary.wiley.com/doi/abs/10.1002/nav.21787?af=R
https://onlinelibrary.wiley.com/doi/abs/10.1002/nav.21787?af=R
Issue Information
http://feedproxy.google.com/~r/wileyonlinelibrary/nav/~3/9y5fUFZrVsw/nav.21754
Volume 65, Issue 1, Page 1-2, February 2018.

]]>
Naval Research Logistics (NRL), Volume 65, Issue 1, Page 1-2, February 2018. <br/>
Issue Information
doi:10.1002/nav.21754
Naval Research Logistics (NRL)
2018-04-14T07:00:00Z
Naval Research Logistics (NRL)
65
1
2018-04-14T07:00:00Z
2018-04-14T07:00:00Z
10.1002/nav.21754
https://onlinelibrary.wiley.com/doi/abs/10.1002/nav.21754?af=R
https://onlinelibrary.wiley.com/doi/abs/10.1002/nav.21754?af=R
Revenue management under randomly evolving economic conditions
Abstract
We consider a dynamic pricing model in which the instantaneous rate of the demand arrival process is dependent on not only the current price charged by the concerned firm, but also the present state of the world. While reflecting the current economic condition, the state evolves in a Markovian fashion. This model represents the real‐life situation in which the sales season is relatively long compared to the fast pace at which the outside environment changes. We establish the value of being better informed on the state of the world. When reasonable monotonicity conditions are met, we show that better present economic conditions will lead to higher prices. Our computational study is partially calibrated with real data. It demonstrates that the benefit of heeding varying economic conditions is on par with the value of embracing randomness in the demand process. © 2015 Wiley Periodicals, Inc. Naval Research Logistics, 2015
Yusen
Xia
,
Jian
Yang
,
Tingting
Zhou
http://feedproxy.google.com/~r/wileyonlinelibrary/nav/~3/hIRgbv6ba50/nav.21635
]]>
Naval Research Logistics (NRL), EarlyView. <br/>
Revenue management under randomly evolving economic conditions
doi:10.1002/nav.21635
Naval Research Logistics (NRL)
2015-07-15T07:00:00Z
Naval Research Logistics (NRL)
2015-07-15T07:00:00Z
2015-07-15T07:00:00Z
10.1002/nav.21635
https://onlinelibrary.wiley.com/doi/abs/10.1002/nav.21635?af=R
https://onlinelibrary.wiley.com/doi/abs/10.1002/nav.21635?af=R
On the convergence of optimal actions for Markov decision processes and the optimality of (s, S) inventory policies
Abstract
This article studies convergence properties of optimal values and actions for discounted and average‐cost Markov decision processes (MDPs) with weakly continuous transition probabilities and applies these properties to the stochastic periodic‐review inventory control problem with backorders, positive setup costs, and convex holding/backordering costs. The following results are established for MDPs with possibly non‐compact action sets and unbounded cost functions: (i) convergence of value iterations to optimal values for discounted problems with possibly non‐zero terminal costs, (ii) convergence of optimal finite‐horizon actions to optimal infinite‐horizon actions for total discounted costs, as the time horizon tends to infinity, and (iii) convergence of optimal discount‐cost actions to optimal average‐cost actions for infinite‐horizon problems, as the discount factor tends to 1. Being applied to the setup‐cost inventory control problem, the general results on MDPs imply the optimality of (s, S) policies and convergence properties of optimal thresholds. In particular this article analyzes the setup‐cost inventory control problem without two assumptions often used in the literature: (a) the demand is either discrete or continuous or (b) the backordering cost is higher than the cost of backordered inventory if the amount of backordered inventory is large.© 2017 Wiley Periodicals, Inc. Naval Research Logistics 00: 000–000, 2017
Eugene A.
Feinberg
,
Mark E.
Lewis
http://feedproxy.google.com/~r/wileyonlinelibrary/nav/~3/qblXJUyZgYQ/nav.21750
]]>
Naval Research Logistics (NRL), EarlyView. <br/>
On the convergence of optimal actions for Markov decision processes and the optimality of (s, S) inventory policies
doi:10.1002/nav.21750
Naval Research Logistics (NRL)
2017-08-11T07:00:00Z
Naval Research Logistics (NRL)
2017-08-11T07:00:00Z
2017-08-11T07:00:00Z
10.1002/nav.21750
https://onlinelibrary.wiley.com/doi/abs/10.1002/nav.21750?af=R
https://onlinelibrary.wiley.com/doi/abs/10.1002/nav.21750?af=R
On the reduction of total‐cost and average‐cost MDPs to discounted MDPs
Abstract
This article provides conditions under which total‐cost and average‐cost Markov decision processes (MDPs) can be reduced to discounted ones. Results are given for transient total‐cost MDPs with transition rates whose values may be greater than one, as well as for average‐cost MDPs with transition probabilities satisfying the condition that there is a state such that the expected time to reach it is uniformly bounded for all initial states and stationary policies. In particular, these reductions imply sufficient conditions for the validity of optimality equations and the existence of stationary optimal policies for MDPs with undiscounted total cost and average‐cost criteria. When the state and action sets are finite, these reductions lead to linear programming formulations and complexity estimates for MDPs under the aforementioned criteria.© 2017 Wiley Periodicals, Inc. Naval Research Logistics, 2017
Eugene A.
Feinberg
,
Jefferson
Huang
http://feedproxy.google.com/~r/wileyonlinelibrary/nav/~3/7fzdbt7ks6o/nav.21743
]]>
Naval Research Logistics (NRL), EarlyView. <br/>
On the reduction of total‐cost and average‐cost MDPs to discounted MDPs
doi:10.1002/nav.21743
Naval Research Logistics (NRL)
2017-05-25T07:00:00Z
Naval Research Logistics (NRL)
2017-05-25T07:00:00Z
2017-05-25T07:00:00Z
10.1002/nav.21743
https://onlinelibrary.wiley.com/doi/abs/10.1002/nav.21743?af=R
https://onlinelibrary.wiley.com/doi/abs/10.1002/nav.21743?af=R
Finite‐horizon Markov population decision chains with constant risk posture
Abstract
A Markov population decision chain concerns the control of a population of individuals in different states by assigning an action to each individual in the system in each period. This article solves the problem of finding policies that maximize expected system utility over a finite horizon in Markov population decision chains with finite state‐action space under the following assumptions: (1) The utility function exhibits constant risk posture, (2) the progeny vectors of distinct individuals are independent, and (3) the progeny vectors of individuals in a state who take the same action are identically distributed. The main result is that it is possible to solve the problem with the original state‐action space without augmenting it to include information about the population in each state or any other aspect of the system history. In particular, there exists an optimal policy that assigns the same action to all individuals in a given state and period, independently of the population in that period and such a policy can be computed efficiently. The optimal utility operators that find the maximum of a finite collection of polynomials (rather than affine functions) yield an optimal solution with effort linear in the number of periods.© 2016 Wiley Periodicals, Inc. Naval Research Logistics, 2016
Amanda M.
White
,
Pelin G.
Canbolat
http://feedproxy.google.com/~r/wileyonlinelibrary/nav/~3/IpTIJtwwT10/nav.21698
]]>
Naval Research Logistics (NRL), EarlyView. <br/>
Finite‐horizon Markov population decision chains with constant risk posture
doi:10.1002/nav.21698
Naval Research Logistics (NRL)
2016-07-29T07:00:00Z
Naval Research Logistics (NRL)
2016-07-29T07:00:00Z
2016-07-29T07:00:00Z
10.1002/nav.21698
https://onlinelibrary.wiley.com/doi/abs/10.1002/nav.21698?af=R
https://onlinelibrary.wiley.com/doi/abs/10.1002/nav.21698?af=R
Structural properties of a class of robust inventory and queueing control problems
Abstract
In standard stochastic dynamic programming, the transition probability distributions of the underlying Markov Chains are assumed to be known with certainty. We focus on the case where the transition probabilities or other input data are uncertain. Robust dynamic programming addresses this problem by defining a min‐max game between Nature and the controller. Considering examples from inventory and queueing control, we examine the structure of the optimal policy in such robust dynamic programs when event probabilities are uncertain. We identify the cases where certain monotonicity results still hold and the form of the optimal policy is determined by a threshold. We also investigate the marginal value of time and the case of uncertain rewards.© 2017 Wiley Periodicals, Inc. Naval Research Logistics, 2017
Zeynep
Turgay
,
Fikri
Karaesmen
,
Egemen
Lerzan Örmeci
http://feedproxy.google.com/~r/wileyonlinelibrary/nav/~3/Ax8DtrNFk6k/nav.21748
]]>
Naval Research Logistics (NRL), EarlyView. <br/>
Structural properties of a class of robust inventory and queueing control problems
doi:10.1002/nav.21748
Naval Research Logistics (NRL)
2017-08-07T07:00:00Z
Naval Research Logistics (NRL)
2017-08-07T07:00:00Z
2017-08-07T07:00:00Z
10.1002/nav.21748
https://onlinelibrary.wiley.com/doi/abs/10.1002/nav.21748?af=R
https://onlinelibrary.wiley.com/doi/abs/10.1002/nav.21748?af=R
Constant risk aversion in stochastic contests with exponential completion times
Abstract
This article analyzes a class of stochastic contests among multiple players under risk‐averse exponential utility. In these contests, players compete over the completion of a task by simultaneously deciding on their investment, which determines how fast they complete the task. The completion time of the task for each player is assumed to be an exponentially distributed random variable with rate linear in the player's investment and the completion times of different players are assumed to be stochastically independent. The player that completes the task first earns a prize whereas the remaining players earn nothing. The article establishes a one‐to‐one correspondence between the Nash equilibrium of this contest with respect to risk‐averse exponential utilities and the nonnegative solution of a nonlinear equation. Using the properties of the latter, it proves the existence and the uniqueness of the Nash equilibrium, and provides an efficient method to compute it. It exploits the resulting representation of the equilibrium investments to determine the effects of risk aversion and the differences between the outcome of the Nash equilibrium and that of a centralized version.© 2016 Wiley Periodicals, Inc. Naval Research Logistics, 2016
Pelin G.
Canbolat
,
Uriel G.
Rothblum
http://feedproxy.google.com/~r/wileyonlinelibrary/nav/~3/Vf7Awa9eO0M/nav.21727
]]>
Naval Research Logistics (NRL), EarlyView. <br/>
Constant risk aversion in stochastic contests with exponential completion times
doi:10.1002/nav.21727
Naval Research Logistics (NRL)
2017-01-24T08:00:00Z
Naval Research Logistics (NRL)
2017-01-24T08:00:00Z
2017-01-24T08:00:00Z
10.1002/nav.21727
https://onlinelibrary.wiley.com/doi/abs/10.1002/nav.21727?af=R
https://onlinelibrary.wiley.com/doi/abs/10.1002/nav.21727?af=R
Robust shortest path planning and semicontractive dynamic programming
Abstract
In this article, we consider shortest path problems in a directed graph where the transitions between nodes are subject to uncertainty. We use a minimax formulation, where the objective is to guarantee that a special destination state is reached with a minimum cost path under the worst possible instance of the uncertainty. Problems of this type arise, among others, in planning and pursuit‐evasion contexts, and in model predictive control. Our analysis makes use of the recently developed theory of abstract semicontractive dynamic programming models. We investigate questions of existence and uniqueness of solution of the optimality equation, existence of optimal paths, and the validity of various algorithms patterned after the classical methods of value and policy iteration, as well as a Dijkstra‐like algorithm for problems with nonnegative arc lengths.© 2016 Wiley Periodicals, Inc. Naval Research Logistics, 2016
Dimitri P.
Bertsekas
http://feedproxy.google.com/~r/wileyonlinelibrary/nav/~3/TuluvvnNreQ/nav.21697
]]>
Naval Research Logistics (NRL), EarlyView. <br/>
Robust shortest path planning and semicontractive dynamic programming
doi:10.1002/nav.21697
Naval Research Logistics (NRL)
2016-08-08T07:00:00Z
Naval Research Logistics (NRL)
2016-08-08T07:00:00Z
2016-08-08T07:00:00Z
10.1002/nav.21697
https://onlinelibrary.wiley.com/doi/abs/10.1002/nav.21697?af=R
https://onlinelibrary.wiley.com/doi/abs/10.1002/nav.21697?af=R
Level product form QSF processes and an analysis of queues with Coxian interarrival distribution
Abstract
In this article, we study a class of Quasi‐Skipfree (QSF) processes where the transition rate submatrices in the skipfree direction have a column times row structure. Under homogeneity and irreducibility assumptions we show that the stationary distributions of these processes have a product form as a function of the level. For an application, we will discuss the
‐queue that can be modeled as a QSF process on a two‐dimensional state space. In addition, we study the properties of the stationary distribution and derive monotonicity of the mean number of the customers in the queue, their mean sojourn time and the variance as a function of for fixed mean arrival rate. © 2016 Wiley Periodicals, Inc. Naval Research Logistics, 2016
Dwi
Ertiningsih
,
Michael N.
Katehakis
,
Laurens C.
Smit
,
Flora M.
Spieksma
http://feedproxy.google.com/~r/wileyonlinelibrary/nav/~3/RH6yjrIxAWQ/nav.21680
]]>
Naval Research Logistics (NRL), EarlyView. <br/>
Level product form QSF processes and an analysis of queues with Coxian interarrival distribution
doi:10.1002/nav.21680
Naval Research Logistics (NRL)
2016-03-30T07:00:00Z
Naval Research Logistics (NRL)
2016-03-30T07:00:00Z
2016-03-30T07:00:00Z
10.1002/nav.21680
https://onlinelibrary.wiley.com/doi/abs/10.1002/nav.21680?af=R
https://onlinelibrary.wiley.com/doi/abs/10.1002/nav.21680?af=R
Dynamic pricing policies for an inventory model with random windows of opportunities
Abstract
We study a single‐product fluid‐inventory model in which the procurement price of the product fluctuates according to a continuous time Markov chain. We assume that a fixed order price, in addition to state‐dependent holding costs are incurred, and that the depletion rate of inventory is determined by the sell price of the product. Hence, at any time the controller has to simultaneously decide on the selling price of the product and whether to order or not, taking into account the current procurement price and the inventory level. In particular, the controller is faced with the question of how to best exploit the random time windows in which the procurement price is low. We consider two policies, derive the associated steady‐state distributions and cost functionals, and apply those cost functionals to study the two policies.© 2017 Wiley Periodicals, Inc. Naval Research Logistics, 2017
Arnoud
den Boer
,
Ohad
Perry
,
Bert
Zwart
http://feedproxy.google.com/~r/wileyonlinelibrary/nav/~3/OTyiHQaXJb0/nav.21737
]]>
Naval Research Logistics (NRL), EarlyView. <br/>
Dynamic pricing policies for an inventory model with random windows of opportunities
doi:10.1002/nav.21737
Naval Research Logistics (NRL)
2017-04-20T07:00:00Z
Naval Research Logistics (NRL)
2017-04-20T07:00:00Z
2017-04-20T07:00:00Z
10.1002/nav.21737
https://onlinelibrary.wiley.com/doi/abs/10.1002/nav.21737?af=R
https://onlinelibrary.wiley.com/doi/abs/10.1002/nav.21737?af=R
Damage accumulation and probability of kill for gun and target engagements
Abstract
Determination of the gunfire probability of kill against a target requires two parameters to be taken into consideration: the likelihood of hitting the target (susceptibility) and the conditional probability of kill given a hit (vulnerability). Two commonly used methods for calculating the latter probability are (1) treating each hit upon the target independently, and (2) setting an exact number of hits to obtain a target kill. Each of these methods contains an implicit assumption about the probability distribution of the number of hits‐to‐kill. Method (1) assumes that the most likely kill scenario occurs with exactly one hit, whereas (2) implies that achieving a precise number of hits always results in a kill. These methods can produce significant differences in the predicted gun effectiveness, even if the mean number of hits‐to‐kill for each distribution is the same. We therefore introduce a new modeling approach with a more general distribution for the number of hits‐to‐kill. The approach is configurable to various classes of damage mechanism and is able to match both methods (1) and (2) with a suitable choice of parameter. We use this new approach to explore the influence of various damage accumulation models on the predicted effectiveness of weapon‐target engagements.
Paul A.
Chircop
,
Bernard J.
Kachoyan
http://feedproxy.google.com/~r/wileyonlinelibrary/nav/~3/J811vhoIiAg/nav.21784
]]>
Naval Research Logistics (NRL), EarlyView. <br/>
Damage accumulation and probability of kill for gun and target engagements
doi:10.1002/nav.21784
Naval Research Logistics (NRL)
2018-03-31T03:01:32Z
Naval Research Logistics (NRL)
2018-03-31T03:01:32Z
2018-03-31T03:01:32Z
10.1002/nav.21784
https://onlinelibrary.wiley.com/doi/abs/10.1002/nav.21784?af=R
https://onlinelibrary.wiley.com/doi/abs/10.1002/nav.21784?af=R