نتایج جستجو برای: meta heuristic methods

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

Abolfazl Danaei Farshad Faezy Razi Rahele Sadat Khatami

In the science of operation research and decision theory, selection is the most important process. Selection is a process that studies multiple qualitative and quantitative criteria, related to the science of management, which are mostly incompatible with each other. The multi criteria selection of a renewable energy portfolio is one of the main issues considered in multi criteria literatur...

2017
Kirandeep Kaur

The various meta-heuristic techniques for cloud and grid environment are: Ant Colony Optimization (ACO), Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Tabu Search, Firefly Algorithm, BAT Algorithm and many more. So this paper represents the two types of meta-heuristic techniques, i.e. BAT algorithm and Genetic Algorithm. The different types of methods which comprise meta-heuristic ...

Journal: :international journal of supply and operations management 2015
abolfazl kazemi vahid khezrian mahsa oroojeni mohammad javad alireza alinezhad

in this study, a bi-objective model for integrated planning of production-distribution in a multi-level supply chain network with multiple product types and multi time periods is presented. the supply chain network including manufacturers, distribution centers, retailers and final customers is proposed. the proposed model minimizes the total supply chain costs and transforming time of products ...

Journal: :journal of advances in computer research 2012
majid yousefikhoshbakht farzad didehvar farhad rahmati

the vehicle routing problem with simultaneous pickup and delivery (vrpspd) is a well-known combinatorial optimization problem which addresses provided service to a set of customers using a homogeneous fleet of capacitated vehicles. the objective is to minimize the distance traveled. the vrpspd is an np-hard combinatorial optimization problem. therefore, practical large-scale instances of vrpspd...

2013
Zahra Beheshti Siti Mariyam Hj. Shamsuddin

Exact optimization algorithms are not able to provide an appropriate solution in solving optimization problems with a high-dimensional search space. In these problems, the search space grows exponentially with the problem size therefore; exhaustive search is not practical. Also, classical approximate optimization methods like greedy-based algorithms make several assumptions to solve the problem...

Journal: :مهندسی صنایع 0
رضا رمضانیان استادیار دانشکدة مهندسی صنایع دانشگاه صنعتی خواجه نصیرالدین طوسی محسن شفیعی نیک آبادی استادیار دانشکدة اقتصاد و مدیریت دانشگاه سمنان سحر فلاح صنمی دانشجوی کارشناسی ارشد دانشکدة اقتصاد و مدیریت دانشگاه سمنان

production planning and scheduling are the most important issues of the production industries, which have a considerable influence on the productivity of the production systems. although, production planning and scheduling are in two different medium-term and short-term decision making levels, there are a very close relationship between them. ignoring this important feature in production planni...

Vehicle Routing Problem with Time Windows (VRPTW) is an NP-Complete Optimization Problem. Even finding an optimal solution for small size problems is too hard and time-consuming. The objective of VRPTW is to use a fleet of vehicles with specific capacity to serve a number of customers with dissimilar demands and time window constraints at minimum cost, without violating the capacity and time wi...

2001
Raphaël Dorne Christos Voudouris

For some years now, Meta-Heuristic methods have demonstrated their ability to tackle large-scale optimisation problems. Up to now, several frameworks have been implemented for this family of methods. Some of them are either dedicated to Local Search such as EasyLocal++[5], Localizer[8], LocalSearch framework[1], Templar[7], HotFrame[4] or to Evolutionary Computation such as EOS[2], EASEA[3]. Th...

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

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