Solving a bi-objective multi-product vehicle routing problem with heterogeneous fleets under an uncertainty condition

Size: px
Start display at page:

Download "Solving a bi-objective multi-product vehicle routing problem with heterogeneous fleets under an uncertainty condition"

Transcription

1 Solving a bi-objective multi-roduct icle routing roblem with heterogeneous fleets under an uncertainty condition Reza Tavakkoli-Moghaddam 1*, Zohreh Raziei 1, and Siavash Tabrizian 2 Received: Acceted: Abstract: This aer resents a novel bi-objective multi-roduct caacitated icle routing roblem with uncertainty in demand of retailers and volume of roducts (UCVRP) and heterogeneous icle fleets. The first of two conflict fuzzy objective functions is to minimize the cost of the used icles, fuel consumtion for full loaded icles and shortage of roducts. The second objective is to minimize the shortage of roducts for all retailers. In order to get closer to a real-world situation, the uncertainty in the demand of retailers is alied using fuzzy numbers. Additionally, the volume of roducts is alied using robust arameters, because the ossible value of this arameter is not distinct and belongs to a bounded uncertainty set. The fuzzy-robust counterart model may be larger than the deterministic form or the uncertain model with one aroach and it has with further comlexity; however, it rovides a better efficient solution for this roblem. The roosed fuzzy aroach is used to solve the bi-objective mixed-integer linear roblem to find the most referred solution. Moreover, it is imossible to imrove one of the objective functions without considering deterioration in the other objective functions. In order to show the conflict between two objective functions in an excellent fashion, a Pareto-otimal solution with the ε-constraint method is obtained. Some numerical test roblems are used to demonstrate the efficiency and validity of the resented model. Keywords: Caacitated icle routing roblem, Bi-objective model, Robust otimization, Fuzzy otimization, Multile roducts. * Corresonding author. tavakoli@ut.ac.ir 1. Professor, School of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran 2. M.Sc. Student, School of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran 2. M.Sc. Grad., Deartment of Industrial Engineering, Sharif University of Technology, Tehran, Iran 207 Vol.3/ No.3/ Summer 2015

2 Solving a Bi-Objective Multi-Product Vehicle Routing Problem with Heterogeneous Fleets under 1. Introduction A icle routing roblem (VRP) was one of the most crucial and essential issues in recent years. The objective of this roblem is obtained through otimal route and distribution of icles in different nodes in a network. Vehicles start their travel from the deot and after serving all vertices (nodes), return to the deot (excet in an oen VRP). There are different tyes of a VRP according to different tyes of real-world alications. There are several assumtions in formulating VRP. Some considered assumtions in this study are include: a caacitated VRP considering the load on each route does not exceed the caacity of a icle. A multi-commodity VRP that is considering different tyes of roducts transorted on each route. A heterogeneous or homogeneous fleet considers different tyes or caacity for icles. Also, a multi or single-deot VRP is one of the critical assumtion. One of the most regular objective functions is to minimize the cost. For instance, the cost of fuel consumtion with resect to the distance between each node is considered in a few aers. It is one of the most imortant issues in the comany to save the fuel cost in transortation. Some aers discussed about the effect of distance travel on the fuel consumtion, [Kara, Kara and Yetis, 2007] roosed a caacitated VRP with a new cost function based on the distance and the load of a icle. The emirical analysis of [Sahin et al, 2009] discussed for the truck with the caacity of 20 tons, when the fuel cost for 1000 km traveled included 60% of the total cost. Therefore, it is imortant to reduce the fuel consumtion at the oerational level. Hence, the travel distance is one of the critical factors effecting on the fuel consumtion when it is considered the full loaded icle caacity. Also, one of the roblems dealing with the VRP is inventory decision. The inventory-routing roblem (IRP) is regarded as a medium-term roblem; however, the VRP is a short-term roblem [Moin and Salhi, 2007]. The first study on the IRP was introduced by [Golden, Assad and Dahl, 1984] to identify a routing roblem take into account the inventory assumtions. One of the critical issue is to integrate inventory management with a routing decision. As recent studies on this roblem [Yu, Chen and Chu, 2008] roosed a model with slit delivery and homogeneous fleet. They used a Lagrangian relaxation method that is 208 decomosed in two sub-roblems; inventory and routing roblems in order to solve the large-scale roblem. [Raa and Aghezzaf, 2009] roosed an integrated model of inventory management and icle route with a fleet size in a ractical case in the context of vendor-managed inventory (VMI) with a cyclic aroach. The aim is to minimize the average distribution and inventory cost. [Coelho, Cordeau and Laorte 2012] roosed and IRP model with a more ractical case in the context of VMI. They assumed that roducts could be transshied from a sulier to a customer and a customer to another customer. [Li et al, 2014] investigated a novel model for the IRP for a gasoline distribution industry, which minimizes travel time. They rovided tabu search and an adated US algorithm as a art of a solution rocedure to obtain a better solution. In the last two decades, the alications of this roblem under uncertainty have increased in both ractitioners and researchers area. This uncertainty existed in the board sectrum of the theories that include stochastic, fuzzy and robust uncertainty. Fuzzy uncertainty is associated with the ambiguity of linguistic statements. These ambiguous situations may occur in objectives or in the arameters. It is often haening in arameters, such as demand and time windows. [Cheng, Gen and Tozawa 1995] roosed a VRP model with time windows and considered due-time instead of fixed time windows. Their fuzzy membershi function shows the degree of customer satisfaction of the service time. [Wang and Wen, 2002] investigated a VRP model for a Chinese ostman roblem and considered fuzzy time windows. [Tang et al, 2009] roosed bi-objective VRP model with fuzzy soft time windows and considered a linear and concave fuzzy membershi. Their objective functions are to minimize the routing cost and maximize the overall customer satisfaction level. [Ghannadour et al, 2014] roosed a multi-objective dynamic VRP with fuzzy time windows. The objective functions are to minimize the total travel distance and waiting time on icles and maximize customer references for service. They roosed a genetic algorithm with three basic modules to solve this roblem. Other studies have considered demand and travel time as fuzzy arameters. [Guta, Singh and Pandey, 2010] solved a multi-objective VRP with fuzzy time windows. The objective functions are to minimize the fleet size, maximize the average

3 Reza Tavakkoli-Moghaddam, Zohre Raziei, Siavash Tabrizian grade of satisfaction, minimize the total travel distance, and minimize the total waiting time for icles. [Cao and Lai, 2010] roosed an oen icle routing roblem (OVRP) model. They considered fuzzy demands and used a fuzzy chance-constrained rograming model based on a fuzzy credibility theory to solve this model. Some aers have considered travel time as fuzzy arameters. [Kuo, Chiu and Lin, 2004] roosed a VRP model with time windows and fuzzy travel time. They used ant colony otimization (ACO) to solve this roblem. [He and Xu, 2005] considered a single deot VRP with fuzzy demand and robability travel times between customers that minimizes travel time by considering caacity and arrival time constraints on the greatest degree. Because of the comlexity of an uncertain VRP, they used a genetic algorithm to solve it. [Zheng and Liu, 2006] roosed a single-deot VRP model with time windows and considered travel time as fuzzy variables. They designed the integrated fuzzy simulation and genetic algorithm to solve this roblem. [Xu, Yan and Li, 2011] roosed a bi-objective VRP model with soft time windows and fuzzy random environment. The objective functions are to minimize the total travel time and maximize the average satisfaction level of all customers. In order to obtain the equivalent cris, the concet of the fuzzy random exected value is used. Some recent studies have considered a dynamic condition. [Ghannadour, Noori and Tavakkoli-Moghaddam, 2013] considered the customer satisfaction level by using the concet of fuzzy time windows with the revious assumtions. Also, the first objective function is to minimize the total traveling distance and waiting time on icles and the second one is to maximize the customer reference for service. Some recent studies have used the concet of robust otimization in a VRP model. This concet is used to comensate for the limitation of a stochastic aroach for this roblem, because this aroach does not increase the comlexity of the roblem. [Montemanni et al, 2007] roosed a new extension for solving travel salesman roblem by robust otimization. They alied a robust deviation criterion to imrove otimization over an interval data roblem. [Sungur, Ordónez and Dessouky, 2008] roosed a VRP model with demand uncertainty to introduce robust otimization to solve the roblem. The aim is to minimize transortation costs with satisfying all demands. [Sungur et al, 2010] roosed an 209 uncertain VRP model. They considered scenariobased stochastic rogramming for uncertainty in customers and robust otimization for uncertainty in service times. [Li, Xu and Zhou, 2012] rovided chance-constrained rogramming for a fuzzy demand in a VRP model. Also, they found the lowest total mileage in the model by using the imroved tabu search algorithm. [Gounaris, Wiesemann and Floudas 2013] roosed caacitated VRP model with uncertain demand. They used robust otimization to solve the roblem by develoed robust rounded-caacity inequalities for two broad classes of the demand caacity. [Agra et al. 2013] roosed a VRP model with time windows and roosed a new formulation of a robust roblem. The first formulation extends the well-known resource inequality formulation by considering adjustable robust otimization and the second aroach formulation generalizes a ath inequalities formulation for the uncertain context. [Solano- Charris, Prins and Santos, 2014] considered a robust VRP with uncertain travel time with discrete scenarios. The objective function is to minimize the worst total cost in each scenario. They used a genetic algorithm to solve this roblem for small and medium-sized roblems. [Sun and Wang, 2015] roosed a VRP model with uncertainty in the demand and transortation cost. They used robust otimization considered situations ossibly related to bidding and caital budgets to solve the roblem. To summarize the contribution of this aer, a bi-objective caacitated VRP with uncertainty (UCVRP) is resented. Also, an assumtion of multi-roduct and heterogeneous icles (with different caacity) is considered. The fuzzy objective functions are considered that minimize the traditional cost by considering the fuel consumtion cost due to the traveled distance for fully loaded icles as the first objective. According to the constraints of inventory management in the model, the second objective is to minimize the shortage of roducts (i.e., negative inventory). Two tyes of uncertain arameters (e.g., demand of retailers and volume of roducts) are considered in the model. The uncertainty in the demand of retailers is due to the linguistic ambiguity of eole, so it is exressed as fuzzy arameter. Also, the uncertainty in the volume of roducts is exressed as robust arameter, because the level of uncertainty of the volume of roducts belongs to the small bound without knowing

