Metaheuristic optimization algorithms have become a popular choice for solving complex
problems which are otherwise difficult to solve by traditional methods. However, these …

Since the appearance of cloud computing, computing capacity has been charged as a
service through the network. The optimal scheduling of computing resources (OSCR) over …

Ant-based algorithms simulate the cooperative behaviour of real ants in finding food
resources. A significant number of studies have focused on the self-organised behaviour of …

The proliferation of mobile smart devices has led to a rapid increase of location-based
services, many of which are amassing large datasets of user trajectory information …

Combining ideas from evolutionary algorithms, decomposition approaches, and Pareto local
search, this paper suggests a simple yet efficient memetic algorithm for combinatorial …

This paper presents a Pareto-based bi-objective optimization of hazardous materials vehicle
routing and scheduling problem with time windows and shows its application to a realistic …

The calculation of the exact set in Multi-Objective Combinatorial Optimization (MOCO)
problems is one of the most computationally demanding tasks as most of the problems are …

Generator maintenance scheduling (GMS) determines the outage periods of generating
units in a one-year or two-year planning horizon for regular safety inspection. This paper …

Ant colony optimization (ACO) algorithms often fall into the local optimal solution and have
lower search efficiency for solving the travelling salesman problem (TSP). According to …

Bu çalışmada, NP-zor problem sınıfından olan gezgin satıcı probleminin (GSP), stokastik
optimizasyon tekniklerinin en genel sınıfı olan metasezgisel yöntemlerle çözümü ele …