Deep learning assisted heuristic tree search for the container pre-marshalling problem
DOI10.1016/j.cor.2019.104781zbMath1458.90436arXiv1709.09972OpenAlexW2970019720WikidataQ127314541 ScholiaQ127314541MaRDI QIDQ2333140
André Hottung, Kevin Tierney, Shunji Tanaka
Publication date: 11 November 2019
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1709.09972
Learning and adaptive systems in artificial intelligence (68T05) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items (17)
Uses Software
Cites Work
- Unnamed Item
- ASlib: a benchmark library for algorithm selection
- DASH: dynamic approach for switching heuristics
- On the abstraction method for the container relocation problem
- A biased random-key genetic algorithm for the container pre-marshalling problem
- A tree search procedure for the container pre-marshalling problem
- Empirical decision model learning
- Applying the corridor method to a blocks relocation problem
- An optimization model for the container pre-marshalling problem
- New approaches for heuristic search: A bilateral linkage with artificial intelligence
- Model agnostic solution of CSPs via deep learning: a preliminary study
- Accelerating the branch-and-price algorithm using machine learning
- An exact algorithm for the blocks relocation problem with new lower bounds
- Solving real-world sized container pre-marshalling problems with an iterative deepening branch-and-bound algorithm
- A feasibility-based heuristic for the container pre-marshalling problem
- Markov chain methods for the bipartite Boolean quadratic programming problem
- Future paths for integer programming and links to artificial intelligence
- Crew assignment via constraint programming: Integrating column generation and heuristic tree search
- Search-based structured prediction
- Learning when to use a decomposition
- A multi-heuristic approach for solving the pre-marshalling problem
- On learning and branching: a survey
- A branch and bound approach for large pre-marshalling problems
- A Branch and Price Procedure for the Container Premarshalling Problem
- Algorithm Selection for Combinatorial Search Problems: A Survey
- A Machine Learning-Based Approximation of Strong Branching
- Embedding Decision Trees and Random Forests in Constraint Programming
- Comments on: ``On learning and branching: a survey
This page was built for publication: Deep learning assisted heuristic tree search for the container pre-marshalling problem