|
|
International Journal of Supply and Operations Management، جلد ۲، شماره ۲، صفحات ۷۰۰-۷۱۹
|
|
|
| عنوان فارسی |
Vehicle Routing with Time Windows and Customer Selection for Perishable Goods |
|
| چکیده فارسی مقاله |
Delivering perishable products to customers as soon as possible and with the minimum cost has been always a challenge for producers and has been emphasized over recent years due to the global market becoming more competitive. In this paper a multi-objective mix integer non-linear programming model is proposed to maximize both profits of a distributer and the total freshness of the several products to be delivered to customers with respect to their demands and with consideration of different soft time windows for each customer, heterogeneous distribution fleet and customer selection option for the distributer. The proposed model is solved with TH method. The two genetic algorithm and simulated annealing algorithm are used to solve large-sized problems. Finally, their results are compared to each other when the optimization software becomes unable of solution representation. |
|
| کلیدواژههای فارسی مقاله |
Vehicle Routing Problem with Time Windows (VRPTW) ، Perishable Goods ، Multi-Objective Programming ، Genetic Algorithm ، Simulated Annealing ، |
|
| عنوان انگلیسی |
Vehicle Routing with Time Windows and Customer Selection for Perishable Goods |
|
| چکیده انگلیسی مقاله |
Delivering perishable products to customers as soon as possible and with the minimum cost has been always a challenge for producers and has been emphasized over recent years due to the global market becoming more competitive. In this paper a multi-objective mix integer non-linear programming model is proposed to maximize both profits of a distributer and the total freshness of the several products to be delivered to customers with respect to their demands and with consideration of different soft time windows for each customer, heterogeneous distribution fleet and customer selection option for the distributer. The proposed model is solved with TH method. The two genetic algorithm and simulated annealing algorithm are used to solve large-sized problems. Finally, their results are compared to each other when the optimization software becomes unable of solution representation. |
|
| کلیدواژههای انگلیسی مقاله |
Vehicle Routing Problem with Time Windows (VRPTW) , Perishable Goods , Multi-Objective Programming , Genetic Algorithm , Simulated Annealing , |
|
| نویسندگان مقاله |
| masoud rabbani
tehran university, tehran, iran
سازمان اصلی تایید شده: دانشگاه تهران (Tehran university)
| mohammad javad ramezankhani
college of engineering, university of tehran, tehran, iran
سازمان اصلی تایید شده: دانشگاه تهران (Tehran university)
| hamed farrokhi asl
college of engineering, university of tehran, tehran, iran
سازمان اصلی تایید شده: دانشگاه تهران (Tehran university)
| amir farshbaf geranmayeh
college of engineering, university of tehran, tehran, iran
سازمان اصلی تایید شده: دانشگاه تهران (Tehran university)
|
|
| نشانی اینترنتی |
http://system.khu.ac.ir/ijsom/browse.php?a_code=A-10-100-47&slc_lang=en&sid=en |
| فایل مقاله |
دریافت فایل مقاله |
| کد مقاله (doi) |
|
| زبان مقاله منتشر شده |
en |
| موضوعات مقاله منتشر شده |
Artificial intelligence & expert system |
| نوع مقاله منتشر شده |
Research paper |
|
|
|
برگشت به:
صفحه اول پایگاه |
نسخه مرتبط |
نشریه مرتبط |
فهرست نشریات
|
