A system dynamics based multi user network game

We developed a multi-user computer network simulation game model as a decision support tool in a manufacturing and distribution system. The model, written in Powersim(registered) software package, based on system dynamics theories. The game is a "dynamic business environment" in which the outcome is determined by interactions within and between the players in the framework of the industrial system. This game can accommodate simultaneous play by a maximum of seven players. Management's job in the game is to employ its company's resources and to manage its operations in such a way as to minimize the inventory fluctuations and costs. The purpose of this decision support tool is to provide hypothetical business scenarios in which players-managers-can practice decision-making processes in their companies. The simulation game, built in this thesis, can Support planning, decision-making, and policy-setting processes by analyzing the effect of changes in the operations and resources that impact inventory level and cost and by providing a means to test and resent the proposed policies under different scenarios.http://archive.org/details/asystemdynamicsb1094513566Turkish Army author.Approved for public release; distribution is unlimited

A heuristic method to solve the Sales Based Integer Program for Airlines Network Revenue Management

Airline Revenue Management (RM) Departments pay remarkable attention to many different applications based on Sales Based Linear Program (SBLP). SBLP is mainly used by airlines to evaluate the performance of their RM systems, as well as it plays the role of optimization core for some RM Decision Support Systems. In this study, we consider Sales Based Integer Program (SBIP) formulation. We propose a new formulation based on Market-Service decomposition that allows to solve large instances of SBIP. We strengthen the linear relaxations of subproblems generated in LP-based branch-and-bound paradigm by introducing effective Chvatal-Gomory cuts. Main idea is to optimally allocate the capacity to the markets by transforming the market subproblems into a piecewise linear objective function. Major advantages are significant reduction of the problem size and the possibility of deriving a concave objective function which is strengthened dynamically

The sales based integer program for post-departure analysis in airline revenue management: model and solution

Airline revenue management (RM) departments pay remarkable attention to many different applications based on sales-based linear program (SBLP). SBLP is mainly used as the optimization core to solve network revenue management problems in RM decision support systems. In this study we consider a post-departure analysis, when there is no more randomness in the problem and we can tackle SBLP with integrality constraints on the variables (SBIP) in order to understand which should be the best possible solution. We propose a new formulation based on a market-service decomposition that allows to solve large instances of SBIP using LP-based branch-and-bound paradigm. We strengthen the bound obtained with the linear relaxations by introducing effective Chvàtal-Gomory cuts. Main idea is to optimally allocate the capacity to the markets by transforming the market subproblems into a piecewise linear objective function. Major advantages are significant reduction of the problem size and the possibility of deriving a concave objective function which is strengthened dynamically. Numerical results are reported. Providing realistic integral solutions move forward the network revenue management state of the art