Supply capacity acquisition and allocation with uncertain customer demands

We study a class of capacity acquisition and assignment problems with stochastic customer demands often found in operations planning contexts. In this setting, a supplier utilizes a set of distinct facilities to satisfy the demands of different customers or markets. Our model simultaneously assigns customers to each facility and determines the best capacity level to operate or install at each facility. We propose a branch-and-price solution approach for this new class of stochastic assignment and capacity planning problems. For problem instances in which capacity levels must fall between some pre-specified limits, we offer a tailored solution approach that reduces solution time by nearly 80% over an alternative approach using a combination of commercial nonlinear optimization solvers. We have also developed a heuristic solution approach that consistently provides optimal or near-optimal solutions, where solutions within 0.01% of optimality are found on average without requiring a nonlinear optimization solver.     

Fair resource allocation for different scenarios of demands

This paper considers a resource allocation problem, which objective is to treat fairly all the system users. Usually the requests cannot be entirely predicted, but the manager can forecast the request evolution, this leading to a set of possible scenarios. Such a problem arises for instance in network bandwidth allocation as well as in storage space management. It also appears in the management of computer systems, such as computational grids or in cloud computing, when teams share a common pool of machines. Problems of fair resource sharing arise among users with equal access right but with different needs.Here the problem is tackled by a multi-criteria model, where one criterion is associated to one scenario. A solution is a policy, which provides an allocation for each scenario. An algorithm is proposed and analysed that lists all solutions which are Pareto optimal with regard to the different possible user request scenarios. The algorithm is used offline, but can be adapted, with some additional hypothesis, to be used online.     

Centralized resource allocation with stochastic data

Data Envelopment Analysis (DEA) is a technique based on mathematical programming for evaluating the efficiency of homogeneous Decision Making Units (DMUs). In this technique inefficient DMUs are projected on to the frontier which constructed by the best performers. Centralized Resource Allocation (CRA) is a method in which all DMUs are projected on to the efficient frontier through solving just one DEA model. The intent of this paper is to present the Stochastic Centralized Resource Allocation (SCRA) in order to allocate centralized resources where inputs and outputs are stochastic. The concept discussed throughout this paper is illustrated using the aforementioned example.     

Quantifying the benefits of route reoptimisation under stochastic customer demands

Incorporating route reoptimisation in the management of vehicle routing operations under stochastic demands yields benefits such as lower transportation and inventory costs. Because an investment in advanced information systems is indispensable for route reoptimisation, a firm needs to estimate the likely magnitude of these benefits before making an investment decision. This study addresses this information needed by providing a framework to assess the benefits more completely than previous studies. The framework, which is the key contribution of the research, comprises a set of tractable models that together address the costs of both inventory and transportation. By accounting for key determinants of route reoptimisation's benefits, including, for example, the volatility of customer demands, the models are applicable to a broad range of vehicle routing scenarios.     

A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands

This article introduces a new exact algorithm for the capacitated vehicle routing problem with stochastic demands (CVRPSD). The CVRPSD can be formulated as a set partitioning problem and it is shown that the associated column generation subproblem can be solved using a dynamic programming scheme. Computational experiments show promising results.     

Optimal resource allocation in a complex queueing system

This paper studies the optimal allocation of service rates in a three-stage complex queueing system with total finite waiting space. The word ‘optimal’ is being used in the seitse minimising sum of costs of servers and holding subject to relevant constraints. The problem has been solved through geometric programming.     

Optimal resource allocation in survey designs

Resource allocation is a relatively new research area in survey designs and has not been fully addressed in the literature. Recently, the declining participation rates and increasing survey costs have steered research interests towards resource planning. Survey organizations across the world are considering the development of new mathematical models in order to improve the quality of survey results while taking into account optimal resource planning. In this paper, we address the problem of resource allocation in survey designs and we discuss its impact on the quality of the survey results. We propose a novel method in which the optimal allocation of survey resources is determined such that the quality of survey results, i.e., the survey response rate, is maximized. We demonstrate the effectiveness of our method by extensive numerical experiments.     

Optimal resource allocation across related channels

In this paper, we consider resource allocation strategies of a limited resource across two related channels in a multi-period setting. We study a stochastic control problem where the objective is to determine the optimal limited resource allocation policy across two related channels and optimal transshipment policy between these two channels. We characterize some structural results of the optimal resource allocation policy and show that it is determined by three monotone curves.     

A genetic-algorithm-based approach to the two-echelon capacitated vehicle routing problem with stochastic demands in logistics service

