Open Vehicle Routing Problem Optimization under Realistic Assumptions
سال انتشار: 1393
نوع سند: مقاله ژورنالی
زبان: انگلیسی
مشاهده: 100
فایل این مقاله در 10 صفحه با فرمت PDF قابل دریافت می باشد
- صدور گواهی نمایه سازی
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_RIEJ-3-2_005
تاریخ نمایه سازی: 15 فروردین 1401
چکیده مقاله:
MDOVRP is a variant of classical VRP, which seeks to find a set of non-depot returning vehicle routes dispatching form several depots. A new integer linear programming model is presented considering limited number of vehicles at each depot. Randomly generated smallsized MDOVRPs are solved for validation and verification of the proposed model. Due to the complexity of the problem, a simulated annealing algorithm (SA) is developed for medium and large-sized MDVRPs’ benchmarks.
کلیدواژه ها:
نویسندگان
Kh. Pichka
Industrial Engineering Department, University of Tafresh, Tafresh, Iran
B. Ashjari
Industrial Engineering Department, University of Tafresh, Tafresh, Iran
A. Ziaeifar
School of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran
P. Nickbeen
Industrial Engineering Department, University of Kurdistan, Sanandaj, Iran