4 Solving a Bi-Objective Multi-Product Vehicle Routing Problem with Heterogeneous Fleets under ossible value. As a result, a new model is roosed by considering two uncertainty aroaches and fuzzy objective functions in this study. The rest of this aer is organized as follows. Classifying and reviewing the literature in Section 1. In Section 2 introduces the deterministic formulation of the model. Section 3 resents a fuzzy aroach used in the objective functions and demand arameter and then rewrites fuzzy formulation of the model. Section 4 resents a robust otimization aroach for an uncertain volume of roducts and rewrites the final form of the model. Numerical results and sensitive analysis are rovided in Section 5, and we conclude this study in Section Problem Statement In this aer, we consider the bi-objective multiroduct VRP with heterogeneous fleet and retailer s inventory assumtion. We assume that the icles are driving the same seed with full load on each tour. Additionally, we consider an uncertain demand for retailers, volume of roducts and objective functions. Additionally, the aim of this model is to minimize the total cost and shortage of roducts (i.e., negative inventory) with fuzzy objectives. The total cost consists of used icle, fuel consumtion and shortage cost as lack of inventory in each demand oint. It is notable that the cost of fuel consumtion is calculated with resect to the travel distance, because the seed of full loaded icles are considered the same on each route. 2.1 Assumtions The main assumtions of the resent model are listed below. Considering the caacitated icle routing roblem (CVRP). Considering different tyes of roducts. Considering a icle with the different caacity (i.e., heterogeneous fleet). Considering an inventory olicy. Considering fuel consumtion as a art of cost function in the first objective. Minimize the shortage of roducts as the second objective. Demands of retailers are assumed to be in a fuzzy nature. Volumes of roducts are assumed to be in a robust nature. Considering the fuzzy objective functions. Figure 1 rovides an examle of a mathematical model in order to illustrate this roblem with the above assumtions. This samle roblem is described for nine retailers, three full loaded icles with different caacity and same seed and three tyes of roducts. According to the described model, the tours constructed from a central deot to visit retailers are shown. Also, the icles which choose to carry the amount of three tyes of selected roducts are shown. Figure 1. Illustrative examle of the given roblem 210

5 2.2 Model Formulation Alied sets, indices, arameters and modeling variables are as follows: Sets 1,..., P Set of roducts v 1,..., V Set of icles c 1,..., C Set of retailers Parameters dem c Reza Tavakkoli-Moghaddam, Zohre Raziei, Siavash Tabrizian The amount of demand of retailer c for roduct ca v d cc ˆ c v ca vol f v k fuel c c zl 1, zu 1 zl 2, zu 2 zll, zuu v, M Caacity of icle v Distance between retailer c and c Cost of icle v Caacity of roduct in central deot Volume of roduct Amount of fuel consumtion of icle v er unit distance and unit icle weight Density er each tye of roduct Price of fuel consumtion er unit distance er unit icle weight Cost of shortage (i.e., negative inventory) for roduct Fuzzy multi objective arameters Uer bound and lower bound of right hand side of fuzzy constraints Robust arameters Decision variables x vc 0 u vc 0 inv c inv c invn c vcc ˆ z v Amount of roducts delivered to retailer c by icle v Amount of roducts when entering in retailer c by icle v Amount of inventory levels of roduct for retailer c Amount of ositive and negative inventories of roduct for retailer c If icle v is assumed to travel from retailer c to c Otherwise If icle v is used Otherwise 211

6 yvc, zv, y, z, vcc ˆ vcc ˆ vcc ˆ Robust variables Fuzzy variable The Auxiliary variable for linearization 2.3 Mathematical model fuel z 1 Min cv zv c fv d c invn ˆ vcc ˆ cc ˆ c vv vv cccc P cc (1) z 2 Min invn c PcC s.t. 1 vvcc ˆ vcc ˆ c C, c>1 (3) cc ˆ vcc ˆ v V,c C (4) cc ˆ vccˆ xvc ca P (5) vvcc vol x ca z vc v v V (6) v PcC uvc ( u x ) vcˆ vcˆ vcc ˆ (2) Pv, Vcc,, Cc, 1 (7) u v1 x cc Pv vcˆ, V (8) z ˆ vcc ˆ v cc vvc, C (9) xvc M demc v V,cC (10) P cc ˆ invc xvc demc vv inv c inv c invnc Pc, C (11) Pc, C (12) 0,1 vcc ˆ cc ˆ, C (13) z v 0,1 v V (14) x vc 0 Pv, Vc, C (15) u vc 0 Pv, Vc, C (16) invc, invnc 0 Pv, V (17) inv c free Pc, C (18) Vol.3/ No.3/ Summer

7 Reza Tavakkoli-Moghaddam, Zohre Raziei, Siavash Tabrizian As mentioned before, this aer aims at minimizing the cost of urchasing the icle, fuel consumtion and shortage as the first objective function and minimizing the shortage of roducts (i.e., negative inventory) as the second objective function. Both of them are shown as the first and second equations. The first constraint as shown in Eq. (3) ensures that each retailer stands on just one route. Eq. (4) guarantees whether icle v enter in node c, it should leave this node. Eq. (5) ensures that the amount of delivering roduct tye does not exceed its caacity. Eq. (6) is the caacity of a icle constraint. Eqs. (7) and (8) are sub-tour elimination constraints based on the amount of roducts when entering in nodes and ensure that no route is aart from a central deot. Eq. (9) ensures that each icle is assigned to one route. Eq. (10) states that roduct tye is delivered to retailer c by icle v, if icle v is allocated the route of retailer c. Eqs. (11) and (12) are the inventory constraints stating that the amount of delivered roducts to a retailer (i.e., inventory level) is the difference between load delivering to retailers and the demand for them. On the other hand, it is the difference between the inventory level of retailer and the shortage of roducts in one eriod. 2.4 Linearization Ste Due to the non-linear term aeared in the aforementioned mathematical model, a linearization rocedure for Eq. (7) is alied as follows: uvc u x bigm(1 ) vcˆ vcˆ vcc ˆ (19) vcc,,, 1 3. Fuzzy Mathematical Programming The roosed model for the VRP resented in the receding section is a deterministic model. The fuzzy multi-objective mixed-integer linear rogramming (FMOMILP) is rovided in this section to overcome the rigidity of the deterministic model. The mathematical model in the fuzzy environment can be included vague goal and arameters. In the deterministic formulation, the total cost consists of the cost of the icle, cost of fuel consumtion and enalty cost for shortage of roducts (i.e., negative inventory). In the real world, most of these costs are not easily measured, because human ercetion is effected in this evaluation. When we face with this issue, the decision maker wants to reach some asiration levels of the objective functions and allow some violations in the arameters of constraints. In addition, the fuzzy objective functions, the demand is considered as fuzzy arameter reresented by intervals of tolerance. This aer uses a fuzzy aroach of [Zimmermann, 1978] and other [Chen and Chou, 1996] to deal with the imrecise arameters and fuzzy situation of objective functions. The linear membershi functions are emloyed for constraints and objective functions. This aroach is resented below. Max (20) s.t. min Minimum objective zr ( x) function (21) max Maximum zs ( x) function objective (22) ( x) gl Fuzzy constraint (23) g ( x) b Deterministic constraint (24) In the above model, min zr ( x), max ( x) and ( x) refer to a zs gl minimum objective, a maximum objective and fuzzy constraints, resectively. The membershi functions based on reference are linear as shown below: 1 z u r z r u z ( ) ( ) r z x r l ( ) u min x zr zr x z u l r z r z r z r 0 z z l r r (25) 1 z u s zs ( ) l max ( ) zs x z x s z l z ( x ) z u z u l s s s s zs zs 0 z z l s s (26) With two membershi functions for minimization and maximization objective functions, we can obtain an asiration level for the value of the objective functions. 1 g ( x) b gx ( ) b g ( x) b g( x) b d d 0 g( x) b d (27) 213

8 Solving a Bi-Objective Multi-Product Vehicle Routing Problem with Heterogeneous Fleets under where the left hand side of the fuzzy constraints is g( x ), the -th fuzzy value is b and the tolerance level that the decision maker can consider in the -th constraint of the fuzzy inequality is d. According to the fuzzy objective functions and constraints, the MILP formulation can be exressed as follows: max (28) ( z u z l ) z u z (29) ( z z ) z z (30) u l u ( dem u dem ) dem u c c c ( invc xvc ) vv, c (31) ( dem dem l c c) demc invc x, c vc vv (32) Constraints (3)-(6), (14), (8)-(10), (12) and (13). 0 1 (33) In order to obtain uer and lower bounds of two fuzzy objective functions, use the following rocedure. In minimization goals, z l can be i obtained by solving each of single objective linear rogramming. Also, in minimization goals, z u i is the non-ideal solution (i.e., maximum value). After calculating of uer bound of each objective, if the uer bound is infinite, eliminated the basic constraint (e.g., sub-tour elimination) of the roblem and calculated the uer bound of objective functions by minimizing them. 4. Robust Mathematical Programing Now, the robust counterart roblem for a fuzzy VRP is resented. The volume of each roduct tye is the other arameter of this model, which is faced with uncertainty. It is better to use a bound uncertainty set of data to solve this model efficiently in an uncertain condition. The exectation is that such a solution with a robust arameter will be efficient in this bound for every ossible outcome. According to the robust formulation [Bertsimas and Sim, 2004], the following constraint with uncertainty in arameter vol is considered, where J is the set of coefficients for this arameter and takes the value according to a symmetric distribution with the mean that is equal to the nominal value vol in the interval vol vol ˆ, vol vol ˆ. vol x ca z vc v v PcC Parameter is introduced that takes a value in interval 0, for each. The role of is adjusted the robustness of the roosed method against the level of rotection of the solution. The aim of this tye of robustness is rotected against that all cases u to change, and only one coefficient ( vol ˆ ) is changed by ˆ vol. The obtained robust solution is feasible deterministically, even if more than one change, the robust solution will be feasible with very high robability. The formulation is shown below: max cx s.t. vol x vc PcC max St SJ, S, tj\ S vol ˆ y vc ˆ vol y vc Pc C ca z v v yvc xvc yvc x0, y 0 The value of the second art of the left hand side of Constraint (36) can be comuted for each icle v and retailer c. Also, by considering 0, J, the robustness of the model against the level of rotection is more flexible than J. This model is equal to the objective function of the linear model as shown below: ( x *, ) max( vol ˆ x * i i vc zv ) PcC (39) z (40) v vv z v 0 1 (41) 214

