Queue-constrained packing: a vehicle ferry case study

DOI10.1016/j.ejor.2020.07.027zbMath1487.90540OpenAlexW3042953019MaRDI QIDQ2029061

Julia A. Bennell, Christopher Bayliss, Christine S. M. Currie, Antonio Martínez-Sykora

Publication date: 3 June 2021

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

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

zbMATH Keywords

stochastic optimizationpackinglogistics

Mathematics Subject Classification ID

Stochastic programming (90C15) Combinatorial optimization (90C27)

Related Items

Cutting and packing problems under uncertainty: literature review and classification framework

Cites Work

• Optimization by Simulated Annealing
• Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts
• A skyline heuristic for the 2D rectangular packing and strip packing problems
• A two-stage stochastic programming model for the parallel machine scheduling problem with machine capacity
• An exact method for the 2D guillotine strip packing problem
• A general framework for bounds for higher-dimensional orthogonal packing problems.
• Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation
• New lower bounds for bin packing problems with conflicts
• Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach
• A review of the application of meta-heuristic algorithms to 2D strip packing problems
• New upper bounds for online strip packing
• A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem
• Two-dimensional packing problems: a survey
• LP models for bin packing and cutting stock problems
• Algorithms for the variable sized bin packing problem
• The theory and practice of revenue management
• Dynamic pricing for vehicle ferries: using packing and simulation to optimize revenues
• Online knapsack of unknown capacity. How to optimize energy consumption in smartphones
• The benefit of adaptivity in the stochastic knapsack problem with dependence on the state of nature
• The two-dimensional bin packing problem with variable bin sizes and costs
• An improved typology of cutting and packing problems
• Exact Solution of the Two-Dimensional Finite Bin Packing Problem
• Two Dimensional Knapsack with Unloading Constraints
• Algorithms for Scheduling Runway Operations Under Constrained Position Shifting
• Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity
• Bounds for Two-Dimensional Cutting
• An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
• The Dynamic and Stochastic Knapsack Problem with Deadlines
• Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
• A new upper bound for unconstrained two-dimensional cutting and packing
• A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems
• Higher‐Dimensional Packing with Order Constraints
• A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints