DocumentCode
2841488
Title
Solving the Optimal Natural Casing Packing Problem by a Double-Objective Integer Programming
Author
Ding, Wei ; Chen, Bingwu ; Wang, Liqing ; Li, Yongliang
fYear
2012
fDate
24-25 July 2012
Firstpage
79
Lastpage
82
Abstract
In the paper, we firstly formulate the natural casing packing problem (NCPP) as a double-objective integer programming model, and then propose a two-stage heuristic algorithm for solving NCPP. Numerical results show that our model and algorithm can determine a nearly optimal solution. Finally, we build an extended version of the model to formulate other related problems.
Keywords
Heuristic algorithms; IP networks; Linear programming; Materials; Mathematical model; Numerical models; Standards; double-objective; natural casing packing problem; two-stage heuristic algorithm;
fLanguage
English
Publisher
ieee
Conference_Titel
Information and Computing Science (ICIC), 2012 Fifth International Conference on
Conference_Location
Liverpool, United Kingdom
ISSN
2160-7443
Print_ISBN
978-1-4673-1985-0
Type
conf
DOI
10.1109/ICIC.2012.51
Filename
6258076
Link To Document