Maritime inventory routing optimization is an important yet challenging combinatorial optimization problem. We propose a machine learning-based local search approach for finding feasible solutions of large-scale maritime inventory routing optimization problems. Given the combinatorial complexity of the problems, we integrate a graph neural network-based neighborhood selection method to enhance local search efficiency. Our approach enables a structured exploration of different neighborhoods by imitating an optimization-based expert neighborhood selection policy, improving solution quality while maintaining computational efficiency. Through extensive computational experiments on realistic instances, we demonstrate that our method outperforms direct mixed-integer programming as well as benchmark local search approaches in solution time and solution quality.
Learning Large Neighborhood Search for Maritime Inventory Routing Optimization
Rui Chen,Defeng Liu,Nan Jiang,Rishabh Gupta,Mustafa Kilinc,Andrea Lodi
Published 2025 in Unknown venue
ABSTRACT
PUBLICATION RECORD
- Publication year
2025
- Venue
Unknown venue
- Publication date
2025-02-21
- Fields of study
Mathematics, Computer Science, Engineering
- Identifiers
- External record
- Source metadata
Semantic Scholar
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
Showing 1-61 of 61 references · Page 1 of 1
CITED BY
- No citing papers are available for this paper.
Showing 0-0 of 0 citing papers · Page 1 of 1