Retail store operations: Literature review and research directions

S Mou, DJ Robb, N DeHoratius - European Journal of Operational …, 2018 - Elsevier
In the digital age, retail store operations face a variety of novel challenges and complexities.
We review 255 papers on retail store operations from 32 operations research, management …

Robust optimization: concepts and applications

J García, A Peña - Nature-inspired methods for stochastic, robust …, 2018 - books.google.com
Robust optimization is an emerging area in research that allows addressing different
optimization problems and specifically industrial optimization problems where there is a …

New binary marine predators optimization algorithms for 0–1 knapsack problems

M Abdel-Basset, R Mohamed, RK Chakrabortty… - Computers & Industrial …, 2021 - Elsevier
Recently, a novel meta-heuristic algorithm known as the marine predators algorithm (MPA)
has been proposed for solving continuous optimization problems. Despite the significant …

An enhanced binary slime mould algorithm for solving the 0–1 knapsack problem

B Abdollahzadeh, S Barshandeh, H Javadi… - Engineering with …, 2022 - Springer
The slime mould algorithm (SMA) has recently been introduced to solve continuous
engineering problems, which has been employed to solve a wide range of various problems …

A variable neighborhood search simheuristic for project portfolio selection under uncertainty

J Panadero, J Doering, R Kizys, AA Juan, A Fito - Journal of Heuristics, 2020 - Springer
With limited financial resources, decision-makers in firms and governments face the task of
selecting the best portfolio of projects to invest in. As the pool of project proposals increases …

An improved binary quantum-behaved particle swarm optimization algorithm for knapsack problems

X Li, W Fang, S Zhu - Information Sciences, 2023 - Elsevier
The 0-1 knapsack problem is a typical NP-hard combinatorial optimization problem that is
difficult to solve efficiently based on traditional optimization approaches. Binary quantum …

Robust traveling salesman problem with drone: balancing risk and makespan in contactless delivery

L Zhao, X Bi, Z Dong, N **ao… - … in Operational Research, 2024 - Wiley Online Library
The spread of COVID‐19 outbreak has promoted truck‐drone delivery from trials to
commercial applications in end‐to‐end contactless solutions. To fully integrate truck‐drone …

An integrated multi-objective multi-product inventory managed production planning problem under uncertain environment

UM Modibbo, S Gupta, A Ahmed, I Ali - Annals of Operations Research, 2024 - Springer
Integrating inventory with production–distribution operations has critical importance realized
by several companies' top management a long time before; however, challenging. The …

Binary Honey Badger Algorithm for 0-1 Knapsack Problem

GO Büyüköz, H Haklı - Journal of Intelligent Systems: Theory and …, 2023 - dergipark.org.tr
Honey Badger Algorithm (HBA) is one of the recently proposed optimization techniques
inspired by the foraging behavior of honey badger. Although it has been successfully …

A Hybrid Harmony Search Algorithm with Distribution Estimation for Solving the 0‐1 Knapsack Problem

K Liu, H Ouyang, S Li, L Gao - Mathematical Problems in …, 2022 - Wiley Online Library
Many optimization algorithms have been applied to solve high‐dimensional instances of the
0‐1 knapsack problem. However, these algorithms often fall into a local optimization trap …