DISPATCHING VEHICLES CONSIDERING UNCERTAIN HANDLING TIMES AT PORT CONTAINER TERMINALS
|
|
- Warren Bailey
- 7 years ago
- Views:
Transcription
1 DISPATCHING VEHICLES CONSIDERING UNCERTAIN HANDLING TIMES AT PORT CONTAINER TERMINALS Vu Duc Nguyen Department of Industral Engneerng, Pusan Natonal Unversty, Busan , South Korea Kap Hwan Km The correspondng author Department of Industral Engneerng, Pusan Natonal Unversty, Busan , South Korea Abstract Ths paper consders the problem of vehcle dspatchng at port contaner termnals n a dynamc envronment. The problem deals wth the assgnment of delvery orders of contaners to vehcles whle tang nto consderaton the uncertanty n the travel tmes of the vehcles. Thus, a real-tme vehcle dspatchng algorthm s proposed for adaptaton to the dynamc changes n the states of the contaner termnals. To evaluate the performance of the proposed algorthm, a smulaton study was conducted by consderng varous values of decson parameters under the uncertanty n travel tmes. Further, the performance of the proposed algorthm was compared wth those of heurstc algorthms from prevous studes. 1 Introducton Because of globalzaton, many cargoes today are transported from one area of the world to another. Over the last decade, cargo transportaton by contanershps has rapdly grown n popularty because of ts cost effcency. In contaner termnals, contaners are transferred between contanershps and the storage yard va dschargng and loadng operatons. Durng dschargng operatons, contaners n a contanershp are unloaded from the contanershp and staced n the storage yard, and vce versa durng loadng operatons. In ths paper, we consder a port contaner termnal n whch three man types of handlng equpment, quay cranes (QCs), vehcles, and yard cranes (YCs), are used for shp operatons. Fgure 1 llustrates the layout of a seaport contaner termnal that conssts
2 of areas for the QCs, vehcle drvng, and YCs. Contaner termnals have complcated handlng systems, and thus, there are many sources of uncertantes durng ther operaton. In partcular, the travel tmes of vehcles may not be consdered as beng constant any more. Ths paper attempts to schedule the delvery operatons of vehcles whle tang nto account the uncertanty n the travel tmes of the vehcles. Fgure 2 shows the dschargng and loadng processes n port contaner termnals. Fgure 1: Layout of Seaport Contaner Termnal.
3 Fgure 2: Dschargng and Loadng Processes. Vehcle dspatchng problems have been addressed by many researchers. Egbelu and Tanchoco [1] presented a dspatchng method for sngle-load automated guded vehcles (AGVs) that ncorporated a varety of prorty rules. Egbelu [3] suggested a demanddrven rule n whch AGVs are frst assgned delvery tass that are allocated to machnes wth the smallest number of tass already present n ther nput buffers. Blge and Ulusoy [5] presented a method for smultaneously schedulng the operaton of machnes and the transfer of materals by AGVs. Km et al. [6] suggested an AGV dspatchng method n whch the prmary crteron for selectng the next delvery tas s to balance the worload across dfferent worstatons. Van der Meer [9] undertoo a smulaton study to evaluate varous dspatchng rules, ncludng rules usng pre-arrval nformaton, for automated lftng vehcles (ALVs) n contaner termnals. Lm et al. [10] ntroduced an AGV dspatchng method usng a bddng concept n whch the dspatchng decsons are made through communcaton between related vehcles and machnes. Km and Bae [12] presented a mxed-nteger programmng model for assgnng optmal delvery tass to AGVs and suggested a heurstc algorthm for solvng the mathematcal model. Usng a smulaton study, the heurstc algorthm was performed and compared wth other dspatchng rules. Bsh et al. [15] proposed a vehcle dspatchng technque to mnmze the total tme taen to serve a shp. They developed easly mplementable heurstc algorthms and dentfed both the absolute and the asymptotc worst-case performance ratos of these heurstcs. Brsorn et al. [16] presented an alternatve formulaton of the AGV assgnment problem that does not nclude due tmes and that s based on a rough analogy to nventory management; they proposed an exact algorthm for solvng the formulaton. Grunow et al. [17] descrbed a smulaton study of AGV dspatchng strateges n a seaport contaner termnal, where AGVs can be used n ether sngle- or
4 dual-carrer mode. They compared a typcal, on-lne dspatchng strategy adopted from flexble manufacturng systems wth a pattern-based, off-lne heurstc algorthm. Nguyen and Km [19] developed a mathematcal formulaton of the dspatchng problem for ALVs. They suggested a heurstc algorthm and compared ts solutons to optmal solutons. Angelouds and Bell [20] presented a flexble AGV dspatchng algorthm capable of operatng under uncertan condtons wthn a detaled contaner termnal model. Several performance ndcators were descrbed, focusng on generc features of vehcle operatons as well as the assessment of uncertanty levels nsde the termnal. From the results of the smulatons, t was found that ther technque outperforms wellnown heurstcs and alternatve algorthms. However, n contaner termnals there are many uncertan factors. Smulatons have been used as a powerful tool for analyzng the performance of port contaner termnals n complex dynamc envronments. Varous levels of detal and the uncertantes n contaner termnals can be expressed n smulaton models. Much research on the development of smulaton models of contaner termnals has been publshed (Cho [2]; Yun and Cho [7]; Tahar and Hussan [8]). Hartmann [11] ntroduced an approach for generatng scenaros that can be used as nput data for smulaton models of port contaner termnals. Through a smulaton study, Vs and Hara [13] and Yang et al. [14] compared the performance of two types of automated vehcle, namely AGVs and ALVs. Lee et al. [18] undertoo a smulaton study comparng varous handlng systems consstng of dfferent types of transport vehcle (prme movers and shuttle carrers) and dfferent storage-yard layouts (wth and wthout a chasss lane besde blocs). Ths paper s organzed as follows. Secton 2 ntroduces the shp operaton and the method of operatonal control for vehcles n contaner termnals. A heurstc algorthm for solvng the vehcle dspatchng problem bearng n mnd the uncertantes s proposed n Secton 3. Secton 4 presents the results of a smulaton experment for comparng the proposed heurstc algorthm wth other algorthms and analyzng the performance of the proposed heurstc algorthm. Fnally, some conclusons and ssues for further research are set out n Secton 5. 2 Shp Operaton and Operaton Control Method for Vehcles Before a shp arrves at a port contaner termnal, all nformaton regardng the nbound and outbound contaners s sent to the termnal by a shppng agent. Based on ths nformaton, a lst of the sequence of dschargng and loadng operatons for ndvdual contaners s then made. When the shp actually arrves, shp operatons are usually performed on the bass of the dschargng and loadng sequence lst. For a dschargng operaton, after recevng a contaner from a QC, the vehcle delvers t to the desgnated storage yard. When the vehcle arrves at the yard, t wats at the transfer pont (TP) n the yard for the contaner to be pced up by YC. A YC pcs up the contaner and stacs t n an empty slot n a bay. Loadng operatons are performed n exactly reverse order. Durng the dschargng operaton, a vehcle and a QC must
5 converge when the QC releases an nbound contaner onto the vehcle, and the vehcle and a YC must converge when the YC pcs up the nbound contaner from the vehcle. Smlar convergences occur durng the loadng operaton. Ths necessty for synchronzaton frequently causes delays to transport operatons n contaner termnals. In contaner termnals, a vehcle can be consdered a resource that has to be effcently dspatched. To adapt to a changng envronment, a dspatchng decson must be made whenever an mportant event occurs. Shp operaton planners develop the sequence of dschargng and loadng operatons for each QC. The sequence s ntally put nto LIST A n Fgure 3. Among the tass (dschargng and loadng operatons) n LIST A, a pre-specfed number of the most mmedate tass for each QC are moved to LIST B. The tass n LIST B are canddates for assgnaton to vehcles. Whenever a vehcle commences travel to pc up a contaner for a tas, the tas s removed from LIST B, and the next urgent tas from the correspondng LIST A s moved to LIST B. Note that for each QC, the same number of mmedate tass must be mantaned n LIST B, unless LIST A becomes manly empty. The dspatchng algorthm s trggered when a vehcle becomes dle. When a vehcle completes a delvery tas, the vehcle reports the completon of the tas to the control system (CS). The CS wll then trgger the dspatchng algorthm for assgnng delvery tass to vehcles. Followng the outcome of dspatchng, f the vehcle s assgned a delvery tas, t wll commence travelng to the pcup poston of the assgned tas. Otherwse, the vehcle wll move to the parng area to awat the next assgnment. When a QC completes a delvery tas, completon of the tas s reported to the CS, and the next tas s added to the QC s tas lst. The CS wll then trgger the dspatchng algorthm for reassgnng delvery tass to vehcles. When an dle vehcle s assgned a tas, the vehcle wll commence travel. When the vehcle arrves at the desgnated QC, ts arrval wll be reported to the CS. At the quay, the vehcle checs the status of the QC. For loadng tass, f the QC s not avalable, the vehcle has to wat untl t becomes so. If t s avalable, the QC pcs up the outbound contaner from the vehcle. Smlarly, for dschargng tass, the vehcle has to wat untl the QC becomes avalable, and the QC releases the nbound contaner onto the vehcle. The change n status of the vehcle s then reported to the CS. When the vehcle departs from the QC wth an unloaded contaner, t wll go to a desgnated bloc to delver t. When the vehcle completes the delvery of a loadng contaner, the dspatchng procedure s trggered for assgnng another tas to the vehcle. When no tas s assgned, the vehcle becomes dle and moves to the parng area. When a tas s assgned, t moves to the pcup poston of the next assgned tas. All changes n the system status are reported to the CS.
6 (LIST A) A sequence lst of remanng dschargng and loadng tass for QC1 A sequence lst of remanng dschargng and loadng tass for QC2 A sequence lst of remanng dschargng and loadng tass for QC3 (LIST B) A pooled lst of mmedate tass for dspatchng Fgure 3: Varous Lsts of Tass for Dspatchng. 3 Heurstc Algorthm Consderng Uncertantes The vehcle dspatchng problem was formulated as a mxed-nteger programmng (MIP) model, and a detaled descrpton of ths formulaton can be found n Km and Bae [12]. Ther suggested algorthm assumed determnstc handlng and travel tmes for the equpment. The present paper extends ther dspatchng heurstc algorthm by relaxng ths assumpton. The followng frst ntroduces a formulaton of the dspatchng problem and the heurstc algorthm by Km and Bae [12]. A loadng operaton cycle by a QC begns wth the pcup of a contaner from a vehcle, whle a dschargng operaton cycle ends wth the release of a contaner onto a vehcle. For a QC operaton to be performed wthout delay, a vehcle must be ready at a specfed locaton beneath the assocated QC before the transfer of a contaner commences. Let e be an event representng the moment at whch a vehcle transfers the th contaner of QC (the th operaton of QC ). When the th operaton of QC s a loadng operaton, event e corresponds to the begnnng of the pcup of a contaner from a vehcle. When the th operaton of QC s a dschargng operaton, t corresponds to the begnnng of the release of a contaner onto a vehcle. The tme of event e s denoted Y. A delay to an operaton occurs when the correspondng vehcle does not arrve at the requested moment, whch s the tme of the event wth no delays to QC operaton and s represented by s,.e., the earlest possble event tme. Three types of events are undergone by vehcles durng a shp operaton: The ntal event, whch represents the current state of each vehcle; the event when a vehcle begns to receve a contaner from a QC or when a vehcle begns to transfer a contaner to a QC; and the stoppng event, when a vehcle completes all of ts assgned tass. The notatons related to shp operatons are summarzed as follows:
7 V = The set of vehcles. K = The set of QCs. O e = The ntal event of vehcle v, v v V. F e = The stoppng event of a vehcle v, v v V. Note that, although the number of stoppng events of vehcles s the same as the number of vehcles, stoppng events wth dfferent subscrpts do not need to be dstngushed from each other. e = The event that corresponds to the begnnng of a pcup (or release) of a contaner from (onto) a vehcle for the tas related to the th operaton of QC. Assume that there exst m tass for QC. = The set of e for = 1,2,,m and K. = The locaton at whch event O e occurs. le ( ) represents the ntal locaton of T l ( e ) v vehcle v. Here, l ( e ) represents the poston at whch the th contaner of QC wll be transferred. The locaton at whch a vehcle completes ts fnal F delvery tas s denoted le ( v ). lj t = The pure travel tme from l ( e ) to l ( e l j ). lj C = The tme requred for a vehcle to be ready for l e after undergong j e, whch s a random varable. For example, f both l e and e are related to loadng j operatons, then the startng moment (event) for evaluatng c lj s the pcup of the th lj contaner of QC by QC. Included n C are the travel tme from the apron to the locaton of the next contaner (the j th contaner of QC l) n the marshallng yard, the release tme of the contaner by a YC, and the travel tme of the vehcle to QC l. Let S and D be the sets of O F e v and e v, v V, respectvely. A feasble dspatchng decson s then a one-to-one assgnment between all the events n S T and those n D T. Let K = { O} K, K = { F} K, and x lj be a decson varable that becomes 1 f e s assgned to e l j, for K and l K. For l, K, the assgnment of e to mples that the vehcle that has just delvered the th contaner of QC s scheduled to delver the j th contaner of QC l. Let α be the travel cost per unt tme of a vehcle, and β be the penalty cost per unt tme for a delay n the completon tme. It s assumed that α << β. Further, let m O and m F equal V. The dspatchng problem can then be formulated as follows: l e j Mnmze Subject to m ml lj lj t x + β E Ym s m K = 1 l K j= 1 K + α [( ) ] (1)
8 ml l K j= 1 m K = 1 l lj lj Yj Y C M x lj x = 1, for K and = 1,, m (2) lj x = 1, for l K and j = 1,, m (3) l ( + ) ( 1), for K, l K, = 1,, m, and j = 1,, ml (4) O Y v = 0, for v = 1,, V (5) Y+ 1 Y s+ 1 s, for K and = 1,, m 1 (6) y s, for K and = 1,, m (7) lj x = 0 or 1, for K, l K, = 1,, m, and j = 1,, ml (8) Because α << β, the sum of the delays to QC operatons wll be mnmzed frst. For the same value of the sum of the delays, the total travel dstance of the vehcles wll be mnmzed. Constrants (2) and (3) force the one-to-one assgnment between all the events n S T and those n D T. Constrant (4) mples that two events that are served consecutvely by the same vehcle must be set apart by at least the tme requred for the vehcle to travel and transfer a load between the two events. That s, x lj can be 1 only f l lj Fj Yj Y C. Note that x, K, s not restrcted by constrant (4). Constrant (6) mples that two events that are served by the same QC must be set apart by at least the tme requred for the QC to perform all the movements between the two events. Constrant (7) sgnfes that the actual event tme s always more than or equal to the lj earlest possble event tme. A feasble soluton of ( x ) s a one-to-one assgnment from a node n S T to a node n D T. Let us express the above formulaton n a more general way as follows: Mnmze f(x, Y) subject to g(x, Y, C) = 0 (9) lj lj Km and Bae [12] solved the problem by settng C = c and ncreasng the values of Y by the smallest possble ncrements so that delay cost could be mnmzed. Once the lj lj values of Y ( Y = y ) and C ( C = c ) are gven, (9) becomes an assgnment problem, wth some assgnments forbdden because of constrant (4). That s, for a gven set of y l and y j, f the nequalty l ( lj lj yj y + c) 0 holds, then x cannot equal 1. The remanng problem s how to ncrease the values of Y. Km and Bae [12] fxed them as follows: Suppose that Y (whch are equal to s n the ntal stage), = 1,..., K, and = 1,, m are gven and the events are sequenced n ncreasng order of Y. We denote event (j) as the j th event n the sequence, y as the tme of event (), c j as the tme requred for a
9 vehcle to be ready for event (j) after t goes through event () (correspondng to the lj notaton of c ), t j as the pure travel tme from the locaton of event () to the locaton of event (j), and x j as the decson varable for the assgnment of event (j) from event (). Let T be a subset of T, whch ncludes only the frst ξ ξ events n the sequence. The constrant subset ξ of (2) (4) can then be wrtten as follows: (Constrant subset ξ ) j S T ξ j j D T ξ x = 1, for j D T ξ (10) x = 1, for S T ξ (11) y j ( y + cj ) M ( xj 1), for S T ξ and j Tξ (12) x = 0 or 1, for j S T ξ and j D Tξ (13) In the algorthm, for gven values of y, the feasblty of each s checed one at a tme from the constrant subset 1 to the constrant subset T. In the process, f an nfeasble constrant subset s found, the nfeasblty s resolved by ncreasng an event tme so that one or more x j can be allowed to be 1 by constrant (12). Durng teratve procedures of the algorthm, attempts to mnmze the delay to QC operaton are made by ncreasng y by the least possble amount. However, after a feasble soluton to constrant subset T, whch s equvalent to constrants (2) and (3), s found, the total travel tme of vehcles, whch s the frst term of objectve functon (1), wll be mnmzed by applyng the assgnment problem technque. A smlar procedure wll be followed n the algorthm descrbed n ths paper. In Km and Bae [12], because c j s constant, for a gven set of values of Y, t s clear whether the constrant yj ( y + cj) 0 s satsfed or not. However, n constrant (4), because C j s a random varable, t s not certan whether or not yj ( y + Cj) 0 holds. Thus, we defne a probablty functon P j = P{ yj ( y + Cj) 0}, whch can be easly evaluated once P(C j ) s gven, and modfy the constrant subset ξ as follows: (Revsed constrant subset ξ) xj 1 Pj θ, for S T ξ and j D T (14) ξ { ( [ ]/ )} ( 1) yj y + E Cj Pj M xj, for S T ξ and j T ξ (15) and (10), (11), and (13).
10 Constrant (14) mples that e can be connected to e j only f P j θ. A hgher penalty s gven to the assgnment wth a lower probablty of tmely delvery. That s, c j n (12) s replaced wth E[ C ]/ P. j j A detaled heurstc algorthm can then be descrbed as follows: O Step 0. Intalzng. Set y = s and y = 0, for all vehcles. Set ξ = 0. Step 1. Next Tas. ξ = ξ + 1. If ξ > m (m = the total number of tass n sequence T), then go to Step 4. Otherwse, sequence the events n ncreasng order of y and go to Step 2. Step 2. Feasblty Checng. Chec the exstence of a feasble soluton to revsed constrant subset ξ. If there s a feasble soluton, then go to Step 1. Otherwse, go to Step 3. Step 3. Delayng Event Tme. π * = mn max ( EC [ ξ] P ξ) ( yξ y),0 (, ξ ): P ξ θ. Let ξ { }, where { } S T ξ 1 Denote y γ γ γ as the event tme of event (ξ). Then update * λ yj = yj + π, for j λ. ξ Go to Step 2. Step 4. Tas Assgnment. After settng the assgnment cost of event to j so as to be equal to (t j /P j ), solve the assgnment problem wth the objectve of mnmzng the total assgnment cost. Stop. Feasblty Chec: In ths step, for gven values of y, the feasblty can be checed by solvng a maxmum cardnalty matchng problem n a bpartte graph (Evans and Mnea [4]). When the maxmum cardnalty s the same as S T, revsed constrant subset ξ has a feasble soluton. When solvng the matchng problem n the bpartte graph, arcs from node to j are lned n the graph only f Pj θ. Delayng Event Tme: To satsfy the revsed constrant subset, one or more addtonal x j must be allowed to become 1 by relaxng constrant (15). In other words, the tme for event ξ s delayed so that at least one x ξ, for < ξ, becomes 1, denoted π *. The process ξ s repeated untl the current constrant subset becomes feasble. 4 Smulaton Experments A smulaton model was developed usng Plant-Smulaton software. Detaled operaton of the hypothetcal contaner termnal (Fgure 1) can be descrbed as follows. When a shp arrves, t s assgned a berth f there s one avalable for the shp to enter. Otherwse, the shp must wat untl one becomes avalable. When the shp enters a berth, a prespecfed number of QCs are assgned to the shp. A dschargng and loadng sequence
11 for contaners s then generated for each QC. Based on the specfed sequence, QCs start to dscharge and load contaners. The wharf of the model termnal n Fgure 1 has one berth and three QCs. The yard conssts of sx storage blocs, and two YCs of the same sze are deployed at each bloc. The total number of vehcles s sx. The vehcles are shared between all the QCs, that s, a poolng strategy s used for dspatchng vehcles. From LIST A for each QC, the eght most mmedate tass are moved to LIST B for dspatchng. That s, the number of loong-ahead tass s 24. The total number of contaners transferred by QCs durng one smulaton run s about The detaled movements of QCs and YCs (gantry, trolley, and hostng movements) are modeled n the smulaton. The travel tme of vehcles s assumed to follow a unform dstrbuton: U(E[C j ] ± Δ E[C j ]). E[C j ] s calculated usng the travel dstance from the poston of event to that of event j dvded by the speed of vehcles, and Δ s a constant referred to here as the uncertanty factor. The uncertanty factor s set to be 0.2 n the experments. The threshold of the connectng probablty, θ, has a value of 0.5 to 1.0. The performance measures compared n the smulaton experments are the total delay tme of QCs, the total travel tme of vehcles, the total travel tme of empty vehcles, and the vehcle throughput, whch s the number of delvery tass performed per hour. The performance of the proposed heurstc algorthm supportng the uncertantes of travel tmes (LADP-un) was compared wth that of the Greedy algorthm and that of the heurstc algorthm suggested by Km and Bae [12] for the determnstc case (LADP-de). For the Greedy algorthm, whenever a vehcle becomes dle, t s assgned the delvery tas that ncurs the mnmum assgnment cost (t j /P j ) of all the tass n LIST B that can be performed by vehcles wthout volatng constrants. Table 1 lsts the total delay tme of QCs, the total travel tme of vehcles, the total travel tme of empty vehcles, the vehcle throughput, and the computatonal tme for each algorthm. As can be seen n Table 1, LADP-un showed the best performance, and both LADP-un and LADP-de sgnfcantly outperformed the Greedy algorthm n terms of the total delay tme of QCs and the vehcle throughput. However, the Greedy algorthm was the best n terms of the total travel tme of vehcles and the total travel tme of empty vehcles, because both the LADP algorthms frst attempted to mnmze the total delay tme of QCs before then attemptng to mnmze the total travel tme of vehcles as a secondary objectve. In addton, the Greedy algorthm spent the least computatonal tme solvng nstance problems, and LADP-un too relatvely longer than LADP-de n terms of computatonal tme per nstance. Fgure 4 shows the mprovement n the performance of LADP-un over that of other algorthms (Greedy and LADP-de). Its performance was a 55.11% mprovement on that of the Greedy algorthm and 18.45% on that of LADP-de n terms of the total delay tme of QCs. The vehcle throughput of LADP-un was 25.83% larger than that of the Greedy algorthm and 4.15% greater than that of LADP-de.
12 Algorthm Table 1: Comparson of LADP-un, Greedy, and LADP-de Algorthms. Total delay tme of QCs (s) Total travel tme of vehcles (s) Total travel tme of empty vehcles (s) Vehcle throughput (moves/hour) Computatonal tme per nstance (ms) Greedy LADP-de LADP-un Fgure 4: Improvement n Performance of LADP-un Over That of Greedy and LADP-de Algorthms. Fgures 5 8 show the changes n the total delay tme of QCs and computatonal tme, the total travel tme of vehcles, the total empty travel tme of vehcles, and the vehcle throughput, respectvely, for varous thresholds of the connectng probablty. Fgure 5 shows that the total delay tme of QCs decreases rapdly as the threshold of the connectng probablty decreases. As the threshold of the connectng probablty decreases, the number of arcs connectng nodes n the bpartte graph ncreases. As a result, the average computatonal tme per nstance ncreases. However, because the feasble soluton of the problem becomes larger, the soluton qualty mproves, as can be observed n Fgure 5. When the threshold of the connectng probablty falls below a certan value (0.6, as ndcated n Fgure 5), the change n the reducton n the total delay tme becomes smaller.
13 Fgure 5: Effects of Threshold of Connectng Probablty on Total Delay Tme of QCs and Average Computatonal Tme per Instance. Fgure 6: Effects of Threshold of Connectng Probablty on Total Travel Tmes of Vehcles.
14 Fgure 7: Effects of Threshold of Connectng Probablty on Total Empty Travel Tmes of Vehcles. Fgure 8: Effects of Threshold of Connectng Probablty on Vehcle Throughput. Smlarly, the changes n the total travel tme of vehcles and total empty travel tme of vehcles are shown n Fgures 6 and 7. The total travel tme of vehcles and the total empty travel of vehcles ncreases qucly as the threshold of the connectng probablty ncreases and reaches 0.9. However, the vehcle throughput decreases as the threshold of
15 the connectng probablty ncreases, as shown n Fgure 8. Note that the results n Fgures 5 8 compare LADP-de and LADP-un because the case n whch the threshold equals 1 corresponds to LADP-de. The results show that LADP-un outperforms LAPDde n ts objectve values at the expense of greater computatonal tme. For example, Fgure 5 shows that the percentage dfference between the two algorthms n the total delay tme of QCs ncreased from 7.14% to 18.45% as the threshold of the connectng probablty decreased from 0.9 to Conclusons Ths paper has dscussed the vehcle dspatchng problem n port contaner termnals whle tang nto account the uncertanty n the travel tmes of vehcles. A heurstc algorthm (LADP-un) was proposed for solvng the problem. Smulaton models were developed to evaluate the performance of the proposed heurstc algorthm under varous condtons. The performance of LADP-un was compared wth a greedy heurstc rule (Greedy) and a heurstc algorthm for the case wth determnstc travel tmes (LADP-de). From the expermental results, t was found that LADP-un outperformed the other algorthms n terms of the total delay tme of QCs and the vehcle throughput. It was also found that the total delay tme of QCs, the total travel tme of vehcles, and the empty travel tme of vehcles decreased rapdly when the threshold of the connectng probablty decreased. Moreover, the vehcle throughput ncreased as the threshold was reduced. Ths study manly ntroduced the schedulng problem for vehcles. As part of future studes, the combned schedulng problem for YCs and QCs as well as for vehcles may be addressed. Acnowledgements Ths study was supported by the Korean Mnstry of Educaton & Human Resources Development through the Research Center of Logstcs Informaton Technologes (LIT). References [1] Egbelu, P. J. and Tanchoco, J. M. A., Characterzaton of Automatc Guded Vehcle Dspatchng Rules, Internatonal Journal of Producton Research, 22, (1984). [2] Cho, D. W., A Computer Smulaton Model for Contaner Termnal Systems, Journal of the Korean Insttute of Industral Engneers, 11, (1985). [3] Egbelu, P. J., Pull Versus Push Strategy for Automated Guded Vehcle Load Movement n a Batch Manufacturng System, Journal of Manufacturng Systems, 6, (1987).
16 [4] Evans, J. R. and Mnea, E., Optmzaton Algorthms for Networs and Graphs, Marcel Deer, New Yor (1992). [5] Blge, U. and Ulusoy, G., A Tme Wndow Approach to Smultaneous Schedulng of Machnes and Materal Handlng System n an FMS, Operatons Research, 43, (1995). [6] Km, C. W., Tanchoco, J. M. A., and Koo, P. H., AGV Dspatchng Based on Worload Balancng, Internatonal Journal of Producton Research, 37, (1999). [7] Yun, W. Y. and Cho, Y. S., A Smulaton Model for Contaner-Termnal Operaton Analyss Usng an Object-orented Approach, Internatonal Journal of Producton Economcs, 59, (1999). [8] Tahar, R. M. and Hussan, K., Smulaton and Analyss for the Kelang Contaner Termnal Operatons, Logstcs Informaton Management, 13, (2000). [9] Van der Meer, R., Operatonal Control of Internal Transport, Ph.D. dssertaton, Erasmus Research Insttute of Management, Rotterdam, The Netherlands (2000). [10] Lm, J. K., Km, K. H., Yoshmoto, K., Lee, J. H., and Taahash T., A Dspatchng Method for Automated Guded Vehcles by Usng a Bddng Concept, OR Spectrum, 25, (2003). [11] Hartmann, S., Generatng Scenaros for Smulaton and Optmzaton of Contaner Logstcs, OR Spectrum, 26, (2004). [12] Km, K. H. and Bae, J. W., A Loo-ahead Dspatchng Method for Automated Guded Vehcles n Automated Port Contaner Termnals, Transportaton Scence, 38, (2004). [13] Vs, I. F. A. and Hara, I., Comparson of Vehcle Types at an Automated Contaner Termnal, OR Spectrum, 26, (2004). [14] Yang, C. H., Cho, Y. S., and Ha, T. Y., Smulaton-based Performance Evaluaton of Transport Vehcles at Automated Contaner Termnals, OR Spectrum, 26, (2004). [15] Bsh, E. K., Chen F. Y., Leong, Y. T., Nelson, B. L., Ng, C. J. W., and Davd, S. L., Dspatchng Vehcles n a Mega Contaner Termnal, OR Spectrum, 27, (2005). [16] Brsorn, D., Drexl, A., and Hartmann, S., Inventory-based Dspatchng of Automated Guded Vehcles on Contaner Termnals, OR Spectrum, 28, (2006). [17] Grunow, M., Günther, H. O., and Lehmann, M., Strateges for Dspatchng AGVs at Automated Seaport Contaner Termnals, OR Spectrum, 28, (2006). [18] Lee, L. H., Chew, E. P., Tan, K. C., Huang, H. C., Ln, W., Han, Y., and Chan, T. H., A Smulaton Study n the Uses of Shuttle Carrers n the Contaner Hub, Proceedngs of the Wnter Smulaton Conference, Washngton D.C., (2007). [19] Nguyen, V. D., and Km, K. H., A Dspatchng Method for Automated Lftng Vehcles n Automated Port Contaner Termnals, Computers & Industral Engneerng, 56, (2009).
17 [20] Angelouds, P. and Bell, M. G. H., An Uncertanty-aware AGV Assgnment Algorthm for Automated Contaner Termnals, Transportaton Research Part E, 46, 3, (2010).
The Greedy Method. Introduction. 0/1 Knapsack Problem
The Greedy Method Introducton We have completed data structures. We now are gong to look at algorthm desgn methods. Often we are lookng at optmzaton problems whose performance s exponental. For an optmzaton
More informationProject Networks With Mixed-Time Constraints
Project Networs Wth Mxed-Tme Constrants L Caccetta and B Wattananon Western Australan Centre of Excellence n Industral Optmsaton (WACEIO) Curtn Unversty of Technology GPO Box U1987 Perth Western Australa
More informationA DYNAMIC CRASHING METHOD FOR PROJECT MANAGEMENT USING SIMULATION-BASED OPTIMIZATION. Michael E. Kuhl Radhamés A. Tolentino-Peña
Proceedngs of the 2008 Wnter Smulaton Conference S. J. Mason, R. R. Hll, L. Mönch, O. Rose, T. Jefferson, J. W. Fowler eds. A DYNAMIC CRASHING METHOD FOR PROJECT MANAGEMENT USING SIMULATION-BASED OPTIMIZATION
More informationDynamic Fleet Management for Cybercars
Proceedngs of the IEEE ITSC 2006 2006 IEEE Intellgent Transportaton Systems Conference Toronto, Canada, September 17-20, 2006 TC7.5 Dynamc Fleet Management for Cybercars Fenghu. Wang, Mng. Yang, Ruqng.
More informationModule 2 LOSSLESS IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module LOSSLESS IMAGE COMPRESSION SYSTEMS Lesson 3 Lossless Compresson: Huffman Codng Instructonal Objectves At the end of ths lesson, the students should be able to:. Defne and measure source entropy..
More informationPower-of-Two Policies for Single- Warehouse Multi-Retailer Inventory Systems with Order Frequency Discounts
Power-of-wo Polces for Sngle- Warehouse Mult-Retaler Inventory Systems wth Order Frequency Dscounts José A. Ventura Pennsylvana State Unversty (USA) Yale. Herer echnon Israel Insttute of echnology (Israel)
More informationAn MILP model for planning of batch plants operating in a campaign-mode
An MILP model for plannng of batch plants operatng n a campagn-mode Yanna Fumero Insttuto de Desarrollo y Dseño CONICET UTN yfumero@santafe-concet.gov.ar Gabrela Corsano Insttuto de Desarrollo y Dseño
More informationFormulating & Solving Integer Problems Chapter 11 289
Formulatng & Solvng Integer Problems Chapter 11 289 The Optonal Stop TSP If we drop the requrement that every stop must be vsted, we then get the optonal stop TSP. Ths mght correspond to a ob sequencng
More informationFeature selection for intrusion detection. Slobodan Petrović NISlab, Gjøvik University College
Feature selecton for ntruson detecton Slobodan Petrovć NISlab, Gjøvk Unversty College Contents The feature selecton problem Intruson detecton Traffc features relevant for IDS The CFS measure The mrmr measure
More informationSciences Shenyang, Shenyang, China.
Advanced Materals Research Vols. 314-316 (2011) pp 1315-1320 (2011) Trans Tech Publcatons, Swtzerland do:10.4028/www.scentfc.net/amr.314-316.1315 Solvng the Two-Obectve Shop Schedulng Problem n MTO Manufacturng
More informationA hybrid global optimization algorithm based on parallel chaos optimization and outlook algorithm
Avalable onlne www.ocpr.com Journal of Chemcal and Pharmaceutcal Research, 2014, 6(7):1884-1889 Research Artcle ISSN : 0975-7384 CODEN(USA) : JCPRC5 A hybrd global optmzaton algorthm based on parallel
More informationOn the Optimal Control of a Cascade of Hydro-Electric Power Stations
On the Optmal Control of a Cascade of Hydro-Electrc Power Statons M.C.M. Guedes a, A.F. Rbero a, G.V. Smrnov b and S. Vlela c a Department of Mathematcs, School of Scences, Unversty of Porto, Portugal;
More informationOptimized ready mixed concrete truck scheduling for uncertain factors using bee algorithm
Songklanakarn J. Sc. Technol. 37 (2), 221-230, Mar.-Apr. 2015 http://www.sst.psu.ac.th Orgnal Artcle Optmzed ready mxed concrete truck schedulng for uncertan factors usng bee algorthm Nuntana Mayteekreangkra
More informationActivity Scheduling for Cost-Time Investment Optimization in Project Management
PROJECT MANAGEMENT 4 th Internatonal Conference on Industral Engneerng and Industral Management XIV Congreso de Ingenería de Organzacón Donosta- San Sebastán, September 8 th -10 th 010 Actvty Schedulng
More informationThe Development of Web Log Mining Based on Improve-K-Means Clustering Analysis
The Development of Web Log Mnng Based on Improve-K-Means Clusterng Analyss TngZhong Wang * College of Informaton Technology, Luoyang Normal Unversty, Luoyang, 471022, Chna wangtngzhong2@sna.cn Abstract.
More informationbenefit is 2, paid if the policyholder dies within the year, and probability of death within the year is ).
REVIEW OF RISK MANAGEMENT CONCEPTS LOSS DISTRIBUTIONS AND INSURANCE Loss and nsurance: When someone s subject to the rsk of ncurrng a fnancal loss, the loss s generally modeled usng a random varable or
More informationRate Monotonic (RM) Disadvantages of cyclic. TDDB47 Real Time Systems. Lecture 2: RM & EDF. Priority-based scheduling. States of a process
Dsadvantages of cyclc TDDB47 Real Tme Systems Manual scheduler constructon Cannot deal wth any runtme changes What happens f we add a task to the set? Real-Tme Systems Laboratory Department of Computer
More informationA Secure Password-Authenticated Key Agreement Using Smart Cards
A Secure Password-Authentcated Key Agreement Usng Smart Cards Ka Chan 1, Wen-Chung Kuo 2 and Jn-Chou Cheng 3 1 Department of Computer and Informaton Scence, R.O.C. Mltary Academy, Kaohsung 83059, Tawan,
More informationChapter 4 ECONOMIC DISPATCH AND UNIT COMMITMENT
Chapter 4 ECOOMIC DISATCH AD UIT COMMITMET ITRODUCTIO A power system has several power plants. Each power plant has several generatng unts. At any pont of tme, the total load n the system s met by the
More informationForecasting the Demand of Emergency Supplies: Based on the CBR Theory and BP Neural Network
700 Proceedngs of the 8th Internatonal Conference on Innovaton & Management Forecastng the Demand of Emergency Supples: Based on the CBR Theory and BP Neural Network Fu Deqang, Lu Yun, L Changbng School
More informationIn some supply chains, materials are ordered periodically according to local information. This paper investigates
MANUFACTURING & SRVIC OPRATIONS MANAGMNT Vol. 12, No. 3, Summer 2010, pp. 430 448 ssn 1523-4614 essn 1526-5498 10 1203 0430 nforms do 10.1287/msom.1090.0277 2010 INFORMS Improvng Supply Chan Performance:
More informationVehicle Routing Problem with Time Windows for Reducing Fuel Consumption
3020 JOURNAL OF COMPUTERS, VOL. 7, NO. 12, DECEMBER 2012 Vehcle Routng Problem wth Tme Wndows for Reducng Fuel Consumpton Jn L School of Computer and Informaton Engneerng, Zhejang Gongshang Unversty, Hangzhou,
More informationThe OC Curve of Attribute Acceptance Plans
The OC Curve of Attrbute Acceptance Plans The Operatng Characterstc (OC) curve descrbes the probablty of acceptng a lot as a functon of the lot s qualty. Fgure 1 shows a typcal OC Curve. 10 8 6 4 1 3 4
More informationDynamic Constrained Economic/Emission Dispatch Scheduling Using Neural Network
Dynamc Constraned Economc/Emsson Dspatch Schedulng Usng Neural Network Fard BENHAMIDA 1, Rachd BELHACHEM 1 1 Department of Electrcal Engneerng, IRECOM Laboratory, Unversty of Djllal Labes, 220 00, Sd Bel
More information1. Fundamentals of probability theory 2. Emergence of communication traffic 3. Stochastic & Markovian Processes (SP & MP)
6.3 / -- Communcaton Networks II (Görg) SS20 -- www.comnets.un-bremen.de Communcaton Networks II Contents. Fundamentals of probablty theory 2. Emergence of communcaton traffc 3. Stochastc & Markovan Processes
More informationWhat is Candidate Sampling
What s Canddate Samplng Say we have a multclass or mult label problem where each tranng example ( x, T ) conssts of a context x a small (mult)set of target classes T out of a large unverse L of possble
More informationLogical Development Of Vogel s Approximation Method (LD-VAM): An Approach To Find Basic Feasible Solution Of Transportation Problem
INTERNATIONAL JOURNAL OF SCIENTIFIC & TECHNOLOGY RESEARCH VOLUME, ISSUE, FEBRUARY ISSN 77-866 Logcal Development Of Vogel s Approxmaton Method (LD- An Approach To Fnd Basc Feasble Soluton Of Transportaton
More informationJoint Scheduling of Processing and Shuffle Phases in MapReduce Systems
Jont Schedulng of Processng and Shuffle Phases n MapReduce Systems Fangfe Chen, Mural Kodalam, T. V. Lakshman Department of Computer Scence and Engneerng, The Penn State Unversty Bell Laboratores, Alcatel-Lucent
More informationAn Interest-Oriented Network Evolution Mechanism for Online Communities
An Interest-Orented Network Evoluton Mechansm for Onlne Communtes Cahong Sun and Xaopng Yang School of Informaton, Renmn Unversty of Chna, Bejng 100872, P.R. Chna {chsun,yang}@ruc.edu.cn Abstract. Onlne
More informationJ. Parallel Distrib. Comput.
J. Parallel Dstrb. Comput. 71 (2011) 62 76 Contents lsts avalable at ScenceDrect J. Parallel Dstrb. Comput. journal homepage: www.elsever.com/locate/jpdc Optmzng server placement n dstrbuted systems n
More informationAn Alternative Way to Measure Private Equity Performance
An Alternatve Way to Measure Prvate Equty Performance Peter Todd Parlux Investment Technology LLC Summary Internal Rate of Return (IRR) s probably the most common way to measure the performance of prvate
More informationAn Integrated Approach for Maintenance and Delivery Scheduling in Military Supply Chains
An Integrated Approach for Mantenance and Delvery Schedulng n Mltary Supply Chans Dmtry Tsadkovch 1*, Eugene Levner 2, Hanan Tell 2 and Frank Werner 3 2 1 Bar Ilan Unversty, Department of Management, Ramat
More informationBatch Scheduling for a Single Deteriorating Machine to Minimize Total Actual Flow Time
Proceedngs of the 2014 Internatonal Conference on Industral Engneerng and Operatons Management Bal, Indonesa, January 7 9, 2014 Batch Schedulng for a Sngle Deteroratng Machne to Mnmze Total Actual Flow
More informationPerformance Analysis of Energy Consumption of Smartphone Running Mobile Hotspot Application
Internatonal Journal of mart Grd and lean Energy Performance Analyss of Energy onsumpton of martphone Runnng Moble Hotspot Applcaton Yun on hung a chool of Electronc Engneerng, oongsl Unversty, 511 angdo-dong,
More information2008/8. An integrated model for warehouse and inventory planning. Géraldine Strack and Yves Pochet
2008/8 An ntegrated model for warehouse and nventory plannng Géraldne Strack and Yves Pochet CORE Voe du Roman Pays 34 B-1348 Louvan-la-Neuve, Belgum. Tel (32 10) 47 43 04 Fax (32 10) 47 43 01 E-mal: corestat-lbrary@uclouvan.be
More informationAn Analysis of Central Processor Scheduling in Multiprogrammed Computer Systems
STAN-CS-73-355 I SU-SE-73-013 An Analyss of Central Processor Schedulng n Multprogrammed Computer Systems (Dgest Edton) by Thomas G. Prce October 1972 Techncal Report No. 57 Reproducton n whole or n part
More informationA multi-start local search heuristic for ship scheduling a computational study
Computers & Operatons Research 34 (2007) 900 917 www.elsever.com/locate/cor A mult-start local search heurstc for shp schedulng a computatonal study Ger BrZnmo a,b,, Marelle Chrstansen b, Kjetl Fagerholt
More informationMany e-tailers providing attended home delivery, especially e-grocers, offer narrow delivery time slots to
Vol. 45, No. 3, August 2011, pp. 435 449 ssn 0041-1655 essn 1526-5447 11 4503 0435 do 10.1287/trsc.1100.0346 2011 INFORMS Tme Slot Management n Attended Home Delvery Nels Agatz Department of Decson and
More informationAN APPOINTMENT ORDER OUTPATIENT SCHEDULING SYSTEM THAT IMPROVES OUTPATIENT EXPERIENCE
AN APPOINTMENT ORDER OUTPATIENT SCHEDULING SYSTEM THAT IMPROVES OUTPATIENT EXPERIENCE Yu-L Huang Industral Engneerng Department New Mexco State Unversty Las Cruces, New Mexco 88003, U.S.A. Abstract Patent
More informationAnts Can Schedule Software Projects
Ants Can Schedule Software Proects Broderck Crawford 1,2, Rcardo Soto 1,3, Frankln Johnson 4, and Erc Monfroy 5 1 Pontfca Unversdad Católca de Valparaíso, Chle FrstName.Name@ucv.cl 2 Unversdad Fns Terrae,
More informationResearch Article A Time Scheduling Model of Logistics Service Supply Chain with Mass Customized Logistics Service
Hndaw Publshng Corporaton Dscrete Dynamcs n Nature and Socety Volume 01, Artcle ID 48978, 18 pages do:10.1155/01/48978 Research Artcle A Tme Schedulng Model of Logstcs Servce Supply Chan wth Mass Customzed
More informationRobust Design of Public Storage Warehouses. Yeming (Yale) Gong EMLYON Business School
Robust Desgn of Publc Storage Warehouses Yemng (Yale) Gong EMLYON Busness School Rene de Koster Rotterdam school of management, Erasmus Unversty Abstract We apply robust optmzaton and revenue management
More informationCost Minimization using Renewable Cooling and Thermal Energy Storage in CDNs
Cost Mnmzaton usng Renewable Coolng and Thermal Energy Storage n CDNs Stephen Lee College of Informaton and Computer Scences UMass, Amherst stephenlee@cs.umass.edu Rahul Urgaonkar IBM Research rurgaon@us.bm.com
More informationInstitute of Informatics, Faculty of Business and Management, Brno University of Technology,Czech Republic
Lagrange Multplers as Quanttatve Indcators n Economcs Ivan Mezník Insttute of Informatcs, Faculty of Busness and Management, Brno Unversty of TechnologCzech Republc Abstract The quanttatve role of Lagrange
More informationData Broadcast on a Multi-System Heterogeneous Overlayed Wireless Network *
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 24, 819-840 (2008) Data Broadcast on a Mult-System Heterogeneous Overlayed Wreless Network * Department of Computer Scence Natonal Chao Tung Unversty Hsnchu,
More informationDEFINING %COMPLETE IN MICROSOFT PROJECT
CelersSystems DEFINING %COMPLETE IN MICROSOFT PROJECT PREPARED BY James E Aksel, PMP, PMI-SP, MVP For Addtonal Informaton about Earned Value Management Systems and reportng, please contact: CelersSystems,
More informationOperating a fleet of electric taxis
Operatng a fleet of electrc taxs Bernat Gacas, Frédérc Meuner To cte ths verson: Bernat Gacas, Frédérc Meuner. Operatng a fleet of electrc taxs. 2012. HAL Id: hal-00721875 https://hal.archves-ouvertes.fr/hal-00721875v2
More informationANALYZING THE RELATIONSHIPS BETWEEN QUALITY, TIME, AND COST IN PROJECT MANAGEMENT DECISION MAKING
ANALYZING THE RELATIONSHIPS BETWEEN QUALITY, TIME, AND COST IN PROJECT MANAGEMENT DECISION MAKING Matthew J. Lberatore, Department of Management and Operatons, Vllanova Unversty, Vllanova, PA 19085, 610-519-4390,
More informationA Simple Approach to Clustering in Excel
A Smple Approach to Clusterng n Excel Aravnd H Center for Computatonal Engneerng and Networng Amrta Vshwa Vdyapeetham, Combatore, Inda C Rajgopal Center for Computatonal Engneerng and Networng Amrta Vshwa
More informationAn Enhanced Super-Resolution System with Improved Image Registration, Automatic Image Selection, and Image Enhancement
An Enhanced Super-Resoluton System wth Improved Image Regstraton, Automatc Image Selecton, and Image Enhancement Yu-Chuan Kuo ( ), Chen-Yu Chen ( ), and Chou-Shann Fuh ( ) Department of Computer Scence
More informationScatter search approach for solving a home care nurses routing and scheduling problem
Scatter search approach for solvng a home care nurses routng and schedulng problem Bouazza Elbenan 1, Jacques A. Ferland 2 and Vvane Gascon 3* 1 Département de mathématque et nformatque, Faculté des scences,
More informationSimulation and optimization of supply chains: alternative or complementary approaches?
Smulaton and optmzaton of supply chans: alternatve or complementary approaches? Chrstan Almeder Margaretha Preusser Rchard F. Hartl Orgnally publshed n: OR Spectrum (2009) 31:95 119 DOI 10.1007/s00291-007-0118-z
More informationPeriod and Deadline Selection for Schedulability in Real-Time Systems
Perod and Deadlne Selecton for Schedulablty n Real-Tme Systems Thdapat Chantem, Xaofeng Wang, M.D. Lemmon, and X. Sharon Hu Department of Computer Scence and Engneerng, Department of Electrcal Engneerng
More informationMaintenance Scheduling by using the Bi-Criterion Algorithm of Preferential Anti-Pheromone
Leonardo ournal of Scences ISSN 583-0233 Issue 2, anuary-une 2008 p. 43-64 Mantenance Schedulng by usng the B-Crteron Algorthm of Preferental Ant-Pheromone Trantafyllos MYTAKIDIS and Arstds VLACHOS Department
More informationResearch Article Enhanced Two-Step Method via Relaxed Order of α-satisfactory Degrees for Fuzzy Multiobjective Optimization
Hndaw Publshng Corporaton Mathematcal Problems n Engneerng Artcle ID 867836 pages http://dxdoorg/055/204/867836 Research Artcle Enhanced Two-Step Method va Relaxed Order of α-satsfactory Degrees for Fuzzy
More informationBrigid Mullany, Ph.D University of North Carolina, Charlotte
Evaluaton And Comparson Of The Dfferent Standards Used To Defne The Postonal Accuracy And Repeatablty Of Numercally Controlled Machnng Center Axes Brgd Mullany, Ph.D Unversty of North Carolna, Charlotte
More informationOptimization of network mesh topologies and link capacities for congestion relief
Optmzaton of networ mesh topologes and ln capactes for congeston relef D. de Vllers * J.M. Hattngh School of Computer-, Statstcal- and Mathematcal Scences Potchefstroom Unversty for CHE * E-mal: rwddv@pu.ac.za
More informationSelfish Constraint Satisfaction Genetic Algorithm for Planning a Long-distance Transportation Network
JOURNAL OF COMPUTERS, VOL. 3, NO. 8, AUGUST 2008 77 Selfsh Constrant Satsfacton Genetc Algorthm for Plannng a Long-dstance Transportaton Network Takash Onoyama and Takuya Maekawa Htach Software Engneerng
More informationINVESTIGATION OF VEHICULAR USERS FAIRNESS IN CDMA-HDR NETWORKS
21 22 September 2007, BULGARIA 119 Proceedngs of the Internatonal Conference on Informaton Technologes (InfoTech-2007) 21 st 22 nd September 2007, Bulgara vol. 2 INVESTIGATION OF VEHICULAR USERS FAIRNESS
More informationEvaluation of Coordination Strategies for Heterogeneous Sensor Networks Aiming at Surveillance Applications
Evaluaton of Coordnaton Strateges for Heterogeneous Sensor Networs Amng at Survellance Applcatons Edson Pgnaton de Fretas, *, Tales Hemfarth*, Carlos Eduardo Perera*, Armando Morado Ferrera, Flávo Rech
More informationSoftware project management with GAs
Informaton Scences 177 (27) 238 241 www.elsever.com/locate/ns Software project management wth GAs Enrque Alba *, J. Francsco Chcano Unversty of Málaga, Grupo GISUM, Departamento de Lenguajes y Cencas de
More informationdenote the location of a node, and suppose node X . This transmission causes a successful reception by node X for any other node
Fnal Report of EE359 Class Proect Throughput and Delay n Wreless Ad Hoc Networs Changhua He changhua@stanford.edu Abstract: Networ throughput and pacet delay are the two most mportant parameters to evaluate
More informationBusiness Process Improvement using Multi-objective Optimisation K. Vergidis 1, A. Tiwari 1 and B. Majeed 2
Busness Process Improvement usng Mult-objectve Optmsaton K. Vergds 1, A. Twar 1 and B. Majeed 2 1 Manufacturng Department, School of Industral and Manufacturng Scence, Cranfeld Unversty, Cranfeld, MK43
More informationASSESSING THE AVAILABILITY AND ALLOCATION OF PRODUCTION CAPACITY IN A FABRICATION FACILITY THROUGH SIMULATION MODELING: A CASE STUDY
Internatonal Journal of Industral Engneerng, 15(2), 166-175, 2008. ASSESSING THE AVAILABILITY AND ALLOCATION OF PRODUCTION CAPACITY IN A FABRICATION FACILITY THROUGH SIMULATION MODELING: A CASE STUDY J.H.
More information行 政 院 國 家 科 學 委 員 會 補 助 專 題 研 究 計 畫 成 果 報 告 期 中 進 度 報 告
行 政 院 國 家 科 學 委 員 會 補 助 專 題 研 究 計 畫 成 果 報 告 期 中 進 度 報 告 畫 類 別 : 個 別 型 計 畫 半 導 體 產 業 大 型 廠 房 之 設 施 規 劃 計 畫 編 號 :NSC 96-2628-E-009-026-MY3 執 行 期 間 : 2007 年 8 月 1 日 至 2010 年 7 月 31 日 計 畫 主 持 人 : 巫 木 誠 共 同
More informationSingle and multiple stage classifiers implementing logistic discrimination
Sngle and multple stage classfers mplementng logstc dscrmnaton Hélo Radke Bttencourt 1 Dens Alter de Olvera Moraes 2 Vctor Haertel 2 1 Pontfíca Unversdade Católca do Ro Grande do Sul - PUCRS Av. Ipranga,
More informationReal-Time Process Scheduling
Real-Tme Process Schedulng ktw@cse.ntu.edu.tw (Real-Tme and Embedded Systems Laboratory) Independent Process Schedulng Processes share nothng but CPU Papers for dscussons: C.L. Lu and James. W. Layland,
More informationExtending Probabilistic Dynamic Epistemic Logic
Extendng Probablstc Dynamc Epstemc Logc Joshua Sack May 29, 2008 Probablty Space Defnton A probablty space s a tuple (S, A, µ), where 1 S s a set called the sample space. 2 A P(S) s a σ-algebra: a set
More informationOpen Access A Load Balancing Strategy with Bandwidth Constraint in Cloud Computing. Jing Deng 1,*, Ping Guo 2, Qi Li 3, Haizhu Chen 1
Send Orders for Reprnts to reprnts@benthamscence.ae The Open Cybernetcs & Systemcs Journal, 2014, 8, 115-121 115 Open Access A Load Balancng Strategy wth Bandwdth Constrant n Cloud Computng Jng Deng 1,*,
More informationA GENETIC ALGORITHM-BASED METHOD FOR CREATING IMPARTIAL WORK SCHEDULES FOR NURSES
82 Internatonal Journal of Electronc Busness Management, Vol. 0, No. 3, pp. 82-93 (202) A GENETIC ALGORITHM-BASED METHOD FOR CREATING IMPARTIAL WORK SCHEDULES FOR NURSES Feng-Cheng Yang * and We-Tng Wu
More informationSupport Vector Machines
Support Vector Machnes Max Wellng Department of Computer Scence Unversty of Toronto 10 Kng s College Road Toronto, M5S 3G5 Canada wellng@cs.toronto.edu Abstract Ths s a note to explan support vector machnes.
More informationRisk-based Fatigue Estimate of Deep Water Risers -- Course Project for EM388F: Fracture Mechanics, Spring 2008
Rsk-based Fatgue Estmate of Deep Water Rsers -- Course Project for EM388F: Fracture Mechancs, Sprng 2008 Chen Sh Department of Cvl, Archtectural, and Envronmental Engneerng The Unversty of Texas at Austn
More informationCalculation of Sampling Weights
Perre Foy Statstcs Canada 4 Calculaton of Samplng Weghts 4.1 OVERVIEW The basc sample desgn used n TIMSS Populatons 1 and 2 was a two-stage stratfed cluster desgn. 1 The frst stage conssted of a sample
More informationExamensarbete. Rotating Workforce Scheduling. Caroline Granfeldt
Examensarbete Rotatng Workforce Schedulng Carolne Granfeldt LTH - MAT - EX - - 2015 / 08 - - SE Rotatng Workforce Schedulng Optmerngslära, Lnköpngs Unverstet Carolne Granfeldt LTH - MAT - EX - - 2015
More informationRetailers must constantly strive for excellence in operations; extremely narrow profit margins
Managng a Retaler s Shelf Space, Inventory, and Transportaton Gerard Cachon 300 SH/DH, The Wharton School, Unversty of Pennsylvana, Phladelpha, Pennsylvana 90 cachon@wharton.upenn.edu http://opm.wharton.upenn.edu/cachon/
More informationDamage detection in composite laminates using coin-tap method
Damage detecton n composte lamnates usng con-tap method S.J. Km Korea Aerospace Research Insttute, 45 Eoeun-Dong, Youseong-Gu, 35-333 Daejeon, Republc of Korea yaeln@kar.re.kr 45 The con-tap test has the
More informationFault tolerance in cloud technologies presented as a service
Internatonal Scentfc Conference Computer Scence 2015 Pavel Dzhunev, PhD student Fault tolerance n cloud technologes presented as a servce INTRODUCTION Improvements n technques for vrtualzaton and performance
More informationFuzzy Set Approach To Asymmetrical Load Balancing In Distribution Networks
Fuzzy Set Approach To Asymmetrcal Load Balancng n Dstrbuton Networks Goran Majstrovc Energy nsttute Hrvoje Por Zagreb, Croata goran.majstrovc@ehp.hr Slavko Krajcar Faculty of electrcal engneerng and computng
More information1 Example 1: Axis-aligned rectangles
COS 511: Theoretcal Machne Learnng Lecturer: Rob Schapre Lecture # 6 Scrbe: Aaron Schld February 21, 2013 Last class, we dscussed an analogue for Occam s Razor for nfnte hypothess spaces that, n conjuncton
More informationOutsourcing inventory management decisions in healthcare: Models and application
European Journal of Operatonal Research 154 (24) 271 29 O.R. Applcatons Outsourcng nventory management decsons n healthcare: Models and applcaton www.elsever.com/locate/dsw Lawrence Ncholson a, Asoo J.
More informationEffective Network Defense Strategies against Malicious Attacks with Various Defense Mechanisms under Quality of Service Constraints
Effectve Network Defense Strateges aganst Malcous Attacks wth Varous Defense Mechansms under Qualty of Servce Constrants Frank Yeong-Sung Ln Department of Informaton Natonal Tawan Unversty Tape, Tawan,
More informationStochastic Inventory Management for Tactical Process Planning under Uncertainties: MINLP Models and Algorithms
Stochastc Inventory Management for Tactcal Process Plannng under Uncertantes: MINLP Models and Algorthms Fengq You, Ignaco E. Grossmann Department of Chemcal Engneerng, Carnege Mellon Unversty Pttsburgh,
More informationForecasting the Direction and Strength of Stock Market Movement
Forecastng the Drecton and Strength of Stock Market Movement Jngwe Chen Mng Chen Nan Ye cjngwe@stanford.edu mchen5@stanford.edu nanye@stanford.edu Abstract - Stock market s one of the most complcated systems
More information+ + + - - This circuit than can be reduced to a planar circuit
MeshCurrent Method The meshcurrent s analog of the nodeoltage method. We sole for a new set of arables, mesh currents, that automatcally satsfy KCLs. As such, meshcurrent method reduces crcut soluton to
More informationSPEE Recommended Evaluation Practice #6 Definition of Decline Curve Parameters Background:
SPEE Recommended Evaluaton Practce #6 efnton of eclne Curve Parameters Background: The producton hstores of ol and gas wells can be analyzed to estmate reserves and future ol and gas producton rates and
More informationA New Task Scheduling Algorithm Based on Improved Genetic Algorithm
A New Task Schedulng Algorthm Based on Improved Genetc Algorthm n Cloud Computng Envronment Congcong Xong, Long Feng, Lxan Chen A New Task Schedulng Algorthm Based on Improved Genetc Algorthm n Cloud Computng
More informationCHOLESTEROL REFERENCE METHOD LABORATORY NETWORK. Sample Stability Protocol
CHOLESTEROL REFERENCE METHOD LABORATORY NETWORK Sample Stablty Protocol Background The Cholesterol Reference Method Laboratory Network (CRMLN) developed certfcaton protocols for total cholesterol, HDL
More informationAPPLICATION OF PROBE DATA COLLECTED VIA INFRARED BEACONS TO TRAFFIC MANEGEMENT
APPLICATION OF PROBE DATA COLLECTED VIA INFRARED BEACONS TO TRAFFIC MANEGEMENT Toshhko Oda (1), Kochro Iwaoka (2) (1), (2) Infrastructure Systems Busness Unt, Panasonc System Networks Co., Ltd. Saedo-cho
More informationMethod for Production Planning and Inventory Control in Oil
Memors of the Faculty of Engneerng, Okayama Unversty, Vol.41, pp.20-30, January, 2007 Method for Producton Plannng and Inventory Control n Ol Refnery TakujImamura,MasamKonshandJunIma Dvson of Electronc
More informationDynamic Scheduling of Emergency Department Resources
Dynamc Schedulng of Emergency Department Resources Junchao Xao Laboratory for Internet Software Technologes, Insttute of Software, Chnese Academy of Scences P.O.Box 8718, No. 4 South Fourth Street, Zhong
More informationNONLINEAR OPTIMIZATION FOR PROJECT SCHEDULING AND RESOURCE ALLOCATION UNDER UNCERTAINTY
NONLINEAR OPTIMIZATION FOR PROJECT SCHEDULING AND RESOURCE ALLOCATION UNDER UNCERTAINTY A Dssertaton Presented to the Faculty of the Graduate School of Cornell Unversty In Partal Fulfllment of the Requrements
More informationDynamic optimization of the LNG value chain
Proceedngs of the 1 st Annual Gas Processng Symposum H. Alfadala, G.V. Rex Reklats and M.M. El-Halwag (Edtors) 2009 Elsever B.V. All rghts reserved. 1 Dynamc optmzaton of the LNG value chan Bjarne A. Foss
More informationTraffic State Estimation in the Traffic Management Center of Berlin
Traffc State Estmaton n the Traffc Management Center of Berln Authors: Peter Vortsch, PTV AG, Stumpfstrasse, D-763 Karlsruhe, Germany phone ++49/72/965/35, emal peter.vortsch@ptv.de Peter Möhl, PTV AG,
More informationAn efficient constraint handling methodology for multi-objective evolutionary algorithms
Rev. Fac. Ing. Unv. Antoqua N. 49. pp. 141-150. Septembre, 009 An effcent constrant handlng methodology for mult-objectve evolutonary algorthms Una metodología efcente para manejo de restrccones en algortmos
More informationConversion between the vector and raster data structures using Fuzzy Geographical Entities
Converson between the vector and raster data structures usng Fuzzy Geographcal Enttes Cdála Fonte Department of Mathematcs Faculty of Scences and Technology Unversty of Combra, Apartado 38, 3 454 Combra,
More informationRecurrence. 1 Definitions and main statements
Recurrence 1 Defntons and man statements Let X n, n = 0, 1, 2,... be a MC wth the state space S = (1, 2,...), transton probabltes p j = P {X n+1 = j X n = }, and the transton matrx P = (p j ),j S def.
More informationTo Fill or not to Fill: The Gas Station Problem
To Fll or not to Fll: The Gas Staton Problem Samr Khuller Azarakhsh Malekan Julán Mestre Abstract In ths paper we study several routng problems that generalze shortest paths and the Travelng Salesman Problem.
More informationA method for a robust optimization of joint product and supply chain design
DOI 10.1007/s10845-014-0908-5 A method for a robust optmzaton of jont product and supply chan desgn Bertrand Baud-Lavgne Samuel Bassetto Bruno Agard Receved: 10 September 2013 / Accepted: 21 March 2014
More informationEnabling P2P One-view Multi-party Video Conferencing
Enablng P2P One-vew Mult-party Vdeo Conferencng Yongxang Zhao, Yong Lu, Changja Chen, and JanYn Zhang Abstract Mult-Party Vdeo Conferencng (MPVC) facltates realtme group nteracton between users. Whle P2P
More informationA DATA MINING APPLICATION IN A STUDENT DATABASE
JOURNAL OF AERONAUTICS AND SPACE TECHNOLOGIES JULY 005 VOLUME NUMBER (53-57) A DATA MINING APPLICATION IN A STUDENT DATABASE Şenol Zafer ERDOĞAN Maltepe Ünversty Faculty of Engneerng Büyükbakkalköy-Istanbul
More information