Road Hub Location-Routing Issue in a Sparse and Distant Area | ||
| Industrial Management Journal | ||
| مقاله 4، دوره 9، شماره 1، 2017، صفحه 59-78 اصل مقاله (952.04 K) | ||
| نوع مقاله: Original Research Article | ||
| شناسه دیجیتال (DOI): 10.22059/imj.2017.213340.1007104 | ||
| نویسندگان | ||
| Farzad Bahrami1؛ Hossein Safari* ؛ Reza Tavakkoli-Moghaddam2؛ Mohammad Modarres Yazdi3 | ||
| 1Ph.D. Candidate in Production and Operations Management, University of Tehran, Tehran, Iran | ||
| 2Prof., School of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran | ||
| 3Prof., Dep. of Industrial Engineering, Sharif University of Technology, Tehran, Iran | ||
| چکیده | ||
| In order to manage the expenditures in a road transportation network in which the transport demands between cities are less than a truckload capacity, one needs to determine the location of hubs at first, and then collect the cargo from the cities in some routes which are assigned to the appropriate hubs. In this paper, a special case of hub location-routing issue was considered that is suitable for the particular conditions of Iran as cities are located in the sparse and distant places. A mixed integer mathematical programming model was proposed. As the model is NP-hard in nature, a two-phase hybrid method including genetic algorithms and simulated annealing was designed to solve the model. The results of the comparison between the model and the outputs demonstrated the accuracy and speed of the proposed solution method. Finally, a real case including all 31 capital cities of Iran provinces was solved to illustrate the appropriate performance of the solution method. | ||
| کلیدواژهها | ||
| Genetic Algorithm؛ Hub location؛ Mathematical Programming؛ Simulated Annealing؛ Vehicle routing problem | ||
| مراجع | ||
|
| ||
|
آمار تعداد مشاهده مقاله: 1,432 تعداد دریافت فایل اصل مقاله: 852 |
||