کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
1023621 941637 2009 15 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
A Lagrangian heuristic for the real-time vehicle rescheduling problem
موضوعات مرتبط
علوم انسانی و اجتماعی مدیریت، کسب و کار و حسابداری کسب و کار و مدیریت بین المللی
پیش نمایش صفحه اول مقاله
A Lagrangian heuristic for the real-time vehicle rescheduling problem
چکیده انگلیسی

When a public transit vehicle breaks down on a scheduled trip, one or more vehicles need to be rescheduled to serve that trip and other service trips originally scheduled for the disabled vehicle. In this paper, the vehicle rescheduling problem (VRSP) is investiaged to consider operating costs, schedule disruption costs, and trip cancellation costs. The VRSP is proven to be NP-hard, and a Lagrangian relaxation based insertion heuristic is developed. Extensive computational experiments on randomly generated problems are reported. The results show that the Lagrangian heuristic performs very well for solving the VRSP.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Transportation Research Part E: Logistics and Transportation Review - Volume 45, Issue 3, May 2009, Pages 419–433
نویسندگان
, , ,