Optimization of Extended Hub-and-spoke Regional Port Transportation Networks with Interval Cost Parameters Wang Chuanxu School of Economy and Management, Shanghai Maritime University, P.R.China, 200135 Abstract: In regional port transportation networks, the ports are connected by direct transports or via a transshipment port. This has led to the formation of hub-and-spoke networks in regional port transportation industry. Cargoes from original ports are usually consolidated at hub port and shipped to different destination ports. Hub-and-spoke transportation can be classified into two types: pure and extended. The pure hub-and-spoke transportation network is characterized by transshipment in which direct transport between ports is excluded and all cargoes have to be transported through a hub port. The extended hub-and–spoke transportation network consists of direct transportation between ports and transshipment via the hub port. Based on extended hub-and-spoke regional port transportation network, a model is introduced for regional port transportation network optimization problem where the cost coefficients of the objective functions are expressed as interval values. The proposed model aims at minimizing the total costs including the transportation cost between two ports and handling cost occurring at ports. Meanwhile it optimizes the following factors: cargo transportation volume and corresponding transportation capacity via a hub port from an original port to a destination port, cargo transportation volume and corresponding transportation capacity directly from an original port to a destination port. Based on preference relations between intervals, the proposed model can be solved by transforming it into an equivalent deterministic two-objective linear programming model that can be solved by goal programming or fuzzy programming. At last, a numerical example is given to demonstrate the effectiveness of the proposed model. Key Words: Hub-and-spoke, Optimization, Port transportation network

1 Introduction
In regional port transportation networks, the sizes and types of ships calling at every port are different because individual port’s natural condition and capacity are different. The route selection is important in regional port transportation network optimization. The port condition and economy of scale in ship transportation should be considered to select the routes from original ports to destination ports. In regional port transportation networks, the ports are connected by direct transports or via a transshipment port. This has led to the formation of hub-and-spoke networks in regional port transportation industry. Cargoes from original ports are usually consolidated at hub port and shipped to

Hub port

Port

Port

Figure1 Structure of an extended hub-and-spoke system

127

troP

troP troP

Port

different destination ports. Hub-and-spoke transportation can be classified into two types: pure and extended. The pure hub-and-spoke transportation network is characterized by transshipment in which direct transport between ports is excluded and all cargoes have to be transported through a hub port. The extended hub-and–spoke transportation network consists of direct transportation between ports and transshipment via the hub port (Fig. 1)[1]. In this paper, based on extended hub-and-spoke port transportation system, a decision model is developed to determine the following factors: cargo transportation volume and corresponding transportation capacity via a hub port from an original port to a destination port, cargo transportation volume and corresponding transportation capacity directly from an original port to a destination port. The decision problem of hub-and-spoke systems has received many attentions in academic literature. Some researchers solved it as the location –allocation problem that determines locations of hubs and a...

+2.8 +3.5 +4.3 +5.0 +6.0 +6.5 +8.5 -106 -109 -112 -144 -190 -220 -221 -225 -241 -242 -2500 -2670 -339 -340 -3690 -404 -50 -560 -935 0 0.5 0.6 0.7 0.8 01 02 03 04 0i 1 1.0 1.1 1.2 1.4 1.5 1.6 1.8 10 10.0 10.5 100 1000 10000 105 105x 11 11380 115 117 12 12.0 120 120x 125 125x43 127 128 129 13 130 131 132 133 13360 134 135 14 140 145 15 1500 16 16580 17 1790 18 182 19560 1960 1979 1983 1986 1987 1990 1995 1996 1997 1998 1999 2 2.0 2.1 2.2 2.3 2.4 2.5 2.6 2.7 2.8 2.9 20 2001 200135 2002 2003 201 207 21 2100 219 23 230 2320 2330 24 2500 26 2670 2680 2700 29 3 3.0 3.1 3.2 3.5 3.6 30 3030 31 32 325 327 34 3690 38 39 393 4 4.0 4.3 40 41 42 43 44 45 450 48 49 4transformation 5 5.0 5.2 5.4 5.5 50 5000 5000y1 55 5569280 560 6 6.0 6.2 6.5 6160 65 650 6830 7 7.0 7.5 7.8 70 7180 7245950 75 750 7560 78 8 80 8000 8000y40 8290 890 9 9.0 9.5 92 923 9490 95 99 abdinnourhelm above-ment abstract ac academ acknowledg addit aim air al alam alefeld alloc also altern ambigu analog analysi annal anoth appli applic approach ar arithmet assign assum attent aw aykin b base bc bertazzi binari bl bound br bracket bw c c.l c.n c.y call campbel cannot capac cargo case cci cciijyij center chan chang character china chuanxu ciij cij classifi close coeffici come comput conclus condit connect consid consist consolid constant constrain constraint construct cooper correspond cost cp cri crij crisp cw cwi cwij cwijyij cwp d d.a das data date deal decis defin definit deliveri demand demonstr denot design destin determin determinist develop differ dij direct disciplin divis e econom economi effect effici employ equal equival european everi examin exampl exceed exclud exist expect express extend facil factor feasibl fig figure1 find fix focus follow format formul foundat four freight frequenc function fuzzi g given goal goswami grant h half half-width hall handl herzberg howev hub hub-and hub-and-spok iff ij illustr impli import includ individu industri inform integ integr interact intern interv introduc introduct ishibuchi j j.f j.g ji journal k ka kac kelli key kij klincewicz known l larger last lead led left lesaoana less let li lie lij limit linear link literatur liu locat logist lower lr m m.a m.e m.g maker manag mani maritim mathemat maximun meanwhil median mention method min mine minim minimun mix model moor much multiobject must n.g nation natur negat network new no.05bjb014 no.70573068 no.t0602 node non non-neg nondomin notat number numer o object obtain occur one oper optim order origin origina p p-hub p.r.china p1 pa pair paper paramet pareto parti philadelphia pirkul plan polici port port1 pott practic predetermin prefer present press problem procedur product program propos provid pure quadrat quantiti r r.e rare rc real receiv refer region relat repres research respect ri right rij rout s.k s.s s.t s235 satisfi scale schedul schill school scienc section select set shanghai ship shipment shouldn singl size slam social solut solv sourc speranza spoke state structur studi subject sum support system tab.1and tab.2 tabl tanaka techniqu ten theori therefor third thousand ton total transform transport transship travel trop truck two two-object type type1 type2 ukovich uncertain uncertainti univers use usual valu variabl venkataramanan via volum w wang wasner wherea width word work x x01 x02 x03 x04 x10 x12 x13 x14 x21 x23 x30 x31 x32 x34 xi xij xji y y10 y12 y13 y14 y20 y23 y24 y30 y34 y40 yij yijk york yuan z zapfel zc zr