9 With regards to the final form of the model introduced by [Bertsimas and Sim 2004], the new form of model is rewritten, which is established based on the dual of the model. First, the dual of the model is considered below: min vv z P (42) zv vol ˆ y cv, (43) vc cc (44) z 0 v v 0 (45) The objective value is obtained from the dual roblem is feasible and bounded for all 0, J. Now, the first model by considering the fuzzy objectives and fuzzy demands as well as a robust volume of roducts in constraints is rewritten. max (46) s.t. Normal constraints 1 vvcc ˆ vcc ˆ c C, c>1 (47) cc ˆ vcc ˆ cc ˆ vccˆ v V,c C (48) xvc ca vvcc P (49) uvc u x bigm(1 ) vcˆ vcˆ vcc ˆ vcc,,, 1 (50) u v1 x cc vcˆ Pv, V (51) z ˆ vcc ˆ v cc vvc, (52) xvc Mvcc ˆ v V,c C (53) P cˆ C inv c invc invnc Pc, C (54) Fuzzy constraints for objective function ( z u z l ) z u z (55) ( z z ) z z u l u Reza Tavakkoli-Moghaddam, Zohre Raziei, Siavash Tabrizian Fuzzy constraints for demand ( dem u dem ) dem u c c c ( invc xvc ) vv Pc, C (57) ( dem dem l c c) demc invc xvc vv Pc, C (58) Robust constraints for volume of roduct vol x z ca z vc v v v v PcC P v V (59) zv vol ˆ yvc cc Pv, V (60) xvc yvc Pv, Vc, C (61) (56) 215

10 Solving a Bi-Objective Multi-Product Vehicle Routing Problem with Heterogeneous Fleets under xvc yvc Pv, Vc, C (62) 0 1 (63) x0, y 0 (64) zv 0, 0, xvc 0, uvc 0, invc 0, invnc 0 (65) {0,1}, z {0,1} vcc ˆ v 5. Extension of the Model with Decreasing the Load on Each Route Changing in the load of the icle has a direct imact on fuel consumtion. After delivery of roducts with large sizes (in the weight), the amount of fuel consumtion has decreased. However, in the medium and small sizes (in the weight) of the delivery rocess, the decreasing in the fuel consumtion is very low. So, the amount (66) of fuel consumtion can be considered fixed. In this section, the extension of the model is considered for assessing the effect of the load decreasing for delivered roducts in large sizes on the icle fuel consumtion. First, the deterministic form of the model is described as follows. Put u vcc ˆ vc then vcc ˆ fuel z 1 Min cvzv + c fvvol k d vv PvVc Ccˆ C vcc ˆ cc ˆ c invnc Pc C (67) s.t. u M (1 vcc ˆ ) vcc ˆ vc Pv, Vcc,, ˆ C (68) u M (1 vcc ˆ ) vcc ˆ vc Pv, Vcc,, ˆ C (69) ˆ ˆ vcc M vcc Pv, Vcc,, ˆ C (70) vcc ˆ 0 (71) Constraints (2)-(18) (72) In the Eq. (67) minimize the cost objective function includes the cost of urchasing the icle, fuel consumtion cost with considering the effect decreasing the load on fuel consumtion of a icle. Eqs. (68) - (71) are the linearization rocedure for cost of fuel consumtion term in the first objective function. Because the uncertainty in the volume of roducts is considered as robust arameter, it is needed to consider the robust formulation for this arameter in the objective function. Since the generating the robust model based on deterministic model is described before, in this section the relations are just reresented. The new model with fuzzy and robust arameters is shown bellow. Put A vcc ˆ fuel c fvvol k d cc ˆ then z 1 Min cv zv + c invn c (73) vv PcC A vcc ˆ vcc ˆ,,, ˆ PvVcc C (74) 216

11 Reza Tavakkoli-Moghaddam, Zohre Raziei, Siavash Tabrizian vcc ˆ (75) Constraints (68)-(72) (76) As described before, the robust model in Eq. (74) for mentioning robust factor is shown below. Max ˆ * z ˆ PvV cc cc vcc ˆ ˆ ˆ (77) s.t. (78) Pv VcC ˆ cc z vcc ˆ (79) 0 z 1 vcc ˆ (80) The dual of the above model is considered below: Min Pv V cc ˆ cc vcc ˆ z z aˆ * Pv, Vcc,, ˆ C vcc ˆ vcc ˆ vcc ˆ (82) 0 vcc ˆ Pv, Vcc,, ˆ C (83) z 0 (84) Now, the final form of the new model considering the fuzzy and robust constraints of original model is shown below. (85) a z Pv V cc ˆ cc vcc ˆ vcc ˆ PvV cc ˆ cc vcc ˆ (86) z a y vcc ˆ vcc ˆ vcc ˆ Pv, Vcc,, ˆ C (87) y y vcc ˆ vcc ˆ vcc ˆ,,, ˆ 217 (81) PvVcc C (88),, z 0 vcc ˆ vcc ˆ (89) Constraints (47)-(66) (90) 6. Comutational Results In the revious section, the given roblem was described in details. In this section, the numerical results of the deterministic, fuzzy, robust and fuzzy-robust model with Equations (1)-(66) are resented. The results is obtained by solving some instances via general algebraic modelling system (GAMS) /CPLEX. It is essential to create random intelligent various samle roblems in order to evaluate the mathematical model. For nominal exeriments, eight samle roblems with small and medium sizes are shown in Tables 2 and 3. The samle data are chosen from a uniform bound as shown in Table 1. It is notable that the cost of the three arameters in first objective function (e.g., c, c v and fuel c ) should be in the same scale. The cost scaled of fuel consumtion is different from the cost of the icle and shortage. It causes to ignore the effect of fuel consumtion cost. In order to overcome this issue, each arameter is normalized than the range of its data.

12 Solving a Bi-Objective Multi-Product Vehicle Routing Problem with Heterogeneous Fleets under Table 1. Source of random generations for samle roblems Parameters Corresonding random distribution Parameters Corresonding random distribution dem c Uniform (0,31) ca Uniform (200000,300000) ca v Uniform (200000,300000) vol Uniform (5,15) d cc ˆ Euclidean distance f v Uniform (5,15) c v Uniform (250000,300000) k Uniform (1,10) c Uniform (250000,300000) According to the discrete and continuous variables, the roosed model is a mixed-integer linear model. In order to validate the model and examined the result of the samle roblems for fuzzy, robust, fuzzy-robust and deterministic models, used GAMS software. In Table 2, dimensions and characteristics of small-sized instances with the result of the deterministic and fuzzy-robust model is shown. As resented in Table 2, the total cost of the samle roblem included, the cost of using icles, fuel consumtion and shortage of roducts for each retailer is between and in deterministic form. Also, shortage of roducts as the second objective is between 70 and 107. Table 2. Small-scale instances: Results for the deterministic and fuzzy-robust model Problem name Indices Deterministic Fuzzy-robust Obj1 Obj2 Obj1 Obj2 S01 ()4-(c)5-(v) S02 ()4-(c)6-(v) S03 ()4-(c)7-(v) S04 ()4-(c)8-(v) Min ()4-(c)5-(v) Mean ()4-(c)7-(v) Max ()4-(c)8-(v) (i): indices of roducts, (c): indices of retailers, (v): indices of icles In order to validate the exact solution of GAMS and erformance of model by increasing the comlexity of the roblem, four samle roblems with a medium size are created and otimized. The results of medium-sized roblems are shown in Table 3. Table 3. Medium-sized instances: results for the deterministic and fuzzy-robust model Problem name Indices Deterministic Robust-fuzzy Obj1 Obj2 Obj1 Obj2 M01 ()6-(c)8-(v) M02 ()6-(c)9-(v) M03 ()7-(c)9-(v) M04 ()7-(c)10-(v) Min ()6-(c)8-(v) Mean ()6-(c)9-(v) Max ()7-(c)10-(v) (i): indices of roducts, (c): indices of retailers, (v): indices of icles 218

13 Reza Tavakkoli-Moghaddam, Zohre Raziei, Siavash Tabrizian Figure 2. Otimum objective function for small-sized instances in comarison with fuzzy otimum results The results of the fuzzy and robust models for small instances are shown in Figures 2 and 3, searately. As characteristic of a fuzzy set theory, the solution of the fuzzy model is more stable than the deterministic form and shows the better insight into the model structure. So, the fuzzy results better than deterministic. Also, the result of the robust otimization model is better than the deterministic model, because this robust aroach [Bertsimas and Sim 2004] guaranteed that constraints are satisfied by changing data. Also, these results are the same for medium sizes. The results of comarison fuzzy-robust model with other medium samle roblems are shown in Figure 4. It is obvious that the result of both objective functions of the fuzzy-robust model are the best otimization value than the other ones. If the uncertainty of arameters is known by the most ossible value of them, it is efficient to use a fuzzy otimization aroach. If the uncertainty of arameters is unknown and only a small violation of them is known, it is efficient to use a robust otimization aroach. The most aroriate solution is achieved with these aggregation of aroaches for an uncertain model. In order to evaluate the flexibility of the resented model, we use a sensitive analysis rocedure in different conditions and measure the flexibility of the model. Therefore, various scenarios for robust model and fuzzy model are defined and imlementing sensitivity analysis rocedures. Figure 3. Otimum objective function for small-sized instances in comarison with the robust otimum results 219

