طراحی شبکه محور میانه سلسله‌ مراتبی ظرفیت‌دار با ملاحظه زمان تحویل

بزرگی امیری, علی; پارسا, ایمان; یاوری, آرش

طراحی شبکه محور میانه سلسله‌ مراتبی ظرفیت‌دار با ملاحظه زمان تحویل

نویسندگان

کارگرشمالی-بالاتر از بزرگراه جلال آل احمد-پردیس دانشکده های فنی دانشگاه تهران-دانشکده مهندسی صنایع

چکیده

در این مقاله، مسئله طراحی مکانیابی محور سلسله مراتبی در حالت محدودیت ظرفیت روی محورها و کمانها در نظر گرفته شده است. مسئله مورد نظر شامل سه سطح می باشد. بالاترین سطح شبکه، شامل محورهای مرکزی و به‌صورت یک شبکه کامل به هم متصل هستند. سطوح دوم و سوم به ترتیب شامل محورها و نقاط تقاضا می باشند که در قالب شبکه های ستارهای به یکدیگر متصل هستند. علاوه بر آن، در مدل پیشنهادی، محدودیت زمان تحویل برای ارسال کالاها نیز در نظر گرفته شده است. مسئله، یافتن تعداد از پیش تعیین شده محورها و محورهای مرکزی در بین نقاط کاندید می باشد به‌ گونه‌ای که هزینه های سیستم کمینه گردد. جهت نشان دادن کارایی و کاربرد پذیری مسئله پیشنهادی، نتایج محاسباتی برای مثالهای با ابعاد مختلف مسئله ارائه و مورد تجزیه‌وتحلیل قرار گرفته است.

کلیدواژه‌ها

عنوان مقاله [English]

The Capacitated Hierarchical p-hub Median Problem Considering Delivery Time

چکیده [English]

In this paper, a hierarchical p-hub median problem is considered that all the nodes and arcs on the network have limited capacities. Proposed model has three-level where the complete network at the top level consists of the central hubs. The second and third levels consist of hub and demand nodes respectively, which are connected through star networks. Also, delivery time restriction is taken into account. The problem is to decide on the locations of a predetermined number of hubs and central hubs among the available nodes in order to minimize the total costs. Numerical experiments demonstrate the efficiency and applicability of the proposed model for actual decision-making problems

کلیدواژه‌ها [English]

Hub Location
Hierarchical Hub Median
Single Assignment
Capacity Constraint

مراجع

[1] Toh, R. S., Higgins, R. G. “The impact of hub and spoke network centralization and route monopoly on domestic airline profitability”, Transportation Journal, PP. 16-27, 1985.

[2] Hakimi, S. L. “Optimum locations of switching centers and the absolute centers and medians of a graph”, Operations Research, Vol. 12, No. 3, PP. 450-459, 1964.

[3] O'Kelly, M.E. “The location of interacting hub facilities”, Transportation Science, No. 20, PP. 92-106, 1986.

[4] O'kelly, M.E. “A quadratic integer program for the location of interacting hub facilities”, European Journal of Operational Research, No. 32, PP. 393-40,1987.

[5] Campbell, J F. "Integer programming formulations of discrete hub location problems", European Journal of Operational Research, No. 72.PP. 387-405,1994.

[6] Ernst, A.T., Krishnamoorthy, M. "Efficient algorithms for the uncapacitated single allocation p-hub median problem", Location science, No. 4, PP. 139-154,1996.

[7] O'Kelly, M.E., Bryan, D., Skorin-Kapov, D., Skorin-Kapov, J. “Hub network design with single and multiple allocation: A computational study”, Location Science, No. 4, PP. 125-138,1996.

[8] Skorin-Kapov, D., Skorin-Kapov, J., O'Kelly, M. “Tight linear programming relaxations of uncapacitated p-hub median problems”, European Journal of Operational Research, No. 94, PP. 582-593,1996.

[9] Sohn, J., Park, S. “A linear program for the two-hub location problem”, European Journal of Operational Research, No. 100, PP. 617-622,1997.

[10] Sohn, J., Park, S. “Efficient solution procedure and reduced size formulations for p-hub location problems”, European Journal of Operational Research, No. 108, PP. 118-126,1998.

[11] Ebery, J. “Solving large single allocation p-hub problems with two or three hubs”, European Journal of Operational Research, No. 128, PP. 447-458,2001.

[12] Klincewicz, J. G. “Heuristics for the p-hub location problem”, European Journal of Operational Research, No. 53, PP. 25-37,1991.

[13] Klincewicz, J.G. “Avoiding local optima in the p-hub location problem using tabu search and GRASP”, Annals of Operations Research, No. 40, PP. 283-302,1992.

[14] Skorin-Kapov, D., Skorin-Kapov,J. “On tabu search for the location of interacting hub facilities”, European Journal of Operational Research, No. 73, PP. 502-509,1994.

[15] Smith, K., Krishnamoorthy, M., Palaniswami, M. “Neural versus traditional approaches to the location of interacting hub facilities”, Location Science, No. 4, PP. 155-171,1996.

[16] Contreras, I., Díaz, J.A., Fernández, E. “Lagrangean relaxation for the capacitated hub location problem with single assignment”, OR spectrum, No. 31, PP. 483-505,2009.

[17] De Camargo, R. S., Miranda, J. “Single allocation hub location problem under congestion: Network owner and userperspectives”, Expert Systems with Applications, No. 39, PP. 3385-3391,2012.

[18] Davari, S., Zarandi, M.H.F. “The single-allocation hierarchical hub median location problem with fuzzy demands”, African Journal of Business Manegement, No. 6, PP. 347-360,2012.

[19] Snyder, L.V., Daskin, M.S. “Reliability models for facility location: the expected failure cost case”, Transportation Science, No. 39, PP. 400-416,2005.

[20] Snyder, L.V., Scaparra, M.P., Daskin, M.S., Church, R.L. “Planning for disruptions in supply chain networks”,Tutorials in operations research,2006.

[21] Berman, O., Krass, D., Menezes, M.B. “Facility reliability issues in network p-median problems: strategic centralization and co-location effects”, Operations Research, No. 55, PP. 332-350,2007.

[22] Cui, T., Ouyang, Y., Shen, Z.J.M. “Reliable facility location design under the risk of disruptions”, Operations Research, No. 58, Part-1, PP. 998-1011,2010.

[23] Li, X., Ouyang, Y. “A continuum approximation approach to reliable facility location design under correlated probabilistic disruptions”, Transportation Research.part B: methodological, No. 44, PP. 535-548,2010.

[24] Kratica, J., Stanimirović, Z., Tošić, D., Filipović, V. “Two genetic algorithms for solving the uncapacitated single allocation p-hub median problem”,European Journal of Operational Research, No. 182, PP. 15-28,2007.

[25] Stanimirović, Z. “A genetic algorithm approach for the capacitated single allocation p-hub median problem”. Computing and Informatics, No. 29, PP. 117-132,2012.

[26] Wu, T. H., Kolar, D. J., Cardwell, R. H. “Survivable network architectures for broad-band fiber optic networks: model and performance comparison.” J. ofLightwave Technology, No. 6, PP.1698-1709,1988.

[27] Yaman, H. “The hierarchical hub median problem with single assignment”, Transportation Research. Part B: Methodological, No. 43, PP. 643-658,2009.