کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
1134748 | 956077 | 2010 | 10 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A variable neighborhood descent heuristic for arc routing problems with time-dependent service costs
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
سایر رشته های مهندسی
مهندسی صنعتی و تولید
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
This paper proposes a variable neighborhood descent heuristic for solving a capacitated arc routing problem with time-dependent service costs. The problem is motivated by winter gritting applications where the timing of each intervention is crucial. The variable neighborhood descent is based on neighborhood structures that manipulate arcs or sequences of arcs. Computational results are reported on problems derived from classical capacitated arc routing problem instances. A comparison is also provided with an alternative approach where the arc routing problem is solved after being transformed into an equivalent node routing problem.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Industrial Engineering - Volume 59, Issue 4, November 2010, Pages 954–963
Journal: Computers & Industrial Engineering - Volume 59, Issue 4, November 2010, Pages 954–963
نویسندگان
Mariam Tagmouti, Michel Gendreau, Jean-Yves Potvin,