14 Solving a Bi-Objective Multi-Product Vehicle Routing Problem with Heterogeneous Fleets under Figure 4. Otimum objective function for medium-sized instances in comarison with fuzzy otimum and robust otimum results In order to demonstrate the conflict between objective functions, we show the Pareto otimal solution. The augmented ε-constraint method is used to achieve this goal. Table 4 illustrates the ideal (Z I ) and nadir (Z N ) oints for objective functions. Also, the diagram of a Pareto front is shown in Figure 5. Table 4. Uer and lower bound Ideal and Nadir oints Objective 1 (Cost) Objective 2 (Shortage) Uer bound Z N = Z N =64 Lower bound Z I = Z I =56 According to the non-dominated solution shown in Figure 5, the first two oints of the Pareto front have the same value of the cost objective function, while the shortage of roducts objective function are different. Also, the two other oints are the same condition. Conflict among objective functions is not only clear in the Pareto frontier objective, but also is obvious in the model logically. According to the second objective function, if an unlimited amount of negative inventory for the second objective function is allowed, the number of delivered roducts by each icle (Constraints 11 and 12) is reduced. Also, the number of used icles and icle tris (Constraints 6 and 10) are reduced. So, the value of the cost objective function is reduced. Figure 5. Pareto front 220

15 Reza Tavakkoli-Moghaddam, Zohre Raziei, Siavash Tabrizian 6.1 Analysis Based on the Uncertainty Level of the Demand The scenarios on reducing demand is considered and chosen samle roblem S02 as an examle. The result of reducing demand resented in Table 5. Two analysis is made for reducing the demand. First, the total cost is constant or decreases and the shortage of roducts decreases too. It is due to the fact that the icle number is constant. As a result, the shortage of roducts decreases means while the cost is constant or decreases. Second, costs decrease a lot and the shortage of roducts increases, which means that deciding to use fewer icles due to the demand reduction. So, the amount of the remained facilities are not caable of sulying more shortage of roducts. The results from the fuzzy model and robustfuzzy model are congruent with first exectation scenarios from the suggested model erformance. When the reduction of demands is increasing, the reduction rate of the objective function of the fuzzy-robust model is more than the fuzzy model. It reresents the best erformance of the fuzzyrobust model. These reduced rates for both models are shown in Figures 6 and Analysis Based on a Protection Level for Robust Parameters It is accetable to estimate the change in the objective functions with resect to the change in rotection level i of constraint i measure the validation of the robust otimization model. Hence, the rice of increasing or decreasing a change is evaluated at the rotection level for each constraint by the results of the objective functions in the robust model. Also, the results of the fuzzyrobust otimization model is obtained for each level of rotection. Moreover, the robability bounds of constraint violation is obtained [Bertsimas and Sim 2004]. In other words, if more than the uncertain arameters of the right i hand side of i-th constraint change, the robability of a violation of i-th constraint is at most these bounds. The result of change i on objective functions and robability bound of constraints for the robust and fuzzy-robust models are shown in Table 6. Table 5. Scenarios designed for the sensitivity analysis rocedure on demand Scenario Amount of demand Fuzzy Fuzzy-robust Obj1 (Cost) Obj2 (Shortage) Obj1 (Cost) Obj2 (Shortage) Demand Demand Demand Demand Demand Demand Figure 6. Reduced rate of the second objective function for both models in each scenario 221

16 Solving a Bi-Objective Multi-Product Vehicle Routing Problem with Heterogeneous Fleets under In the robust otimization model, the objective functions are increasing the rotection level; however, the trend of the objective functions in the fuzzy-robust model is not distinct. It is obvious that the otimal value of the objective functions in both models is affected when the rotection level is increased. For examle, in order to have a robability guarantee of a constraint violation at most 15.74%, it needs to reduce the first objective function of the robust model, 69%, while the reduction level for the fuzzy-robust model is 41%. The effect of the rotection level on an otimal value of the first objective function for the robust and fuzzy-robust models are shown in Figure 8. The results illustrate the better erformance of the fuzzy-robust model for each level of rotection. Also, Figure 9 illustrates the otimal value of the first objective function with resect to the robability bound of constraint violation. 6.3 Comarison Between Results of Original and Extension Models In order to show the effect of decreasing of icle load (for the model resented in Section 5), the result of the deterministic model described for small-sized instances are shown in Table 7. Also, the result of the fuzzy-robust model is shown in Table 7 to show the effect of the robust arameter in the objective function. Table 6. Results of the robust and fuzzy-robust solutions for Probability bound Robust Fuzzy-robust Obj1 Obj2 Obj1 Obj Figure 7. Otimal value of the robust and fuzzy-robust models as function of 222

17 Reza Tavakkoli-Moghaddam, Zohre Raziei, Siavash Tabrizian Figure 8. Otimal value of the robust and fuzzy-robust models as a function of the robability bound of the constraint Table 7. Comarision between the models for small-sized instances Problem Original model Extension model Deterministic Fuzzy-robust Deterministic Fuzzy-robust Obj1 Obj2 Obj1 Obj2 S S S S According to the results of Table 7, both objective functions considering load is worse than the original model for a deterministic form. In the fuzzy-robust model, adding the robust arameter to the objective function is changed without any secific behavior in both objective functions. 7. Conclusion In this study, we roosed a novel bi-objective caacitated icle routing roblem under uncertainty (UCVRP) and considered the multiroducts with heterogeneous fully loaded icles (i.e., different caacity) assumtions. The first objective function minimizes the cost of the used icles, fuel consumtion and shortage of roducts for each retailer. The second objective minimizes the shortage of roducts. The inventory constraints are considered in the model to obtain the shortage of roducts. We considered uncertainty in some arameters included the demand of retailers and volume of roducts. We utilized fuzzy otimization and robust otimization aroaches searately to coe with the uncertain arameters and objective functions. In order to overcome the ambiguous of linguistic for demand of retailers and most ossible amount of known demands in the real world, considered a fuzzy otimization model. Also, the uncertainty in the volume of roducts belongs to the bounded uncertainty set in the real world. Therefore, we considered a robust otimization model. Finally, an integrated model (i.e., fuzzy-robust model) resented to deal with both uncertainty arameters. Additionally, we coed with fuzzy uncertainty in the bi-objective mixed-integer linear roblem. The augmented ε-constraint method is used to demonstrate the conflict between objective functions. Also, an extension of model considering the effect of load of fuel consumtion is resented. Some samle roblems are generated and solved to demonstrate the efficiency of the fuzzy-robust model. Finally, we roosed a sensitivity analysis based on a reducing demand for the fuzzy and fuzzy-robust model and increasing rotection level for the robust and fuzzy-robust model. The results showed the efficiency of the integrated model. 223

18 Solving a Bi-Objective Multi-Product Vehicle Routing Problem with Heterogeneous Fleets under Future studies can be considered a model for a multi-deot VRP or multi-eriod condition. Also, one can be rovided an efficient algorithm to solve given large scale roblem. 8. References -Agra, A., Christiansen, M., Figueiredo, R., Hvattum, L. M., Poss, M. and Requejo C. (2013) The robust icle routing roblem with time windows, Comuters & Oerations Research, Vol. 40, Bertsimas, D. and Sim, M. (2004) The rice of robustness, Oerations Research, Vol. 52, Cao, E., and Lai, M. (2010) The oen icle routing roblem with fuzzy demands, Exert Systems with Alications, Vol. 37, Chen, H.K. and Chou, H.W. (1996) Solving multi objective linear rogramming roblems - A generic aroach, Fuzzy Sets and Systems, Vol. 82, Cheng, R., Gen, M., and Tozawa, T. (1995) Vehicle routing roblem with fuzzy due-time using genetic algorithms, Jaan Society for Fuzzy Theory and Systems, Vol. 7, Coelho, L. C., Cordeau, J., and Laorte, G. (2012) The inventory-routing roblem with transshiment, Comuters & Oerations Research, Vol. 39, Golden, B., Assad, A., and Dahl, R. (1984) Analysis of a large scale icle routing roblem with an inventory comonent, Large scale systems, Vol. 7, Ghannadour, S. F., Noori, S. and Tavakkoli- Moghaddam, R. (2013) Multiobjective dynamic icle routing roblem with fuzzy travel times and customers satisfaction in suly chain management, IEEE Transactions on Engineering Management, Vol. 60, Ghannadour, S. F., Noori, S., Tavakkoli- Moghaddam, R., and Ghoseiri, K. (2014) A multi-objective dynamic icle routing roblem with fuzzy time windows: Model, solution and alication, Alied Soft Comuting, Vol. 14, Gounaris, C. E., Wiesemann, W., and Floudas C. A. (2013) The robust caacitated icle routing roblem under demand uncertainty, Oerations Research, Vol. 61, Guta, R., Singh, B., and Pandey, D. (2010) Fuzzy icle routing roblem with uncertainty in service time, International Journal of Contemorary Mathematical Sciences, Vol. 5, He, Y. and Xu, J. (2005) A class of random fuzzy rogramming model and its alication to icle routing roblem, World Journal of Modelling and simulation, Vol. 1, Kara, I., Kara, B. Y., and Yetis, M. K. (2007) Energy minimizing icle routing roblem, In Combinatorial otimization and alications, Sringer Berlin Heidelberg. -Kuo, R. J., Chiu, C. Y. and Lin, Y. J. (2004) Integration of fuzzy theory and ant algorithm for icle routing roblem with time window, Processing of the IEEE Annual Meeting of the Fuzzy Information (NAFIPS'04), Vol. 2, Li, H., Xu Z. and Zhou F. (2012) A study on icle routing roblem with fuzzy demands based on imroved tabu search, Fourth International Conference on Comutational and Information Sciences (ICCIS), Li, K., Chen B., Sivakumar, A. I. and Wu, Y. (2014) An inventory routing roblem with the objective of travel time minimization, Euroean Journal of Oerational Research, Vol. 236, Moin, N.H. and Salhi, S. (2007) Inventory routing roblems: a logistical overview, Journal of Oeration Research Society, Vol. 58, Montemanni, R., Barta, J., Mastrolilli, M. and Gambardella L. M. (2007) The robust traveling salesman roblem with interval data, Transortation Science, Vol. 41, Raa, B. and Aghezzaf, E. H. (2009) A ractical solution aroach for the cyclic inventory routing roblem, Euroean Journal of Oerational Research, Vol. 192, Sahin, B., Yilmaz, H., Ust, Y., Guneri, A. F. and Gulsun B. (2009) An aroach for analysing transortation costs and a case study, Euroean Journal of Oerational Research, Vol. 193,

19 Reza Tavakkoli-Moghaddam, Zohre Raziei, Siavash Tabrizian -Solano-Charris, E. L., Prins, C. and Santos, A. C. (2014) A robust otimization aroach for the icle routing roblem with uncertain travel cost, International Conference on Control, Decision and Information Technologies, Sun, L. and Wang, B. (2015) Robust otimization aroach for icle routing roblems with uncertainty, Mathematical Problems in Engineering, Article in Press. -Sungur, I., Ordónez F. and Dessouky, M. (2008) A robust otimization aroach for the caacitated icle routing roblem with demand uncertainty, IIE Transactions, Vol. 40, Sungur, I., Ren, Y., Ordóñez, F., Dessouky, M. and Zhong, H. (2009) A model and algorithm for the courier delivery roblem with uncertainty, Transortation Science, Vol. 44, Tang, J., Pan, Z., Fung, R. Y. K., and Lau, H. (2009) Vehicle routing roblem with fuzzy time windows, Fuzzy Sets and Systems, Vol. 160, Wang, H. F., and Wen, Y. P. (2002) Timeconstrained Chinese ostman roblems, Comuters & Mathematics with Alications, Vol. 44, Xu, J., Yan, F. and Li, S. (2011) Vehicle routing otimization with soft time windows in a fuzzy random environment, Transortation Research Part E: Logistics and Transortation Review, Vol. 47, Yu, Y., Chen, H. and Chu, F. (2008) A new model and hybrid aroach for large scale inventory routing roblems, Euroean Journal of Oerational Research, Vol. 189, Zheng, Y. and Liu, B. (2006) Fuzzy icle routing model with credibility measure and its hybrid intelligent algorithm, Alied Mathematics and Comutation, Vol. 176, Zimmermann, H. J. (1978) Fuzzy rogramming and linear rogramming with several objective functions, Fuzzy Sets and Systems, Vol. 1,

AN INTEGER LINEAR MODEL FOR GENERAL ARC ROUTING PROBLEMS

AN INTEGER LINEAR MODEL FOR GENERAL ARC ROUTING PROBLEMS AN INTEGER LINEAR MODEL FOR GENERAL ARC ROUTING PROBLEMS Philie LACOMME, Christian PRINS, Wahiba RAMDANE-CHERIF Université de Technologie de Troyes, Laboratoire d Otimisation des Systèmes Industriels (LOSI)

More information

Sensitivity of multi-product two-stage economic lotsizing models and their dependency on change-over and product cost ratio s

Sensitivity of multi-product two-stage economic lotsizing models and their dependency on change-over and product cost ratio s Sensitivity two stage EOQ model 1 Sensitivity of multi-roduct two-stage economic lotsizing models and their deendency on change-over and roduct cost ratio s Frank Van den broecke, El-Houssaine Aghezzaf,

More information

IMS Network Deployment Cost Optimization Based on Flow-Based Traffic Model

IMS Network Deployment Cost Optimization Based on Flow-Based Traffic Model IMS Network Deloyment Cost Otimization Based on Flow-Based Traffic Model Jie Xiao, Changcheng Huang and James Yan Deartment of Systems and Comuter Engineering, Carleton University, Ottawa, Canada {jiexiao,

More information

A BICRITERION STEINER TREE PROBLEM ON GRAPH. Mirko VUJO[EVI], Milan STANOJEVI] 1. INTRODUCTION

A BICRITERION STEINER TREE PROBLEM ON GRAPH. Mirko VUJO[EVI], Milan STANOJEVI] 1. INTRODUCTION Yugoslav Journal of Oerations Research (00), umber, 5- A BICRITERIO STEIER TREE PROBLEM O GRAPH Mirko VUJO[EVI], Milan STAOJEVI] Laboratory for Oerational Research, Faculty of Organizational Sciences University

