Capacitated Single Allocation P-Hub Covering Problem in Multi-modal Network Using Tabu Search

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.

KARIMI H.; BASHIRI M.; Nickel s.

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

Journal Paper

Paper Information

Journal: INTERNATIONAL JOURNAL OF ENGINEERING Year:2016 | Volume:29 | Issue:6 (TRANSACTIONS C: Aspects) Page(s): 0-0

Download Full-Text

View:

176

Download:

Cites:

Information Journal Paper

Title

Capacitated Single Allocation P-Hub Covering Problem in Multi-modal Network Using Tabu Search

Author(s)

KARIMI H. | BASHIRI M. | Nickel s. | Issue Writer Certificate

Keywords

Hub Location

Covering;Multi-Modal

Tabu Search

Valid Inequality

Capacity

Abstract

The goals of Hub Location problems are finding the location of hub facilities and determining the allocation of non-hub nodes to these located hubs. In this work, we discuss the multi-modal single allocation capacitated p-hub covering problem over fully interconnected hub networks. Therefore, we provide a formulation to this end. The purpose of our model is to find the location of hubs and the hub links between them at a selected combination of modes for each origin-destination. Furthermore, it determines the allocation of non-hub nodes to the located hubs at the best mode for each allocation such that the travel time between any origin– destination pair is not greater than a given time bound. In addition, the Capacity of hub nodes is considered. Six valid inequalities are presented to tight the linear programming lower bound. We present a heuristic based on Tabu Search algorithm and test the performance of it on the Australian Post (AP) data set.

Cites

No record.

References

No record.

Cite

APA: Copy

KARIMI, H., BASHIRI, M., & Nickel, s.. (2016). Capacitated Single Allocation P-Hub Covering Problem in Multi-modal Network Using Tabu Search. INTERNATIONAL JOURNAL OF ENGINEERING, 29(6 (TRANSACTIONS C: Aspects)), 0-0. SID. https://sid.ir/paper/724155/en

Vancouver: Copy

KARIMI H., BASHIRI M., Nickel s.. Capacitated Single Allocation P-Hub Covering Problem in Multi-modal Network Using Tabu Search. INTERNATIONAL JOURNAL OF ENGINEERING[Internet]. 2016;29(6 (TRANSACTIONS C: Aspects)):0-0. Available from: https://sid.ir/paper/724155/en

IEEE: Copy

H. KARIMI, M. BASHIRI, and s. Nickel, “Capacitated Single Allocation P-Hub Covering Problem in Multi-modal Network Using Tabu Search,” INTERNATIONAL JOURNAL OF ENGINEERING, vol. 29, no. 6 (TRANSACTIONS C: Aspects), pp. 0–0, 2016, [Online]. Available: https://sid.ir/paper/724155/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops