MULTIPLE ALLOCATION HUB LOCATION PROBLEM WITH MULTIPLE CAPACITY LEVELS AND LIMITED FLOW IN LINKAGES

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.

RABBANI MASOUD; TAVAKOLI LEILA

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

Seminar Paper

Paper Information

Seminar: LOGISTICS AND SUPPLY CHAIN CONFERENCE
Year:2012 | Issue:5

Download Full-Text

View:

135

Download:

152

Information Seminar Paper

Title

MULTIPLE ALLOCATION HUB LOCATION PROBLEM WITH MULTIPLE CAPACITY LEVELS AND LIMITED FLOW IN LINKAGES

Author(s)

RABBANI MASOUD | TAVAKOLI LEILA

Keywords

HUB LOCATION PROBLEM

MULTIPLE CAPACITY LEVELS

CAPACITY OF LINKAGES

Abstract

DURING THE TWO LAST DECADES, A WIDE RANG OF APPLICATION OF HUB NETWORK DESIGN PROBLEMS HAVE RECEIVED INCREASING ATTENTION IN THE FIELDS OF TRANSPORTATION, TELECOMMUNICATIONS, COMPUTER NETWORKS, POSTAL DELIVERY, LESS-THAN-TRUCK LOADING AND SUPPLY CHAIN MANAGEMENT. HUBS ARE SPECIAL FACILITIES USED FOR SWITCHING, TRANSSHIPMENT AND SORTING POINTS IN DISTRIBUTION SYSTEMS. HUB FACILITIES ARE USED TO CONSENTRATE FLOWS IN ORDER TO TAKE ADVANTAGE OF ECONOMIES OF SCALE. IN THIS RESEARCH A MULTIPLE ALLOCATION HUB LOCATION PROBLEM IS CONSIDERED AND IT IS ASSUMED EACH POTENTIAL HUB COULD HAVE MULTIPLE CAPACITY LEVELS. ALSO, A FIXED COST AND A MINIMUM CAPACITY FOR ALL LINKAGES ARE CONSIDERED. IN OTHERE WORDS, THE FLOW BETWEEN EACH LINKAGES CANNOT EXCEED FROM A PREDETERMINED CAPACITY. AT THE END, GAMS SOFTWARE WITH CPLEX SOLVER IS USED TO OPTIMIZE THE PROBLEM IN SMALL SIZES AND ALSO, TO CHECK THE FEASIBILITY OF THE NEW MODEL.

Cites

No record.

References

No record.

Cite

APA: Copy

RABBANI, MASOUD, & TAVAKOLI, LEILA. (2012). MULTIPLE ALLOCATION HUB LOCATION PROBLEM WITH MULTIPLE CAPACITY LEVELS AND LIMITED FLOW IN LINKAGES. LOGISTICS AND SUPPLY CHAIN CONFERENCE (5TH NATIONAL AND 3RD INTERNATIONAL). SID. https://sid.ir/paper/929951/en

Vancouver: Copy

RABBANI MASOUD, TAVAKOLI LEILA. MULTIPLE ALLOCATION HUB LOCATION PROBLEM WITH MULTIPLE CAPACITY LEVELS AND LIMITED FLOW IN LINKAGES. 2012. Available from: https://sid.ir/paper/929951/en

IEEE: Copy

MASOUD RABBANI, and LEILA TAVAKOLI, “MULTIPLE ALLOCATION HUB LOCATION PROBLEM WITH MULTIPLE CAPACITY LEVELS AND LIMITED FLOW IN LINKAGES,” presented at the LOGISTICS AND SUPPLY CHAIN CONFERENCE (5TH NATIONAL AND 3RD INTERNATIONAL). 2012, [Online]. Available: https://sid.ir/paper/929951/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops