نتایج جستجو برای: objective simulated annealing algorithm
تعداد نتایج: 1384170 فیلتر نتایج به سال:
the network design problem (ndp) is one of the important problems in combinatorial optimization. among the network design problems, the multicommodity capacitated network design (mcnd) problem has numerous applications in transportation, logistics, telecommunication, and production systems. the mcnd problems with splittable flow variables are np-hard, which means they require exponential time t...
This paper introduces and analyzes a parallel method of simulated annealing. Borrowing from genetic algorithms, an eeective combination of simulated annealing and genetic algorithms, called parallel recombinative simulated annealing, is developed. This new algorithm strives to retain the desirable asymptotic convergence properties of simulated annealing, while adding the populations approach an...
This paper addresses the Vehicle Routing Problem with Delivery Time Cost. This problem aims to find a set of routes of minimal total costs including the travelling cost and delivery time cost, starting and ending at the depot, in such a way that each customer is visited by one vehicle given the capacity of the vehicle to satisfy a specific demand. In this research, a hybrid metaheuristic approa...
considering the increasingly high attention to quality, promoting the reliability of products during designing process has gained significant importance. in this study, we consider one of the current models of the reliability science and propose a non-linear programming model for redundancy allocation in the series-parallel systems according to the redundancy strategy and considering the assump...
in this paper, we present a simulated annealing (sa) and a genetic algorithm (ga) based on heuristics for scheduling problem of jobs in virtual cellular manufacturing systems. a virtual manufacturing cell (vmc) is a group of resources that is dedicated to the manufacturing of a part family. although this grouping is not reflected in the physical structure of the manufacturing system, but machin...
In this paper, we present a new algorithm — an Enhanced Annealing Genetic Algorithm for Multi-Objective Optimization problems (MOPs). The algorithm tackles the MOPs by a new quantitative measurement of the Pareto front coverage quality — Coverage Quotient. We then correspondingly design an energy function, a fitness function and a hybridization framework, and manage to achieve both satisfactory...
Harmony search is a new heuristic optimization algorithm. Comparing with other algorithms, this algorithm has very strong robustness and can be easily operated. Combining with the features of harmony search, an improved simulated annealing algorithm is proposed in this paper. It can improve the speed of annealing. The initial state of simulated annealing and new solutions are generated by harmo...
The Network Design Problem (NDP) is one of the important problems in combinatorial optimization. Among the network design problems, the Multicommodity Capacitated Network Design (MCND) problem has numerous applications in transportation, logistics, telecommunication, and production systems. The MCND problems with splittable flow variables are NP-hard, which means they require exponential time t...
FACTS Devices Allocation for Power Transfer Capability Enhancement and Power System Losses Reduction
In this paper, a hybrid evolutionary algorithm (HEA) is proposed to determine the optimal placement of multi-type flexible AC transmission system (FACTS) devices to simultaneously maximize the total transfer capability (TTC) and minimize the system real power loss of power transfers in deregulated power systems. Multi-objective optimal power flow (OPF) with FACTS devices including TTC, power lo...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید