Heuristic algorithms based on column generation for an online product shipping problem

DOI10.1016/j.cor.2023.106403MaRDI QIDQ6065593

No author found.

Publication date: 15 November 2023

Published in: Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

column generationcutting stock problemonline problemcolumn evaluation criteriaproduct shipping problem

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Unnamed Item
• Mathematical models and a heuristic method for the multiperiod one-dimensional cutting stock problem
• Solving real-world cutting stock-problems in the paper industry: mathematical approaches, experience and challenges
• Pattern-set generation algorithm for the one-dimensional cutting stock problem with setup cost
• A linear optimization approach to the combined production planning model
• Classification and literature review of integrated lot-sizing and cutting stock problems
• One-dimensional cutting stock optimization in consecutive time periods
• Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths
• The one-dimensional cutting stock problem with due dates
• Exact solution of bin-packing problems using column generation and branch-and-bound
• The integrated lot sizing and cutting stock problem with saw cycle constraints applied to furniture production
• Combined cutting stock and lot-sizing problem with pattern setup
• BPPLIB: a library for bin packing and cutting stock problems
• One-dimensional cutting stock problem to minimize the number of different patterns
• Heuristics for the integer one-dimensional cutting stock problem: A computational study
• Two heuristics for the capacitated multi-period cutting stock problem with pattern setup cost
• Modeling and solving a real-world cutting stock problem in the marble industry via mathematical programming and stochastic diffusion search approaches
• The integrated lot sizing and cutting stock problem in an automotive spring factory
• Solving a combined cutting-stock and lot-sizing problem with a column generating procedure
• One-dimensional cutting stock problem with a given number of setups: a hybrid approach of metaheuristics and linear programming
• C-Sets-based sequential heuristic procedure for the one-dimensional cutting stock problem with pattern reduction
• Solving a bi-criterion cutting stock problem with open-ended demand: a case study
• A Linear Programming Approach to the Cutting-Stock Problem
• On the online bin packing problem
• Online Vehicle Routing Problems: A Survey
• On-line packing with boxes of different sizes
• Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
• Progressive Selection Method for the Coupled Lot-Sizing and Cutting-Stock Problem
• Multi-job Cutting Stock Problem with Due Dates and Release Dates
• Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems
• A Linear Programming Approach to the Cutting Stock Problem—Part II
• Dynamic Programming Algorithms for the Integer Programming Problem—I: The Integer Programming Problem Viewed as a Knapsack Type Problem

This page was built for publication: Heuristic algorithms based on column generation for an online product shipping problem