کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
481723 | 1446181 | 2008 | 14 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
An efficient computational approach for railway booking problems
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: An efficient computational approach for railway booking problems An efficient computational approach for railway booking problems](/preview/png/481723.png)
چکیده انگلیسی
This paper deals with the determination of seat allocations for a rail booking system. It is assumed that demand for each trip in the network can be divided into two segments, namely a full fare segment and a discounted fare segment. A constrained nonlinear integer programming model is formulated to deal with this problem. The purpose of this paper is to develop an efficient heuristic approach to develop the booking limits for all ticket types in the railway network. The solutions obtained by the heuristic approach are compared with those found by the Lingo software and the DICOPT solver. Numerical results show that the proposed heuristic approach only require a small number of CPU time to obtain superior solutions.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 185, Issue 2, 1 March 2008, Pages 811–824
Journal: European Journal of Operational Research - Volume 185, Issue 2, 1 March 2008, Pages 811–824
نویسندگان
Peng-Sheng You,