More information

Sensitivity Analysis for an Optimal Routing Policy in an Ad Hoc Wireless Network

Sensitivity Analysis for an Optimal Routing Policy in an Ad Hoc Wireless Network 1 Sensitivity Analysis for an Otimal Routing Policy in an Ad Hoc Wireless Network Tara Javidi and Demosthenis Teneketzis Deartment of Electrical Engineering and Comuter Science University of Michigan Ann

More information

A Bi-objective VRPTW Model for Non-adjacent Products

A Bi-objective VRPTW Model for Non-adjacent Products American Journal of Science, Engineering and Technology 2017; 2(1): 1-5 htt://wwwscienceublishinggroucom/j/ajset doi: 1011648/jajset2017020111 A Bi-objective VRPTW Model for Non-adjacent Products Mohammad

More information

Improved heuristics for the single machine scheduling problem with linear early and quadratic tardy penalties

Improved heuristics for the single machine scheduling problem with linear early and quadratic tardy penalties Imroved heuristics for the single machine scheduling roblem with linear early and quadratic tardy enalties Jorge M. S. Valente* LIAAD INESC Porto LA, Faculdade de Economia, Universidade do Porto Postal

More information

Applying the fuzzy preference relation to the software selection

Applying the fuzzy preference relation to the software selection Proceedings of the 007 WSEAS International Conference on Comuter Engineering and Alications, Gold Coast, Australia, January 17-19, 007 83 Alying the fuzzy reference relation to the software selection TIEN-CHIN

More information

Process and Measurement System Capability Analysis

Process and Measurement System Capability Analysis Process and Measurement System aability Analysis Process caability is the uniformity of the rocess. Variability is a measure of the uniformity of outut. Assume that a rocess involves a quality characteristic

More information

A DEA-bases Approach for Multi-objective Design of Attribute Acceptance Sampling Plans

A DEA-bases Approach for Multi-objective Design of Attribute Acceptance Sampling Plans Available online at htt://ijdea.srbiau.ac.ir Int. J. Data Enveloment Analysis (ISSN 2345-458X) Vol.5, No.2, Year 2017 Article ID IJDEA-00422, 12 ages Research Article International Journal of Data Enveloment

More information

Application of Fuzzy X S Charts for Solder Paste Thickness

Application of Fuzzy X S Charts for Solder Paste Thickness Global Journal of Pure and Alied Mathematics ISSN 0973-1768 Volume 12 Number 5 (2016) 4299-4315 Research India Publications htt://wwwriublicationcom/gjamhtm Alication of Fuzzy X S Charts for Solder Paste

More information

An Efficient Video Program Delivery algorithm in Tree Networks*

An Efficient Video Program Delivery algorithm in Tree Networks* 3rd International Symosium on Parallel Architectures, Algorithms and Programming An Efficient Video Program Delivery algorithm in Tree Networks* Fenghang Yin 1 Hong Shen 1,2,** 1 Deartment of Comuter Science,

More information

An Efficient Coding Method for Coding Region-of-Interest Locations in AVS2

An Efficient Coding Method for Coding Region-of-Interest Locations in AVS2 An Efficient Coding Method for Coding Region-of-Interest Locations in AVS2 Mingliang Chen 1, Weiyao Lin 1*, Xiaozhen Zheng 2 1 Deartment of Electronic Engineering, Shanghai Jiao Tong University, China

More information

Flexible Manufacturing Cell Formation of Processing Workshop based on Intelligent Computing

Flexible Manufacturing Cell Formation of Processing Workshop based on Intelligent Computing 27 A ublication of CHEMICAL ENGINEERINGTRANSACTIONS VOL. 55, 206 Guest Editors:Tichun Wang, Hongyang Zhang, Lei Tian Coyright 206, AIDIC Servizi S.r.l., ISBN978-88-95608-46-4; ISSN 2283-926 The Italian

More information

OMNI: An Efficient Overlay Multicast. Infrastructure for Real-time Applications

OMNI: An Efficient Overlay Multicast. Infrastructure for Real-time Applications OMNI: An Efficient Overlay Multicast Infrastructure for Real-time Alications Suman Banerjee, Christoher Kommareddy, Koushik Kar, Bobby Bhattacharjee, Samir Khuller Abstract We consider an overlay architecture

More information

Directed File Transfer Scheduling

Directed File Transfer Scheduling Directed File Transfer Scheduling Weizhen Mao Deartment of Comuter Science The College of William and Mary Williamsburg, Virginia 387-8795 wm@cs.wm.edu Abstract The file transfer scheduling roblem was

More information

EE678 Application Presentation Content Based Image Retrieval Using Wavelets

EE678 Application Presentation Content Based Image Retrieval Using Wavelets EE678 Alication Presentation Content Based Image Retrieval Using Wavelets Grou Members: Megha Pandey megha@ee. iitb.ac.in 02d07006 Gaurav Boob gb@ee.iitb.ac.in 02d07008 Abstract: We focus here on an effective

More information

Matlab Virtual Reality Simulations for optimizations and rapid prototyping of flexible lines systems

Matlab Virtual Reality Simulations for optimizations and rapid prototyping of flexible lines systems Matlab Virtual Reality Simulations for otimizations and raid rototying of flexible lines systems VAMVU PETRE, BARBU CAMELIA, POP MARIA Deartment of Automation, Comuters, Electrical Engineering and Energetics

More information

Interactive Image Segmentation

Interactive Image Segmentation Interactive Image Segmentation Fahim Mannan (260 266 294) Abstract This reort resents the roject work done based on Boykov and Jolly s interactive grah cuts based N-D image segmentation algorithm([1]).

More information

An empirical analysis of loopy belief propagation in three topologies: grids, small-world networks and random graphs

An empirical analysis of loopy belief propagation in three topologies: grids, small-world networks and random graphs An emirical analysis of looy belief roagation in three toologies: grids, small-world networks and random grahs R. Santana, A. Mendiburu and J. A. Lozano Intelligent Systems Grou Deartment of Comuter Science

More information

Evaluation of Metaheuristics for Robust Graph Coloring Problem

Evaluation of Metaheuristics for Robust Graph Coloring Problem Proceedings of the Federated Conference on Comuter Science and Information Systems. 519 524 DOI: 10.15439/2015F293 ACSIS, Vol. 5 Evaluation of Metaheuristics for Robust Grah Coloring Problem Zbigniew Kokosiński

More information

Extracting Optimal Paths from Roadmaps for Motion Planning

Extracting Optimal Paths from Roadmaps for Motion Planning Extracting Otimal Paths from Roadmas for Motion Planning Jinsuck Kim Roger A. Pearce Nancy M. Amato Deartment of Comuter Science Texas A&M University College Station, TX 843 jinsuckk,ra231,amato @cs.tamu.edu

