A Genetic Algorithm with Lower Neighborhood Search for the Three-Dimensional Multiorder Open-Size Rectangular Packing Problem

This paper addresses the multiorder open-dimension three-dimensional rectangular packing problem (3D-MOSB-ODRPP), which involves packing rectangular items from multiple orders into a single, size-adjustable container. We propose a novel metaheuristic approach combining a genetic algorithm with the Gurobi solver. The algorithm incorporates a lower neighborhood search strategy and is underpinned by a mathematical model representing the multiorder open-dimension packing scenario. Extensive experiments validate the effectiveness of the proposed approach. The LNSGA algorithm outperforms Gurobi and the traditional genetic algorithm in solution quality and computational efficiency. For small-scale instances, LNSGA achieves optimal values in most cases. LNSGA demonstrates significant optimization improvements over Gurobi and the genetic algorithm for large-scale instances. The superior performance is attributed to the effective integration of the lower neighborhood search mechanism and the Gurobi solver. This study offers valuable insights for optimizing the packing process in e-commerce warehousing and logistics operations.

• Publication year

  2024

• Venue

  International Journal of Intelligent Systems

• Publication date

  2024-05-15

• Fields of study

  Mathematics, Computer Science, Engineering

• Identifiers
  DOI 10.1155/2024/4456261
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Deep Reinforcement Learning Assisted Genetic Programming Ensemble Hyper-Heuristics for Dynamic Scheduling of Container Port Trucks

  2025cited by this paper
• Logistics Optimization Using Hybrid Genetic Algorithm (HGA): A Solution to the Vehicle Routing Problem With Time Windows (VRPTW)

  2024cited by this paper
• A Multi-Heuristic Algorithm for Multi-Container 3-D Bin Packing Problem Optimization Using Real World Constraints

  2024cited by this paper
• A matheuristic for the Two-Echelon Multi-Trip Vehicle Routing Problem with mixed pickup and delivery demand and time windows

  2024cited by this paper
• A customizable optimization model for green e-commerce packing considering multiple orders and diverse box types

  2024cited by this paper
• A Matheuristic Approach to the Integration of Three-Dimensional Bin Packing Problem and Vehicle Routing Problem with Simultaneous Delivery and Pickup

  2023cited by this paper
• Exact and metaheuristic approaches to solve the integrated production scheduling, berth allocation and storage yard allocation problem

  2023cited by this paper
• Optimizing e-commerce warehousing through open dimension management in a three-dimensional bin packing system

  2023cited by this paper
• The 3D bin packing problem for multiple boxes and irregular items based on deep Q-network

  2023cited by this paper
• Towards reliable robot packing system based on deep reinforcement learning

  2023cited by this paper
• A hybrid biogeography-based optimization algorithm for three-dimensional bin size designing and packing problem

  2023cited by this paper
• Meta-Heuristic Algorithms for the Generalized Extensible Bin Packing Problem With Overload Cost

  2022cited by this paper
• Solving 3D packing problem using Transformer network and reinforcement learning

  2022cited by this paper
• An improved Harris Hawks Optimization algorithm for continuous and discrete optimization problems

  2022cited by this paper
• Multi-objective optimization of the 3D container stowage planning problem in a barge convoy system

  2022cited by this paper
• On-line three-dimensional packing problems: A review of off-line and on-line solution approaches

  2022cited by this paper
• A bin packing approach to solve the aircraft maintenance task allocation problem

  2021cited by this paper
• Multi-objective 3D bin packing problem with load balance and product family concerns

  2021cited by this paper
• Self-play Learning Strategies for Resource Assignment in Open-RAN Networks

  2021cited by this paper
• Integrated optimization algorithm: A metaheuristic approach for complicated optimization

  2021cited by this paper
• Variable-sized bin packing problem with conflicts and item fragmentation

  2021cited by this paper
• Learning practically feasible policies for online 3D bin packing

  2021cited by this paper
• Just-in-time two-dimensional bin packing

  2020cited by this paper
• CT-CPP: Coverage Path Planning for 3D Terrain Reconstruction Using Dynamic Coverage Trees

  2020cited by this paper
