A Simulated Annealing Algorithm For Fuzzy Unit Commitment Problem by Mantawy, A. H.

“…This paper presents a new algorithm based on integrating simulated annealing and fuzzy logic methods to solve the unit commitment problem. …”
Get full text

A simulated annealing algorithm for fuzzy unit commitment problem by Mantawy, A.H.

“…This paper presents a new algorithm based on integrating simulated annealing and fuzzy logic methods to solve the unit commitment problem. …”
Get full text
Get full text

A simulated annealing algorithm for the capacitated vehicle routing problem by Azar, Danielle

“…In this paper, we present a meta-heuristic approach for solving the CVRP based on simulated annealing. The algorithm uses a combination of random and deterministic operators that are based on problem knowledge information. …”
Get full text
Get full text
Get full text

Scatter search algorithm for the cross-dock door assignment problem by Tarhini, Abbas

“…A lot of research has been conducted regarding this topic still, up to our knowledge, none used Scatter Search (SS). In this paper, we implemented this evolutionary metaheuristic algorithm and tested it, then compared the results with those of another evolutionary algorithm, Genetic Algorithm (GA). …”
Get full text
Get full text
Get full text
Get full text

Natural optimization algorithms for the cross-dock door assignment problem by Tarhini, Abbas A.

“…The results indicate that the SS algorithm outperformed the GA, particularly for large-sized problems with a diverse reference set.…”
Get full text
Get full text
Get full text
Get full text

Fixed-parameter algorithms for hitting set problems. (c2006) by Masri, Rola El.

Get full text
Get full text

Logistics Optimization Using Hybrid Genetic Algorithm (HGA): A Solution to the Vehicle Routing Problem With Time Windows (VRPTW) by Ayesha Maroof (17984053)

Spider monkey optimizations: application review and results by Abualigah, Laith

“…Optimization algorithms are applied to find efficient solutions in different problems in several fields such as the routing in wireless networks, cloud computing, big data, image processing and scheduling, and so forth. …”
Get full text

Modified arithmetic optimization algorithm for drones measurements and tracks assignment problem by Abu Zitar, Raed

“…The measurements and track generation are simulated using Stone Soup software. On the other hand, the optimization of the problem is implemented using several evolutionary-based metaheuristic algorithms. …”
Get full text

An Efficient Tabu Search Algorithm For The Single-Machine Mean Tardiness Problem by Bendaya, M.

“…In this paper, an efficient tabu search algorithm is prepared ibr solving the singlemachine mean tardiness problem. …”
Get full text

A parallel optimization algorithm for the maximum clique problem. (c2008) by Rizk, Mohamad A.

Get full text
Get full text

A parallel genetic algorithm for the geometrically constrained site layout problem by Zouein, P.

“…This paper presents a parallel genetic algorithm to solve the geometrically constrained site layout problem that involves coordinating the use of limited space to accommodate temporary facilities subject to geometric constraints. …”
Get full text
Get full text
Get full text

Linear-time algorithms for problems on planar graphs with fixed disk dimension by Abu-Khzam, Faisal N.

“…In particular, a linear-time approximation algorithm is presented for the pathwidth problem.…”
Get full text
Get full text
Get full text

Integrating genetic algorithms, tabu search, and simulatedannealing for the unit commitment problem by Mantawy, A.H.

“…This paper presents a new algorithm based on integrating genetic algorithms, tabu search and simulated annealing methods to solve the unit commitment problem. …”
Get full text
Get full text

A Multiswarm Intelligence Algorithm for Expensive Bound Constrained Optimization Problems by Wali Khan Mashwani (14590504)

“…The test suite of benchmark function is recently designed for the special session of EAs competition in IEEE Congress on Evolutionary Computation (IEEE-CEC′13). The suggested algorithm has approximated promising solutions with good convergence and diversity maintenance for most of the used bound constrained single optimization problems. …”

Efficient convex-elastic net algorithm to solve the Euclideantraveling salesman problem by Al-Mulhem, M.

“…This paper describes a hybrid algorithm that combines an adaptive-type neural network algorithm and a nondeterministic iterative algorithm to solve the Euclidean traveling salesman problem (E-TSP). …”
Get full text
Get full text

Modified clarke wright algorithms for solving the realistic vehicle routing problem by Shour, Amina

Get full text
Get full text
Get full text
Get full text

A distributed genetic algorithm for deterministic and stochastic labor scheduling problems by Mansour, Nashat

Get full text
Get full text
Get full text
Get full text

Efficient methods and techniques for the open-shop scheduling problem. (c2006) by Bou Ghosn, Steve

Get full text
Get full text

On the periodic hierarchical Chinese postman problem by Muhammed Emre Keskin (19457413)