Put forward a method for rectangle layout problems by rectangle's feasible region in layout polygon, sort all the rectangles as their areas and take the locationing function as the basis to place the ...

This model is an example of a constraint optimization problem. Considering a constraint of an integer programming model where all the decision variables in the constraint are binary, the goal is to ...

Solution quality and execution time are tunable, since the solver is SA-based. Not only integers but also real numbers can be set as a rectangle width and height. A rectangle can rotate while ...

Rectangle packing problem exists widely in manufacturing processes of modern industry, such as cutting of wood, leather, metal and paper, etc. It is also known as a typical NP-Complete combinatorial ...

Example 5.4: Restarting an Optimization This example shows how you can restart an optimization problem using the OUTEST=, INEST=, OUTMODEL=, and MODEL= options and how to save output into an OUT= data ...

Ant colony optimization (ACO) is a class of heuristic algorithms proposed to solve optimization problems. The idea was inspired by the behavior ... [9, 10, 15]. In these two examples, rectangular ...