کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
480684 | 1446092 | 2011 | 7 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A global optimization procedure for the location of a median line in the three-dimensional space
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
A global optimization procedure is proposed to find a line in the Euclidean three-dimensional space which minimizes the sum of distances to a given finite set of three-dimensional data points.Although we are using similar techniques as for location problems in two dimensions, it is shown that the problem becomes much harder to solve. However, a problem parameterization as well as lower bounds are suggested whereby we succeeded in solving medium-size instances in a reasonable amount of computing time.
► We solve the median line location problem in the three-dimensional space.
► A branch-and-bound algorithm is suggested and necessary lower bounds are calculated.
► Extensive numerical results show that medium-size instances can be solved.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 215, Issue 1, 16 November 2011, Pages 14–20
Journal: European Journal of Operational Research - Volume 215, Issue 1, 16 November 2011, Pages 14–20
نویسندگان
Rafael Blanquero, Emilio Carrizosa, Anita Schöbel, Daniel Scholz,