Iterated tabu search and variable neighborhood descent for packing unequal circles into a circular container
type: Item
instance of: scholarly article
title: Iterated tabu search and variable neighborhood descent for packing unequal circles into a circular container
zbMATH Open document ID: 1346.90526
author: Zhizhong Zeng
author: Xinguo Yu
author: Kun He
author: Wenqi Huang
author: Zhanghua Fu
published in: European Journal of Operational Research
publication date: 2016-10-07T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 52C26
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6636074
zbMATH Keywords: packing
zbMATH Keywords: tabu search
zbMATH Keywords: variable neighborhood descent
zbMATH Keywords: iterated local search
describes a project that uses: L-BFGS
MaRDI profile type: Publication
full work available at URL: j.ejor.2015.09.001
OpenAlex ID: W1416294610
cites work: Disk packing in a square: a new global optimization approach
cites work: Efficiently packing unequal disks in a circle
cites work: A beam search algorithm for the circular packing problem
cites work: A hybrid beam search looking-ahead algorithm for the circular packing problem
cites work: Adaptive beam search lookahead algorithms for the circular packing problem
cites work: Optimizing the packing of cylinders into a rectangular container: A nonlinear approach
cites work: Solving circle packing problems by global optimization: numerical results and industrial applications
cites work: Iterated tabu search for the circular open dimension problem
cites work: Tabu Search—Part II
cites work: Integrating tabu search and VLSN search to develop enhanced algorithms: a case study using bipartite Boolean quadratic programs
cites work: A population-based approach for hard global optimization problems based on dissimilarity measures
cites work: Solving the problem of packing equal and unequal circles in a circular container
cites work: Variable Neighborhood Search
cites work: Approximate algorithms for constrained circular cutting problems
cites work: A dynamic adaptive local search algorithm for the circular packing problem
cites work: Adaptive and restarting techniques-based algorithms for circular packing problems
cites work: A literature review on circle and sphere packing problems: models and methodologies
cites work: Greedy algorithms for packing unequal circles into a rectangular container
cites work: New heuristics for packing unequal circles into a circular container
cites work: Two personification strategies for solving circles packing problem
cites work: Greedy vacancy search algorithm for packing equal circles in a square
cites work: Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods
cites work: On the limited memory BFGS method for large scale optimization
cites work: Packing unequal circles using formulation space search
cites work: Q4452900
cites work: Adaptive tabu search for course timetabling
cites work: PERM for solving circle packing problem
cites work: Variable neighborhood search
cites work: A tabu search for time-dependent multi-zone multi-trip vehicle routing problem with time windows
cites work: A perturbation based variable neighborhood search heuristic for solving the vehicle routing problem with simultaneous pickup and delivery with time limit
cites work: An improved algorithm for the packing of unequal circles within a larger containing circle
cites work: A variable neighborhood search with an effective local search for uncapacitated multilevel lot-sizing problems
cites work: An effective hybrid algorithm for the problem of packing circles into a larger containing circle
DOI: 10.1016/J.EJOR.2015.09.001
description: scientific article; zbMATH DE number 6636074