Some experiments with simulated annealing techniques for packing problems
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 41891 (Why is no real title available?)
- An improved annealing scheme for the QAP
- Convergence of an annealing algorithm
- Equation of state calculations by fast computing machines
- Optimization by simulated annealing
- Simulated Annealing – An Annotated Bibliography
- Tabu search techniques. A tutorial and an application to neural networks
- The Three-Dimensional Pallet Chart: An Analysis of the Factors Affecting the Set of Feasible Layouts for a Class of Two-Dimensional Packing Problems
- The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
Cited in
(44)- Packaging optimization using the dynamic vector fields method
- Dynamic pricing for vehicle ferries: using packing and simulation to optimize revenues
- A new adaptive mutation simulated annealing algorithm: application to the study of pure and mixed Pt-Pd clusters
- A method for optimising the nesting of multiple, highly complex shapes using a modified simulated annealing algorithm
- An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem
- A simulated annealing approach to the nesting problem in the textile manufacturing industry
- Exact algorithms for the two-dimensional strip packing problem with and without rotations
- Solving the flight perturbation problem with meta heuristics
- scientific article; zbMATH DE number 7656032 (Why is no real title available?)
- Packing rectangles into a fixed size circular container: constructive and metaheuristic search approaches
- A skyline heuristic for the 2D rectangular packing and strip packing problems
- A hybrid evolutionary algorithm for the two-dimensional packing problem
- A robust simulated annealing based examination timetabling system.
- A comparison of neighborhood search techniques for multi-objective combinatorial problems
- An agent-based approach to the two-dimensional guillotine bin packing problem
- Cybernetic optimization by simulated annealing: Accelerating convergence by parallel processing and probabilistic feedback control
- A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation
- Guillotineable bin packing: A genetic approach
- Reactive GRASP for the strip-packing problem
- Guided local search and its application to the traveling salesman problem
- Efficient implementations of construction heuristics for the rectilinear block packing problem
- A simulated annealing approach to police district design
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
- Two-dimensional packing problems: a survey
- Adaptive temperature control for simulated annealing: a comparative study
- The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview
- Operational aircraft maintenance routing problem with remaining time consideration
- An exact strip packing algorithm based on canonical forms
- Random search in the one-dimensional cutting stock problem
- The pallet loading problem: a review of solution methods and computational experiments
- Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem
- Solving the multi-objective nurse scheduling problem with a weighted cost function
- The obnoxious \(p\) facility network location problem with facility interaction
- Variants of simulated annealing for the examination timetabling problem
- An optimal algorithm for rectangle placement
- A comparative study of both standard and adaptive versions of threshold accepting and simulated annealing algorithms in three scheduling problems
- Metaheuristics: A bibliography
- Solving zero-one mixed integer programming problems using tabu search
- Some experiments with a simple tabu search algorithm for the manufacturer's pallet loading problem
- Hybrid heuristics for the capacitated lot sizing and loading problem with setup times and overtime decisions
- An n-tet graph approach for non-guillotine packings of n-dimensional boxes into an n-container
- Computing closely matching upper and lower bounds on textile nesting problems
- A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem
- A family of genetic algorithms for the pallet loading problem
This page was built for publication: Some experiments with simulated annealing techniques for packing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1309920)
