Scopus İndeksli Açık & Kapalı Erişimli Yayınlar

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

Browse

Filters

20212

Settings

Author: search.filters.author.Atalay, Kumru DidemHas files: Yes

Search Results

Now showing 1 - 2 of 2
  • 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.
  • No Thumbnail Available
    Item
    A New Methodology for Solving Multiobjective Chance-Constrained Problems: An Application on IoT Systems
    (2021) Atalay, Kumru Didem; Pekin, Tacettin Sercan; Apaydin, Aysen; 0000-0002-9021-3565
    This study presents a newly developed methodology to transform the chance-constrained problem into a deterministic problem and then solving this multiobjective deterministic problem with the proposed method. Chance-constrained problem contains independent gamma random variables that are denoted as a(ij). Two methods are proposed to obtain the deterministic equivalent of chance-constrained problem. The first of the methods is directly based on using the distribution, and the second consists of normalizing probabilistic constraints using Lyapunov's central limit theorem. An algorithm which uses the Global Criterion Method is developed to solve the multiobjective deterministic equivalent of chance-constrained problem. The methodology is applied to a real-life engineering problem that consists of an IoT device and its data sending process. Using Lyapunov's central limit theorem for large numbers of random variables is found to be more appropriate.