Optimal budget allocation policy for tabu search in stochastic simulation optimization
type: Item
instance of: scholarly article
title: Optimal budget allocation policy for tabu search in stochastic simulation optimization
author: Chunlong Yu
author: Nadia Lahrichi
author: Andrea Matta
published in: Computers \& Operations Research
publication date: 2022-12-19T00:00:00Z
Mathematics Subject Classification ID: 90Bxx
zbMATH DE Number: 7634090
zbMATH Keywords: metaheuristics
zbMATH Keywords: simulation optimization
zbMATH Keywords: tabu search
zbMATH Keywords: optimal computing budget allocation
zbMATH Keywords: ranking and selection
describes a project that uses: EGO
describes a project that uses: SimOpt
MaRDI profile type: Publication
full work available at URL: j.cor.2022.106046
OpenAlex ID: W4306740563
cites work: Q4451011
cites work: A Single-Sample Multiple Decision Procedure for Ranking Means of Normal Populations with known Variances
cites work: Selecting a Selection Procedure
cites work: A lower bound for the correct subset-selection probability and its application to discrete-event system simulations
cites work: Efficient Dynamic Simulation Allocation in Ordinal Optimization
cites work: Simulation budget allocation for further enhancing the efficiency of ordinal optimization
cites work: Complete expected improvement converges to an optimal budget allocation
cites work: Differentiated service inventory optimization using nested partitions and MOCBA
cites work: Sequential sampling to myopically maximize the expected value of information
cites work: A parallel tabu search for solving the primal buffer allocation problem in serial production systems
cites work: Large deviations techniques and applications.
cites work: Scheduling using tabu search methods with intensification and diversification
cites work: A Knowledge-Gradient Policy for Sequential Information Collection
cites work: Recent advances in tabu search
cites work: A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers
cites work: Handbook of metaheuristics
cites work: Future paths for integer programming and links to artificial intelligence
cites work: Ranking and selection for steady-state simulation: procedures and perspectives
cites work: Simulation optimization using the cross-entropy method with optimal computing budget allocation
cites work: Efficient global optimization of expensive black-box functions
cites work: A fully sequential procedure for indifference-zone selection in simulation
cites work: A procedure for selecting a subset of size m containing the l best of k independent normal populations, with applications to simulation
cites work: Multi-objective simulation-based evolutionary algorithm for an aircraft spare parts allocation problem
cites work: Optimal Computing Budget Allocation to Select the Nondominated Systems—A Large Deviations Perspective
cites work: Fully sequential procedures for large-scale ranking-and-selection problems in parallel computing environments
cites work: Determining buffer location and size in production lines using tabu search
cites work: Efficient Ranking and Selection in Parallel Computing Environments
cites work: Particle swarm optimization for function optimization in noisy environment
cites work: Ranking and Selection as Stochastic Control
cites work: A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups
cites work: On two-stage selection procedures and related probability-inequalities
cites work: On the Convergence Rates of Expected Improvement Methods
cites work: Using tabu search to schedule activities of stochastic resource-constrained projects
cites work: Simulation Optimization: A Review and Exploration in the New Era of Cloud Computing and Big Data
cites work: Tabu-search simulation optimization approach for flow-shop scheduling with multiple processors — a case study
cites work: Finding Optimal (s, S) Policies Is About As Simple As Evaluating a Single Policy
DOI: 10.1016/J.COR.2022.106046
Recommended article: Efficient Computing Budget Allocation for Simulation-Based Optimization With Stochastic Simulation Time
Recommended article: Simulation budget allocation for further enhancing the efficiency of ordinal optimization
Recommended article: Optimal allocation of simulation experiments in discrete stochastic optimization and approximative algorithms
Recommended article: Approximate Simulation Budget Allocation for Selecting the Best Design in the Presence of Stochastic Constraints
Recommended article: Efficient budget allocation strategies for elementary effects method in stochastic simulation
Recommended article: A Simulation Budget Allocation Procedure for Enhancing the Efficiency of Optimal Subset Selection
Recommended article: A general framework on the simulation-based optimization under fixed computing budget
Recommended article: Efficient Simulation Budget Allocation With Bound Information
Recommended article: Simulation budget allocation for simultaneously selecting the best and worst subsets
description: scientific article; zbMATH DE number 7634090