کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
7543432 | 1489486 | 2018 | 22 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Staircase compatibility and its applications in scheduling and piecewise linearization
ترجمه فارسی عنوان
سازگاری پله ها و کاربرد آن در برنامه ریزی و خطی سازی قطعه ای
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
کنترل و بهینه سازی
چکیده انگلیسی
We introduce the Clique Problem with Multiple-Choice constraints (CPMC) and characterize a case where it is possible to give an efficient description of the convex hull of its feasible solutions. This special case, which we name staircase compatibility, generalizes common properties in several applications and allows for a linear description of the integer feasible solutions to (CPMC) with a totally unimodular constraint matrix of polynomial size. We derive two such totally unimodular reformulations for the problem: one that is obtained by a strengthening of the compatibility constraints and one that is based on a representation as a dual network flow problem. Furthermore, we show a natural way to derive integral solutions from fractional solutions to the problem by determining integral extreme points generating this fractional solution. We also evaluate our reformulations from a computational point of view by applying them to two different real-world problem settings. The first one is a problem in railway timetabling, where we try to adapt a given timetable slightly such that energy costs from operating the trains are reduced. The second one is the piecewise linearization of non-linear network flow problems, illustrated at the example of gas networks. In both cases, we are able to reduce the solution times significantly by passing to the theoretically stronger formulations of the problem.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Optimization - Volume 29, August 2018, Pages 111-132
Journal: Discrete Optimization - Volume 29, August 2018, Pages 111-132
نویسندگان
Andreas Bärmann, Thorsten Gellermann, Maximilian Merkert, Oskar Schneider,