S. Armagan Tarim
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
S. Armagan Tarim has a total of 61 co-authors. Here are the top co-authors by number of shared publications:
- Roberto Rossi
Business School University of Edinburgh UK
45 shared publications - Steven Prestwich
University College Cork
36 shared publications Brahim Hnich
14 shared publications- Brahim Hnich
Department of Computer Engineering Izmir University of Economics Turkey
13 shared publications - Huseyin Tunc
Department of Business Administration, Social Sciences University of Ankara, Ankara, Turkiye
7 shared publications Onur A. Kilic
7 shared publications
Latest Publications
- Open Access
Mixed-Integer Linear Programming Approximations for the Stochastic Knapsack
We develop a novel mathematical programming approximation framework to tackle the stochastic knapsack problem. In this problem, the decision maker considers items for which either weights or values, or both, are random. The aim is to select a subset of these items to be included into their knapsack. We study both "static" and "dynamic" variants of this problem: in the static setting, the decision about which items should be included in the knapsack is taken at the outset, before any random item value or weight is revealed; in the dynamic setting, items are received sequentially, and the decision about a particular item is made by taking into account previously observed values and weights. The knapsack has a given capacity, and if the total realised weight exceeds this capacity then a penalty cost is incurred for each unit of excess capacity utilised. The goal is to maximise the expected net profit. We tackle the case of normally distributed item weights and we show that our approach extends seamlessly to the case in which item weights are correlated and follow a multivariate normal distribution. In addition, we show our approach represents an effective heuristic for the case in which item weights follow generic probability distributions. In an extensive computational study we demonstrate that our models are near-optimal and more scalable than other state-of-the-art approaches.
Open AccessMixed-Integer Linear Programming Approximations for the Stochastic Knapsack
We develop a novel mathematical programming approximation framework to tackle the stochastic knapsack problem. In this problem, the decision maker considers items for which either weights or values, or both, are random. The aim is to select a subset of these items to be included into their knapsack. We study both "static" and "dynamic" variants of this problem: in the static setting, the decision about which items should be included in the knapsack is taken at the outset, before any random item value or weight is revealed; in the dynamic setting, items are received sequentially, and the decision about a particular item is made by taking into account previously observed values and weights. The knapsack has a given capacity, and if the total realised weight exceeds this capacity then a penalty cost is incurred for each unit of excess capacity utilised. The goal is to maximise the expected net profit. We tackle the case of normally distributed item weights and we show that our approach extends seamlessly to the case in which item weights are correlated and follow a multivariate normal distribution. In addition, we show our approach represents an effective heuristic for the case in which item weights follow generic probability distributions. In an extensive computational study we demonstrate that our models are near-optimal and more scalable than other state-of-the-art approaches.
- Open Access
- 5 June 2025
- Published by Elsevier in Expert Systems with Applications
- Vol. 296
Weight stability intervals for multi-criteria decision analysis using the weighted sum model
- 5 June 2025
- Published by Elsevier in Expert Systems with Applications
- Vol. 296
Open AccessWeight stability intervals for multi-criteria decision analysis using the weighted sum model
- Open Access
- 5 July 2023
- Published by Elsevier in European Journal of Operational Research
- Vol. 312 (2) , 541-555
On the stochastic inventory problem under order capacity constraints
- 5 July 2023
- Published by Elsevier in European Journal of Operational Research
- Vol. 312 (2) , 541-555
Open AccessOn the stochastic inventory problem under order capacity constraints
- 22 April 2022
- Published by Elsevier in European Journal of Operational Research
- Vol. 304 (2) , 515-524
A mathematical programming-based solution method for the nonstationary inventory problem under correlated demand
- 22 April 2022
- Published by Elsevier in European Journal of Operational Research
- Vol. 304 (2) , 515-524
A mathematical programming-based solution method for the nonstationary inventory problem under correlated demand
- Open Access
A Simulated Annealing Algorithm for Joint Stratification and Sample Allocation Designs
This study combines simulated annealing with delta evaluation to solve the joint stratification and sample allocation problem. In this problem, atomic strata are partitioned into mutually exclusive and collectively exhaustive strata. Each partition of atomic strata is a possible solution to the stratification problem, the quality of which is measured by its cost. The Bell number of possible solutions is enormous, for even a moderate number of atomic strata, and an additional layer of complexity is added with the evaluation time of each solution. Many larger scale combinatorial optimisation problems cannot be solved to optimality, because the search for an optimum solution requires a prohibitive amount of computation time. A number of local search heuristic algorithms have been designed for this problem but these can become trapped in local minima preventing any further improvements. We add, to the existing suite of local search algorithms, a simulated annealing algorithm that allows for an escape from local minima and uses delta evaluation to exploit the similarity between consecutive solutions, and thereby reduces the evaluation time. We compared the simulated annealing algorithm with two recent algorithms. In both cases, the simulated annealing algorithm attained a solution of comparable quality in considerably less computation time.
Open AccessA Simulated Annealing Algorithm for Joint Stratification and Sample Allocation Designs
This study combines simulated annealing with delta evaluation to solve the joint stratification and sample allocation problem. In this problem, atomic strata are partitioned into mutually exclusive and collectively exhaustive strata. Each partition of atomic strata is a possible solution to the stratification problem, the quality of which is measured by its cost. The Bell number of possible solutions is enormous, for even a moderate number of atomic strata, and an additional layer of complexity is added with the evaluation time of each solution. Many larger scale combinatorial optimisation problems cannot be solved to optimality, because the search for an optimum solution requires a prohibitive amount of computation time. A number of local search heuristic algorithms have been designed for this problem but these can become trapped in local minima preventing any further improvements. We add, to the existing suite of local search algorithms, a simulated annealing algorithm that allows for an escape from local minima and uses delta evaluation to exploit the similarity between consecutive solutions, and thereby reduces the evaluation time. We compared the simulated annealing algorithm with two recent algorithms. In both cases, the simulated annealing algorithm attained a solution of comparable quality in considerably less computation time.
- Open Access
- 1 October 2021
- Published by Elsevier in European Journal of Operational Research
- Vol. 294 (1) , 91-99
Computing optimal () policy parameters by a hybrid of branch-and-bound and stochastic dynamic programming- 1 October 2021
- Published by Elsevier in European Journal of Operational Research
- Vol. 294 (1) , 91-99
Open AccessComputing optimal () policy parameters by a hybrid of branch-and-bound and stochastic dynamic programming - Open Access
A mathematical programming-based solution method for the nonstationary inventory problem under correlated demand
This paper extends the single-item single-stocking location non-stationary stochastic inventory problem to relax the assumption of independent demand. We present a mathematical programming-based solution method that relaxes the assumption of demand independence between time periods in an existing piecewise linear approximation strategy under the receding horizon control framework. Our method can be solved via off-the-shelf mixed-integer linear programming solvers. It can tackle demand under various assumptions: the multivariate normal distribution, a collection of time-series processes, and the Martingale Model of Forecast Evolution. We compare against solutions via stochastic dynamic programming to demonstrate that our method leads to near-optimal solutions.
Open AccessA mathematical programming-based solution method for the nonstationary inventory problem under correlated demand
This paper extends the single-item single-stocking location non-stationary stochastic inventory problem to relax the assumption of independent demand. We present a mathematical programming-based solution method that relaxes the assumption of demand independence between time periods in an existing piecewise linear approximation strategy under the receding horizon control framework. Our method can be solved via off-the-shelf mixed-integer linear programming solvers. It can tackle demand under various assumptions: the multivariate normal distribution, a collection of time-series processes, and the Martingale Model of Forecast Evolution. We compare against solutions via stochastic dynamic programming to demonstrate that our method leads to near-optimal solutions.
- 1 October 2019
- Published by Wiley in System Dynamics Review
- Vol. 35 (4) , 337-368
An integrated economy‐demography model reframed in a system dynamics setting
In recent history, there has been an increasing concern about population aging and the associated increased economic burden in terms of high health‐care expenses and pension payments. The need for decision support tools that can explore population dynamics has become a prominent issue. This study presents a comprehensive framework where one can scrutinize the key demographic drives of fertility (Total Fertility Rate/Age‐Specific Fertility Rate) over macroeconomic indicators (technology, education, human capital) under exogenous mortality. The integrated model in this article is developed based on a reformulation of the unified growth theory. In the reformulated model, namely the “economy‐demography model,” the population age/sex structure is preserved, age‐specific mortality is included, and fertility is measured in conventional demographic terms. The model is then presented in system dynamics framework, and its practical use is showcased with data obtained from the Turkish Statistical Institute.Copyright © 2020 System Dynamics Society
- 1 October 2019
- Published by Wiley in System Dynamics Review
- Vol. 35 (4) , 337-368
An integrated economy‐demography model reframed in a system dynamics setting
In recent history, there has been an increasing concern about population aging and the associated increased economic burden in terms of high health‐care expenses and pension payments. The need for decision support tools that can explore population dynamics has become a prominent issue. This study presents a comprehensive framework where one can scrutinize the key demographic drives of fertility (Total Fertility Rate/Age‐Specific Fertility Rate) over macroeconomic indicators (technology, education, human capital) under exogenous mortality. The integrated model in this article is developed based on a reformulation of the unified growth theory. In the reformulated model, namely the “economy‐demography model,” the population age/sex structure is preserved, age‐specific mortality is included, and fertility is measured in conventional demographic terms. The model is then presented in system dynamics framework, and its practical use is showcased with data obtained from the Turkish Statistical Institute.Copyright © 2020 System Dynamics Society
- Open Access
An (R, S) Based Heuristic Model for the Stochastic Joint Replenishment Problem
This paper considers the periodic-review stochastic joint replenishment problem (JRP) under Bookbinder and Tan's static-dynamic uncertainty control policy. According to a static-dynamic uncertainty control rule, the decision maker fixes timing of replenishments once and for all at the beginning of the planning horizon, the inventory position is then raised to a predefined order-up-to-position at the beginning of each replenishment period. In this policy, freezing the replenishment times ameliorates the inherent difficulties pertinent to replenishment coordination of multiple products, whereas dynamic order quantities facilitate dealing with uncertain demands. We adapt and extend an earlier mixed integer linear programming (MILP) model for computing static-dynamic uncertainty policy parameters, and demonstrate that the same can be used to approximate the optimal control rule for the JRP, also known as $(\sigma, \vec{S})$ policy. An extensive computational study illustrates the effectiveness of our approach when compared to alternative approaches in the literature.Open AccessAn (R, S) Based Heuristic Model for the Stochastic Joint Replenishment Problem
This paper considers the periodic-review stochastic joint replenishment problem (JRP) under Bookbinder and Tan's static-dynamic uncertainty control policy. According to a static-dynamic uncertainty control rule, the decision maker fixes timing of replenishments once and for all at the beginning of the planning horizon, the inventory position is then raised to a predefined order-up-to-position at the beginning of each replenishment period. In this policy, freezing the replenishment times ameliorates the inherent difficulties pertinent to replenishment coordination of multiple products, whereas dynamic order quantities facilitate dealing with uncertain demands. We adapt and extend an earlier mixed integer linear programming (MILP) model for computing static-dynamic uncertainty policy parameters, and demonstrate that the same can be used to approximate the optimal control rule for the JRP, also known as $(\sigma, \vec{S})$ policy. An extensive computational study illustrates the effectiveness of our approach when compared to alternative approaches in the literature.