Scopus İndeksli Yayınlar Koleksiyonu

Permanent URI for this collectionhttps://hdl.handle.net/11727/4809

Browse

Filters

2011 - 20152

Settings

Author: search.filters.author.Alabas-Uslu, CigdemHas files: No

Search Results

Now showing 1 - 2 of 2
  • No Thumbnail Available
    Item
    A Self-tuning Heuristic for the Design of Communication Networks
    (2015) Dengiz, Berna; Alabas-Uslu, Cigdem
    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) finding a minimum-cost network topology that every pair of nodes can communicate with each other and (2) computing overall reliability to provide the reliability constraint. Over the last two decades, metahemistic algorithms have been widely applied to solve this problem due to its NP-hardness. In this study, a self-tuning heuristic (STH), which is a new approach free from parameter tuning, is applied to the design of communication networks. Extensive computational results confirm that STH generates superior solutions to the problem in comparison to some well-known local search metaheuristics, and also more sophisticated metaheuristics proposed in the literature. The practical advantage of STH lies in both its effectiveness and simplicity in application to the design problem.
  • No Thumbnail Available
    Item
    A Self-adaptive Local Search Algorithm for the Classical Vehicle Routing Problem
    (2011) Alabas-Uslu, Cigdem; Dengiz, Berna
    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 routes from one depot to a number of customers under the limitations of side constraints to minimize the total traveling cost. The importance of this problem comes from practical as well as theoretical point of view. The proposed heuristic, self-adaptive local search (SALS), has one generic parameter which is learnt throughout the search process. Computational experiments confirm that SALS gives high qualified solutions to the VRP and ensures at least an average performance, in terms of efficiency and effectiveness, on the problem when compared with the recent and sophisticated approaches from the literature. The most important advantage of the proposed heuristic is the application convenience for the end-users. SALS also is flexible that can be easily applied to variations of VRP. (C) 2011 Elsevier Ltd. All rights reserved.