Teesside University Research Data Repository2026 · dataset
Mission-reliability-constrained maintenance: data and codeThis dataset provides the data, code, numerical results, raw simulation outputs, and verification materials supporting the manuscript “Mission-reliability-constrained maintenance under correlated demand: Decision consequences of model simplification” by Chesoong Kim, Youngjin Oh, and Janos Sztrik. It supports reproduction of the CTMC, uniformization, DES, decision-map, transfer-margin, robustness,
figshare + Loughborough Research Repository2026 · Astronomical catalogue
Supplementary file 1_Multi-resource operating room scheduling: a three-stage heuristic for efficiency and patient safety.docxIntroduction<p>Operating room (OR) scheduling remains a critical healthcare operations challenge, yet existing approaches suffer from three fundamental limitations: they either oversimplify the multi-resource synchronization requirements, lack provable performance guarantees for clinical decision-making, or fail to adequately integrate emergency responsiveness with elective efficiency.</p>Methods<
Teesside University Research Data Repository2026 · dataset
Stochastic Hysteretic Capacity Control under Correlated Demand and Evolving Priority: A Queueing Framework Motivated by Emergency CareThis dataset provides the reproducibility data, source code, numerical outputs, simulation records, and verification materials supporting the article “Stochastic Hysteretic Capacity Control under Correlated Demand and Evolving Priority: A Queueing Framework Motivated by Emergency Care.” The archive contains the model inputs, CTMC construction and stationary-solution code, threshold-policy evaluati
Teesside University Research Data Repository2026 · dataset
Multi-Timescale Edge–Cloud Control under Correlated Batch Demand and Endogenous Degradation: Structural Analysis and Approximate OptimizationThis dataset provides the reproducibility data, manuscript source, publication figures, and verification code supporting the manuscript “Multi-Timescale Edge–Cloud Control under Correlated Batch Demand and Endogenous Degradation: Structural Analysis and Approximate Optimization.” The archive contains the V1.19 LaTeX source, bibliography, reference PDF, 12 frozen CSV ledgers, 11 vector figure files
figshare2026 · Astronomical catalogue
Instances Multi-Source<p dir="ltr">The objective is to maximize the number of high-priority nodes visited while simultaneously maximizing the total reward collected from those visits. The optimization process seeks to determine routes that provide the best trade-off between coverage of priority nodes and the cumulative reward obtained.</p>
figshare2026 · Astronomical catalogue
Numerical results of the B&B algorithm experiments<p dir="ltr">The results obtained from the computational experiments of the proposed branch and bound algorithm are presented.</p><p dir="ltr">There are two sets of results: B&B algorithm (solved without a time limit until the entire tree was explored) and B&B algorithm with a 10 minute time limit.</p><p dir="ltr">The data used is found here. https://doi.org/10.25439/rmt.26325706</p>
Teesside University Research Data Repository2026 · dataset
Benchmark instances for three‑stage integrated scheduling with complete‑kit assembly and finite‑buffer constraintsTeesside University Research Data Repository2026 · dataset
The Multivisit Parallel Drone Scheduling Electric Vehicle Routing Considering Soft Time Windows and Drone HeterogeneityThe set includes all instances used in the multi-visit parallel drone scheduling electric vehicle routing considering soft time windows and drone heterogeneity: 1. Small instances 2. Large instances 3. Instances for sensitivity analysis
Teesside University Research Data Repository2026 · dataset
SH_map数据包含行政区,POI,AOI,数据来源https://lbs.amap.com/api/webservice/guide/api/search
Teesside University Research Data Repository2026 · dataset
Neurologistics: Replication Package for an Exploratory Computational Experiment on Anticipatory Ethical Knowledge in AI-Enabled Supply ChainsThis replication package contains the complete Python code, configuration files, automated verification tests, documentation, synthetic result tables, figures, and run reports associated with the Neurologistics exploratory computational experiment. The simulation compares alternative decision architectures under controlled synthetic conditions in three AI-enabled logistics scenarios involving tens
Teesside University Research Data Repository2026 · dataset
Database for Service Level Optimization Using an Integrated Logistics Management Model at an Auto Parts Importing CompanyThis dataset contains data collected and processed for the research article titled "Service Level Optimization via an Integrated Logistics Management Model at an Auto Parts Importing Company." The data include: inventory records, the technical gap, economic impact, identification of root causes and reasons, cash flows for three scenarios (optimistic, pessimistic, and moderate), components of the i
Teesside University Research Data Repository2026 · dataset
Replication data and code for: Fair resource allocation in agricultural cooperatives under governance constraints: A simulation-based planning-support modelHugging Face Datasets2026 · Text
FrontierOR BenchmarkFrontierOR Benchmark A benchmark of 180 literature-grounded OR tasks, each packaged as a self-contained reproducible unit: natural-language problem description, mathematical formulation, reference Gurobi implementation, test instances, reference solutions, and an automated feasibility checker. Designed for evaluating LLMs on the end-to-end task of turning a research paper's OR proble
Teesside University Research Data Repository2025 · dataset
Validated Inventory Optimization Framework for E-commerce: Data & CodeThis dataset contains the data, figures, and code accompanying our validated inventory optimization framework for e-commerce. The framework optimizes the cycle service level (CSL) under a standard (Q,R) policy, balances holding, ordering, and shortage costs, and reports a U-shaped total cost curve with a minimum around 95% CSL (fill rate ≈ 99.8%). We provide both “policy-stable” sensitivity (CSL f
Teesside University Research Data Repository2025 · dataset
Replication data and code for “Processing Location for Cross-Border Perishables with Arrival-Rate–Conserving Conversion: Thresholds, Strategy Frontiers, and a China–US Case” (v1.0)This data article is related to the research article entitled “Processing Location for Cross-Border Perishables with Arrival-Rate–Conserving Conversion: Thresholds, Strategy Frontiers, and a China–US Case”. It consists of solver-ready Python code, calibrated inputs (in a CSV file), and the outputs generated to construct the decision-rule cards, uncertainty bands, and figures in the manuscript. Fol
IISH Dataverse2025 · dataset · unknown
Example Solution for the Pickup an Delivery Problem with Online TransfersThis is an example solution of our model for the pickup-and-delivery problem that utilizes quite a few online transfers.
IISH Dataverse2025 · dataset · unknown
Code: A Fast Exact Pricing Algorithm for the Railway Crew Scheduling ProblemThis is a repository containing the code used for the article A Fast Exact Pricing Algorithm for the Railway Crew Scheduling Problem'. In this article, a new exact pricing algorithm is proposed, and this algorithm is compared to the fastest known exact algorithm from literature. Abstract The railway crew scheduling problem consists of selecting a least cost set of duties that cover all tasks. Larg
IISH Dataverse2025 · dataset · unknown
Warehouse Data NL & BE 2017/2012Dataset containing warehouse performance characteristics from 2017 and 2012 for 131 warehouses from the Netherlands and Belgium. This dataset was compiled in 2017 by Christian Kaps with the support of René de Koster from Erasmus University Rotterdam as well as the warehouse associations evofendex and TLN in an effort to gather real-life data for a research project on automation’s effect on warehou
Teesside University Research Data Repository2024 · dataset
Order Picking Dataset from a Warehouse of a Footwear Manufacturing CompanyThis dataset originates from a real-world footwear manufacturing warehouse and provides a comprehensive foundation for benchmarking research in warehouse order-picking operations. Data was collected via SQL queries on the company’s Warehouse Management System (WMS), resulting in diverse formats such as CSV files, CAD layouts, and Python scripts. The dataset includes geometric representations of th
Repositorio Institucional de la Universidad de Burgos2024 · Archive
Dataset of the paper “Variable neighborhood search approach to face-shield delivery during pandemic periods”. International Transactions in Operational Research, 32(2), 719-744In 2020, the COVID-19 pandemic and its rapid spread shook health authorities worldwide at the regional and national levels. Healthcare systems had difficulty acquiring important supplies, such as face shields, which at that time were essential for healthcare staff. The need for this material increased with the spread of the pandemic. In most areas, warehouses did not have a sufficient stock of thi
Repositorio Institucional de la Universidad de Burgos2024 · Archive
Dataset of the paper “Grouping products for the optimization of production processes: A case in the steel manufacturing industry”. European Journal of Operational Research, 286(1), 190-202The optimization of a production process is often based on the efficient utilization of the production facility and equipment. In particular, reducing the time to change from producing one product to another is critical to the fulfillment of demand at a minimum cost. We study the production of steel coils in the context of searching for groups of products with similar characteristics in order to c
Repositorio Institucional de la Universidad de Burgos2024 · Archive
Dataset of the paper “Selection of Investment Portfolio with Social Responsibility: A Multi-Objective Model and a Tabu Search Method”. Applied Intelligence, 52, 15785-15808In this study, a model for the selection of investment portfolios is proposed with three objectives. In addition to the traditional objectives of maximizing profitability and minimizing risk, maximization of social responsibility is also considered. Moreover, with the purpose of controlling transaction costs, a limit is placed on the number of assets for selection. To the best of our knowledge, th
Repositorio Institucional de la Universidad de Burgos2024 · Archive
Dataset of the paper “Variable selection for linear regression in large databases: exact methods” Applied Intelligence, 51(6), 3736-3756The variable selection problem in the context of Linear Regression for large databases is analysed. The problem consists in selecting a small subset of independent variables that can perform the prediction task optimally. This problem has a wide range of applications. One important type of application is the design of composite indicators in various areas (sociology and economics, for example). Ot
Repositorio Institucional de la Universidad de Burgos2024 · Archive
Dataset of the paper “A stepped tabu search method for the clique partitioning problem”. Applied Intelligence, 53, 16275-16292Given an undirected graph, a clique is a subset of vertices in which the induced subgraph is complete; that is, all pairs of vertices of this subset are adjacent. Clique problems in graphs are very important due to their numerous applications. One of these problems is the clique partitioning problem (CPP), which consists of dividing the set of vertices of a graph into the smallest number of clique
Repositorio Institucional de la Universidad de Burgos2024 · Archive
Dataset of the paper “A multistart tabu search–based method for feature selection in medical applications". Scientific Reports, 13, 17140In the design of classification models, irrelevant or noisy features are often generated. In some cases, there may even be negative interactions among features. These weaknesses can degrade the performance of the models. Feature selection is a task that searches for a small subset of relevant features from the original set that generate the most efficient models possible. In addition to improving