An access network design problem with end-to-end QoS constraints

In this paper, we present an access network design problem with end-to-end quality of service (QoS) requirement. The problem can be conceptualized as a two-level hierarchical location-allocation problem on the tree topology with nonlinear side constraints. The objective function of the nonlinear mixed integer programming model minimizes the total cost of switch and fiber cable, while satisfying demand within the prescribed level of QoS. By exploiting the inherent structure of the nonlinear QoS constraints, we develop linearization techniques for finding an optimal solution. Also, we devise an effective exact optimal algorithm within the context of disjunctive constraint generation. We present promising computational results that demonstrate the effectiveness of the proposed solution procedure.     

Mixed integer (0–1) fractional programming for decision support in paper production industry

This paper presents an effective and efficient method for solving a special class of mixed integer fractional programming (FP) problems. We take a classical reformulation approach for continuous FP as a starting point and extend it for solving a more general class of mixed integer (0–1) fractional programming problems.To stress the practical relevance of the research we focus on a real-life application in paper production industry. The constantly advancing physical knowledge of large scale pulp and paper production did have a substantial impact on an existing DSS in which mixed integer (0–1) fractional programming is introduced. We show that the motivation to solve a real-life fractional programming problem can provide the basis for a new approach in a new context that has an added value of its own, even outside the given application area. We describe the main characteristics of the DSS, the necessity to develop a non-iterative solution procedure and demonstrate both the effectiveness and efficiency of the proposed approach from practical data sets.     

Transient detailed balance and product form for reaction networks

This paper explores the boundary of the set of reaction networks that have an exact transient (truncated) multidimensional Poisson or product-form distribution for the number of particles of different types. Motivated by the birth–death process, we introduce the notions of transient detailed balance and delay functions, and use these notions to obtain the novel transient product-form distribution in a coagulation-fragmentation process for polymers with a tree-like structure from that of the pure coagulation process.     

Staff rostering in call centers providing employee transportation

We address the staff rostering problem in call centers with the goal of balancing operational cost, agent satisfaction and customer service objectives. In metropolitan cities such as Istanbul and Mumbai, call centers provide the transportation of their staff so that shuttle costs constitute a significant part of the operational costs. We develop a mixed integer programming model that incorporates the shuttle requirements at the beginning and end of the shifts into the agent-shift assignment decisions, while considering the skill sets of the agents, and other constraints due to workforce regulations and agent preferences. We analyze model solutions for a banking call center under various management priorities to understand the interactions among the conflicting objectives. We show that considering transportation costs as well as agent preferences in agent-shift assignments provides significant benefits in terms of both cost savings and employee satisfaction.     

Incorporating balance concerns in resource allocation decisions: A bi-criteria modelling approach

We consider resource allocation problems where inputs are allocated to different entities such as activities, projects or departments. In such problems a common goal is achieving a desired balance in the allocation over different categories of the entities. We propose a bi-criteria framework for trading balance off against efficiency. We define and categorise indicators based on balance distribution and propose formulations and solution algorithms which provide insight into the balance-efficiency tradeoff. We illustrate our models by applying them to the data of a portfolio selection problem faced by a science funding agency and to randomly generated large-sized problem instances to demonstrate computational feasibility.     

Marginal likelihood estimation from the Metropolis output: tips and tricks for efficient implementation in generalized linear latent variable models

The marginal likelihood can be notoriously difficult to compute, and particularly so in high-dimensional problems. Chib and Jeliazkov employed the local reversibility of the Metropolis–Hastings algorithm to construct an estimator in models where full conditional densities are not available analytically. The estimator is free of distributional assumptions and is directly linked to the simulation algorithm. However, it generally requires a sequence of reduced Markov chain Monte Carlo runs which makes the method computationally demanding especially in cases when the parameter space is large. In this article, we study the implementation of this estimator on latent variable models which embed independence of the responses to the observables given the latent variables (conditional or local independence). This property is employed in the construction of a multi-block Metropolis-within-Gibbs algorithm that allows to compute the estimator in a single run, regardless of the dimensionality of the parameter space. The counterpart one-block algorithm is also considered here, by pointing out the difference between the two approaches. The paper closes with the illustration of the estimator in simulated and real-life data sets.     

A harmony search-based memetic optimization model for integrated production and transportation scheduling in MTO manufacturing

This paper investigates an integrated production and transportation scheduling problem in an MTO supply chain. A harmony search-based memetic optimization model is developed to handle this problem, in which certain heuristic procedures are proposed to convert the investigated problem into an order assignment problem. A novel improvisation process is also proposed to improve the optimum-seeking performance. The effectiveness of the proposed model is validated by numerical experiments. The experimental results show that (1) the proposed model can solve the investigated problem effectively and that (2) the proposed memetic optimization process exhibits better optimum-seeking performance than genetic algorithm-based and traditional memetic optimization processes.     

Bandwidth selection through cross-validation for semi-parametric varying-coefficient partially linear models

We study bandwidth selection for a class of semi-parametric models. The proper choice of optimal bandwidth minimizes the prediction errors of the model. We provide detailed derivation of our procedure and the corresponding computation algorithms. Our proposed method simplifies the computation of the cross-validation criteria and facilitates more complicated inference and analysis in practice. A data set from Wisconsin Diabetes Registry has been analysed as an illustration.     

Results concerning the generalized partially linear single-index model

The central topic of this article is the estimation of parameters of the generalized partially linear single-index model (GPLSIM). Two numerical optimization procedures are presented and an S-plus program based on these procedures is compared to a program by Wand in a simulation setting. The results from these simulations indicate that the estimates for the new procedures are as good, if not better, than Wand's. Also, this program is much more flexible than Wand's since it can handle more general models. Other simulations are also conducted. The first compares the effects of using linear interpolation versus spline interpolation in an optimization procedure. The results indicate that by using spline interpolation one gets more stable estimates at a cost of increased computational time. A second simulation was conducted to assess the performance of a method for estimating the variance of alpha. A third set of simulations is carried out to determine the best criterion for testing that one of the elements of alpha is equal to zero. The GPLSIM is applied to a water quality data set and the results indicate an interesting relationship between gastrointestinal illness and turbidity (cloudiness) of drinking water.     

On partial linear additive isotonic regression

In this paper we discuss semiparametric additive isotonic regression models. We discuss the efficiency bound of the model and the least squares estimator under this model. We show that the ordinary least square estimator studied by Huang (2002) and Cheng (2009) for the semiparametric isotonic regression achieves the efficiency bound for the regular estimator when the true parameter belongs to the interior of the parameter space. We also show that the result by Cheng (2009) can be generalized to the case that the covariates are dependent on each other.