نتایج جستجو برای: meta heuristics algorithm

تعداد نتایج: 924855  

Journal: :مهندسی صنایع 0
بهروز مینائی دانشیار دانشکده مهندسی کامپیوتر- دانشگاه علم و صنعت ایران محمد فتحیان دانشیار دانشکده مهندسی صنایع- دانشگاه علم و صنعت ایران احمدرضا جعفریان مقدم دانشجوی دکترای دانشکده مهندسی صنایع دانشگاه علم و صنعت ایران و مدیر پروژه توسعه نرم افزار شرکت مهندسی شبکه پویش داده نوین مهدی نصیری دانشجوی دکترای مهندسی کامپیوتر دانشگاه علم و صنعت ایران

clustering technique is one of the most important techniques of data mining and is the branch of multivariate statistical analysis and a method for grouping similar data in to same clusters. with the databases getting bigger, the researchers try to find efficient and effective clustering methods so that they can make fast and real decisions. thus, in this paper, we proposed an improved ant syst...

2003
Gianluca Mardente Claudio Casetti Marco Mellia Maurizio Munafò Renato Lo Cigno

In this paper we propose several heuristic algorithms that, using MPLS capabilities, provide network operators with a control framework for the routing plane. In particular, a monitoring block collects real-time measurements, such as the link load, and feeds them to a centralized decision block which runs a routing optimization algorithm. The output of the optimization process is then conveyed ...

This research addresses the mixed-model assembly line (MMAL) by considering various constraints. In MMALs, several types of products which their similarity is so high are made on an assembly line. As a consequence, it is possible to assemble and make several types of products simultaneously without spending any additional time. The proposed multi-objective model considers the balancing and sequ...

Journal: :JSW 2014
Gary Yu-Hsin Chen Pei-Qi Wang

The topic of test case prioritization has been researched extensively in the past decade. However, current researches carried out on test case prioritization are mainly concerned with independent test cases in a structural testing environment. In a specification-based testing environment, however, some test cases are inter-case dependent and must follow certain sequences of execution. The objec...

Journal: :European Journal of Operational Research 2003
Alain Hertz Marino Widmer

The 18th EURO Summer/Winter Institute (ESWI XVIII) took place during the spring 2000 in Switzerland. The topic of ESWI XVIII, ‘‘Meta-heuristics in Combinatorial Optimization’’, was selected due to its great current scientific interest: indeed, in recent years, several meta-heuristics have proved to be highly efficient for the solution of difficult combinatorial optimization problems. The Instit...

Journal: :International journal of cloud applications and computing 2023

Task scheduling in fog computing is one of the areas where researchers are having challenges as demand grows for use internet things (IoT) to access cloud resources. Many resource and optimization algorithms were used by many computing; some single techniques while others combined schemes achieve dynamic computing, assessed based on deterministic meta-heuristic find out solution task problem bu...

2012
Mohamad Mirzazadeh Gholam Hasan Shirdel Behrouz Masoumi

Assigning facilities to locations is one of the important problems, which significantly is influence in transportation cost reduction. In this study, we solve quadratic assignment problem (QAP), using a meta-heuristic algorithm with deterministic tasks and equality in facilities and location number. It should be noted that any facility must be assign to only one location. In this paper, first o...

Journal: :Algorithms 2014
Min-Xia Zhang Bei Zhang Yu-Jun Zheng

Emergency transportation plays a vital role in the success of disaster rescue and relief operations, but its planning and scheduling often involve complex objectives and search spaces. In this paper, we conduct a survey of recent advances in bio-inspired meta-heuristics, including genetic algorithms (GA), particle swarm optimization (PSO), ant colony optimization (ACO), etc., for solving emerge...

2013
Yu-Ping Wang

In order to conquer the premature convergence problem and lower the cost of computing of the basic Ant Colony Algorithm (ACA), we present an adaptive ant colony algorithm, named AACA, coupled with a Pareto Local Search (PLS) algorithm and apply to the Vehicle Routing Problem (VRP) and Capacitated VRP (CVRP). By using the information entropy, the algorithm adjusts the pheromone updating strategy...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید