A constraint programming approach for the premarshalling problem

DOI10.1016/J.EJOR.2022.07.042MaRDI QIDQ6106491zbMATH OpenOpenAlexFDO

Authors Celia Jiménez-Piqueras, Rubén Ruiz, Consuelo Parreño-Torres, Ramón Alvarez-Valdes

Publication date 3 July 2023

Published in European Journal of Operational Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1016/j.ejor.2022.07.042

zbMATH Keywords

constraint programmingcontainer terminal optimizationlogisticspremarshalling problem

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• Preference-Based Problem Solving for Constraint Programming
• Integer programming models for the pre-marshalling problem
• scientific article; zbMATH DE number 2084708
• Constraint propagation and problem decomposition: A preprocessing procedure for the job shop problem
• Certain exact and approximate algorithms for solving precedence problems with constraints
• A multi-heuristic approach for solving the pre-marshalling problem
• A branch and bound approach for large pre-marshalling problems
• Solving LP relaxations of large-scale precedence constrained problems
• Preprocessing rules for integer programming solutions to the generalised assignment problem
• A pegging approach to the precedence-constrained knapsack problem

Cites work

• A biased random-key genetic algorithm for the container pre-marshalling problem
• A branch and bound approach for large pre-marshalling problems
• A branch and price procedure for the container premarshalling problem
• A branch-and-cut algorithm for the restricted block relocation problem
• A feasibility-based heuristic for the container pre-marshalling problem
• A multi-heuristic approach for solving the pre-marshalling problem
• A new effective unified model for solving the pre-marshalling and block relocation problems
• A note on ``An exact algorithm for the blocks relocation problem with new lower bounds
• A tree search procedure for the container pre-marshalling problem
• An efficient ant colony optimization algorithm for the blocks relocation problem
• An exact algorithm for the blocks relocation problem with new lower bounds
• An exact algorithm for the unrestricted block relocation problem
• An optimization model for the container pre-marshalling problem
• Constraint programming models for integrated container terminal operations
• Deep learning assisted heuristic tree search for the container pre-marshalling problem
• Integer programming models for the pre-marshalling problem
• Mixed integer programming: analyzing 12 years of progress
• Pre-processing a container yard under limited available time
• Robust optimization for premarshalling with uncertain priority classes
• Solving Real-World Linear Programs: A Decade and More of Progress
• Solving real-world sized container pre-marshalling problems with an iterative deepening branch-and-bound algorithm
• Solving the robust container pre-marshalling problem
• The bounded beam search algorithm for the block relocation problem

Cited in

(8)

• Constraint propagation and problem decomposition: A preprocessing procedure for the job shop problem
• A multi-heuristic approach for solving the pre-marshalling problem
• Preference-Based Problem Solving for Constraint Programming
• Integer programming model and branch-and-cut algorithm for the stack inbound and pre-marshalling problem
• Solving the unit-load pre-marshalling problem in block stacking storage systems with multiple access directions
• A constraint-programming approach for the storage space allocation problem in a distribution center
• Sorting multi-bay block stacking storage systems
• Container pre-Marshalling problem under the same-group exclusive strategy

This page was built for publication: A constraint programming approach for the premarshalling problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6106491)