More information

The degree constrained k-cardinality minimum spanning tree problem: a lexisearch

The degree constrained k-cardinality minimum spanning tree problem: a lexisearch Decision Science Letters 7 (2018) 301 310 Contents lists available at GrowingScience Decision Science Letters homeage: www.growingscience.com/dsl The degree constrained k-cardinality minimum sanning tree

More information

A Novel Iris Segmentation Method for Hand-Held Capture Device

A Novel Iris Segmentation Method for Hand-Held Capture Device A Novel Iris Segmentation Method for Hand-Held Cature Device XiaoFu He and PengFei Shi Institute of Image Processing and Pattern Recognition, Shanghai Jiao Tong University, Shanghai 200030, China {xfhe,

More information

Analyzing Borders Between Partially Contradicting Fuzzy Classification Rules

Analyzing Borders Between Partially Contradicting Fuzzy Classification Rules Analyzing Borders Between Partially Contradicting Fuzzy Classification Rules Andreas Nürnberger, Aljoscha Klose, Rudolf Kruse University of Magdeburg, Faculty of Comuter Science 39106 Magdeburg, Germany

More information

A GPU Heterogeneous Cluster Scheduling Model for Preventing Temperature Heat Island

A GPU Heterogeneous Cluster Scheduling Model for Preventing Temperature Heat Island A GPU Heterogeneous Cluster Scheduling Model for Preventing Temerature Heat Island Yun-Peng CAO 1,2,a and Hai-Feng WANG 1,2 1 School of Information Science and Engineering, Linyi University, Linyi Shandong,

More information

Use of Multivariate Statistical Analysis in the Modelling of Chromatographic Processes

Use of Multivariate Statistical Analysis in the Modelling of Chromatographic Processes Use of Multivariate Statistical Analysis in the Modelling of Chromatograhic Processes Simon Edwards-Parton 1, Nigel itchener-hooker 1, Nina hornhill 2, Daniel Bracewell 1, John Lidell 3 Abstract his aer

More information

The Scalability and Performance of Common Vector Solution to Generalized Label Continuity Constraint in Hybrid Optical/Packet Networks

The Scalability and Performance of Common Vector Solution to Generalized Label Continuity Constraint in Hybrid Optical/Packet Networks The Scalability and Performance of Common Vector Solution to Generalized abel Continuity Constraint in Hybrid Otical/Pacet etwors Shujia Gong and Ban Jabbari {sgong, bjabbari}@gmuedu George Mason University

More information

A Study of Protocols for Low-Latency Video Transport over the Internet

A Study of Protocols for Low-Latency Video Transport over the Internet A Study of Protocols for Low-Latency Video Transort over the Internet Ciro A. Noronha, Ph.D. Cobalt Digital Santa Clara, CA ciro.noronha@cobaltdigital.com Juliana W. Noronha University of California, Davis

More information

Open Vehicle Routing Problem Optimization under Realistic Assumptions

Open Vehicle Routing Problem Optimization under Realistic Assumptions Int. J. Research in Industrial Engineering, pp. 46-55 Volume 3, Number 2, 204 International Journal of Research in Industrial Engineering www.nvlscience.com Open Vehicle Routing Problem Optimization under

More information

Implementation of Evolvable Fuzzy Hardware for Packet Scheduling Through Online Context Switching

Implementation of Evolvable Fuzzy Hardware for Packet Scheduling Through Online Context Switching Imlementation of Evolvable Fuzzy Hardware for Packet Scheduling Through Online Context Switching Ju Hui Li, eng Hiot Lim and Qi Cao School of EEE, Block S Nanyang Technological University Singaore 639798

More information

Modeling Reliable Broadcast of Data Buffer over Wireless Networks

Modeling Reliable Broadcast of Data Buffer over Wireless Networks JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 3, 799-810 (016) Short Paer Modeling Reliable Broadcast of Data Buffer over Wireless Networs Deartment of Comuter Engineering Yeditee University Kayışdağı,

More information

Multicommodity Network Flow - Methods and Applications

Multicommodity Network Flow - Methods and Applications Multicommodity Network Flow - Methods and Alications Joe Lindström Linköing University joeli89@student.liu.se Abstract This survey describes the Multicommodity Network Flow roblem, a network flow roblem

More information

Building Better Nurse Scheduling Algorithms

Building Better Nurse Scheduling Algorithms Building Better Nurse Scheduling Algorithms Annals of Oerations Research, 128, 159-177, 2004. Dr Uwe Aickelin Dr Paul White School of Comuter Science University of the West of England University of Nottingham

More information

Randomized algorithms: Two examples and Yao s Minimax Principle

Randomized algorithms: Two examples and Yao s Minimax Principle Randomized algorithms: Two examles and Yao s Minimax Princile Maximum Satisfiability Consider the roblem Maximum Satisfiability (MAX-SAT). Bring your knowledge u-to-date on the Satisfiability roblem. Maximum

More information

Patterned Wafer Segmentation

Patterned Wafer Segmentation atterned Wafer Segmentation ierrick Bourgeat ab, Fabrice Meriaudeau b, Kenneth W. Tobin a, atrick Gorria b a Oak Ridge National Laboratory,.O.Box 2008, Oak Ridge, TN 37831-6011, USA b Le2i Laboratory Univ.of

More information

Swift Template Matching Based on Equivalent Histogram

Swift Template Matching Based on Equivalent Histogram Swift emlate Matching ased on Equivalent istogram Wangsheng Yu, Xiaohua ian, Zhiqiang ou * elecommunications Engineering Institute Air Force Engineering University Xi an, PR China *corresonding author:

More information

Mining Association rules with Dynamic and Collective Support Thresholds

Mining Association rules with Dynamic and Collective Support Thresholds Mining Association rules with Dynamic and Collective Suort Thresholds C S Kanimozhi Selvi and A Tamilarasi Abstract Mining association rules is an imortant task in data mining. It discovers the hidden,

More information

J. Parallel Distrib. Comput.

J. Parallel Distrib. Comput. J. Parallel Distrib. Comut. 71 (2011) 288 301 Contents lists available at ScienceDirect J. Parallel Distrib. Comut. journal homeage: www.elsevier.com/locate/jdc Quality of security adatation in arallel

More information

A Parallel Algorithm for Constructing Obstacle-Avoiding Rectilinear Steiner Minimal Trees on Multi-Core Systems

A Parallel Algorithm for Constructing Obstacle-Avoiding Rectilinear Steiner Minimal Trees on Multi-Core Systems A Parallel Algorithm for Constructing Obstacle-Avoiding Rectilinear Steiner Minimal Trees on Multi-Core Systems Cheng-Yuan Chang and I-Lun Tseng Deartment of Comuter Science and Engineering Yuan Ze University,

More information

AUTOMATIC GENERATION OF HIGH THROUGHPUT ENERGY EFFICIENT STREAMING ARCHITECTURES FOR ARBITRARY FIXED PERMUTATIONS. Ren Chen and Viktor K.

AUTOMATIC GENERATION OF HIGH THROUGHPUT ENERGY EFFICIENT STREAMING ARCHITECTURES FOR ARBITRARY FIXED PERMUTATIONS. Ren Chen and Viktor K. inuts er clock cycle Streaming ermutation oututs er clock cycle AUTOMATIC GENERATION OF HIGH THROUGHPUT ENERGY EFFICIENT STREAMING ARCHITECTURES FOR ARBITRARY FIXED PERMUTATIONS Ren Chen and Viktor K.

More information

Efficient Processing of Top-k Dominating Queries on Multi-Dimensional Data

Efficient Processing of Top-k Dominating Queries on Multi-Dimensional Data Efficient Processing of To-k Dominating Queries on Multi-Dimensional Data Man Lung Yiu Deartment of Comuter Science Aalborg University DK-922 Aalborg, Denmark mly@cs.aau.dk Nikos Mamoulis Deartment of

More information

Parametric Optimization in WEDM of WC-Co Composite by Neuro-Genetic Technique

Parametric Optimization in WEDM of WC-Co Composite by Neuro-Genetic Technique Parametric Otimization in WEDM of WC-Co Comosite by Neuro-Genetic Technique P. Saha*, P. Saha, and S. K. Pal Abstract The resent work does a multi-objective otimization in wire electro-discharge machining

More information

A simulated Linear Mixture Model to Improve Classification Accuracy of Satellite. Data Utilizing Degradation of Atmospheric Effect

A simulated Linear Mixture Model to Improve Classification Accuracy of Satellite. Data Utilizing Degradation of Atmospheric Effect A simulated Linear Mixture Model to Imrove Classification Accuracy of Satellite Data Utilizing Degradation of Atmosheric Effect W.M Elmahboub Mathematics Deartment, School of Science, Hamton University

More information

A CLASS OF STRUCTURED LDPC CODES WITH LARGE GIRTH

A CLASS OF STRUCTURED LDPC CODES WITH LARGE GIRTH A CLASS OF STRUCTURED LDPC CODES WITH LARGE GIRTH Jin Lu, José M. F. Moura, and Urs Niesen Deartment of Electrical and Comuter Engineering Carnegie Mellon University, Pittsburgh, PA 15213 jinlu, moura@ece.cmu.edu

More information

Grouping of Patches in Progressive Radiosity

Grouping of Patches in Progressive Radiosity Grouing of Patches in Progressive Radiosity Arjan J.F. Kok * Abstract The radiosity method can be imroved by (adatively) grouing small neighboring atches into grous. Comutations normally done for searate

More information

Single character type identification

Single character type identification Single character tye identification Yefeng Zheng*, Changsong Liu, Xiaoqing Ding Deartment of Electronic Engineering, Tsinghua University Beijing 100084, P.R. China ABSTRACT Different character recognition

More information

An Efficient End-to-End QoS supporting Algorithm in NGN Using Optimal Flows and Measurement Feed-back for Ubiquitous and Distributed Applications

An Efficient End-to-End QoS supporting Algorithm in NGN Using Optimal Flows and Measurement Feed-back for Ubiquitous and Distributed Applications An Efficient End-to-End QoS suorting Algorithm in NGN Using Otimal Flows and Measurement Feed-back for Ubiquitous and Distributed Alications Se Youn Ban, Seong Gon Choi 2, Jun Kyun Choi Information and

More information

TCP VON: Joint Congestion Control and Online Network Coding for Wireless Networks

TCP VON: Joint Congestion Control and Online Network Coding for Wireless Networks TCP VON: Joint Congestion Control and Online Network Coding for Wireless Networks Wei Bao, Vahid Shah-Mansouri, Vincent W.S. Wong, and Victor C.M. Leung Deartment of Electrical and Comuter Engineering

More information

Chapter 7, Part B Sampling and Sampling Distributions

Chapter 7, Part B Sampling and Sampling Distributions Slides Preared by JOHN S. LOUCKS St. Edward s University Slide 1 Chater 7, Part B Samling and Samling Distributions Samling Distribution of Proerties of Point Estimators Other Samling Methods Slide 2 Samling

More information

Expert Systems with Applications

Expert Systems with Applications Exert Systems with Alications 38 (2011) 10803 10811 Contents lists available at ScienceDirect Exert Systems with Alications journal homeage: www.elsevier.com/locate/eswa An integrated fuzzy TOPSIS and

More information

Face Recognition Based on Wavelet Transform and Adaptive Local Binary Pattern

Face Recognition Based on Wavelet Transform and Adaptive Local Binary Pattern Face Recognition Based on Wavelet Transform and Adative Local Binary Pattern Abdallah Mohamed 1,2, and Roman Yamolskiy 1 1 Comuter Engineering and Comuter Science, University of Louisville, Louisville,

More information

Fuzzy Logic and ANFIS based Image Centroid Tracking and Filtering Schemes

Fuzzy Logic and ANFIS based Image Centroid Tracking and Filtering Schemes Fuzzy Logic and ANFIS based Image Centroid Tracking and Filtering Schemes Parimala, A., Asstt. Prof., Det. of Telecommunication, MSRIT; Jain University Research Scholar, Bangalore. Raol, J. R., Prof. Emeritus,

More information

Leak Detection Modeling and Simulation for Oil Pipeline with Artificial Intelligence Method

Leak Detection Modeling and Simulation for Oil Pipeline with Artificial Intelligence Method ITB J. Eng. Sci. Vol. 39 B, No. 1, 007, 1-19 1 Leak Detection Modeling and Simulation for Oil Pieline with Artificial Intelligence Method Pudjo Sukarno 1, Kuntjoro Adji Sidarto, Amoranto Trisnobudi 3,

More information

Experimental Comparison of Shortest Path Approaches for Timetable Information

Experimental Comparison of Shortest Path Approaches for Timetable Information Exerimental Comarison of Shortest Path roaches for Timetable Information Evangelia Pyrga Frank Schulz Dorothea Wagner Christos Zaroliagis bstract We consider two aroaches that model timetable information

More information

Statistical Detection for Network Flooding Attacks

Statistical Detection for Network Flooding Attacks Statistical Detection for Network Flooding Attacks C. S. Chao, Y. S. Chen, and A.C. Liu Det. of Information Engineering, Feng Chia Univ., Taiwan 407, OC. Email: cschao@fcu.edu.tw Abstract In order to meet

More information

Support Vector Machines for Face Authentication

Support Vector Machines for Face Authentication Suort Vector Machines for Face Authentication K Jonsson 1 2, J Kittler 1,YPLi 1 and J Matas 1 2 1 CVSSP, University of Surrey Guildford, Surrey GU2 5XH, United Kingdom 2 CMP, Czech Technical University

More information

Improved Image Super-Resolution by Support Vector Regression

Improved Image Super-Resolution by Support Vector Regression Proceedings of International Joint Conference on Neural Networks, San Jose, California, USA, July 3 August 5, 0 Imroved Image Suer-Resolution by Suort Vector Regression Le An and Bir Bhanu Abstract Suort

More information

Face Recognition Using Legendre Moments

Face Recognition Using Legendre Moments Face Recognition Using Legendre Moments Dr.S.Annadurai 1 A.Saradha Professor & Head of CSE & IT Research scholar in CSE Government College of Technology, Government College of Technology, Coimbatore, Tamilnadu,

More information

Distributed Estimation from Relative Measurements in Sensor Networks

Distributed Estimation from Relative Measurements in Sensor Networks Distributed Estimation from Relative Measurements in Sensor Networks #Prabir Barooah and João P. Hesanha Abstract We consider the roblem of estimating vectorvalued variables from noisy relative measurements.

More information

Improving Trust Estimates in Planning Domains with Rare Failure Events

Improving Trust Estimates in Planning Domains with Rare Failure Events Imroving Trust Estimates in Planning Domains with Rare Failure Events Colin M. Potts and Kurt D. Krebsbach Det. of Mathematics and Comuter Science Lawrence University Aleton, Wisconsin 54911 USA {colin.m.otts,

More information

Space-efficient Region Filling in Raster Graphics

Space-efficient Region Filling in Raster Graphics "The Visual Comuter: An International Journal of Comuter Grahics" (submitted July 13, 1992; revised December 7, 1992; acceted in Aril 16, 1993) Sace-efficient Region Filling in Raster Grahics Dominik Henrich

More information

Protecting Mobile Agents against Malicious Host Attacks Using Threat Diagnostic AND/OR Tree

Protecting Mobile Agents against Malicious Host Attacks Using Threat Diagnostic AND/OR Tree Protecting Mobile Agents against Malicious Host Attacks Using Threat Diagnostic AND/OR Tree Magdy Saeb, Meer Hamza, Ashraf Soliman. Arab Academy for Science, Technology & Maritime Transort Comuter Engineering

More information

The Research on Curling Track Empty Value Fill Algorithm Based on Similar Forecast

The Research on Curling Track Empty Value Fill Algorithm Based on Similar Forecast Research Journal of Alied Sciences, Engineering and Technology 6(8): 1472-1478, 2013 ISSN: 2040-7459; e-issn: 2040-7467 Maxwell Scientific Organization, 2013 Submitted: October 31, 2012 Acceted: January

More information

A joint multi-layer planning algorithm for IP over flexible optical networks

A joint multi-layer planning algorithm for IP over flexible optical networks A joint multi-layer lanning algorithm for IP over flexible otical networks Vasileios Gkamas, Konstantinos Christodoulooulos, Emmanouel Varvarigos Comuter Engineering and Informatics Deartment, University

More information

Incremental Planning of Multi-layer Elastic Optical Networks

Incremental Planning of Multi-layer Elastic Optical Networks Incremental Planning of Multi-layer Elastic Otical Networks P. Paanikolaou, K. Christodoulooulos, and E. Varvarigos School of Electrical and Comuter Engineering, National Technical University of Athens,

More information

Privacy Preserving Moving KNN Queries

Privacy Preserving Moving KNN Queries Privacy Preserving Moving KNN Queries arxiv:4.76v [cs.db] 4 Ar Tanzima Hashem Lars Kulik Rui Zhang National ICT Australia, Deartment of Comuter Science and Software Engineering University of Melbourne,

More information

SEARCH ENGINE MANAGEMENT

SEARCH ENGINE MANAGEMENT e-issn 2455 1392 Volume 2 Issue 5, May 2016. 254 259 Scientific Journal Imact Factor : 3.468 htt://www.ijcter.com SEARCH ENGINE MANAGEMENT Abhinav Sinha Kalinga Institute of Industrial Technology, Bhubaneswar,

More information

Each copy of any part of a JSTOR transmission must contain the same copyright notice that appears on the screen or printed page of such transmission.

Each copy of any part of a JSTOR transmission must contain the same copyright notice that appears on the screen or printed page of such transmission. An Interactive Programming Method for Solving the Multile Criteria Problem Author(s): Stanley Zionts and Jyrki Wallenius Source: Management Science, Vol. 22, No. 6 (Feb., 1976),. 652-663 Published by:

More information

Source Coding and express these numbers in a binary system using M log

Source Coding and express these numbers in a binary system using M log Source Coding 30.1 Source Coding Introduction We have studied how to transmit digital bits over a radio channel. We also saw ways that we could code those bits to achieve error correction. Bandwidth is

More information

APPLICATION OF PARTICLE FILTERS TO MAP-MATCHING ALGORITHM

APPLICATION OF PARTICLE FILTERS TO MAP-MATCHING ALGORITHM APPLICATION OF PARTICLE FILTERS TO MAP-MATCHING ALGORITHM Pavel Davidson 1, Jussi Collin 2, and Jarmo Taala 3 Deartment of Comuter Systems, Tamere University of Technology, Finland e-mail: avel.davidson@tut.fi

More information

Mobile Robot Fuzzy Control near Obstacles

Mobile Robot Fuzzy Control near Obstacles Mobile Robot Fuzzy Control near Obstacles Assoc. Prof. PhD.Eng. ILIE DIACONU diaconu@robotics.ucv.ro Lect.Eng. NICU BIZDOACA nicu@robotics.ucv.ro University of Craiova, Faculty of Control, Comuters and

More information

A Morphological LiDAR Points Cloud Filtering Method based on GPGPU

A Morphological LiDAR Points Cloud Filtering Method based on GPGPU A Morhological LiDAR Points Cloud Filtering Method based on GPGPU Shuo Li 1, Hui Wang 1, Qiuhe Ma 1 and Xuan Zha 2 1 Zhengzhou Institute of Surveying & Maing, No.66, Longhai Middle Road, Zhengzhou, China

More information

Efficient Parallel Hierarchical Clustering

Efficient Parallel Hierarchical Clustering Efficient Parallel Hierarchical Clustering Manoranjan Dash 1,SimonaPetrutiu, and Peter Scheuermann 1 Deartment of Information Systems, School of Comuter Engineering, Nanyang Technological University, Singaore

More information

The Redundancy Allocation Problem (RAP) is a well-known and complex reliability design problem that was first introduced by

The Redundancy Allocation Problem (RAP) is a well-known and complex reliability design problem that was first introduced by Research Article (wileyonlinelibrary.com) DOI: 10.1002/qre.1545 Published online 3 July 2013 in Wiley Online Library A Decision Suort System for Solving Multi- Objective Redundancy Allocation Problems

More information

Bayesian Oil Spill Segmentation of SAR Images via Graph Cuts 1

Bayesian Oil Spill Segmentation of SAR Images via Graph Cuts 1 Bayesian Oil Sill Segmentation of SAR Images via Grah Cuts 1 Sónia Pelizzari and José M. Bioucas-Dias Instituto de Telecomunicações, I.S.T., TULisbon,Lisboa, Portugal sonia@lx.it.t, bioucas@lx.it.t Abstract.

More information

High Quality Offset Printing An Evolutionary Approach

High Quality Offset Printing An Evolutionary Approach High Quality Offset Printing An Evolutionary Aroach Ralf Joost Institute of Alied Microelectronics and omuter Engineering University of Rostock Rostock, 18051, Germany +49 381 498 7272 ralf.joost@uni-rostock.de

More information

Equality-Based Translation Validator for LLVM

Equality-Based Translation Validator for LLVM Equality-Based Translation Validator for LLVM Michael Ste, Ross Tate, and Sorin Lerner University of California, San Diego {mste,rtate,lerner@cs.ucsd.edu Abstract. We udated our Peggy tool, reviously resented

More information

A New and Efficient Algorithm-Based Fault Tolerance Scheme for A Million Way Parallelism

A New and Efficient Algorithm-Based Fault Tolerance Scheme for A Million Way Parallelism A New and Efficient Algorithm-Based Fault Tolerance Scheme for A Million Way Parallelism Erlin Yao, Mingyu Chen, Rui Wang, Wenli Zhang, Guangming Tan Key Laboratory of Comuter System and Architecture Institute

More information

Ensemble Learning Based on Parametric Triangular Norms

Ensemble Learning Based on Parametric Triangular Norms Send Orders for Rerints to rerints@benthamscience.ae The Oen Automation and Control Systems Journal, 2014, 6, 997-1003 997 Ensemble Learning Based on Parametric Triangular Norms Oen Access Pengtao Jia

More information

An Efficient VLSI Architecture for Adaptive Rank Order Filter for Image Noise Removal

An Efficient VLSI Architecture for Adaptive Rank Order Filter for Image Noise Removal International Journal of Information and Electronics Engineering, Vol. 1, No. 1, July 011 An Efficient VLSI Architecture for Adative Rank Order Filter for Image Noise Removal M. C Hanumantharaju, M. Ravishankar,

More information

AN ANALYTICAL MODEL DESCRIBING THE RELATIONSHIPS BETWEEN LOGIC ARCHITECTURE AND FPGA DENSITY

AN ANALYTICAL MODEL DESCRIBING THE RELATIONSHIPS BETWEEN LOGIC ARCHITECTURE AND FPGA DENSITY AN ANALYTICAL MODEL DESCRIBING THE RELATIONSHIPS BETWEEN LOGIC ARCHITECTURE AND FPGA DENSITY Andrew Lam 1, Steven J.E. Wilton 1, Phili Leong 2, Wayne Luk 3 1 Elec. and Com. Engineering 2 Comuter Science

More information

Source-to-Source Code Generation Based on Pattern Matching and Dynamic Programming

Source-to-Source Code Generation Based on Pattern Matching and Dynamic Programming Source-to-Source Code Generation Based on Pattern Matching and Dynamic Programming Weimin Chen, Volker Turau TR-93-047 August, 1993 Abstract This aer introduces a new technique for source-to-source code

More information

AUTOMATIC EXTRACTION OF BUILDING OUTLINE FROM HIGH RESOLUTION AERIAL IMAGERY

AUTOMATIC EXTRACTION OF BUILDING OUTLINE FROM HIGH RESOLUTION AERIAL IMAGERY AUTOMATIC EXTRACTION OF BUILDING OUTLINE FROM HIGH RESOLUTION AERIAL IMAGERY Yandong Wang EagleView Technology Cor. 5 Methodist Hill Dr., Rochester, NY 1463, the United States yandong.wang@ictometry.com

More information

A Symmetric FHE Scheme Based on Linear Algebra

A Symmetric FHE Scheme Based on Linear Algebra A Symmetric FHE Scheme Based on Linear Algebra Iti Sharma University College of Engineering, Comuter Science Deartment. itisharma.uce@gmail.com Abstract FHE is considered to be Holy Grail of cloud comuting.

More information

To appear in IEEE TKDE Title: Efficient Skyline and Top-k Retrieval in Subspaces Keywords: Skyline, Top-k, Subspace, B-tree

To appear in IEEE TKDE Title: Efficient Skyline and Top-k Retrieval in Subspaces Keywords: Skyline, Top-k, Subspace, B-tree To aear in IEEE TKDE Title: Efficient Skyline and To-k Retrieval in Subsaces Keywords: Skyline, To-k, Subsace, B-tree Contact Author: Yufei Tao (taoyf@cse.cuhk.edu.hk) Deartment of Comuter Science and

More information

Learning Robust Locality Preserving Projection via p-order Minimization

Learning Robust Locality Preserving Projection via p-order Minimization Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence Learning Robust Locality Preserving Projection via -Order Minimization Hua Wang, Feiing Nie, Heng Huang Deartment of Electrical

More information

A Model-Adaptable MOSFET Parameter Extraction System

A Model-Adaptable MOSFET Parameter Extraction System A Model-Adatable MOSFET Parameter Extraction System Masaki Kondo Hidetoshi Onodera Keikichi Tamaru Deartment of Electronics Faculty of Engineering, Kyoto University Kyoto 66-1, JAPAN Tel: +81-7-73-313

More information

Figure 8.1: Home age taken from the examle health education site (htt:// Setember 14, 2001). 201

Figure 8.1: Home age taken from the examle health education site (htt://  Setember 14, 2001). 201 200 Chater 8 Alying the Web Interface Profiles: Examle Web Site Assessment 8.1 Introduction This chater describes the use of the rofiles develoed in Chater 6 to assess and imrove the quality of an examle

More information

Ad Hoc Networks. Latency-minimizing data aggregation in wireless sensor networks under physical interference model

Ad Hoc Networks. Latency-minimizing data aggregation in wireless sensor networks under physical interference model Ad Hoc Networks (4) 5 68 Contents lists available at SciVerse ScienceDirect Ad Hoc Networks journal homeage: www.elsevier.com/locate/adhoc Latency-minimizing data aggregation in wireless sensor networks

More information

EP2200 Performance analysis of Communication networks. Topic 3 Congestion and rate control

EP2200 Performance analysis of Communication networks. Topic 3 Congestion and rate control EP00 Performance analysis of Communication networks Toic 3 Congestion and rate control Congestion, rate and error control Lecture material: Bertsekas, Gallager, Data networks, 6.- I. Kay, Stochastic modeling,

More information

Constrained Path Optimisation for Underground Mine Layout

Constrained Path Optimisation for Underground Mine Layout Constrained Path Otimisation for Underground Mine Layout M. Brazil P.A. Grossman D.H. Lee J.H. Rubinstein D.A. Thomas N.C. Wormald Abstract The major infrastructure comonent reuired to develo an underground

More information

Near-Optimal Routing Lookups with Bounded Worst Case Performance

Near-Optimal Routing Lookups with Bounded Worst Case Performance Near-Otimal Routing Lookus with Bounded Worst Case Performance Pankaj Guta Balaji Prabhakar Stehen Boyd Deartments of Electrical Engineering and Comuter Science Stanford University CA 9430 ankaj@stanfordedu

More information

Vehicle Logo Recognition Using Modest AdaBoost and Radial Tchebichef Moments

Vehicle Logo Recognition Using Modest AdaBoost and Radial Tchebichef Moments Proceedings of 0 4th International Conference on Machine Learning and Comuting IPCSIT vol. 5 (0) (0) IACSIT Press, Singaore Vehicle Logo Recognition Using Modest AdaBoost and Radial Tchebichef Moments

More information

Cross products. p 2 p. p p1 p2. p 1. Line segments The convex combination of two distinct points p1 ( x1, such that for some real number with 0 1,

Cross products. p 2 p. p p1 p2. p 1. Line segments The convex combination of two distinct points p1 ( x1, such that for some real number with 0 1, CHAPTER 33 Comutational Geometry Is the branch of comuter science that studies algorithms for solving geometric roblems. Has alications in many fields, including comuter grahics robotics, VLSI design comuter

More information

High Quality Offset Printing An Evolutionary Approach

High Quality Offset Printing An Evolutionary Approach High Quality Offset Printing An Evolutionary Aroach Ralf Joost Institute of Alied Microelectronics and omuter Engineering University of Rostock Rostock, 18051, Germany +49 381 498 7272 ralf.joost@uni-rostock.de

More information

Image Segmentation Using Topological Persistence

Image Segmentation Using Topological Persistence Image Segmentation Using Toological Persistence David Letscher and Jason Fritts Saint Louis University Deartment of Mathematics and Comuter Science {letscher, jfritts}@slu.edu Abstract. This aer resents

More information

SPARSE SIGNAL REPRESENTATION FOR COMPLEX-VALUED IMAGING Sadegh Samadi 1, M üjdat Çetin 2, Mohammad Ali Masnadi-Shirazi 1

SPARSE SIGNAL REPRESENTATION FOR COMPLEX-VALUED IMAGING Sadegh Samadi 1, M üjdat Çetin 2, Mohammad Ali Masnadi-Shirazi 1 SPARSE SIGNAL REPRESENTATION FOR COMPLEX-VALUED IMAGING Sadegh Samadi 1, M üjdat Çetin, Mohammad Ali Masnadi-Shirazi 1 1. Shiraz University, Shiraz, Iran,. Sabanci University, Istanbul, Turkey ssamadi@shirazu.ac.ir,

More information

10. Parallel Methods for Data Sorting

10. Parallel Methods for Data Sorting 10. Parallel Methods for Data Sorting 10. Parallel Methods for Data Sorting... 1 10.1. Parallelizing Princiles... 10.. Scaling Parallel Comutations... 10.3. Bubble Sort...3 10.3.1. Sequential Algorithm...3

More information

Semi-Markov Process based Model for Performance Analysis of Wireless LANs

Semi-Markov Process based Model for Performance Analysis of Wireless LANs Semi-Markov Process based Model for Performance Analysis of Wireless LANs Murali Krishna Kadiyala, Diti Shikha, Ravi Pendse, and Neeraj Jaggi Deartment of Electrical Engineering and Comuter Science Wichita

More information