ROAD HUB LOCATION-ROUTING ISSUE IN A SPARSE AND DISTANT AREA

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

BAHRAMI FARZAD; SAFARI HOSSEIN; TAVAKKOLI MOGHADDAM REZA; MODARES YAZDI MOHAMMAD

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: Industrial Management Journal Year:2017 | Volume:9 | Issue:1 Page(s): 59-78

Download Full-Text

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Persian Verion

View:

1,393

Download:

Cites:

Information Journal Paper

Title

ROAD HUB LOCATION-ROUTING ISSUE IN A SPARSE AND DISTANT AREA

Author(s)

BAHRAMI FARZAD | SAFARI HOSSEIN | TAVAKKOLI MOGHADDAM REZA | MODARES YAZDI MOHAMMAD | Issue Writer Certificate

Keywords

GENETIC ALGORITHMQ2

HUB LOCATIONQ1

MATHEMATICAL PROGRAMMINGQ1

SIMULATED ANNEALINGQ1

VEHICLE ROUTING PROBLEMQ1

Abstract

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.

Cites

No record.

References

No record.

Cite

APA: Copy

BAHRAMI, FARZAD, SAFARI, HOSSEIN, TAVAKKOLI MOGHADDAM, REZA, & MODARES YAZDI, MOHAMMAD. (2017). ROAD HUB LOCATION-ROUTING ISSUE IN A SPARSE AND DISTANT AREA. JOURNAL OF INDUSTRIAL MANAGEMENT, 9(1 ), 59-78. SID. https://sid.ir/paper/140013/en

Vancouver: Copy

BAHRAMI FARZAD, SAFARI HOSSEIN, TAVAKKOLI MOGHADDAM REZA, MODARES YAZDI MOHAMMAD. ROAD HUB LOCATION-ROUTING ISSUE IN A SPARSE AND DISTANT AREA. JOURNAL OF INDUSTRIAL MANAGEMENT[Internet]. 2017;9(1 ):59-78. Available from: https://sid.ir/paper/140013/en

IEEE: Copy

FARZAD BAHRAMI, HOSSEIN SAFARI, REZA TAVAKKOLI MOGHADDAM, and MOHAMMAD MODARES YAZDI, “ROAD HUB LOCATION-ROUTING ISSUE IN A SPARSE AND DISTANT AREA,” JOURNAL OF INDUSTRIAL MANAGEMENT, vol. 9, no. 1 , pp. 59–78, 2017, [Online]. Available: https://sid.ir/paper/140013/en

Related Journal Papers