M2M solves the many-to-many MAPD problem with two variants and outperforms prior one-to-one methods by completing up to 22,000 more tasks on average in 8-hour warehouse simulations.
Optimization by simulated annealing
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
verdicts
UNVERDICTED 3roles
background 1polarities
background 1representative citing papers
Compares quantum annealing models for coarse-grained protein folding, proposes interleaved-grid tetrahedral encoding, and reports hardware limits from embedding alongside scaling gains over classical simulated annealing on embedded instances.
IWSO is a new metaheuristic using matchmaker-guided elite influence and adaptive elimination-reinitialization to achieve faster convergence and higher solution quality than GA, PSO, DE, and CS on high-dimensional benchmark functions.
citing papers explorer
-
Many-to-Many Multi-Agent Pickup and Delivery
M2M solves the many-to-many MAPD problem with two variants and outperforms prior one-to-one methods by completing up to 22,000 more tasks on average in 8-hour warehouse simulations.
-
Exploring Quantum Annealing for Coarse-Grained Protein Folding
Compares quantum annealing models for coarse-grained protein folding, proposes interleaved-grid tetrahedral encoding, and reports hardware limits from embedding alongside scaling gains over classical simulated annealing on embedded instances.
-
Indian Wedding System Optimization (IWSO): A Novel Socially Inspired Metaheuristic with Operational Design and Analysis
IWSO is a new metaheuristic using matchmaker-guided elite influence and adaptive elimination-reinitialization to achieve faster convergence and higher solution quality than GA, PSO, DE, and CS on high-dimensional benchmark functions.