Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
From MaRDI portal
Recommendations
- Two-dimensional packing problems: a survey
- A constructive bin-oriented heuristic for the two-dimensional bin packing problem with guillotine cuts
- Approximation algorithm for the oriented two-dimensional bin packing problem
- Sequential heuristic for the two-dimensional bin-packing problem
- scientific article; zbMATH DE number 1488076
Cited in
(only showing first 100 items - show all)- An agent-based approach to the two-dimensional guillotine bin packing problem
- A survey and comparison of guillotine heuristics for the 2D oriented offline strip packing problem
- Metaheuristics for vehicle routing problems with three-dimensional loading constraints
- New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems
- A lower bound for the non-oriented two-dimensional bin packing problem
- Logic based Benders' decomposition for orthogonal stock cutting problems
- Symmetry breaking for generalized disjunctive programming formulation of the strip packing problem
- A sequential value correction heuristic for a bi-objective two-dimensional bin-packing
- A hybrid feasibility constraints-guided search to the two-dimensional bin packing problem with due dates
- A beam search approach to solve the convex irregular bin packing problem with guillotine guts
- A tree search algorithm for solving the multi-dimensional strip packing problem with guillotine cutting constraint
- Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts
- Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows
- Approximation algorithm for the oriented two-dimensional bin packing problem
- New lower bounds for the three-dimensional finite bin packing problem
- Two-dimensional packing problems: a survey
- Heuristic algorithms for the three-dimensional bin packing problem
- Space defragmentation for packing problems
- Vehicle routing problems with loading constraints: state-of-the-art and future directions
- Adaptive large neighborhood search for solving the circle bin packing problem
- Exact solution techniques for two-dimensional cutting and packing
- Queue-constrained packing: a vehicle ferry case study
- Number of bins and maximum lateness minimization in two-dimensional bin packing
- The maximum diversity assortment selection problem
- 2DPackLib: a two-dimensional cutting and packing library
- A goal-driven ruin and recreate heuristic for the 2D variable-sized bin packing problem with guillotine constraints
- Adaptive simulated annealing with greedy search for the circle bin packing problem
- A goal-driven approach to the 2D bin packing and variable-sized bin packing problems
- Bidirectional best-fit heuristic for orthogonal rectangular strip packing
- Heuristics for packing semifluids
- Optimization of the distribution of small scale linear Fresnel reflectors on roofs of urban buildings
- Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints
- A guided tabu search for the vehicle routing problem with two-dimensional loading constraints
- TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem
- A three-dimensional bin-packing model: exact multicriteria solution and computational complexity
- Triple-solution approach for the strip packing problem with two-staged patterns
- An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem
- New resolution algorithm and pretreatments for the two-dimensional bin-packing problem
- Improved local search algorithms for the rectangle packing problem with general spatial costs
- A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
- The two-dimensional bin packing problem with variable bin sizes and costs
- Using tree search bounds to enhance a genetic algorithm approach to two rectangle packing problems
- Integrated distribution and loading planning via a compact metaheuristic algorithm
- Sequential heuristic for the two-dimensional bin-packing problem
- A variable neighborhood descent approach for the two-dimensional bin packing problem
- A hybrid genetic algorithm for the two-dimensional single large object placement problem
- A new exact method for the two-dimensional orthogonal packing problem
- Models and algorithms for three-stage two-dimensional bin packing
- The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview
- Capping methods for the automatic configuration of optimization algorithms
- The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers
- An efficient intelligent search algorithm for the two-dimensional rectangular strip packing problem
- Hybrid approach for the two-dimensional bin packing problem with two-staged patterns
- Solving two-dimensional bin packing problems with two-stage guillotine cutting by combined local search heuristics
- A set-covering-based heuristic approach for bin-packing problems
- A hybrid genetic algorithm for the vehicle routing problem with three-dimensional loading constraints
- A hybrid heuristic algorithm for the 2D variable-sized bin packing problem
- Metaheuristics for truck loading in the car production industry
- A block-based layer building approach for the 2D guillotine strip packing problem
- Heuristics with stochastic neighborhood structures for two-dimensional bin packing and cutting stock problems
- A heuristic for solving large bin packing problems in two and three dimensions
- scientific article; zbMATH DE number 5911854 (Why is no real title available?)
- Constrained order packing: comparison of heuristic approaches for a new bin packing problem
- A hybrid algorithm for constrained order packing
- Two-dimensional bin packing problems
- A quasi-human algorithm for the two dimensional rectangular strip packing problem: in memory of Prof. Wenqi Huang
- A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints
- The disruptive anti-covering location problem
- The vehicle routing problem with simultaneous pick-ups and deliveries and two-dimensional loading constraints
- A biased-randomised large neighbourhood search for the two-dimensional vehicle routing problem with backhauls
- An effective tabu search approach with improved loading algorithms for the 3L-CVRP
- A simple randomized algorithm for two-dimensional strip packing
- Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts
- A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces
- Models and algorithms for packing rectangles into the smallest square
- Analysis of distributed genetic algorithms for solving cutting problems
- Bin packing and related problems: general arc-flow formulation with graph compression
- A modified partially mapped multicrossover genetic algorithm for two-dimensional bin packing problem
- Metaheuristics based on Bin Packing for the line balancing problem
- An investigation into two bin packing problems with ordering and orientation implications
- scientific article; zbMATH DE number 1336411 (Why is no real title available?)
- scientific article; zbMATH DE number 1488076 (Why is no real title available?)
- Packing, covering and tiling in two-dimensional spaces
- A Search-Based Heuristic For The Two-Dimensional Bin-Packing Problem
- An iterative bidirectional heuristic placement algorithm for solving the two-dimensional knapsack packing problem
- Heuristic placement routines for two-dimensional bin packing problem
- A multi-start tabu search based algorithm for solving the warehousing problem with conflict
- Using biased randomization for solving the two-dimensional loading vehicle routing problem with heterogeneous fleet
- An introduction to the two‐dimensional rectangular cutting and packing problem
- Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization
- Routing problems with loading constraints
- Solution validator and visualizer for (combined) vehicle routing and container loading problems
- A squeaky wheel optimisation methodology for two-dimensional strip packing
- Maximizing revenue with allocation of multiple advertisements on a Web banner
- A constructive bin-oriented heuristic for the two-dimensional bin packing problem with guillotine cuts
- Models for two-dimensional bin packing problems with customer order spread
- Filtered beam search algorithm for the two-dimensional rectangular packing problem
- Recent advances on two-dimensional bin packing problems
- Solving the parallel processor scheduling and bin packing problems with contiguity constraints: mathematical models and computational studies
- Mixed-integer and constraint programming models for the two-dimensional guillotine cutting problem
This page was built for publication: Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4427380)
