Vehicle-Routing Problem with Time Windows, Driver-Specific Times and Vehicles-Specific Capacities

سال انتشار: 1396
نوع سند: مقاله کنفرانسی
زبان: انگلیسی
مشاهده: 374

فایل این مقاله در 7 صفحه با فرمت PDF قابل دریافت می باشد

استخراج به نرم افزارهای پژوهشی:

لینک ثابت به این مقاله:

شناسه ملی سند علمی:

ISOBM01_011

تاریخ نمایه سازی: 17 آبان 1396

چکیده مقاله:

nowadays, planning the vehicles have been one of important problems with respect to increasing population, number of vehicles and environmental pollution. This paper proposes a Multi-Objective Mixed IntegerProgramming (MOMIP) model for the Vehicle-Routing Problem with Time windows, Driver-specific times and Vehicles-specific capacities (VRPTDV), a variant of the classical VRPT that uses driver-specific travel and servicetimes and vehicles-specific capacity to model the familiarity of the different drivers with the customers to visit. The first objective function aims to minimize traveled distance and the second objective function minimizesworking duration. Time windows means that the service must be started at certain time interval. Also, regarding to driver-specific times, driver knowledge in the route planning clearly improves the efficiency of vehicle routesand decrease the working duration. Also, vehicles-specific capacities means that different vehicles have different capacity. Finally, the proposed model is solved as a single-objective mixed integer programming model by the LPmetricsmethod. The experimental results shows the superiority of the proposed approach to solve the research problem.

نویسندگان

Ebrahim Asadi-Gangraj

Department of industrial engineering; Babol Noshirvani University of Technology Babol, Iran

Sina Nayeri

Department of industrial engineering; Babol Noshirvani University of Technology Babol, Iran