Mansour Eddaly

Learn More
A hybrid genetic algorithm is proposed in this paper to minimize the makespan and the total flowtime in the no-wait flowshop scheduling problem, which is known to be NP-hard for more than two machines. The Variable Neighborhood Search is used as an improvement procedure in the last step of the genetic algorithm. First, comparisons are provided with respect(More)
We propose a hybrid approach for multi-objective assignment problem which combines genetic algorithm and mathematical programming techniques. This method is based on the dominance cost variant of the multi-objective genetic algorithm hybridized with exact method. The initial population is generated by solving a series of mono-objective assignment problems(More)
This paper studies the capacitated vehicle routing problem (CVRP). Since the problem is NP-hard, a variable neighborhood search (VNS) algorithm is proposed for the CVRP with the objective to minimize the total traveled distance. The proposed algorithm includes a variable neighborhood descent (VND) algorithm based on several different neighborhood structures(More)