Search
Now showing items 1-4 of 4
A Self-adaptive Local Search Algorithm for the Classical Vehicle Routing Problem
(2011)
The purpose of this study is introduction of a local search heuristic free from parameter tuning to solve classical vehicle routing problem (VRP). The VRP can be described as the problem of designing optimal delivery of ...
A Self-tuning Heuristic for the Design of Communication Networks
(2015)
This paper addresses the design of communication networks that has a large application area. The problem is to design a minimum cost network subject to a given reliability level. Complexity of the problem is twofold: (1) ...
A Local Search Heuristic with Self-tuning Parameter for Permutation Flow-Shop Scheduling Problem
(2009)
In this paper, a new local search metaheuristic is proposed for the permutation flow-shop scheduling problem. In general, metaheuristics are widely used to solve this problem due to its NP-completeness. Although these ...