نوع مقاله : علمی - پژوهشی
نویسندگان
1 دانشجوی دکترای مهندسی صنایع، دانشکده فنی و مهندسی، دانشگاه پیام نور، تهران
2 استاد، دانشکده مهندسی صنایع، دانشگاه علم و صنعت، تهران، ایران
3 استاد دانشکده مهندسی صنایع، پردیس دانشکده های فنی، دانشگاه تهران
چکیده
کلیدواژهها
موضوعات
عنوان مقاله [English]
نویسندگان [English]
A Location-Arc Routing Problem (LARP) is a practical problem, while a few mathematical programming models have been considered for this problem so far. To the best our knowledge, it is the first time that a mixed non-linear bi-objective programming model is proposed for a multi-period LARP with time window and risk of robby valuable product. In the proposed model, vehicles can meet the customer for delivery or receive product. 22 standard problems are solved with the ε-constraint method, MOPSO, MOBA, MODA and NSGA-II. The computational results are shown the efficiency of the MODA on indicators of multi-objective problems for solving them. The deviation of the MODA objectives with the ε-constraint at the extreme is equal to 1.32% and 0.45% average. The proposed model is used for solving the location problem of the treasury of a bank as a case study. The case study is a node routing problem with nearby nodes that has transform to arc routing. According to the rules, experts have selected 13 treasuries between 18 candidates, that the Pareto boundary provided by the MODA for the 10 case studies.
کلیدواژهها [English]