کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
474733 699117 2011 8 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
The balanced traveling salesmanproblem
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
The balanced traveling salesmanproblem
چکیده انگلیسی

In this paper we introduce the balanced traveling salesman problem (BTSP), which can be used to model optimization problems where equitable distribution of resources are important. BTSP is obviously NP-hard. Efficient heuristic algorithms are presented to solve the problem along with extensive computational results using benchmark problems from TSPLIB and random instances. Our algorithms produced provably optimal solutions for several test instances. Application of the model in solving the nozzle guide vane assembly problem related to the maintenance of aircraft engines is also discussed.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Operations Research - Volume 38, Issue 5, May 2011, Pages 868–875
نویسندگان
, ,