کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
4968588 1449674 2017 33 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Designing an integrated distribution system for catering services for high-speed railways: A three-echelon location routing model with tight time windows and time deadlines
ترجمه فارسی عنوان
طراحی یک سیستم توزیع یکپارچه برای خدمات پذیرایی برای راه آهن های با سرعت بالا: یک مدل مسیریابی سه بعدی با پنجره های زمان بندی و زمان های تعیین شده
کلمات کلیدی
خدمات پذیرایی، راه آهن با سرعت بالا، طرح راه آهن عمومی، مدل مسیریابی محل الگوریتم انتروپی صلیب، اوج گیری همسایه زمان گرا،
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نرم افزارهای علوم کامپیوتر
چکیده انگلیسی


- We address a distribution system design problem for the rail catering service.
- A location routing model with time windows and time budget constraints is proposed.
- We use a relaxation model to provide a lower bound for the location routing model.
- We use a hybrid cross entropy algorithm to solve the location routing model.

An emerging task in catering services for high-speed railways (CSHR) is to design a distribution system for the delivery of high-quality perishable food products to trains in need. This paper proposes a novel model for integrating location decision making with daily rail catering operations, which are affected by various aspects of rail planning, to meet time-sensitive passenger demands. A three-echelon location routing problem with time windows and time budget constraints (3E-LRPTWTBC) is thus proposed toward formulating this integrated distribution system design problem. This model attempts to determine the capacities/locations of distribution centers and to optimize the number of meals delivered to stations. The model also attempts to generate a schedule for refrigerated cars traveling from distribution centers to rail stations for train loading whereby meals can be catered to trains within tight time windows and sold before a specified time deadline. By relaxing the time-window constraints, a relaxation model that can be solved using an off-the-shelf mixed integer programming (MIP) solver is obtained to provide a lower bound on the 3E-LRPTWTBC. A hybrid cross entropy algorithm (HCEA) is proposed to solve the 3E-LRPTWTBC. A small-scale case study is implemented, which reveals a 9.3% gap between the solution obtained using the HCEA and that obtained using the relaxation model (RM). A comparative analysis of the HCEA and an exhaustive enumeration algorithm indicates that the HCEA shows good performance in terms of computation time. Finally, a case study considering 156 trains on the Beijing-Shanghai high-speed corridor and a large-scale case study considering 1130 trains on the Chinese railway network are addressed in a comprehensive study to demonstrate the applicability of the proposed models and algorithm.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Transportation Research Part C: Emerging Technologies - Volume 74, January 2017, Pages 212-244
نویسندگان
, , ,