Showing papers in "International Transactions in Operational Research in 2012"

TL;DR: A general overview of several variants of the split delivery vehicle routing problem (SDVRP), a class of routing problems where each customer may be served by more than one vehicle, and of the literature available are presented.

TL;DR: This research shows that by using operations research (OR) to adapt supply chain best practices to humanitarian logistics, significant improvements can be achieved.

TL;DR: This article explains how efficiently build and manage inter-firms relationships and proposes five coordination mechanisms that contribute to ensure information sharing, the coordination of logistics activities and the share of benefits.

TL;DR: The knapsack problem (KP) and its multidimensional version (MKP) are basic problems in combinatorial optimization and their multiobjective extension (MOKP and MOMKP), for which the aim is to obtain or approximate the set of efficient solutions.

TL;DR: The most recent and seminal work in all four areas of operations research is reviewed, considering modeling, algorithmic developments and application.

TL;DR: An introductory review of fundamental problems in sports scheduling and their formulations, followed by a survey of applications of optimization methods to scheduling problems in professional leagues of different sport disciplines such as football, baseball, basketball, cricket, and hockey.

TL;DR: The goal in this paper is to study open research lines related to metaheuristics but focusing on less explored areas to provide new perspectives to those researchers interested in multi-objective optimization.

TL;DR: This paper deals with an integrated single-manufacturer single-retailer supply chain model for a single item and determines optimal policies for both the centralized and decentralized coordination systems.

TL;DR: This paper classifies and presents the main exact approaches dealing with several multicriteria path problems putting in evidence the shortest path problem, and reviews exact algorithms dedicated to some multicritical tree problems, namely the minimum spanning tree and the minimum cost/minimum label spanning tree problems.

TL;DR: This tutorial provides an overview of various characteristics of effective branch and cut type algorithms for the maximum stable set problem, and discusses several facet-defining inequalities for the stable set polytope along with their separation routines.

TL;DR: A probabilistic model is proposed and examined for the multivariate distribution of the number of calls in each period of the day in a call center, where the marginal distribution is arbitrary, and the dependence between the periods is modeled via a normal copula.

TL;DR: Both data envelopment analysis and stochastic frontier analysis are applied to measure the efficiency of higher education courses, especially the business administration courses offered by private for-profit institutions that focus just on education and are located in the same geographical region.

TL;DR: By means of some results of the extreme values theory, the probability distribution of the maximum stochastic utilities is derived and the expected value of the optimum of the Stochastic model is found.

TL;DR: In this article, the concept of returns to growth (RTG) of a high-tech firm facing hypercompetition in the new economy is introduced by describing a proportional relationship between growth in inputs and growth in outputs using the growth efficiency (GE) model of Sengupta.

TL;DR: A simulation-based algorithm is proposed using semi-greedy construction heuristics to tackle medium- or large-scale instances of the Stacking Problem, a hard combinatorial optimization problem concerning handling and storage of items in a warehouse.

TL;DR: The objective in this paper is to look at the issues that need to be taken into account in the modeling and analysis of decision problems that are subject to severe uncertainty, paying special attention to some of the misconceptions that are being promulgated in this area.

TL;DR: Recommendations include where to open new rural schools as well as where to expand, reduce, close, or leave unchanged existing schools and it is shown how recommendations are sensitive to key parameters such as the cost of transportation.

TL;DR: An inventory model for exponentially deteriorating and imperfect quality items when a trade credit is offered by the supplier is developed and a numerical example demonstrating the applicability of the proposed model has been included.

TL;DR: The general NP-hardness for the md-MST is established and some properties related to the feasibility of the solutions for this problem are presented, in particular some bounds on the number of internal and leaf nodes are proved.

TL;DR: This paper describes and discusses a number of aspects and requirements in industrial implementations where optimization has been a vital planning or execution tool and presents results and general experience acquired from these implementations.

TL;DR: A decision process that features a set of security rules and a multi-objective optimization model to accomplish this aim is proposed and an illustration is provided to demonstrate the potential usefulness of these concepts in practice.

TL;DR: The paper discusses the benefits and barriers of a distributed approach and then, using a healthcare DSCS, the technological feasibility is demonstrated and the possible distributed approach held great promise is referred to as Distributed Supply Chain Simulation (DSCS).

TL;DR: A two-stage stochastic mixed 0–1 programming model is formulated to satisfy customer demand while minimizing the total logistics cost and provides a more responsive and less expensive global logistics system.

TL;DR: The DEA-based methodology described in this paper has offered an objective way to compare network schools among themselves and with out-of-network schools, providing a deeper understanding of school efficiency levels in the face of scarce resources, and allowing for sharing of best practices across the network.

TL;DR: In this paper, some drawbacks of existing models are explained and new approaches for determining a common set of weights are proposed.

TL;DR: Five basic ideas (overbooking, differential pricing, product protection, planned upgrades, and short-selling) and their variants provide the conceptual foundations of the practice of RM and motivate OR research in RM.

TL;DR: In this paper, a metaheuristic approach was proposed to solve the redundancy allocation problem in a series-parallel system with a mix of components, where different types of components can be used in parallel.

TL;DR: The method produced not only the best efficient solution of the linear objective function but also a subset of nondominated solutions that can help decision makers to select the best decision among a large set of Pareto solutions.

TL;DR: The aim of this work is to find optimal decisions related with cash inventory and transportation across the network, trying to balance the cost of the service and the quality perceived for final users.