Iterated tabu search for the circular open dimension problem. Fu, Z., Huang, W., & Lü, Z. European Journal of Operational Research, 225(2):236-243, Elsevier B.V., 3, 2013. Paper Website abstract bibtex This paper investigates the circular open dimension problem (CODP), which consists of packing a set of circles of known radii into a strip of fixed width and unlimited length without overlapping. The objective is to minimize the length of the strip. In this paper, CODP is solved by a series of sub-problems, each corresponding to a fixed strip length. For each sub-problem, an iterated tabu search approach, named ITS, is proposed. ITS starts from a randomly generated solution and attempts to gain improvements by a tabu search procedure. After that, if the obtained solution is not feasible, a perturbation operator is subsequently employed to reconstruct the incumbent solution and an acceptance criterion is implemented to determine whether or not accept the perturbed solution. As a supplementary method, the length of the strip is determined in monotonously decreasing way, with the aid of some post-processing techniques. The search terminates and returns the best found solution after the allowed computation time has been elapsed. Computational experiments based on numerous well-known benchmark instances show that ITS produces quite competitive results, with respect to the best known results, while the computational time remains reasonable for each instance. © 2012 Elsevier B.V. All rights reserved.
@article{
title = {Iterated tabu search for the circular open dimension problem},
type = {article},
year = {2013},
identifiers = {[object Object]},
keywords = {Acceptance criterion,Cutting,Packing,Perturbation operator,Tabu search},
pages = {236-243},
volume = {225},
websites = {http://linkinghub.elsevier.com/retrieve/pii/S0377221712007680},
month = {3},
publisher = {Elsevier B.V.},
id = {94afb55f-6c8f-3e09-b58a-1a1708488fff},
created = {2015-03-23T18:50:23.000Z},
accessed = {2014-09-11},
file_attached = {true},
profile_id = {756a70ce-605d-3e50-9cbb-a99c29afcbe8},
group_id = {1f5b486a-d8ac-3a35-9104-56111360dab7},
last_modified = {2017-03-14T11:36:44.206Z},
read = {true},
starred = {false},
authored = {false},
confirmed = {true},
hidden = {false},
citation_key = {Fu2013},
private_publication = {false},
abstract = {This paper investigates the circular open dimension problem (CODP), which consists of packing a set of circles of known radii into a strip of fixed width and unlimited length without overlapping. The objective is to minimize the length of the strip. In this paper, CODP is solved by a series of sub-problems, each corresponding to a fixed strip length. For each sub-problem, an iterated tabu search approach, named ITS, is proposed. ITS starts from a randomly generated solution and attempts to gain improvements by a tabu search procedure. After that, if the obtained solution is not feasible, a perturbation operator is subsequently employed to reconstruct the incumbent solution and an acceptance criterion is implemented to determine whether or not accept the perturbed solution. As a supplementary method, the length of the strip is determined in monotonously decreasing way, with the aid of some post-processing techniques. The search terminates and returns the best found solution after the allowed computation time has been elapsed. Computational experiments based on numerous well-known benchmark instances show that ITS produces quite competitive results, with respect to the best known results, while the computational time remains reasonable for each instance. © 2012 Elsevier B.V. All rights reserved.},
bibtype = {article},
author = {Fu, Zhanghua and Huang, Wenqi and Lü, Zhipeng},
journal = {European Journal of Operational Research},
number = {2}
}
Downloads: 0
{"_id":"oyK3XQK2LBhFPcHuH","bibbaseid":"fu-huang-l-iteratedtabusearchforthecircularopendimensionproblem-2013","downloads":0,"creationDate":"2018-03-26T07:07:40.615Z","title":"Iterated tabu search for the circular open dimension problem","author_short":["Fu, Z.","Huang, W.","Lü, Z."],"year":2013,"bibtype":"article","biburl":null,"bibdata":{"title":"Iterated tabu search for the circular open dimension problem","type":"article","year":"2013","identifiers":"[object Object]","keywords":"Acceptance criterion,Cutting,Packing,Perturbation operator,Tabu search","pages":"236-243","volume":"225","websites":"http://linkinghub.elsevier.com/retrieve/pii/S0377221712007680","month":"3","publisher":"Elsevier B.V.","id":"94afb55f-6c8f-3e09-b58a-1a1708488fff","created":"2015-03-23T18:50:23.000Z","accessed":"2014-09-11","file_attached":"true","profile_id":"756a70ce-605d-3e50-9cbb-a99c29afcbe8","group_id":"1f5b486a-d8ac-3a35-9104-56111360dab7","last_modified":"2017-03-14T11:36:44.206Z","read":"true","starred":false,"authored":false,"confirmed":"true","hidden":false,"citation_key":"Fu2013","private_publication":false,"abstract":"This paper investigates the circular open dimension problem (CODP), which consists of packing a set of circles of known radii into a strip of fixed width and unlimited length without overlapping. The objective is to minimize the length of the strip. In this paper, CODP is solved by a series of sub-problems, each corresponding to a fixed strip length. For each sub-problem, an iterated tabu search approach, named ITS, is proposed. ITS starts from a randomly generated solution and attempts to gain improvements by a tabu search procedure. After that, if the obtained solution is not feasible, a perturbation operator is subsequently employed to reconstruct the incumbent solution and an acceptance criterion is implemented to determine whether or not accept the perturbed solution. As a supplementary method, the length of the strip is determined in monotonously decreasing way, with the aid of some post-processing techniques. The search terminates and returns the best found solution after the allowed computation time has been elapsed. Computational experiments based on numerous well-known benchmark instances show that ITS produces quite competitive results, with respect to the best known results, while the computational time remains reasonable for each instance. © 2012 Elsevier B.V. All rights reserved.","bibtype":"article","author":"Fu, Zhanghua and Huang, Wenqi and Lü, Zhipeng","journal":"European Journal of Operational Research","number":"2","bibtex":"@article{\n title = {Iterated tabu search for the circular open dimension problem},\n type = {article},\n year = {2013},\n identifiers = {[object Object]},\n keywords = {Acceptance criterion,Cutting,Packing,Perturbation operator,Tabu search},\n pages = {236-243},\n volume = {225},\n websites = {http://linkinghub.elsevier.com/retrieve/pii/S0377221712007680},\n month = {3},\n publisher = {Elsevier B.V.},\n id = {94afb55f-6c8f-3e09-b58a-1a1708488fff},\n created = {2015-03-23T18:50:23.000Z},\n accessed = {2014-09-11},\n file_attached = {true},\n profile_id = {756a70ce-605d-3e50-9cbb-a99c29afcbe8},\n group_id = {1f5b486a-d8ac-3a35-9104-56111360dab7},\n last_modified = {2017-03-14T11:36:44.206Z},\n read = {true},\n starred = {false},\n authored = {false},\n confirmed = {true},\n hidden = {false},\n citation_key = {Fu2013},\n private_publication = {false},\n abstract = {This paper investigates the circular open dimension problem (CODP), which consists of packing a set of circles of known radii into a strip of fixed width and unlimited length without overlapping. The objective is to minimize the length of the strip. In this paper, CODP is solved by a series of sub-problems, each corresponding to a fixed strip length. For each sub-problem, an iterated tabu search approach, named ITS, is proposed. ITS starts from a randomly generated solution and attempts to gain improvements by a tabu search procedure. After that, if the obtained solution is not feasible, a perturbation operator is subsequently employed to reconstruct the incumbent solution and an acceptance criterion is implemented to determine whether or not accept the perturbed solution. As a supplementary method, the length of the strip is determined in monotonously decreasing way, with the aid of some post-processing techniques. The search terminates and returns the best found solution after the allowed computation time has been elapsed. Computational experiments based on numerous well-known benchmark instances show that ITS produces quite competitive results, with respect to the best known results, while the computational time remains reasonable for each instance. © 2012 Elsevier B.V. All rights reserved.},\n bibtype = {article},\n author = {Fu, Zhanghua and Huang, Wenqi and Lü, Zhipeng},\n journal = {European Journal of Operational Research},\n number = {2}\n}","author_short":["Fu, Z.","Huang, W.","Lü, Z."],"urls":{"Paper":"https://bibbase.org/service/mendeley/756a70ce-605d-3e50-9cbb-a99c29afcbe8/file/141153d2-c733-e6dd-310d-8854da69bfd4/2013-Iterated_tabu_search_for_the_circular_open_dimension_problem.pdf.pdf","Website":"http://linkinghub.elsevier.com/retrieve/pii/S0377221712007680"},"bibbaseid":"fu-huang-l-iteratedtabusearchforthecircularopendimensionproblem-2013","role":"author","keyword":["Acceptance criterion","Cutting","Packing","Perturbation operator","Tabu search"],"downloads":0},"search_terms":["iterated","tabu","search","circular","open","dimension","problem","fu","huang","lü"],"keywords":["acceptance criterion","cutting","packing","perturbation operator","tabu search"],"authorIDs":[]}