Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming
From MaRDI portal
Publication:819074
DOI10.1016/j.ejor.2004.09.008zbMath1116.90088OpenAlexW2126240801MaRDI QIDQ819074
Antonio Miguel Gomes, José Fernando Oliveira
Publication date: 22 March 2006
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2004.09.008
Related Items
A hybrid approach for packing irregular patterns using evolutionary strategies and neural network, Robust mixed-integer linear programming models for the irregular strip packing problem, Optimisation of fault-tolerant fabric-cutting schedules using genetic algorithms and fuzzy set theory, Fast neighborhood search for two- and three-dimensional nesting problems, Efficient implementations of construction heuristics for the rectilinear block packing problem, A clique covering MIP model for the irregular strip packing problem, Aircraft parking stand allocation problem with safety consideration for independent hangar maintenance service providers, Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes, A customized branch-and-bound approach for irregular shape nesting, Packing rectangles into a fixed size circular container: constructive and metaheuristic search approaches, A branch‐and‐cut algorithm for the irregular strip packing problem with uncertain demands, Algorithms for nesting with defects, A heuristic approach for packing identical rectangles in convex regions, Phi-functions for 2D objects formed by line segments and circular arcs, Dealing with nonregular shapes packing, A family of heuristic-based inequalities for maximizing overall safety margins in aircraft parking stands arrangement problems, A hybrid simulated annealing/linear programming approach for the cover printing problem, Optimized Object Packings Using Quasi-Phi-Functions, Rectangle blanket problem: binary integer linear programming formulation and solution algorithms, A parallel biased random-key genetic algorithm with multiple populations applied to irregular strip packing problems, The double pivot simplex method, A beam search implementation for the irregular shape packing problem, Extended local search algorithm based on nonlinear programming for two-dimensional irregular strip packing problem, Mathematical model and efficient algorithms for object packing problem, Mixed-integer programming models for nesting problems, Irregular packing problems: a review of mathematical models, Heuristics for the combined cut order planning two-dimensional layout problem in the apparel industry, Near optimal minimal convex hulls of disks, Raster penetration map applied to the irregular packing problem, Solving the irregular strip packing problem via guided local search for overlap minimization, An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem, Vehicle dispatching plan for minimizing passenger waiting time in a corridor with buses of different sizes: model formulation and solution approaches, Hybridizing exact methods and metaheuristics: a taxonomy, Heuristics for container loading of furniture, Exact approaches for the cutting path determination problem, Mathematical Models of Placement Optimisation: Two- and Three-Dimensional Problems and Applications, Irregular packing: MILP model based on a polygonal enclosure, A new approach for sheet nesting problem using guided cuckoo search and pairwise clustering
Uses Software
Cites Work
- Optimization by Simulated Annealing
- Solution approaches to irregular nesting problems
- Compaction and separation algorithms for non-convex polygons and their applications
- Mathematical model and method of searching for a local extremum for the non-convex oriented polygons allocation problem
- General local search methods
- Applied simulated annealing
- TOPOS -- A new constructive algorithm for nesting problems
- The irregular cutting-stock problem -- a new procedure for deriving the no-fit polygon.
- A 2-exchange heuristic for nesting problems
- A simulated annealing approach to the nesting problem in the textile manufacturing industry
- A local search approach for two-dimensional irregular cutting
- A hybrid algorithm for the two-dimensional layout problem: the cases of regular and irregular shapes
- Jostling for position: local improvement for irregular cutting patterns
- A tabu thresholding implementation for the irregular stock cutting problem
- Equation of State Calculations by Fast Computing Machines
