نمایش نتایج جستجو برای
کلمات کلیدی: heuristic
موارد یافت شده: 52
1 - Combining ant colony optimization algorithm and dynamic programming technique for solving the covering salesman problem (چکیده)2 - Some derivative-free solvers for numerical solution of SODEs (چکیده)
3 - A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem (چکیده)
4 - Heuristic optimization of submerged hydrofoil using ANFIS–PSO (چکیده)
5 - mNAFSA: A novel approach for optimization in dynamic environments with global changes (چکیده)
6 - The time constrained maximal covering salesman problem (چکیده)
7 - EMPSACO: An improved hybrid optimization algorithm based on particle swarm, ant colony and elitist mutation algorithms (چکیده)
8 - An Improved Big Bang – Big Crunch Algorithm For Size Optimization of Trusses (چکیده)
9 - Max-Flow Network Interdiction Problem with Reliability (چکیده)
10 - A hybrid metaheuristic for concurrent layout and scheduling problem in a job shop environment (چکیده)
11 - A Genetic Algorithm for the Resource-Constrained Project Scheduling Problem with Flexible Work Profiles (چکیده)
12 - Heuristic algorithms for permutation flow shop scheduling problem with deteriorating jobs (چکیده)
13 - USING ELECTROMAGNETIC META-HEURISTIC ALGORITHM FOR SOLVING NONLINEAR FREDHOLM INTEGRAL EQUATIONS (چکیده)
14 - A New Heuristic Solution Method for Maximal Covering Location-Allocation Problem with M/M/1 Queueing System (چکیده)
15 - A covering tour approach to the location of satellite distribution centers to supply humanitarian aid (چکیده)
16 - Two effective hybrid metaheuristic algorithms for minimization of multimodal functions (چکیده)
17 - Using Scatter Search to solve a multi-objective transportation problem- a case study (چکیده)
18 - Combining Exact and Heuristic Approaches for the Covering Salesman Problem (چکیده)
19 - A heuristic procedure for the capacitated m_ring star problem (چکیده)
20 - A new hybrid heuristic algorithm to Timetabling Problem_ a case study (چکیده)
21 - Using Scatter Search Algorithm to solve a multi_objective Transportation problem_ a case study (چکیده)
22 - An Electro magnetism based Metaheuristic for the unicost Set Covering Problem (چکیده)
23 - The Cost Constraint Minimum Spanning Tree and the label constrained minimum spanning tree problems (چکیده)
24 - A metaheuristic approach for the unicost set covering problem (چکیده)
25 - An electromagnetism metaheuristic for the unicost set covering problem (چکیده)
26 - The Generalized Covering Salesman Problem (چکیده)
27 - Heuristic Procedures for the Generalized Covering Salesman Problem (چکیده)
28 - Variable Neighborhood Search for the Cost Constrained Minimum Label Spanning Tree and Label Constrained Minimum Spanning Tree Problems (چکیده)
29 - A solution procedure for the Generalized Covering Salesman Problem (چکیده)
30 - An ILP Improvement Procedure for the Open Vehicle Routing Problem (چکیده)
31 - Generalized Covering Salesman Problem (چکیده)
32 - A heuristic Method to solve the Capacitated m-Ring-Star Problem (چکیده)
33 - A heuristic procedure for the Capacitated m-Ring-Star problem (چکیده)
34 - Variable neighborhood search for the cost constrained minimum label spanning tree and label constrained minimum spanning tree problems (چکیده)
35 - An ILP improvement procedure for the Open Vehicle Routing Problem (چکیده)
36 - Maximal covering location-allocation problem with M/M/k queueing system and side constraints (چکیده)
37 - Generalized Covering Salesman Problem (چکیده)
38 - Location and Supply of Humanitarian aid Distribution points (چکیده)
39 - wo new metaheuristic algorithms for unconstrained optimization. (چکیده)
40 - A new hybrid metaheuristic algorithm for solving uncapacitated facility location problem (چکیده)
41 - A new approach to solve traveling salesman problem using genetic algorithm based on heuristic crossover and mutation operator (چکیده)
42 - Resource-Constrained Project Scheduling Problem with Flexible Work Profiles: A Genetic Algorithm Approach (چکیده)
43 - A Single Machine Sequencing Problem With Variable Machining Times And Sequence- Dependent Setups (چکیده)
44 - Tri-directional Scheduling Scheme:Theory and Computation (چکیده)
45 - A Hybrid Scatter Search for the RCPSP (چکیده)
46 - A Hybrid of the Newton-GMRES and Electromagnetic Meta-Heuristic Methods for Solving Systems of Nonlinear Equations (چکیده)
47 - A heuristic method for nonlinear unconstrained global optimization: Electromagnetism meta-heuristic (چکیده)
48 - A hybrid scatter search for the discrete time/resource trade-off problem in project scheduling (چکیده)
49 - Solving the resource-constrained project scheduling problem using filter-and-fan approach (چکیده)
50 - Solving the resource availability cost problem in project scheduling by path relinking and genetic algorithm (چکیده)
51 - A hybrid of the restarted Arnoldi an electromagnetism meta-heuristic methods for calculating eigenva (چکیده)
52 - Solving the p-median problem with pos/neg weights by variable neighborhood search and some results f (چکیده)
