15 research outputs found
A novel technology for minimizing the synthesis time of nanostructured powders in planetary mills
Full text linkBasic and Hybrid Imperialist Competitive Algorithms for Solving the Non-attacking and Non-dominating n-Queens Problems
No full textA hybrid imperialist competitive algorithm for the flexible job shop problem
No full textFlexible job shop scheduling problem (FJSP) is one of the hardest combinatorial optimization problems known to be NP-hard. This paper proposes a novel hybrid imperialist competitive algorithm with simulated annealing (HICASA) for solving the FJSP. HICASA explores the search space by using imperial competitive algorithm (ICA) and use a simulated annealing (SA) algorithm for exploitation in the search space. In order to obtain reliable results from HICASA algorithm, a robust parameter design is applied. HICASA is compared with the widely-used genetic algorithm (GA) and the relatively new imperialist competitive algorithm (ICA). Experimental results suggest that HICASA algorithm is superior to GA and ICA on the FJSP
Multi-objective imperialistic competitive algorithm with multiple non-dominated sets for the solution of global optimization problems
No full textMulti-Objective Vendor Selection Problem of Supply Chain Management Under Fuzzy Environment
No full textOptimization of process planning with various flexibilities using an imperialist competitive algorithm
No full textGA and ICA approaches to job rotation scheduling problem: considering employee’s boredom
No full text
