کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
9740237 | 1489232 | 2005 | 19 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
The multiple depot, multiple traveling salesmen facility-location problem: Vehicle range, service frequency, and heuristic implementations
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
سایر رشته های مهندسی
کنترل و سیستم های مهندسی
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: The multiple depot, multiple traveling salesmen facility-location problem: Vehicle range, service frequency, and heuristic implementations The multiple depot, multiple traveling salesmen facility-location problem: Vehicle range, service frequency, and heuristic implementations](/preview/png/9740237.png)
چکیده انگلیسی
At the core of many delivery-logistics problems is the multiple depot, multiple traveling salesmen facility-location problem (MDMTSFLP). This paper addresses a mixed integer MDMTSFLP formulation, expanded to include vehicle range and multiple service-frequency requirements. Here, vehicle range can be interpreted as limitation on tour length, often due to crew duty day restriction. Once defined, we use this optimization formulation to validate a heuristic solution for location and routing. Our heuristic employs a combination of the minimum spanning forest (MSF) and a modified Clarke-Wright (CW) procedure. The spanning forest is used for geographic partitioning and for depot location, while the CW routes the multiple aircraft fleets. Generalizing from a minimum K-tree, the MSF is an exact O(|I|3) method for partitioning the demands into service regions and in locating regional depots, where |I| is the number of nodes. The Defense Courier Service (DCS) aerial network provides a huge instance of the hierarchical multiple-frequency, range-restricted MDMTSFLP. For this network, we find our MSF/CW procedure to be suboptimal by 3.86 percent on average over 16 validation runs, with no run worse than 20.27 percent. We show that several depots of the DCS may be closed without a large increase of routing cost. The model and solution procedure presented here have implications upon many other logistics problems, which are typically characterized by multiple vehicular visits and shortage of crew duty days.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Mathematical and Computer Modelling - Volume 41, Issues 8â9, AprilâMay 2005, Pages 1035-1053
Journal: Mathematical and Computer Modelling - Volume 41, Issues 8â9, AprilâMay 2005, Pages 1035-1053
نویسندگان
Yupo Chan, S.F. Baker,