Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Retail store operations: Literature review and research directions
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 …
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 …
optimization problems and specifically industrial optimization problems where there is a …
New binary marine predators optimization algorithms for 0–1 knapsack problems
Recently, a novel meta-heuristic algorithm known as the marine predators algorithm (MPA)
has been proposed for solving continuous optimization problems. Despite the significant …
has been proposed for solving continuous optimization problems. Despite the significant …
An enhanced binary slime mould algorithm for solving the 0–1 knapsack problem
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 …
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
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 …
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
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 …
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 …
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
Integrating inventory with production–distribution operations has critical importance realized
by several companies' top management a long time before; however, challenging. The …
by several companies' top management a long time before; however, challenging. The …
Binary Honey Badger Algorithm for 0-1 Knapsack Problem
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 …
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
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 …
0‐1 knapsack problem. However, these algorithms often fall into a local optimization trap …