Scopus İndeksli Yayınlar Koleksiyonu

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

Browse

Filters

20212

Settings

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

Search Results

Now showing 1 - 2 of 2
  • 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
    A goal programming approach for multi objective, multi-trips and time window routing problem in home health care service
    (2021) Dengiz, Asiye Ozge; Atalay, Kumru Didem; Altiparmak, Fulya
    The structure of services in the health sector is changed by the epidemic diseases affecting the world, the population growth and developing technologies. Due to the advantages it provides, home health care (HHC) services are increasingly being demanded by patients. With the in-crease in demand for HHC, the interest of researchers in Home Health Care Routing Problem (HHCRP) is also increasing. In this study, HHCRP has been studied based on information gathered from a relevant unit of a State Hospital providing HHC services in Ankara. Due to the limited resources in the hospital under consideration, vehicles often need to be used for multiple rounds. Thus, the HHCRP is considered as a multi-tour routing problem. Besides, the problem has been created with time window constraints in order to ensure that the demands of the patients are met on time. Meantime, meeting all the patient demands and reducing the environmental impacts are two important goals in HHCRP. The reduction of the environmental impacts can be achieved by minimizing the carbon emission of the vehicles used in the HHC. Thus, the problem addressed in this study has been defined as a multi-objective, multi-trip and time-windows home healthcare routing problem (MTTW-HHCRP). Weighted goal programming (GP) method is used to solve the proposed problem. Test problems are randomly generated based on the data and the information obtained from the hospital in Ankara, and the solutions obtained through scenario analysis are evaluated to guide the decision-making process.