- Rating
- 2
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper is an adaptation of "Evolution of Heuristic" (EoH) on the specific scenario of 3D bin packing. More specifically, instead of direct program search from current state to selected item and position , it provides an "inductive bias" that decompose the process as follows:
- State Reflection: from to hyperparameters of item and position selections
- Item Selection: select the optimal next item to fill from a set, given and
- Position Selection: select the optimal position of the next item from a set, given and
In such a way, instead of searching for a large program from to , the proposed approach searches for three smaller programs, which may be more efficient. And an explicit state reflection program allows the optimization algorithm to change "phase" or "style" during the sequential filling process.
Critical strengths
- This paper addressed an important optimization problem (3D bin packing)
- The proposed three skills do make sense, expecially the explicit introduction of "state reflection" that allow the optimization process to adapt to different "phase" during the sequential filling process
Critical weaknesses
- The proposed approach looks like an inductive bias over the program search space, rather than a fundamental extension of EoH's expressiveness. Let's say, if we have an EoH with a pretty intelligent LLM, and prompt it to design a good optimization program from to , it may evolve the state reflection mechanism, or something even more clever, by itself?
- The performance improvement is not that impressive, especially considering that the proposed approach works specically on 3D bin packing, which is much less universal than the baseline approaches like EoH and ReEvo.
Questions for authors
See "weaknesses"