HUB LOCATION-ROUTING NETWORK DESIGN UNDER INCOMPLETE HUB LINKS AND DIRECT SHIPMENT

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 HOSSEIN; SETAK MOSTAFA

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

Journal Paper

Paper Information

Journal: JOURNAL OF TRANSPORTATION RESEARCH Year:2014 | Volume:11 | Issue:2 (39) Page(s): 173-191

Download Full-Text

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

Persian Verion

View:

643

Download:

Cites:

Information Journal Paper

Title

HUB LOCATION-ROUTING NETWORK DESIGN UNDER INCOMPLETE HUB LINKS AND DIRECT SHIPMENT

Author(s)

KARIMI HOSSEIN | SETAK MOSTAFA | Issue Writer Certificate

Keywords

HUB LOCATIONQ2

MULTIPLE ALLOCATIONQ1

VALID INEQUALITYQ2

TRANSPORTATION NETWORKQ3

ROUTINGQ2

Abstract

In a HUB LOCATION problem network, the flow originated from an origin and shipped to a destination via some selected intermediate nodes called hub nodes since using a discount factor of hubs. The hub nodes are fully interconnected in the traditional HUB LOCATION problem. In any origin-destination path there exists at least one hub element. Rather than directly connecting any pair of locations, all the paths are handled by the hub node. In this paper, a general configuration of HUB LOCATION problems is considered. The model is presented for HUB LOCATION-routing problem which any network topology can be structured. This model application is in the public transportation, telecommunication systems and financial networks. Incomplete hub network is designed in the model. Furthermore, location and ROUTING decisions are considered simultaneously in the model besides MULTIPLE ALLOCATION strategy. Moreover, non-hub nodes can be connected directly. Objective function of this model minimizes transshipment cost of flows and cost of constructing the network. Family of valid inequalities and some preprocessing are proposed to strengthening the model linear relaxation lower bound and improving solution time. Computational results over test problems driven from the literature show that using all valid inequalities and preprocessing perform better than using each of them separately and solve the model in a reasonable solution time.

Cites

No record.

References

No record.

Cite

APA: Copy

KARIMI, HOSSEIN, & SETAK, MOSTAFA. (2014). HUB LOCATION-ROUTING NETWORK DESIGN UNDER INCOMPLETE HUB LINKS AND DIRECT SHIPMENT. JOURNAL OF TRANSPORTATION RESEARCH, 11(2 (39)), 173-191. SID. https://sid.ir/paper/83694/en

Vancouver: Copy

KARIMI HOSSEIN, SETAK MOSTAFA. HUB LOCATION-ROUTING NETWORK DESIGN UNDER INCOMPLETE HUB LINKS AND DIRECT SHIPMENT. JOURNAL OF TRANSPORTATION RESEARCH[Internet]. 2014;11(2 (39)):173-191. Available from: https://sid.ir/paper/83694/en

IEEE: Copy

HOSSEIN KARIMI, and MOSTAFA SETAK, “HUB LOCATION-ROUTING NETWORK DESIGN UNDER INCOMPLETE HUB LINKS AND DIRECT SHIPMENT,” JOURNAL OF TRANSPORTATION RESEARCH, vol. 11, no. 2 (39), pp. 173–191, 2014, [Online]. Available: https://sid.ir/paper/83694/en

Related Journal Papers