Robust Ride-Sharing in a Scheduling-Routing-Assigning Problem
محل انتشار: شانزدهمین کنفرانس بین المللی مهندسی صنایع
سال انتشار: 1398
نوع سند: مقاله کنفرانسی
زبان: انگلیسی
مشاهده: 619
فایل این مقاله در 10 صفحه با فرمت PDF قابل دریافت می باشد
- صدور گواهی نمایه سازی
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
IIEC16_045
تاریخ نمایه سازی: 12 مرداد 1399
چکیده مقاله:
This paper investigated a ride-sharing problem that a company assigns its vehicles to some employees; these employees take other employees up in the way of the company. This way, commuting employees will conduct using ride-sharing vehicles of the company. The proposed mathematical model discussed the problem of scheduling, routing, and assigning issues. The traveling time between nodes as an important parameter considered as an uncertain parameter. Two robust models proposed to deal with the uncertain parameter which are developed using approaches of Leung and Aghezzaf. Finally, employing a numerical example, the benefits of considering traveling time as an uncertain parameter investigated along with comparing two robust models. According to the results, the robust models are better than a deterministic model and between the robust models, Leung’s approach is better than Aghezzaf’s approach, in this problem.
کلیدواژه ها:
نویسندگان
Shiva Ghaffari
Ph.D. Candidate, Department of Industrial Engineering, Yazd University,
Hassan Khademi zareh
Professor, Department of Industrial Engineering, Yazd University,
ahmad sadeghieh
Professor, Department of Industrial Engineering, Yazd University,
ali mostafaeipour
Associate Professor, Department of Industrial Engineering, Yazd University