Ant colony optimization and local search for bin packing and cutting stock problems
From MaRDI portal
Publication:4661198
DOI10.1057/palgrave.jors.2601771zbMath1095.90122OpenAlexW2109469182MaRDI QIDQ4661198
Frederick Ducatelle, John Levine
Publication date: 4 April 2005
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://strathprints.strath.ac.uk/4823/
Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30) Combinatorial optimization (90C27)
Related Items (17)
Ant algorithms for scheduling computations in data centers ⋮ Bin packing and cutting stock problems: mathematical models and exact algorithms ⋮ A grouping genetic algorithm with controlled gene transmission for the bin packing problem ⋮ Exact and approximate methods for the score-constrained packing problem ⋮ An investigation into two bin packing problems with ordering and orientation implications ⋮ Hybridizing evolutionary algorithms with variable-depth search to overcome local optima ⋮ Assigning real-time tasks to heterogeneous processors by applying ant colony optimization ⋮ Bee colony optimization for scheduling independent tasks to identical processors ⋮ Energy efficient spatial TDMA scheduling in wireless networks ⋮ An ant colony optimization approach for the multidimensional knapsack problem ⋮ An algorithm for constructing single machine schedules based on ant colony approach ⋮ Gene selection via a new hybrid ant colony optimization algorithm for cancer classification in high-dimensional data ⋮ Optimisation hybride par colonies de fourmis pour le problème de découpe à deux dimensions ⋮ The stochastic trim-loss problem ⋮ A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing ⋮ The impact of parametrization in memetic evolutionary algorithms ⋮ Heuristics for determining the number of warehouses for storing non-compatible products
This page was built for publication: Ant colony optimization and local search for bin packing and cutting stock problems
