GOAL PROGRAMMING APPROACH TO THE BI-OBJECTIVE COMPETITIVE FLOW-CAPTURING LOCATION-ALLOCATION PROBLEM

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.

NIKBAKHSH E.; NAHAVANDI NASIM; ZEGORDI SEYED HESSAMEDDIN

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

Journal Paper

Paper Information

Journal: INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN) Year:2011 | Volume:22 | Issue:3 Page(s): 293-302

Download Full-Text

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

Persian Verion

View:

666

Download:

Cites:

Information Journal Paper

Title

GOAL PROGRAMMING APPROACH TO THE BI-OBJECTIVE COMPETITIVE FLOW-CAPTURING LOCATION-ALLOCATION PROBLEM

Author(s)

NIKBAKHSH E. | NAHAVANDI NASIM | ZEGORDI SEYED HESSAMEDDIN | Issue Writer Certificate

Keywords

LOCATION-ALLOCATIONQ2

COMPETITIONQ2

FLOW-CAPTURINGQ2

GOAL PROGRAMMINGQ2

OPTIMIZATIONQ3

Abstract

Majority of models in location literature are based on assumptions such as point demand, absence of competitors, as well as monopoly in location, products, and services. However in real-world applications, these assumptions are not well-matched with reality. In this study, a new mixed integer nonlinear programming model based on weighted GOAL PROGRAMMING approach is proposed to maximize the captured demand while minimizing the fixed costs of locating new facilities. To make the proposed model OPTIMIZATION simple, the proposed model is linearized using proper modeling techniques. Although GOAL PROGRAMMING method does not ensure obtaining Pareto-optimal solutions, solving a numerical example demonstrates the possibility of obtaining Pareto-optimal solutions for the research problem besides higher speed of the classical branch & bound method in obtaining the optimal solution in comparison to the conventional single objective model.

Cites

No record.

References

No record.

Cite

APA: Copy

NIKBAKHSH, E., NAHAVANDI, NASIM, & ZEGORDI, SEYED HESSAMEDDIN. (2011). GOAL PROGRAMMING APPROACH TO THE BI-OBJECTIVE COMPETITIVE FLOW-CAPTURING LOCATION-ALLOCATION PROBLEM. INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN), 22(3), 293-302. SID. https://sid.ir/paper/66016/en

Vancouver: Copy

NIKBAKHSH E., NAHAVANDI NASIM, ZEGORDI SEYED HESSAMEDDIN. GOAL PROGRAMMING APPROACH TO THE BI-OBJECTIVE COMPETITIVE FLOW-CAPTURING LOCATION-ALLOCATION PROBLEM. INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN)[Internet]. 2011;22(3):293-302. Available from: https://sid.ir/paper/66016/en

IEEE: Copy

E. NIKBAKHSH, NASIM NAHAVANDI, and SEYED HESSAMEDDIN ZEGORDI, “GOAL PROGRAMMING APPROACH TO THE BI-OBJECTIVE COMPETITIVE FLOW-CAPTURING LOCATION-ALLOCATION PROBLEM,” INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN), vol. 22, no. 3, pp. 293–302, 2011, [Online]. Available: https://sid.ir/paper/66016/en

Related Journal Papers