Conference
Computational Sciences and Optimization
About: Computational Sciences and Optimization is an academic conference. The conference publishes majorly in the area(s): Algorithm design & Supply chain. Over the lifetime, 1395 publications have been published by the conference receiving 4827 citations.
Topics: Algorithm design, Supply chain, Artificial neural network, Fuzzy logic, Optimization problem
Papers
24 Apr 2009
TL;DR: A group of strategies with multi-stage linearly-decreasing inertia weight (MLDW) is proposed in order to get better balance between the global and local search.
Abstract: The inertia weight is often used to control the global exploration and local exploitation abilities of particle swarm optimizers (PSO). In this paper, a group of strategies with multi-stage linearly-decreasing inertia weight (MLDW) is proposed in order to get better balance between the global and local search. Six most commonly used benchmarks are used to evaluate the MLDW strategies on the performance of PSOs. The results suggest that the PSO with W5 strategy is a good choice for solving unimodal problems due to its fast convergence speed, and the CLPSO with W5 strategy is more suitable for solving multimodal problems. Also, W5-CLPSO can be used as a robust algorithm because it is not sensitive to the complexity of problems for solving.
245 citations
24 Apr 2009
TL;DR: An efficient heuristic method is proposed and then five popular heuristics for minimizing makespan and flowtime in heterogeneous distributed computing systems are compared.
Abstract: Scheduling is one of the core steps to efficientlyexploit the capabilities of heterogeneous distributedcomputing systems and is an NP-complete problem.Therefore using meta-heuristic algorithms is asuitable approach in order to cope with its difficulty.In meta-heuristic algorithms, generating individualsin the initial step has an important effect on theconvergence behavior of the algorithm and finalsolutions. Using some heuristics for generating one ormore near-optimal individuals in the initial step canimprove the final solutions obtained by meta-heuristicalgorithms. Different criteria can be used forevaluating the efficiency of scheduling algorithms, themost important of which are makespan and flowtime.In this paper we propose an efficient heuristic methodand then we will compare with five popular heuristicsfor minimizing makespan and flowtime inheterogeneous distributed computing systems.
137 citations
15 Apr 2011
TL;DR: Wang et al. as discussed by the authors presented a risk assessment model to identify, classify and map forest fire risk areas, which considers three parts, i.e. hazards identification, vulnerability analysis, and emergency response capacity analysis.
Abstract: Forest fire is a usual disaster in real life, causing huge live, property and ecology losses. A risk assessment model to identify, classify and map forest fire risk areas is presented in this paper. This model considers three parts, i.e. hazards identification, vulnerability analysis, and emergency response capacity analysis. The first part concentrates on several influence factors in forest fires, including the land use, topography and meteorology where the forest situate. The second part is made up of population density and value of forest resources. The forest fire response capacity including forest fire-brigade, watch-tower and helicopter water source is the third part. Through GIS spatial analytical procedure, the forest fire risk ranging from high to low is derived, according to its sensitivity to fire or fire-inducing capability. Spatial analyst is used to combine some single influence factors in risk maps to display the total fire risk map. The weight to each factor is determined by Grey Relativity Analysis (GRA). This model is illustrated with a case study of forest fire risk of area in China. It is suggested that risk mapping is helpful for the forest fire management to minimize forest fire hazard.
53 citations
15 Apr 2011
TL;DR: The findings reveal that the nonlinear ensemble model proposed here can be used as an alternative forecasting tool for a Meteorological application in achieving greater forecasting accuracy and improving prediction quality further.
Abstract: In this study, a novel modular-type Support Vector Machine (SVM) is presented to simulate rainfall prediction. First of all, a bagging sampling technique is used to generate different training sets. Secondly, different kernel function of SVM with different parameters, i.e., base models, are then trained to formulate different regression based on the different training sets. Thirdly, the Partial Least Square (PLS) technology is used to select choose the appropriate number of SVR combination members. Finally, a $
u$-SVM can be produced by learning from all base models. The technique will be implemented to forecast monthly rainfall in the Guangxi, China. Empirical results show that the prediction by using the SVM combination model is generally better than those obtained using other models presented in this study in terms of the same evaluation measurements. Our findings reveal that the nonlinear ensemble model proposed here can be used as an alternative forecasting tool for a Meteorological application in achieving greater forecasting accuracy and improving prediction quality further.
51 citations
24 Apr 2009
TL;DR: This work represents transportation networks by an undirected graph with the nodes as cities and edges as traffic roads and calculates the network resilience by the weighted sum of all node resilience.
Abstract: To analyze the resilience of transportation networks, it is proposed to use a quantificational resilience evaluation approach. First, we represent transportation networks by an undirected graph with the nodes as cities and edges as traffic roads. Because the survival ability of transportation of a pair of cities depends on the number of independent paths between them, the resilience of a city node can be evaluated by the weighted average number of reliable independent paths with all other city nodes in the networks. The network resilience can then be calculated by the weighted sum of all node resilience. Based on the recommended approaches, the resilience of a transportation network is evaluated and analyzed. Several interesting conclusions are drawn from the computational results.
49 citations
Performance Metrics
| Year | Papers |
|---|---|
| 2020 | 8 |
| 2019 | 25 |
| 2018 | 17 |
| 2017 | 10 |
| 2014 | 145 |
| 2012 | 197 |