اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدParameter Selection In Particle Swarm Optimization For Transportation Network Design Problem
127
0
0.0
(
0
)
نشر من قبل
Mehran Fasihozaman Langerudi
تاريخ النشر
2014
مجال البحث
الهندسة المعلوماتية
والبحث باللغة
English
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In transportation planning and development, transport network design problem seeks to optimize specific objectives (e.g. total travel time) through choosing among a given set of projects while keeping consumption of resources (e.g. budget) within their limits. Due to the numerous cases of choosing projects, solving such a problem is very difficult and time-consuming. Based on particle swarm optimization (PSO) technique, a heuristic solution algorithm for the bi-level problem is designed. This paper evaluates the algorithm performance in the response of changing certain basic PSO parameters.
قيم البحث
اقرأ أيضاً
Microarray techniques are widely used in Gene expression analysis. These techniques are based on discovering submatrices of genes that share similar expression patterns across a set of experimental conditions with coherence constraint. Actually, thes
e submatrices are called biclusters and the extraction process is called biclustering. In this paper we present a novel binary particle swarm optimization model for the gene expression biclustering problem. Hence, we apply the binary particle swarm optimization algorithm with a proposed measure, called Discretized Column-based Measure (DCM) as a novel cost function for evaluating biclusters where biological relevance, MSR and the size of the bicluster are considered as evaluation metrics for our results. Results are compared to the existing algorithms and they show the validity of our proposed approach.
In recent years, with the development of microarray technique, discovery of useful knowledge from microarray data has become very important. Biclustering is a very useful data mining technique for discovering genes which have similar behavior. In mic
roarray data, several objectives have to be optimized simultaneously and often these objectives are in conflict with each other. A Multi Objective model is capable of solving such problems. Our method proposes a Hybrid algorithm which is based on the Multi Objective Particle Swarm Optimization for discovering biclusters in gene expression data. In our method, we will consider a low level of overlapping amongst the biclusters and try to cover all elements of the gene expression matrix. Experimental results in the bench mark database show a significant improvement in both overlap among biclusters and coverage of elements in the gene expression matrix.
In order to reduce the carbon emission, the related government departments encourage road freights to be transferred more by railway transportation. In China freight transport system, the road transportation is usually responsible for the freights th
at are in a short distance or the ones with high value-added. To transfer more high value-added freights from highway to railway, except the transportation expenses of railway have an advantage over the road, the transportation time is of certain competitive force as well. Therefore, it is very essential for railway to provide freight train products that are of competitive power. Under such circumstance, a multi-objective programming model of optimizing the rail express train network is devised in this work on the basis of taking both road and railway transportation modes into account. The aims of optimization are to minimize the operation costs of rail trains, and to maximize the railway transport revenue. In a network with a given set of express train services, either the all-or-nothing (AON) method or the logit model can be employed when assigning high value-added freights. These two flow assignment patterns are investigated in this work.
Convolutional neural network (CNN) is one of the most frequently used deep learning techniques. Various forms of models have been proposed and improved for learning at CNN. When learning with CNN, it is necessary to determine the optimal hyperparamet
ers. However, the number of hyperparameters is so large that it is difficult to do it manually, so much research has been done on automation. A method that uses metaheuristic algorithms is attracting attention in research on hyperparameter optimization. Metaheuristic algorithms are naturally inspired and include evolution strategies, genetic algorithms, antcolony optimization and particle swarm optimization. In particular, particle swarm optimization converges faster than genetic algorithms, and various models have been proposed. In this paper, we propose CNN hyperparameter optimization with linearly decreasing weight particle swarm optimization (LDWPSO). In the experiment, the MNIST data set and CIFAR-10 data set, which are often used as benchmark data sets, are used. By optimizing CNN hyperparameters with LDWPSO, learning the MNIST and CIFAR-10 datasets, we compare the accuracy with a standard CNN based on LeNet-5. As a result, when using the MNIST dataset, the baseline CNN is 94.02% at the 5th epoch, compared to 98.95% for LDWPSO CNN, which improves accuracy. When using the CIFAR-10 dataset, the Baseline CNN is 28.07% at the 10th epoch, compared to 69.37% for the LDWPSO CNN, which greatly improves accuracy.
Probabilistic model checking aims to prove whether a Markov decision process (MDP) satisfies a temporal logic specification. The underlying methods rely on an often unrealistic assumption that the MDP is precisely known. Consequently, parametric MDPs
(pMDPs) extend MDPs with transition probabilities that are functions over unspecified parameters. The parameter synthesis problem is to compute an instantiation of these unspecified parameters such that the resulting MDP satisfies the temporal logic specification. We formulate the parameter synthesis problem as a quadratically constrained quadratic program (QCQP), which is nonconvex and is NP-hard to solve in general. We develop two approaches that iteratively obtain locally optimal solutions. The first approach exploits the so-called convex-concave procedure (CCP), and the second approach utilizes a sequential convex programming (SCP) method. The techniques improve the runtime and scalability by multiple orders of magnitude compared to black-box CCP and SCP by merging ideas from convex optimization and probabilistic model checking. We demonstrate the approaches on a satellite collision avoidance problem with hundreds of thousands of states and tens of thousands of parameters and their scalability on a wide range of commonly used benchmarks.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