This paper addresses the two-echelon capacitated vehicle routing problem (2E-CVRP) with stochastic demands (2E-CVRPSD) in city logistics. A stochastic program with recourse is used to describe the problem. This program aims to minimize the sum of the travel cost and the expected cost of recourse actions resulting from potential route failures. In a two-echelon distribution system, split deliveries are allowed at the first level but not at the second level, thereby increasing the difficulty of calculating the expected failure cost. Three types of routes with or without split deliveries are identified. Different methods are devised or adapted from the literature to compute the failure cost. A genetic-algorithm-based (GA) approach is proposed to solve the 2E-CVRPSD. A simple encoding and decoding scheme, a modified route copy crossover operator, and a satellite-selection-based mutation operator are devised in this approach. The numerical results show that for all instances, the expected cost of the best 2E-CVRPSD solution found by the proposed approach is not greater than that of the best-known 2E-CVRP solution with an average relative gap of 2.57%. Therefore, the GA-based approach can find high-quality solutions for the 2E-CVRPSD.     

Optimal resource allocation in presidential primaries

A model for the optimal allocation of resources in presidential primaries is described, under the assumption that two candidates seek to maximize their expected delegate vote in a sequential game that allows for momentum transfer from earlier to later contests. Specifically, the model assumes that the probability that a voter in a primary state votes for a particular candidate is a function of both the resources that candidate and his opponent allocate to that primary and their performances in the immediately preceding primary - and indirectly on all earlier primaries. Given that the candidates make equal (optimal) allocations to each primary, a local maximum, which heavily emphasizes the earlier primaries, is found. Several modifications in the basic model are discussed. Preliminary financial expenditure data are used to test the basic model for the 1976 primaries, and some cursory comparisons with 1980 are made. Possible normative implications of changes in the primary rules are briefly considered, particularly with respect to inequities the present rules seem to engender.     

Single vehicle routing problems with a predefined customer sequence, compartmentalized load and stochastic demands

We consider the problem of finding the optimal routing of a single vehicle that delivers K different products to N customers according to a particular customer order. The demands of the customers for each product are assumed to be random variables with known distributions. Each product type is stored in its dedicated compartment in the vehicle. Using a suitable dynamic programming algorithm we find the policy that satisfies the demands of the customers with the minimum total expected cost. We also prove that this policy has a specific threshold-type structure. Furthermore, we investigate a corresponding infinite-time horizon problem in which the service of the customers does not stop when the last customer has been serviced but it continues indefinitely with the same customer order. It is assumed that the demands of the customers at different tours have the same distributions. It is shown that the discounted-cost optimal policy and the average-cost optimal policy have the same threshold-type structure as the optimal policy in the original problem. The theoretical results are illustrated by numerical examples.     

The complexity of branch-and-price algorithms for the capacitated vehicle routing problem with stochastic demands

The capacitated vehicle routing problem with stochastic demands (CVRPSD) is a variant of the deterministic capacitated vehicle routing problem where customer demands are random variables. While the most successful formulations for several deterministic vehicle-routing problem variants are based on a set-partitioning formulation, adapting such formulations for the CVRPSD under mild assumptions on the demands remains challenging. In this work we provide an explanation to such challenge, by proving that when demands are given as a finite set of scenarios, solving the LP relaxation of such formulation is strongly NP-Hard. We also prove a hardness result for the case of independent normal demands.     

Fair resource allocation for demands with sharp lower tail inequalities

We consider a fairness problem in resource allocation where multiple groups demand resources from a common source with the total fixed amount. We show that for many common demand distributions satisfying sharp lower-tail inequalities, a natural allocation that provides resources proportional to each group's average demand performs very well. More specifically, this natural allocation is approximately fair and efficient (i.e., it provides near maximum utilization). We also show that, when a small amount of unfairness is allowed, the Price of Fairness (PoF), in this case, is close to 1.     

Progressive hedging innovations for a class of stochastic mixed-integer resource allocation problems

Numerous planning problems can be formulated as multi-stage stochastic programs and many possess key discrete (integer) decision variables in one or more of the stages. Progressive hedging (PH) is a scenario-based decomposition technique that can be leveraged to solve such problems. Originally devised for problems possessing only continuous variables, PH has been successfully applied as a heuristic to solve multi-stage stochastic programs with integer variables. However, a variety of critical issues arise in practice when implementing PH for the discrete case, especially in the context of very difficult or large-scale mixed-integer problems. Failure to address these issues properly results in either non-convergence of the heuristic or unacceptably long run-times. We investigate these issues and describe algorithmic innovations in the context of a broad class of scenario-based resource allocation problem in which decision variables represent resources available at a cost and constraints enforce the need for sufficient combinations of resources. The necessity and efficacy of our techniques is empirically assessed on a two-stage stochastic network flow problem with integer variables in both stages.     

