کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
9663688 | 1446238 | 2005 | 10 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A shortest-path algorithm for solving the fleet management problem in underground mines
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: A shortest-path algorithm for solving the fleet management problem in underground mines A shortest-path algorithm for solving the fleet management problem in underground mines](/preview/png/9663688.png)
چکیده انگلیسی
This paper describes the problem of managing a fleet of load-haul-dump (LHD) vehicles in an underground mine. The problem consists of dispatching, routing and scheduling vehicles whenever they need to be assigned to a new task. The solution approach is based on a shortest-path algorithm. Each decision takes into account the current status of the mine, the current traffic on all single-lane bi-directional road segments of the haulage network and operational constraints such as the fact that, while LHD vehicles move in forward or reverse modes, their bucket must be in dumping/loading position at destination.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 166, Issue 2, 16 October 2005, Pages 497-506
Journal: European Journal of Operational Research - Volume 166, Issue 2, 16 October 2005, Pages 497-506
نویسندگان
Michel Gamache, Renaud Grimard, Paul Cohen,