International Journal of Bio-Inspired Computation, 4 (4), 229–236. Gherboudj, A, A Layeb and S Chikhi Solving 0-1 knapsack problems by a discrete binary version of cuckoo search algorithm.European Journal of Operational Research, 110 (2), 272–281. Foerster, H and G Wäscher Simulated annealing for order spread minimization in sequencing cutting patterns.Falkenauer, E and A Delchambre A genetic algorithm for bin packing and line balancing.European Journal of Operational Research, 114 (3), 542–556. Faina, L An application of simulated annealing to the cutting stock problem.European Journal of Operational Research, 44 (2), 145–159. Dyckhoff, H A typology of cutting and packing problems.Dagli, CH and A Hajakbari Simulated annealing approach for solving stock cutting problem.European Journal of Operational Research, 240 (1), 43–53. Cui, YP, Y Cui and T Tang Sequential heuristic for the two-dimensional bin-packing problem.Journal of Materials Processing Technology, 205 (1), 138–145. Cui, Y and X Song Applying parallelogrammic strips for cutting circles from stainless steel rolls.Cui, Y and Y Lu Heuristic algorithm for a cutting stock problem in the steel bridge construction.(eds.): Algorithm Design for Computer System Design, Vol. Coffman, EG, MR Garey and DS Johnson Approximation algorithms for bin-packing - An updated survey.Asia-Pacific Journal of Operational Research, 24 (4), 463–478. Chen, D and W Huang A new heuristic algorithm for constrained rectangle-packing problem.IEEE Transactions on Computers, 8, 697–707. Chazelle, B The bottom-left bin-packing heuristic: An efficient implementation.International Transactions in Operational Research, 10 (6), 651–663. Carravilla, MA, C Ribeiro and JF Oliveira Solving nesting problems with non-convex polygons by constraint logic programming.Burke, EK, G Kendall and G Whitwell A simulated annealing enhancement of the best-fit heuristic for the orthogonal stock-cutting problem.Annals of Operations Research, 41 (4), 313–325. Błażewicz, J, P Hawryluk and R Walkowiak Using a tabu search approach for solving the two-dimensional irregular cutting problem.Journal of the Operational Research Society, 38 (5), 423–429. Berkey, JO and PY Wang Two-dimensional finite bin-packing algorithms.International Journal of Production Economics, 145 (2), 547–560. Bennell, JA, LS Lee and CN Potts A genetic algorithm for two-dimensional bin packing with due dates.Bennell, JA and KA Dowsland Hybridising tabu search with optimisation techniques for irregular stock cutting.and RL Rivest Orthogonal packings in two dimensions. European Journal of Operational Research, 183 (3), 1167–1182. Alvarez-Valdés, R, F Parreño and JM Tamarit A tabu search algorithm for a two-dimensional non-guillotine cutting problem.Visualization of large multi-criteria result sets. ![]() Non-convex QPs on a D-Wave Quantum Computer?.Packing circles in a rectangle: a MIQCP model.The picture at the top of this post represents the optimal solution for the model with the small random data set of just four sensors. For large problems however this thing turns out to be not so easy to solve. We repeat this trick in the second implication.Īs this is a convex MIQCP, we can use some commercial solvers like Cplex and Gurobi. In the model below we try to solve this by maximizing the number of points covered by at least one sensor:īasically we model two implications and an objective:įor points inside circle k we don't impose anything, but leave it to the objective to drive things in the right direction. However if we superimpose over the rectangle a grid with points, and try to minimize the uncovered points we may have a chance. We are dealing with overlapping circles and and circles that cover areas outside the rectangle. It looks very difficult to me to develop a model that minimizes the uncovered (white) area in the above picture. The circles may look more like ellipses as the aspect ratio of the plot is not one (the plot is too wide). Given a set of circles (with given radius) try to cover as much area of a rectangle.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |