A TABU SEARCH BASED SOLUTION APPROACH TO THE COMPETITIVE MULTIPLE ALLOCATION HUB LOCATION PROBLEMS

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.

Ghaffarinasab Nader; JABARZADEH YOUNIS; Motallebzadeh Alireza

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

Seminar Paper

Paper Information

Seminar: INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING
Year:2017 | Issue:13

Download Full-Text

View:

173

Download:

Information Seminar Paper

Title

A TABU SEARCH BASED SOLUTION APPROACH TO THE COMPETITIVE MULTIPLE ALLOCATION HUB LOCATION PROBLEMS

Author(s)

Ghaffarinasab Nader | JABARZADEH YOUNIS | Motallebzadeh Alireza

Keywords

HUB LOCATION

COMPETITIVE MODELS

MATHEMATICAL FORMULATION

TABU SEARCH

Abstract

THE HUB LOCATION PROBLEMS (HLP) CONSTITUTE AN IMPORTANT CLASS OF FACILITY LOCATION PROBLEMS THAT HAVE ATTRACTED ATTENTION OF THE OPERATIONS RESEARCHERS IN RECENT YEARS. HLP IS ONE OF THE STRATEGIC PROBLEMS FREQUENTLY ENCOUNTERED IN DESIGNING LOGISTICS AND TRANSPORTATION NETWORKS. THIS PAPER ADDRESSES THE COMPETITIVE MULTIPLE ALLOCATION HLP WHERE THE MARKET IS ASSUMED TO BE A DUOPOLY. IT IS ASSUMED THAT AN INCUMBENT FIRM (THE LEADER) IS OPERATING AN EXISTING HUB NETWORK IN A MARKET AND AN ENTRANT FIRM (THE FOLLOWER) TRIES TO ENTER THE MARKET BY CONFIGURING ITS OWN HUB NETWORK TRYING TO CAPTURE AS MUCH FLOW AS POSSIBLE FROM THE LEADER. THE CUSTOMERS CHOOSE ONE FIRM BASED ON THE SERVICE LEVEL (COST, TIME, DISTANCE, ETC.) PROVIDED BY THESE FIRMS. WE FORMULATE THE PROBLEM FROM THE ENTRANT FIRM’S POINT OF VIEW AND PROPOSE AN EFFICIENT TABU SEARCH (TS) BASED SOLUTION ALGORITHM TO SOLVE IT. COMPUTATIONAL EXPERIMENTS SHOW THE CAPABILITY OF THE PROPOSED SOLUTION ALGORITHM TO OBTAIN THE OPTIMAL SOLUTIONS IN SHORT COMPUTATIONAL TIMES.

Cites

No record.

References

No record.

Cite

APA: Copy

Ghaffarinasab, Nader, JABARZADEH, YOUNIS, & Motallebzadeh, Alireza. (2017). A TABU SEARCH BASED SOLUTION APPROACH TO THE COMPETITIVE MULTIPLE ALLOCATION HUB LOCATION PROBLEMS. INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING. SID. https://sid.ir/paper/938750/en

Vancouver: Copy

Ghaffarinasab Nader, JABARZADEH YOUNIS, Motallebzadeh Alireza. A TABU SEARCH BASED SOLUTION APPROACH TO THE COMPETITIVE MULTIPLE ALLOCATION HUB LOCATION PROBLEMS. 2017. Available from: https://sid.ir/paper/938750/en

IEEE: Copy

Nader Ghaffarinasab, YOUNIS JABARZADEH, and Alireza Motallebzadeh, “A TABU SEARCH BASED SOLUTION APPROACH TO THE COMPETITIVE MULTIPLE ALLOCATION HUB LOCATION PROBLEMS,” presented at the INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING. 2017, [Online]. Available: https://sid.ir/paper/938750/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops