Araştırma Çıktıları | TR-Dizin | WoS | Scopus | PubMed

Permanent URI for this communityhttps://hdl.handle.net/11727/4806

Browse

Filters

2018 - 201922020 - 20212

Settings

Author: search.filters.author.Kececi, Barissearch.filters.applied.f.rights: search.filters.rights.info:eu-repo/semantics/openAccess

Search Results

Now showing 1 - 4 of 4
  • No Thumbnail Available
    Item
    A Mathematical Formulation And Heuristic Approach For The Heterogeneous Fixed Fleet Vehicle Routing Problem With Simultaneous Pickup And Delivery
    (2021) Kececi, Baris; Altiparmak, Fulya; Kara, Imdat; ABH-1078-2021
    This study considers a variant of the vehicle routing problem (VRP) called the heterogeneous VRP with simultaneous pickup and delivery (HVRPSPD). The HVRPSPD may broadly be defined as identifying the minimum cost routes and vehicle types. To solve the HVRPSPD, first, we propose a polynomial-size mixed integer programming formulation. Because the HVRPSPD is an NP-hard problem, it is difficult to determine the optimal solution in a reasonable time for moderate and large-size problem instances. Hence, we develop a hybrid metaheuristic approach based on the simulated annealing and local search algorithms called SA-LS. We conduct a computational study in three stages. First, the performance of the mathematical model and SA-LS are investigated on small and medium-size HVRPSPD instances. Second, we compare SA-LS with the constructive heuristics, nearest neigh-borhood and Clarke-Wright savings algorithms, adapted for the HVRPSPD. Finally, the performance of SA-LS is evaluated on the instances of the heterogeneous VRP (HVRP), which is a special case of the HVRPSPD. Computational results demonstrate that the mathematical model can solve small-size instances optimally up to 35 nodes; SA-LS provides good quality solutions for medium and large-size problems. Moreover, SA-LS is superior to simple constructive heuristics and can be a preferable solution method to solve HVRP and VRPSPD instances successfully.
  • No Thumbnail Available
    Item
    Selective generalized travelling salesman problem
    (2020) Derya, Tusan; Dinler, Esra; Kececi, Baris; 0000-0002-2730-5993; F-1639-2011
    This paper introduces the Selective Generalized Traveling Salesman Problem (SGTSP). In SGTSP, the goal is to determine the maximum profitable tour within the given threshold of the tour's duration, which consists of a subset of clusters and a subset of nodes in each cluster visited on the tour. This problem is a combination of cluster and node selection and determining the shortest path between the selected nodes. We propose eight mixed integer programming (MIP) formulations for SGTSP. All of the given MIP formulations are completely new, which is one of the major novelties of the study. The performance of the proposed formulations is evaluated on a set of test instances by conducting 4608 experimental runs. Overall, 4138 out of 4608 (similar to 90%) test instances were solved optimally by using all formulations.
  • No Thumbnail Available
    Item
    An optimization for milling operation of Kevlar fiber-epoxy composite material using factorial design and goal programming methods
    (2019) Ic, Yusuf Tansel; Elaldi, Faruk; Kececi, Baris; Uzun, Gozde Onder; Limoncuoglu, Nur; Aksoy, Irem; 0000-0003-0592-6868; 0000-0002-2730-5993; AAI-1081-2020; AAG-5060-2019; F-1639-2011; AAC-4793-2019
    Kevlar fiber-epoxy composite material is extensively used in manufacturing areas because of the advantages of composite material's characteristics. It is usually processed by traditional machining methods but the drawbacks for determination of optimum cutting parameters might cause some material deformations during machining process. In this study, the cutting parameters are concurrently optimized by using the integrated 2k factorial design and goal programming methods for minimum delamination and minimum surface roughness of Kevlar fiber-epoxy composite and the best machining parameters have been obtained for the material. The results were compared with the results of the multi-criteria decision-based Taguchi methods.
  • Thumbnail Image
    Item
    WEEE estimation and determination of collection points: A case for the Municipality of Cankaya
    (2018) Kececi, Baris; Dengiz, Orhan; Dengiz, Berna; Sumer, Emre; Kilic, Aybuke; Ceki, Ece; Inan, Bedia; Cicek, Selda; 0000-0002-2730-5993; F-1639-2011; AAC-4793-2019
    Electrical-electronic waste (WEEE) is generated from electric and electronic devices at the end of their lifecycles. When WEEEs are disposed, burned or disassembled for recycling, they are transformed into products containing hazardous substances and harm the environment and human health. Therefore WEEEs should be collected, transported and processed properly during their recycling operations by municipality authority in order to minimize their damage and maximize their economic benefit. In this paper, a study is carried out for the WEEE management of Cankaya Municipality by the cooperation of Environmental Conservation and Control Department of Cankaya. For this purpose first WEEE with a focus on television, refrigerator, washing machine, oven and vacuum cleaner are estimated based on the electronic device usage behavior of residents in Cankaya. Secondly, the WEEE collection points' location problem is solved considering set covering problem.