این سایت در حال حاضر پشتیبانی نمی شود و امکان دارد داده های نشریات بروز نباشند
International Journal of Optimaization in Civil Engineering، جلد ۱۱، شماره ۱، صفحات ۷۵-۹۹
عنوان فارسی
چکیده فارسی مقاله
کلیدواژه‌های فارسی مقاله
عنوان انگلیسی SOLVING THE VEHICLE ROUTING PROBLEM BY A HYBRID IMPROVED PARTICLE SWARM OPTIMIZATION
چکیده انگلیسی مقاله The capacity vehicle routing problem (CVRP) is one of the most famous issues in combinatorial optimization that has been considered so far, and has attracted the attention of many scientists and researchers today. Therefore, many exact, heuristic and meta-heuristic methods have been presented in recent decades to solve it. In this paper, due to the weaknesses in the particle swarm optimization (PSO), a hybrid-modified version of this algorithm called PPSO is presented to solve the CVRP problem. In order to evaluate the efficiency of the algorithm, 14 standard examples from 50 to 199 customers of the existing literature were considered and the results were compared with other meta-heuristic algorithms. The results show that the proposed algorithm is competitive with other meta-heuristic algorithms. Besides, this algorithm obtained very close answers to the best known solutions (BKSs) for most of the examples, so that the seven BKSs were produced by PPSO.
کلیدواژه‌های انگلیسی مقاله capacity vehicle routing problem, particle swarm optimization, combined optimization problems, local search algorithms.
نویسندگان مقاله | M. Yousefikhoshbakht


نشانی اینترنتی http://ijoce.iust.ac.ir/browse.php?a_code=A-10-66-293&slc_lang=en&sid=1
فایل مقاله فایلی برای مقاله ذخیره نشده است
کد مقاله (doi)
زبان مقاله منتشر شده en
موضوعات مقاله منتشر شده Optimal design
نوع مقاله منتشر شده پژوهشی
برگشت به: صفحه اول پایگاه   |   نسخه مرتبط   |   نشریه مرتبط   |   فهرست نشریات