In graph theory, Graph Colouring Problem (GCP) is an assignment of colours to vertices of any given graph such that the colours on adjacent vertices are different. The GCP is known to be an optimization and NP-hard problem. Imperialist Competitive Algorithm (ICA) is a meta-heuristic optimization and stochastic search strategy which is inspired from socio-political phenomenon of imperialistic co...

In this paper, optimization of the backstepping controller parameters in a grid-connected single-phase inverter is studied using Imperialist competitive algorithm (ICA), Genetic Algorithm (GA) and Particle swarm optimization (PSO) algorithm. The controller is developed for the system based on state-space averaged model. By selection of a suitable Lyapunov function, stability of the proposed con...

In this paper, a multi-product continuous review inventory control problem within the batch arrival queuing approach (M/M/1) is modeled to find the optimal quantities of the maximum inventory. The objective function is to minimize the total costs of ordering, holding and shortage under warehouse space and service level, and expected lost-sales shortage cost constraints from retailer and warehou...

This paper presents a new hybrid algorithm generated by combining advantageous features of the Imperialist Competitive Algorithm (ICA) and Biogeography Based Optimization (BBO) to create an effective search technique. Although ICA performs fairly well in exploration phase, it is less exploitation stage. In addition, its convergence speed problematic some instances. Meanwhile, BBO method's migra...

The Vehicle Routing Problem (VRP), a famous problem of operation research, holds a central place in combinatorial optimization problems. In this problem, a fleet vehicles with Q capacity start to move from depot and return after servicing to customers in which visit only ones each customer and load more than its capacity not at all. The objective is to minimize the number of used vehicles and t...