Optimal resource allocation in a two-sector economic model with singular regimes

The article considers the problem of resource allocation in a two-sector economic model with a nonlinear production function of a special type. The main mathematical apparatus is Pontryagin’s maximum principle, i.e., the theorem on necessary conditions of optimality. It is shown that in the given problem the maximum principle provides a necessary and sufficient condition of optimality. A possible singular solution of the problem is found. An extremum solution is constructed in explicit form under various assumptions about the initial values. A “sufficiently long” planning horizon is assumed. An alternative approach is described, which does not use the maximum principle and instead investigates the integral representation of the optimand functional. The detailed theoretical investigation of the problem is accompanied by numerous illustrations.     

Optimal resource allocation for security in reliability systems

Recent results have used game theory to explore the nature of optimal investments in the security of simple series and parallel systems. However, it is clearly important in practice to extend these simple security models to more complicated system structures with both parallel and series subsystems (and, eventually, to more general networked systems). The purpose of this paper is to begin to address this challenge. While achieving fully general results is likely to be difficult, and may require heuristic approaches, we are able to find closed-form results for systems with moderately general structures, under the assumption that the cost of an attack against any given component increases linearly in the amount of defensive investment in that component. These results have interesting and sometimes counterintuitive implications for the nature of optimal investments in security.     

Optimal resource allocation for multiqueue systems with a shared server pool

We study optimal allocation of servers for a system with multiple service facilities and with a shared pool of servers. Each service facility poses a constraint on the maximum expected sojourn time of a job. A central decision maker can dynamically allocate servers to each facility, where adding more servers results in faster processing speeds but against higher utilization costs. The objective is to dynamically allocate the servers over the different facilities such that the sojourn-time constraints are met at minimal costs. This situation occurs frequently in practice, for example, in Grid systems for real-time image processing (iris scans, fingerprints). We model this problem as a Markov decision process and derive structural properties of the relative value function. These properties, which are hard to derive for multidimensional systems, give a full characterization of the optimal policy. We demonstrate the effectiveness of these policies by extensive numerical experiments.     

Optimal strategies for asset allocation and consumption under stochastic volatility

Selecting optimal asset allocation and consumption strategies is an important, but difficult, topic in modern finance. The dynamics is governed by a nonlinear partial differential equation. Stochastic volatility adds further complication. Even to obtain a numerical solution is challenging. Here, we develop a closed-form approximate solution. We show that our theoretical predictions for the optimal asset allocation strategy and the optimal consumption strategy are in surprisingly good agreement with the results from full numerical computations.     

Optimal multiple-objective resource allocation using hybrid particle swarm optimization and adaptive resource bounds technique

The multiple-objective resource allocation problem (MORAP) seeks for an allocation of resource to a number of activities such that a set of objectives are optimized simultaneously and the resource constraints are satisfied. MORAP has many applications, such as resource distribution, project budgeting, software testing, health care resource allocation, etc. This paper addresses the nonlinear MORAP with integer decision variable constraint. To guarantee that all the resource constraints are satisfied, we devise an adaptive-resource-bound technique to construct feasible solutions. The proposed method employs the particle swarm optimization (PSO) paradigm and presents a hybrid execution plan which embeds a hill-climbing heuristic into the PSO for expediting the convergence. To cope with the optimization problem with multiple objectives, we evaluate the candidate solutions based on dominance relationship and a score function. Experimental results manifest that the hybrid PSO derives solution sets which are very close to the exact Pareto sets. The proposed method also outperforms several representatives of the state-of-the-art algorithms on a simulation data set of the MORAP.     

Optimal threshold density in a stochastic resource management model with pulse intervention

Human activities and agricultural practices are having huge impacts on the development of fishery and land resources through different ways. To model such systems that involve harvesting, an impulsive model of natural resources with a stochastic noise perturbation element is formulated to study the relationship between (a) the maximal expectation of biomass after harvesting or fishing events and (b) the minimal expectation of pest biomass and the number of times pesticide is applied. Using a detailed analytical treatment, time estimation, and numerical demonstrations, we establish that the proposed mechanism is capable of maximizing fish populations at the end of a fishing season and minimizing pest numbers after a crop harvesting season once the intensity of the noise is relatively small. Investigations of the effects of different parameters reveal that theoretical predictions from the new stochastic model accord with those from the deterministic case. Recommendations for Resource Managers

• Various measures can be implemented to manage natural resources, such as adjusting fishing quantity and intensity to maximize fish population.
• In the natural environment, population growth is inevitably affected by the environment noise. So it is important to understand the noise effect to maintain sustainability of resources.
• Investigated methods are useful to converse resources and can be widely applied to control pests.