Particle swarm optimization algorithm for the berth allocationproblemChing-Jung Ting ⇑,Kun-Chih Wu,Hao ChouDepartment of Industrial Engineering and Management,Yuan Ze University,Chung-Li 32003,Taiwan,ROCa r t i c l e i n f o Keywords:Berth allocation problem Particle swarm optimization Container port Logisticsa b s t r a c tThe berth allocation is one of the major container port optimization problems.In both port operator’s and ocean carriers’perspective,the minimization of the time a ship at the berth may be considered as an objective with respect to port operations.This paper focuses on the discrete and dynamic berth allocation problem (BAP),which assigns ships to discrete berth positions and minimizes the total waiting times and handling times for all ships.We formulate a mixed integer programming (MIP)model for the BAP.Since BAP is a NP-hard problem,exact solution approaches cannot solve the instances of realistic size optimally within reasonable time.We propose a particle swarm optimization (PSO)approach to solve the BAP.The proposed PSO is tested with two sets of benchmark instances in different sizes from the literature.Exper-imental results show that the PSO algorithm is better than the other compared algorithms in terms of solution quality and computation time.Ó2013Elsevier Ltd.All rights reserved.1.IntroductionSince the introduction of the container in the 1950s,container-ships gradually become an important role in the global freight transportation.The world seaborne trade grew by an estimated 7%,taking the total of goods loaded to 8.4billion tons.World con-tainer port throughput increased by an estimated 13.3%to 531mil-lion 20-foot equivalent units (TEUs)in 2010(UNCTAD,2011).Thus,the terminal operation is an important part of the international trade of ocean shipping.Operations in a container terminal can be broken down into three functional systems:seaside operations,yard operations,and land-side operations (Theofanis,Boile,&Golias,2009).The first issue of seaside operations planning is the berth assignment to a set of vessels that have to be served within the planning hori-zon.One of the important objectives shared by the port operators and the ocean carriers is for the ships to leave the port as soon as possible.Thus,the container port authorities are forced to provide efficient and cost-effective services by utilizing the scarce berthing resources efficiently due to the fierce competition between ports.The berth allocation problem (BAP)is to allocate berths to a set of vessels scheduled to arrive at the port within the planning hori-zon in order to minimize their time spent at the port (the sum of their waiting and handling times).Bierwirth and Meisel (2010)classified the BAP according to the following spatial and temporal variations:(1)discrete versus continuous berthing space,(2)static versus dynamic vessel arrivals,(3)deterministic versus stochastic vessel handling time.The quay is divided into a set of berths,and each berth can be used by only one vessel at a time in the discrete case.In the continuous case,a vessel can occupy any arbi-trary position along the quay as long as the safety restriction be-tween vessels is considered.Static BAP assumes that all vessels already arrived at the port for the service,while vessels can arrive at any time during the planning horizon with known future arrival information in a dynamic BAP.The main focus of this research is the discrete berth allocation problem with dynamic vessel arrivals.The discrete BAP is NP hard (Cordeau,Laporte,Legato,&Moccia,2005).Exact solution approach cannot solve large scale realistic environments,heuristics algorithms are proposed in the literature to solve the BAP.In this paper,we investigated the use of particle swarm optimization (PSO)algorithm for the BAP.PSO is a popula-tion-based random search algorithm inspired by the social behav-ior of bird flocks and has been applied to solve many combinatorial optimization problems.We did not find any other work in the re-lated literature using PSO to tackle the BAP.Thus,it is worthwhile to evaluate the PSO for this task.The proposed PSO was tested with two sets of benchmark instances and compared with promising methods found in the literature to verify its efficiency.The remainders of the paper are organized as follows.In the next section we review the related literature.Section 3presents our problem with a mixed integer programming model.The proposed particle swarm optimization algorithm to tackle the discrete and dy-namic berth allocation problems is presented in Section 4.In Sec-tion 5computational experiments are performed and the results are presented.Finally,conclusions are summarized in Section 6.2.Literature reviewBerth allocation problem has attracted considerable practical and academic attention in recent years due to the needs of growing0957-4174/$-see front matter Ó2013Elsevier Ltd.All rights reserved./10.1016/j.eswa.2013.08.051Corresponding author.Tel.:+88634638800x2526;fax:+88634638907.E-mail address:ietingcj@.tw (C.-J.Ting).global supply chain.Different berth allocation models have been proposed in the literature.Steenken,Voß,and Stahlbock(2004), Vacca et al.(2008),Stahlbock and Voß(2008),and Bierwirth and Meisel(2010)provided a detailed review.We refer interested read-ers to the paper and references therein.In the following,we focus on the discrete and dynamic berth allocation problem.Other variants and possible extensions of the BAP will be briefly reviewed.Thurman(1989)proposed an optimization model for ship berthing plans at the US Naval Station ter,Brown, Lawphongpanich,and Thurman(1994)and Brown,Cormican, Lawphongpanich,and Widdis(1997)considered berth allocation models in naval ports and allowed two or more submarines to occupy a single berth position.Imai,Nagaiwa,and Chan(1997) formulated a static BAP as a nonlinear integer programming model to minimize the weighted sum of two conflicting objectives,berth performance and vessel dissatisfaction.Imai,Nishimura,and Papadimitriou(2001)introduced the dynamic BAP and solved the problem with a Lagrangian relaxation based heuristic. Nishimura,Imai,and Papadimitriou(2001)considered a dynamic BAP with multi-water depth configuration in a public berth system and berth dependent vessel handling ter,Imai,Nishimura, and Papadimitriou(2003)considered a dynamic BAP in which different vessels have different service priorities.Genetic algorithms were developed to solve the problem in Imai et al. (2001)and Nishimura et al.(2001).Cordeau et al.(2005)addressed a dynamic BAP with time windows in both discrete and continuous cases based upon data from a terminal in the Port of Gioia Tauro(Italy).The problem was formulated as a multiple depot vehicle routing problem with time windows(MDVRPTW),and solved by a tabu search heuristic. Monaco and Sammarra(2007)presented a compact formulation as a dynamic scheduling problem on unrelated parallel machines.The problem was solved by a Lagrangian relaxation heuristic.Imai, Nishimura,Hattori,and Papadimitriou(2007)considered a BAP in which up to two vessels can be served by the same berth simul-taneously.They formulated the problem with an integer linear programming model and solved it by genetic algorithms.Imai, Zhang,Nishimura,and Papadimitriou(2007)analyzed a two-objective berth allocation problem which minimizes service time and delay time.They used the Lagrangian relaxation with subgra-dient optimization technique and a genetic algorithm to identify the non-inferior solutions in the bi-objective model.Cheong and Tan(2008)developed a multiple ant colony algorithm for Nishimura et al.’s(2001)model and evaluated their algorithm by simulation experiments.Hansen,Og˘uz,and Mladenovic(2008)presented a minimum cost BAP based on an extension of Imai et al.’s(2003)model,and developed a variable neighborhood search(VNS)heuristic for solving it.Imai, Nishimura,and Papadimitriou(2008)studied a variant of the dynamic BAP in which an external terminal is available when there is a lack of berth capacity at the operator’s own terminal.Mauri,Oliveira,and Lorena(2008)proposed a hybrid approach called PTA/LP,which used the population training algorithm with a linear programming model using the column generation tech-nique.Barros,Costa,Oliveira,and Lorena(2011)developed and analyzed a berth allocation model with tidal time windows,where ships can only be served during those time windows.Buhrkal, Zuglian,Ropke,Larsen,and Lusby(2011)studied several mathe-matical programming models of the dynamic BAP and formulated the problem as a generalized set partition problem(GSPP).They solved the problem with CPLEX and obtained the optimal solutions on those instances from Cordeau et al.(2005).To the best of our knowledge,their mathematical model provides the best results on benchmark instances from the literature.de Oliveira,Mauri,and Lorena(2012b)presented an algorithm based on the clustering search method using the simulated annealing algorithm to generate solutions for the discrete BAP. Lalla-Ruiz,Melián-Batista,and Marcos Moreno-Vega(2012) developed a hybrid algorithm that combined tabu search with path relinking(T2S⁄+PR)to solve the BAP.They tested the instances from Cordeau et al.(2005)and newly generated data sets by them-selves.The results showed that the hybrid algorithm was compet-itive with the GSPP in small size instances.Xu,Li,and Leung(2012) considered the static and dynamic BAP that berths are limited by water depth and tidal condition.The problem was formulated as a parallel machine scheduling problem and solved with a heuristic.Another line of berth allocation research assumes that berths along a quayside can be shared by different vessels.Lim(1998) was thefirst to study the continuous berth allocation problem. The continuous BAP was formulated as a restricted form of the two-dimensional packing problem and solved with constant handling times.Li,Cai,and Lee(1998)and Guan,Xiao,Cheung, and Li(2002)modeled berth allocation as machine scheduling problems with multiprocessor tasks,while Guan and Cheung (2004)developed efficient heuristics using a discrete berthing section model for batch arriving vessels.Tong,Lau,and Lim (1999)proposed an ant colony optimization(ACO)approach for the BAP addressed by Lim(1998).Park and Kim(2002)presented a mixed integer programming(MIP)model to minimize the penalty cost associated with service delays and placing a ship at a non-preferred location.A Lagrangian relaxation model with subgradient optimization technique was proposed to solve the problem.Park and Kim(2003)integrated the berth scheduling into the quay crane assignment.The BAP was solved with an adaptation of the method from Park and Kim(2002)and the crane assignment was solved by dynamic programming.Kim and Moon(2003)for-mulated the continuous BAP as a MIP model and solved the prob-lem with a simulated annealing algorithm.Imai,Sun,Nishimura, and Papadimitriou(2005)presented a heuristic for the continuous BAP.Moorthy and Teo(2006)proposed a framework addressing the berth template design problem at the terminal on a weekly ba-sis and solved the problem with a sequence-pair-based SA algo-rithm.Wang and Lim(2007)proposed a stochastic beam search algorithm to solve the BAP in a multiple stage decision-making procedure.The improved beam search scheme and a stochastic node selection criterion were proposed.Lee and Chen(2009)developed a candidate-based approach to handle BAP by allowing vessel shifting and considering the clear-ance distance between vessels which depends on the ship lengths and the order of berthed vessels.A three-stage neighborhood search based heuristic was proposed to solve the BAP.Tang,Li, and Liu(2009)proposed two mathematical models to minimize the total weighted service time.The authors developed an im-proved Lagrangian relaxation algorithm to solve the BAP at the raw material docks in an iron and steel complex.Cheong,Tan, Liu,and Lin(2010)considered a multiple objective BAP which in-cludes makespan,waiting time,and degree of deviation from a pre-determined priority schedule.They proposed a multi-objective evolutionary algorithm that incorporates the Pareto optimality to solve the problem.Lee,Chen,and Cao(2010)developed two ver-sions of greedy randomized adaptive search procedure(GRASP) to solve the continuous BAP.The numerical results were compared with CPLEX and stochastic beam search of Wang and Lim(2007). Raa,Dullaert,and Van Schaeren(2011)presented a MIP model for the integrated BAP and quay crane assignment taking into ac-count vessel priorities,preferred berthing locations and handling time.de Oliveira,Mauri,and Lorena(2012a)presented a clustering search(CS)method with simulated annealing heuristic to solve the continuous BAP.The computational results of the I3instances from Cordeau et al.(2005)were compared with the tabu search by Cordeau et al.(2005)and memetic algorithms by Mauri,De Andrade,and Lorena(2011).1544 C.-J.Ting et al./Expert Systems with Applications41(2014)1543–1550The berth allocation problem is a NP problem.Due to the computational complexity,researchers have developed heuristics to solve the BAP in the literature.These heuristic methods include the GA(Imai et al.,2001;Imai,Nishimura,Hattori,& Papadimitriou,2007;Nishimura et al.,2001),SA(Kim&Moon, 2003;Moorthy&Teo,2006),TS(Cordeau et al.,2005),ACO(Tong et al.,1999;Cheong&Tan,2008),VNS(Hansen et al.,2008)and GRASP(Lee et al.,2010).In this paper,we propose a particle swarm optimization(PSO)algorithm to solve the problem.The reasons that we use PSO to solve this problem are as follows.PSO has been applied in many different combinatorial problems and provided very efficient performance.It is simple and needs less control parameters comparing to other metaheuristics,such as genetic algorithms and ant colony optimization algorithms.To our knowledge,no research used PSO to solve the BAP.Details of the proposed PSO are presented in Section4.3.Mathematical modelThis section describes the mixed integer programming model for the discrete and dynamic berth allocation problem.We treat the BAP as a vehicle routing problem with time windows,where berths correspond to vehicles,ships correspond to customers and a mooring sequence at a particular berth corresponds to a vehicle route.Each vehicle must start and end at the depot.The depot is divided into two dummy nodes,o and d.Time windows can be imposed on every node.The time windows of a vehicle correspond to the availability time of the corresponding berth.3.1.Assumptions1.Each berth can handle one ship at a time.2.Any ship can be handled at any berth with a given processingtime depending on both the ship and the berth.3.All ships arrive before or after the berth becoming availablewith known arrival times.4.Once a vessel is moored,it will remain in its location until allthe required processing is done.5.The initial status of the terminal space is ideally clean withoutany ship.3.2.Notationsa i:the arrival time of ship ib i:the end time of time window of ship id:the destination of any routee k:the end time of berth k availabilityK:set of the berths,K={1,2,...,|K|}M:a big numberN:set of ships that will arrive at the port,N={1,2,...,|N|}o:the origin of any routeP ki:the processing time of ship i at berth kS k:the start time of berth k availabilityDecision variablex kij¼1if ship i uses berth k immediately before ship j0otherwiseT ki:the starting time of ship i at berth k3.3.Model formulationWe formulate the BAP as a vehicle routing type problem,wherenodes o and d represents the origin and destination for any route. The processing time is dependent on the respective berth locations. The model has two types of decision variables:the binary assign-ment variable x kijand the continuous variable t ki.MinimizeXi2NXk2Kðt kiÀa iþp kiXj2N[f d gx kijÞð1Þs:t:Xi2N[f o gx kih¼Xi2N[f d gx khi8h2N;k2Kð2ÞXk2KXj2N[f d gx kij¼18i2Nð3ÞXj2N[f d gx koj618k2Kð4Þðt kiþp kiÞ6t kjþð1Àx kijÞM8i;j2N[f o g[f d g;k2Kð5Þs k6t ko8k2Kð6Þt kd6ek8k2Kð7Þa i6t ki8i2N;k2Kð8Þt kiþp kiXj2N[f d gx kij6bi8i2N;k2Kð9Þx kij¼f0;1g8i;j2N;k2Kð10Þt kiP08i2N;k2Kð11ÞThe objective function(1)minimizes the total service time which includes waiting time and processing time of all ships.Con-straint(2)ensures theflow conservation for all the vessels.Con-straint(3)states that each ship must be assigned to exactly one berth k.Since berth can be left unused,constraints(4)states that berth k can only start at most once.Constraint(5)guarantees the consistency for berthing time and mooring sequence on each berth. The berth availability time is enforced by constraints(6)and(7). Constraints(9)and(10)state that the vessel must be served within the time window.Finally,constraints(10)and(11)define the respective domains of the decision variables.4.Particle swarm optimization for BAPParticle swarm optimization(PSO),inspired by the social behavior of birdflocking orfish schooling,is a population-based stochastic search technique developed by Kennedy and Eberhart (1995).PSO has been applied in a wide range of combinatorial optimization problems,such as reactive power and voltage con-trol(Fukuyama&Yoshida,2001),permutationflowshop sequenc-ing problems(Liao,Tseng,&Luarn,2007),order allocation problem(Ting,Tsai,&Yeh,2007),machine scheduling(Low, Hsu,&Su,2010;Tsai&Kao,2011),production planning(Chen& C.-J.Ting et al./Expert Systems with Applications41(2014)1543–15501545Lin,2009),timetabling problem(Tassopoulos&Beligiannis,2012), and vehicle routing problems(Ai&Kachitvichyanukul,2009; MirHassani&Abolghasemi,2011).Compared to the genetic algo-rithm,PSO is easy to implement and there are few control param-eters to adjust.PSO is initialized with a population of random solutions and the potential solutions,called‘‘particles’’,in PSO search through the solution space.Each particle is also assigned a randomized velocity initially.The positions of individual particles are adjusted(via changing the velocity)according to its own previous searching experience(i.e.,previous best,pBest),and other particles’searching experiences(i.e.,global best,gBest).Velocity changing is weighted by random terms,with separate random numbers being generated for acceleration toward two best solutions,pBest and gBest,in each iteration.Suppose that the search space has D-dimension, and the position and the velocity of the i th particle at the current iteration is represented by X old i=(X old i1,...,X old id,...,X old iD)and V old i=(V old i1,...,V old id,...,V old iD),respectively.The general proce-dures of PSO are as follows.1.Initialization.Randomly generate a population(A)of potentialsolutions,called particles,and each particle is assigned a ran-domized velocity.The population size is problem-dependent and suggested to be between20and40by Hu and Eberhart (2002).2.Evaluation and update best pute the desired opti-mizationfitness function.pare thefitness of each particle with its pBest,if thecurrent is better,update the pBest.pare the pBest of each particle with the gBest,if thepBest is better,update the gBest.3.Velocity update.The particles areflown through hyperspace byupdating their own velocities.The velocity update of a particle is dynamically adjusted,subject to its own past best path and those of its companions.The particle updates its velocity and position with following equations(12)and(13).V new id ¼WÂV oldidþc1Ârnd1ÂðP idÀX oldidÞþc2Ârnd2ÂðP gdÀX oldidÞð12ÞX new id ¼X oldidþV newidð13Þwhere V newid is the particle new velocity,V oldidis the current parti-cle velocity,P id is the best previous position of particle i indimension d,P gd is the best position in dimension d found by all particles till now.W is the inertia weight,c1and c2are learn-ing factors.A larger W can prevent particles being trapped in the local optimum,while a smaller W let particles to exploit the same search space area.Eberhart and Shi(2001)suggested c1=c2=2and W=0.5+(rand()/2).X newidis the new particle(solution)position and X oldidis the current particle position ind th dimension.rnd1and rnd2are random numbers between0and1which represent the stochastic element of the PSO.4.Termination.Stop the algorithm if the stopping criterion is met;otherwise go to2.In this paper,we set the stop criterion as the maximum number of iterations(G)is reached.Particles’velocities on each dimension are clamped to a maxi-mum velocity V max,a parameter specified by the user to determine the maximum change one particle can move during one iteration. If the updated velocity exceeds V max,then the velocity on that dimension is limited to V max.Eberhart and Shi(2001)suggested V max being set at about10-20%of the dynamic range of the variable on each dimension.In PSO,only gBest gives out the information to others.It is a one-way information sharing mechanism.The evolution only looks for the best pared with the genetic algorithm,all the par-ticles tend to converge to the best solution quickly even in the local version in most cases.There are two key steps when applying PSO to optimization problems:the representation of the solution and thefitness function.One of the advantages of PSO is that PSO can take real numbers as particles.The population size will affect the effectiveness of PSO and is problem-dependent.The number of particles most commonly used is in the range of20–40(Hu and Eberhart,2002).The dimension of particles is determined by the problem to be optimized.The range of particles is also determined by the problem to be optimized,the user can specify different ranges for different dimension of parti-cles.Learning factors,c1and c2,usually equal to2.However,other settings were also used in different papers.But usually c1equals to c2and ranges from[0,4].The stop condition is based on the max-imum number of iterations the PSO execute and the minimum er-ror requirement.4.1.Particle representation and initial solution generationThe solution representation is the key issue when designing the PSO algorithm.It could be a string of integers or real numbers.In order to construct a direct relationship between the domain of the berth allocation problem and the PSO practices,n numbers of dimensions are presented each for one of the n vessels.Our solu-tion representation is as follows:n real numbers from a uniform distribution in the interval of(0,m)represent a solution in an array of n cells,where n is number of ships and m is the number of berths.The interval of(0,m)is used as boundary constraint to par-ticle position to guarantee that the decision variables are in the feasible region.The integer part of a real number denotes the berth that the ship is assigned to and the fractional part represents the processing order of ships on each berth.The ships are separated into groups based on the berth to which they are assigned.Based on the real number encoding,the sequence of ships on each berth can be extracted from ascending order of fractional parts.A ship with lower number will be scheduled before the ships with higher numbers.Fig.1shows a particle representation for a berth allocation problem with six vessels and two berths.Each particle dimension is encoded as a real number between(0,2).The integer part of each value represents the berth position the vessel assigned to.Thus,the same integer part represents the vessel is in the same berth.The fractional part determines the sequence of the vessel at the berth. For example,vessels{a,d,e}will be served by berth1while vessels {b,c,f}will be served at berth2.By sorting the fractional values in ascending order,vessel d will be thefirst one moored at berth1, followed by vessel e and a.Similarly,the sequence of vessels moored at berth2is b,f,and c.To prevent the search outside the initialized range of the feasi-ble solution space,we handle the boundary situation as follows.If the value in one cell is less than zero,we randomly generated a va-lue in(0,1)for the cell.If the value is larger than the number of berths,we randomly generated a value in(0,1)and subtract this from the number of berths.We randomly generate all particles except one solution that is based on a simple greedy heuristic,first-come-first-served(FCFS). FCFS is practically used in the real world operations from both operator’s and carrier’s perspective.We assume that all berths be-come available at the same time and sort the ships by their arrival times in ascending order.Ships are assigned one at a time by choosing the combination of berth and ship that willfinishfirst. The time is increased when there are no ships available or all berths are busy.This continues until all ships have been assigned.1546 C.-J.Ting et al./Expert Systems with Applications41(2014)1543–15504.2.Local searchIn each iteration,we apply local search to improve the solution quality.Due to that the local search is a time-consuming procedure of PSO,we will only apply local search to the best particle found in this iteration.The local search technique used in this study has two procedures:swap ships in the same berth and between berths. Fig.2shows these two procedures based on the solution obtained in Fig.1.Given a list of the ships handled by berth j,the swapping compares all the possible swapping pairs within the same berth and select the best improvement to exchange their values as shown in Fig.2(a).For the swapping of two ships in two berths, two ships in two different berths(one for each berth)are randomly selected.The positions of these two ships are exchanged.The swap results are evaluated and select the best improvement to exchange as shown in Fig.2(b).putational experimentsThe proposed PSO algorithm in previous section is tested in this section.Two sets of instances,I2and I3,from Cordeau et al.(2005) were tested.The PSO algorithm was coded in Microsoft Visual Stu-dio C++2008and run on a PC with an Intel Core2Duo CPU E8400 (3.00GHz)processor and1.9GB RAM,under the Windows7oper-ating system.The effectiveness of the proposed PSO algorithm was compared with other recent algorithms for the BAP,namely tabu search(T2S)(Cordeau et al.,2005),population training algorithm with linear programming(PTA/LP)(Mauri et al.,2008),and cluster-ing search(CS)approach(de Oliveira et al.,2012b)from the liter-ature.The results of these algorithms were obtained directly from their articles.To make the performance of our proposed PSO heuristic more robust,parameter-setting is necessary.We have performed a set of preliminary experiments in order tofind an appropriate param-eter setting that produces overall good results across most in-stances,even if they were not the optimal settings for all instances.The control parameters of our PSO algorithm are the number of particles A,number of iterations G,inertia weight W, and learning factors C1and C2,respectively.Based on the prelimin-ary experiments undertaken,we found that the best values of the parameter setting yield to better solution quality as follows:A=20, G=200,W=0.9,C1=C2=2.Each instance is run for30times and reported both best solution and average computational time.5.1.I2setThe I2data set including50instances were generated from the traffic and berth-allocation data at Gioia Tauro,Italy.Five instance sizes were considered:25ships with5,7,and10berths;35ships with7and10berths.A set of10instances was generated for each size.The earliest available time is the same for every berth.The ori-ginal data set takes into account time windows.Table1shows the results for the instances of25and35ships. We also compare the results to those obtained from the most re-cent literature.For each algorithm,we report their results and computational time.Among those results,GSPP by Buhrkal et al.(2011)solved the BAP with CPLEX and obtained the optimal solu-tions.Our PSO canfind the optimal solutions in all50instances and provide much better results than those by Cordeau et al.(2005).The computational times of our PSO in each instance are the average of30runs in seconds.The tabu search algorithm(T2S)pro-posed by Cordeau et al.(2005)used on average120s to solve each instance.The machine used by the GSPP was a PC with an Intel Xeon 2.66GHz,while T2S was run on a Sun workstation (900MHz).Our PSO performs better than that of T2S in terms of solution quality.We can observe that PSOfinds all the optimal solutions for all instances in I2set in short time(1.66s on average).5.2.I3setThe I3data set that includes30instances,each with60ships and13berths,is also randomly generated by Cordeau et al. (2005)based on data from the port of Gioia Tauro.TheparametersTable1Comparison of results of I2set.Instance GSPP T2S PSOOpt.Time Best Best Time25Â5_1759 5.997597590.7525Â5_2964 3.709659640.5525Â5_3970 2.95974970 1.2325Â5_4688 2.727026880.4225Â5_5955 6.979659550.8625Â5_61129 3.10112911290.5225ÂÂ5_7835 2.318358350.5225Â5_8627 1.926296270.5025Â5_9752 4.767557520.6925Â5_101073 6.38107710730.7325Â7_1657 3.626676570.5225Â7_2662 3.156716620.4425Â7_3807 4.288238070.9725Â7_4648 3.786556480.8625Â7_5725 3.857287250.4425Â7_6794 3.607947940.5225Â7_7734 3.547407340.6925Â7_8768 3.93782768 1.0525Â7_9749 3.737597490.8925Â7_10825 3.828308250.5525Â10_1713 5.837177130.7025Â10_2727 6.997367270.7525Â10_3761 6.127647610.5625Â10_4810 5.388198100.5225Â10_5840 6.778558400.4525Â10_6689 5.576946890.4425Â10_7666 5.836736660.5825Â10_8855 5.878608550.5325Â10_9711 5.387267110.4525Â10_10801 5.968128010.4735Â7_1100012.5710191000 5.0235Â7_2119215.9311961192 4.9135Â7_312017.1612301201 4.9435Â7_4113913.5911501139 3.4535Â7_5116411.5011791164 3.3635Â7_6168629.1617031686 3.2835Â7_7117612.8911811176 4.1735Â7_8131817.5213301318 2.3935Â7_912458.4112451245 3.5035Â7_10110914.3911301109 3.8935Â10_1112419.9811281124 1.5835Â10_2118911.3711971189 4.1335Â10_39388.97953938 3.3635Â10_4122610.2812391226 2.8435Â10_5134922.3113721349 1.5335Â10_6118810.9212211188 2.4435Â10_710519.7410521051 2.1735Â10_811949.3912191194 1.2835Â10_9131129.4513151311 2.8135Â10_10118914.2811981189 2.83Average953.668.55963.04953.66 1.66 C.-J.Ting et al./Expert Systems with Applications41(2014)1543–15501547。
