TWO METAHEURISTIC APPROACHES FOR P-HUB CENTER LOCATION PROBLEM UNDER CAPACITY CONSTRAINTS

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.

EYDI ALIREZA; ARKAT JAMAL; PARHIZKAR MEHRABADI EHSAN

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

Journal Paper

Paper Information

Journal: PRODUCTION AND OPERATIONS MANAGEMENT Year:2018 | Volume:8 | Issue:2 (15) Page(s): 47-60

Download Full-Text

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

Persian Verion

View:

1,461

Download:

Cites:

Information Journal Paper

Title

TWO METAHEURISTIC APPROACHES FOR P-HUB CENTER LOCATION PROBLEM UNDER CAPACITY CONSTRAINTS

Author(s)

EYDI ALIREZA | ARKAT JAMAL | PARHIZKAR MEHRABADI EHSAN | Issue Writer Certificate

Keywords

SIMULATED ANNEALINGQ1

ANT COLONY OPTIMIZATIONQ1

CAPACITY CONSTRAINTQ1

P-HUB CENTER LOCATIONQ1

Abstract

Hub location problem is one of the new issues in location problems. This kind of location problem is widely used in transportation systems. In this paper, we investigate P-HUB CENTER LOCATION allocation problem under CAPACITY CONSTRAINT. The aim of the proposed model is to determine the location of hub nodes and the allocation of non-hub nodes to the hub in such a way that the maximum traveling time is minimized. In addition, since the problem is an NP hard problem, two metaheuristic algorithms including SIMULATED ANNEALING algorithm and ant colony are developed for solving large size real world problems. The performances of the proposed algorithms are examined via some numerical examples taken from known related benchmark sets (AP dataset). The best solutions found using metaheuristic algorithms are also compare to the results achieved using Lingo software. The results demonstrate that the proposed algorithms are able to find optimum or near optimum solutions in acceptable run times.

Cites

No record.

References

No record.

Cite

APA: Copy

EYDI, ALIREZA, ARKAT, JAMAL, & PARHIZKAR MEHRABADI, EHSAN. (2018). TWO METAHEURISTIC APPROACHES FOR P-HUB CENTER LOCATION PROBLEM UNDER CAPACITY CONSTRAINTS. PRODUCTION AND OPERATIONS MANAGEMENT, 8(2 (15) ), 47-60. SID. https://sid.ir/paper/217482/en

Vancouver: Copy

EYDI ALIREZA, ARKAT JAMAL, PARHIZKAR MEHRABADI EHSAN. TWO METAHEURISTIC APPROACHES FOR P-HUB CENTER LOCATION PROBLEM UNDER CAPACITY CONSTRAINTS. PRODUCTION AND OPERATIONS MANAGEMENT[Internet]. 2018;8(2 (15) ):47-60. Available from: https://sid.ir/paper/217482/en

IEEE: Copy

ALIREZA EYDI, JAMAL ARKAT, and EHSAN PARHIZKAR MEHRABADI, “TWO METAHEURISTIC APPROACHES FOR P-HUB CENTER LOCATION PROBLEM UNDER CAPACITY CONSTRAINTS,” PRODUCTION AND OPERATIONS MANAGEMENT, vol. 8, no. 2 (15) , pp. 47–60, 2018, [Online]. Available: https://sid.ir/paper/217482/en

Related Journal Papers