CIVILICA We Respect the Science
(ناشر تخصصی کنفرانسهای کشور / شماره مجوز انتشارات از وزارت فرهنگ و ارشاد اسلامی: ۸۹۷۱)

Robust Ride-Sharing in a Scheduling-Routing-Assigning Problem

عنوان مقاله: Robust Ride-Sharing in a Scheduling-Routing-Assigning Problem
شناسه ملی مقاله: IIEC16_045
منتشر شده در شانزدهمین کنفرانس بین المللی مهندسی صنایع در سال 1398
مشخصات نویسندگان مقاله:

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

خلاصه مقاله:
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.

کلمات کلیدی:
Ride-sharing vehicles, Mixed-integer linear programming, robust optimization

صفحه اختصاصی مقاله و دریافت فایل کامل: https://civilica.com/doc/1034731/