پایان نامه با واژه های کلیدی flow، node،

دانلود پایان نامه ارشد

the Capacitated Single Allocation P-Hub Median Problem. Computing and Informatics, 29, 117–132.
Tan, P.Z., Kara, B.Y., 2007. A hub covering model for cargo delivery systems. Networks 49 (1), 28–39.
Toh, R.S., Higgins, R.C., 1985. The impact of hub and spoke network centralization and route monopoly on domestic airline profitability. Transportation Journal, 24, 16–27.
Topcuoglu, H., Corut, F., Ermis, M., Yilmaz, G., 2005. Solving the uncapacitated hub location problem using genetic algorithms. Computers & OR 32 (4), 967–984.
Vladimirou, H., Zenios, S.A., 1997. Stochastic linear programs with restricted recourse, Eur. J. Oper. Res. 101(1), 177-192.
Wagner, B., 2004b. Model formulations for hub covering problems. Working paper, Institute of Operations Research, Darmstadt University of Technology, Hochschulstrasse 1, 64289 Darmstadt, Germany.
Yaman, H., Kara, B.Y., Tansel, B.C., 2007. The latest arrival hub location problem for cargo delivery systems with stopovers. Transport Res B 41, 906–919.
Yang, T.H., 2009. Stochastic air freight hub location and flight routes planning. Applied Mathematical Modelling 33 (12), 4424–4430.
Yin, Y., Madanat, S.M., Lu, X., 2009. Robust improvements schemes for road networks under demand uncertainty, Eur. J. Oper. Res. 198, 470-479.
Yu, C.S., Li., H., 2000. A robust optimization model for stochastic logistic problems, Int. J. Prod. Econ. 64, 385-397.
Zanjirani Farahani, R., Hekmatfar, RM., Boloori Arabani, A., Nikbakhsh, E., 2013. Hub location problems: a review of models, classification, techniques and application. Comput. Ind. Eng. 64 (4), 1096–1109.

پيوست الف :کد نوشته‌شده در نرم‌افزار GAMS برای حالت قطعی (CSAHLP)

$Title CSAHLP
$onsymxref
$onsymlist
*execseed = gday(jnow)*gminute(jnow)*gsecond(jnow)*gmillisec(jnow);
Sets
n ‘Set of flows and distances between the cities’ /1*37/
;
alias(n,i);
alias(n,k);
alias(n,l);
;

$OnEmpty

Scalars
Chi ‘Collection cost per unit of flow and unit of distance’ /1/
Delta ‘Distribution cost per unit of flow and unit of distance’ /1/
Alpha ‘Transfer cost per unit of flow and per unit of distance between hubs’ /0.4/
;

$include IAD parameters

Parameters
f(k) ‘Fixed set-up cost for installing a hub at node n’
O(i) ‘Total flow originated at node i’
D(i) ‘Total flow destined to node i’
C(k) ‘Capacity of each node’
;

O(i) = sum(k, w(i,k;((

پایان نامه
Previous Entries پایان نامه با واژه های کلیدی D.,، problem، European Next Entries دانلود پایان نامه ارشد درباره صحت معامله