• A matheuristic framework for the Three-dimensional Single Large Object Placement Problem with practical constraints

  2020cited by this paper
• The Pallet Loading Problem: Three-dimensional bin packing with practical constraints

  2020cited by this paper
• Applications of gravity models to evaluate and forecast US international air freight markets post-GFC

  2020cited by this paper
• Three-Dimensional Bin Packing and Mixed-Case Palletization

  2019cited by this paper
• Mathematical models for Multi Container Loading Problems with practical constraints

  2019cited by this paper
• Exact methods for three-dimensional cutting and packing: A comparative study concerning single container problems

  2019cited by this paper
• Raster penetration map applied to the irregular packing problem

  2019cited by this paper
• A new load balance methodology for container loading problem in road transportation

  2018cited by this paper
• A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem

  2018cited by this paper
• Packing of concave polyhedra with continuous rotations using nonlinear optimisation

  2018cited by this paper
• Solving a New 3D Bin Packing Problem with Deep Reinforcement Learning Method

  2017cited by this paper
• Solving a large multicontainer loading problem in the car manufacturing industry

  2017cited by this paper
• A biased random key genetic algorithm for open dimension nesting problems using no-fit raster

  2017cited by this paper
• On solving three-dimensional open-dimension rectangular packing problems

  2017cited by this paper
• Three-stage heuristic algorithm for three-dimensional irregular packing problem

  2017cited by this paper
• The 3D Object Packing Problem into a Parallelepiped Container Based on Discrete-Logical Representation

  2016cited by this paper
• A priority heuristic for the guillotine rectangular packing problem

  2016cited by this paper
• A heuristic algorithm for the container loading problem with complex loading constraints

  2016cited by this paper
• An effective placement method for the single container loading problem

  2016cited by this paper
• A hybrid differential evolution algorithm for multiple container loading problem with heterogeneous containers

  2015cited by this paper
• A bidirectional building approach for the 2D constrained guillotine knapsack packing problem

  2015cited by this paper
• A block-based layer building approach for the 2D guillotine strip packing problem

  2014cited by this paper
• Fully dynamic bin packing revisited

  2014cited by this paper
• Pattern recognition technologies for multimedia information processing

  2014cited by this paper
• An integrated formulation for hierarchical cast design problems in the steel making industry

  2014cited by this paper
• Exact and heuristic methods for placing ships in locks

  2014cited by this paper
• The Dotted-Board Model: A new MIP model for nesting irregular shapes

  2013cited by this paper
• Solving non-oriented two dimensional bin packing problem using evolutionary particle swarm optimisation

  2013cited by this paper
• A biased random key genetic algorithm for 2D and 3D bin packing problems

  2013cited by this paper
• Space defragmentation for packing problems

  2012cited by this paper
• A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem

  2012cited by this paper
• A warehouse management system with sequential picking for multi-container deliveries

  2010cited by this paper
• Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation

  2008cited by this paper
• The geometry of nesting problems: A tutorial

  2008cited by this paper
• Environmental innovation in industrial packaging: a supply chain approach

  2007cited by this paper
• The container loading problem

  2005cited by this paper
• 3-D Container Packing Heuristics

  2005cited by this paper
• A multi-faced buildup algorithm for three-dimensional packing problems

  2003cited by this paper
• Heuristics for the container loading problem

  2002cited by this paper
• Algorithms for Unconstrained Two-Dimensional Guillotine Cutting

  1985cited by this paper
• The allocation problem

  1974cited by this paper
• Multistage Cutting Stock Problems of Two and More Dimensions

  1965cited by this paper
• A Linear Programming Approach to the Cutting-Stock Problem

  1961cited by this paper
• A mixed packing problem

  1960cited by this paper

• Intelligent optimization of e-commerce order packing using deep reinforcement learning with heuristic strategies

  2025cites this paper
• A Study on Coordinated and Optimal Allocation of Wind Generation and Storage in a Microgrid Based on Power Balancing

  2025cites this paper
• Formal service conflict detection through abstraction and refinement

  2025cites this paper
• Multi-objective optimization empowered spatiotemporal parallel network for online PM2.5\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \

  2025cites this paper