Les Inscriptions à la Bibliothèque sont ouvertes en
ligne via le site: https://biblio.enp.edu.dz
Les Réinscriptions se font à :
• La Bibliothèque Annexe pour les étudiants en
2ème Année CPST
• La Bibliothèque Centrale pour les étudiants en Spécialités
A partir de cette page vous pouvez :
Retourner au premier écran avec les recherches... |
Détail de l'auteur
Auteur Çatay, B.
Documents disponibles écrits par cet auteur
Affiner la rechercheA multi-period double coverage approach for locating the emergency medical service stations in Istanbul / Basar, A. in Journal of the operational research society (JORS), Vol. 62 N° 4 (Avril 2011)
[article]
in Journal of the operational research society (JORS) > Vol. 62 N° 4 (Avril 2011) . - pp. 627–637
Titre : A multi-period double coverage approach for locating the emergency medical service stations in Istanbul Type de document : texte imprimé Auteurs : Basar, A., Auteur ; Çatay, B., Auteur ; Ünlüyurt, T., Auteur Année de publication : 2011 Article en page(s) : pp. 627–637 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Maximal covering Multi-period backup double covering Tabu search Index. décimale : 001.424 Résumé : We consider the multi-period location planning problem of emergency medical service (EMS) stations. Our objective is to maximize the total population serviced by two distinct stations within two different response time limits over a multi-period planning horizon. Our aim is to provide a backup station in case no ambulance is available in the closer station and to develop a strategic plan that spans multiple periods. In order to solve this problem, we propose a Tabu Search approach. We demonstrate the effectiveness of the proposed approach on randomly generated data. We also implement our approach to the case of Istanbul to determine the locations of EMS stations in the metropolitan area. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n4/abs/jors20105a.html [article] A multi-period double coverage approach for locating the emergency medical service stations in Istanbul [texte imprimé] / Basar, A., Auteur ; Çatay, B., Auteur ; Ünlüyurt, T., Auteur . - 2011 . - pp. 627–637.
Recherche opérationnelle
Langues : Anglais (eng)
in Journal of the operational research society (JORS) > Vol. 62 N° 4 (Avril 2011) . - pp. 627–637
Mots-clés : Maximal covering Multi-period backup double covering Tabu search Index. décimale : 001.424 Résumé : We consider the multi-period location planning problem of emergency medical service (EMS) stations. Our objective is to maximize the total population serviced by two distinct stations within two different response time limits over a multi-period planning horizon. Our aim is to provide a backup station in case no ambulance is available in the closer station and to develop a strategic plan that spans multiple periods. In order to solve this problem, we propose a Tabu Search approach. We demonstrate the effectiveness of the proposed approach on randomly generated data. We also implement our approach to the case of Istanbul to determine the locations of EMS stations in the metropolitan area. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n4/abs/jors20105a.html A robust enhancement to the Clarke–Wright savings algorithm / Doyuran, T. in Journal of the operational research society (JORS), Vol. 62 N° 1 (Janvier 2011)
[article]
in Journal of the operational research society (JORS) > Vol. 62 N° 1 (Janvier 2011) . - pp. 223–231
Titre : A robust enhancement to the Clarke–Wright savings algorithm Type de document : texte imprimé Auteurs : Doyuran, T., Auteur ; Çatay, B., Auteur Année de publication : 2011 Article en page(s) : pp. 223–231 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Vehicle routing Clarke–Wright savings algorithm Heuristics Index. décimale : 001.424 Résumé : We address the Clarke and Wright (CW) savings algorithm proposed for the Capacitated Vehicle Routing Problem. We first consider a recent enhancement that uses the put first larger items idea originally proposed for the bin packing problem and show that the conflicting idea of putting smaller items first has a comparable performance. Next, we propose a robust enhancement to the CW savings formulation. The proposed formulation is normalized to efficiently solve different problems, independent from the measurement units and parameter intervals. To test the performance of the proposed savings function, we conduct an extensive computational study on a large set of well-known instances from the literature. Our results show that the proposed savings function provides shorter distances in the majority of the instances and the average performance is significantly better than previously presented enhancements. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n1/abs/jors2009176a.html [article] A robust enhancement to the Clarke–Wright savings algorithm [texte imprimé] / Doyuran, T., Auteur ; Çatay, B., Auteur . - 2011 . - pp. 223–231.
Recherche opérationnelle
Langues : Anglais (eng)
in Journal of the operational research society (JORS) > Vol. 62 N° 1 (Janvier 2011) . - pp. 223–231
Mots-clés : Vehicle routing Clarke–Wright savings algorithm Heuristics Index. décimale : 001.424 Résumé : We address the Clarke and Wright (CW) savings algorithm proposed for the Capacitated Vehicle Routing Problem. We first consider a recent enhancement that uses the put first larger items idea originally proposed for the bin packing problem and show that the conflicting idea of putting smaller items first has a comparable performance. Next, we propose a robust enhancement to the CW savings formulation. The proposed formulation is normalized to efficiently solve different problems, independent from the measurement units and parameter intervals. To test the performance of the proposed savings function, we conduct an extensive computational study on a large set of well-known instances from the literature. Our results show that the proposed savings function provides shorter distances in the majority of the instances and the average performance is significantly better than previously presented enhancements. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n1/abs/jors2009176a.html