The exploration of hybrid metaheuristics — combination of metaheuristics with concepts and processes from other research areas — has been an important trend in combinatorial optimization research. In this work, we developed a hybrid version of the GRASP metaheuristic which incorporates the path-relinking procedure — a memory-based intensification strategy — and a data mining module. Computation...

This paper is concerned with the development of a new hybrid metaheuristic approach for solving a practical university course timetabling problem in Vietnam. Our hybrid method is a combination of Harmony Search (HS) algorithm and the Bees algorithm. The proposed method has been tested on 14 real-world data instances and compared with some other metaheurisitic approaches, which are Variable Neig...

Doç. Dr. Bilge BİLGEN 10:30 11:00 Integrated production scheduling and distribution planning in dairy supply chain by hybrid modelling Araş. Gör. Şebnem DEMİRKOL AKYOL 11:00 11:15 A Rule Based Constructive Randomized Search Algorithm for Solving ALWABP Araş. Gör. Alper HAMZADAYI 11:15 11:30 A hybrid complete rescheduling approach for dynamic m identical parallel machine scheduling problem with ...

This paper is an application of Ant Colony Metaheuristic (ACO) to the problem of image fractal compression using IFS. An ACO hybrid algorithm is proposed for image fractal compression and the results obtained are shown. According to the tests carried out, the proposed algorithm offers images with similar quality to that obtained with a deterministic method, in about 34% less time.

This paper presents two GRASP metaheuristic algorithms for the vehicle routing problem, considering the capacity and shared demand of the customers. In this paper the solution obtained is compared with a greedy solution and two hybrid solutions (greedy and random). The results obtained show that the GRASP algorithm obtains a better quality solution for this kind of problem.

This paper addresses the Vehicle Routing Problem with Delivery Time Cost. This problem aims to find a set of routes of minimal total costs including the travelling cost and delivery time cost, starting and ending at the depot, in such a way that each customer is visited by one vehicle given the capacity of the vehicle to satisfy a specific demand. In this research, a hybrid metaheuristic approa...

This study deals with the problem of establishing the network of emergency service units. The goal of the basic problem proposed in the literature is to locate certain number of units at given discrete points of the region and to allocate cities to established units, in order to balance the load of established emergency units. Having in mind that emergency units work in shifts, we extend the ba...