Software testing is a valuable and time-consuming activity that aims to improve the software quality. Due its significance, combinatorial focuses on fault identification by interaction of small amount input factors. But, deep not sufficient due time or resources availability. To select optimal test cases with least computation time, Hybrid Multi Criteria Particle Swarm Ranked Firefly Metaheuris...

Combined heat and power (CHP) plants have opportunities to work as distributed generation for providing demand. Furthermore, CHP contribute effectively overcoming the intermittence of renewable energy sources well load dynamics. need optimal solution(s) electrical demand simultaneously within smart network environment. or cogeneration plant operations appropriate techno-economic dispatching com...

In this paper, we consider the problem of scheduling n independent jobs on m uniform parallel machines such that total weighted completion time is minimized. We present two meta-heuristics and two hybrid meta-heuristics to solve this problem. Based on a set of instances, a comparative study has been realized in order to evaluate these approaches.

The vehicle routing problem consists in determining a group of optimal delivery routes that allow satisfaction of the demand from customers spread along a network, which can be represented as a graph type structure. This paper presents two GRASP metaheuristic algorithms for the above mentioned problem, considering the capacity and shared demand of the customers, solving besides, the 3D bin pack...

This work presents a local search approach to the High School Timetabling Problem. The addressed timetabling model is the one stated in the Third International Timetabling Competition (ITC 2011), which considered many instances from educational institutions around the world and attracted seventeen competitors. Our team, named GOAL (Group of Optimization and Algorithms), developed a solver built...

A hybrid metaheuristic approach by hybridizing harmony search (HS) and firefly algorithm (FA), namely, HS/FA, is proposed to solve function optimization. In HS/FA, the exploration of HS and the exploitation of FA are fully exerted, so HS/FA has a faster convergence speed than HS and FA. Also, top fireflies scheme is introduced to reduce running time, and HS is utilized to mutate between firefli...

This paper presents a hybrid metaheuristic for solving the lot streaming problem in job shop production systems. In contrast with conventional tabu search implementations, where the disjunctive graph is adopted to represent the scheduling problem, our tabu search approach is based on permutation with repetition. Moreover, a specific procedure inspired by genetic algorithms is incorporated to se...