کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
6892835 | 699180 | 2016 | 24 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A branch and price algorithm for the pharmacy duty scheduling problem
ترجمه فارسی عنوان
یک الگوریتم شاخه ای و قیمت برای برنامه ریزی هزینه وظیفه داروخانه
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
برنامه ریزی داروسازی، نسل ستون، شعبه و قیمت،
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
چکیده انگلیسی
Pharmacy Duty Scheduling (PDS) is the activity of assigning pharmacies to days during a planning horizon with the purpose of serving society outside regular working hours. In Turkey, pharmacies are retailers who operate during the working hours in weekdays. However, demand for medicine at nights, at the weekends and on holidays must be satisfied by allocating times to pharmacies to open at these times. The problem is a multi-period p-median problem with the additional problem specific constraints, and it is NP-Hard. In this study, we develop a branch-and-price algorithm to solve the PDS to optimality. We decompose the problem into single period problems and apply column generation on the decomposed problem. We propose several enhancements on the algorithm and conduct computational tests on randomly generated instances to compare the performance of the developed algorithm with the state-of-art general purpose solver. The branch-and-price algorithm outperforms the state-of-art general purpose solver.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Operations Research - Volume 72, August 2016, Pages 175-182
Journal: Computers & Operations Research - Volume 72, August 2016, Pages 175-182
نویسندگان
Gökhan Ceyhan, Ãzgür Ãzpeynirci,