On solving multiobjective bin packing problems using evolutionary particle swarm optimization
From MaRDI portal
Publication:2427181
DOI10.1016/j.ejor.2007.06.032zbMath1146.90510OpenAlexW1976093834MaRDI QIDQ2427181
Publication date: 8 May 2008
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2007.06.032
Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (15)
Constrained order packing: comparison of heuristic approaches for a new bin packing problem ⋮ Particle swarm with equilibrium strategy of selection for multi-objective optimization ⋮ The load-balanced multi-dimensional bin-packing problem ⋮ Lexicographic optimization for the multi-container loading problem with open dimensions for a shoe manufacturer ⋮ A nonlinear optimization model for the balanced vehicle routing problem with loading constraints ⋮ The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers ⋮ Unnamed Item ⋮ Metaheuristics for truck loading in the car production industry ⋮ A binary particle swarm optimization algorithm inspired by multi-level organizational learning behavior ⋮ Multi-objective optimization of water supply network rehabilitation with non-dominated sorting genetic algorithm. II ⋮ Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review ⋮ An efficient hybrid multi-objective particle swarm optimization with a multi-objective dichotomy line search ⋮ A hybrid genetic local search algorithm for the permutation flowshop scheduling problem ⋮ A competitive and cooperative co-evolutionary approach to multi-objective particle swarm optimization algorithm design ⋮ A compromised large-scale neighborhood search heuristic for capacitated air cargo loading planning
Uses Software
Cites Work
- Unnamed Item
- On genetic algorithms for the packing of polygons
- BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
- An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles
- Heuristic algorithms for the three-dimensional bin packing problem
- Exact Solution of the Two-Dimensional Finite Bin Packing Problem
- A New Bottom-Left-Fill Heuristic Algorithm for the Two-Dimensional Irregular Packing Problem
- Two-Dimensional Finite Bin-Packing Algorithms
- An Application of the Bin-packing Technique to Job Scheduling on Uniform Processors
- Balanced Loading
- Bin Packing with Geometric Constraints in Computer Network Design
- Worst-Case Analysis of Heuristics for the Bin Packing Problem with General Cost Structures
- A morph-based simulated annealing heuristic for a modified bin-packing problem
- The Three-Dimensional Bin Packing Problem
- Genetic Algorithms-a Tool for OR?
This page was built for publication: On solving multiobjective bin packing problems using evolutionary particle swarm optimization
