New tailored reward functions for greedy packing heuristics in the packing-while-travelling problem outperform standard approaches in both deterministic and chance-constrained stochastic settings.
A hyperheuristic approach based on low-level heuristics for the travelling thief problem.Genetic Programming and Evolvable Machines, 19(1–2):121–150
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.NE 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Greedy Approaches for Packing While Travelling with Deterministic and Stochastic Constraints
New tailored reward functions for greedy packing heuristics in the packing-while-travelling problem outperform standard approaches in both deterministic and chance-constrained stochastic settings.