Farklı Lokasyonlarda, Farklı ve Çoklu Yetenek Gerektiren İşler İçeren Sistemlerde İşgücü Çizelgeleme ve Rotalama Optimizasyonu

Eda YÜCEL (TOBB EKONOMİ VE TEKNOLOJİ ÜNİVERSİTESİ)
Güültekin KUYZU (TOBB EKONOMİ VE TEKNOLOJİ ÜNİVERSİTESİ)
10 7

Proje Grubu: MAG Sayfa Sayısı: 105 Proje No: 117M577 Proje Bitiş Tarihi: 01.05.2020 Metin Dili: Türkçe İndeks Tarihi: 23-03-2021

Farklı Lokasyonlarda, Farklı ve Çoklu Yetenek Gerektiren İşler İçeren Sistemlerde İşgücü Çizelgeleme ve Rotalama Optimizasyonu

Öz:
Gerçek hayatta karsılastıgımız, teknisyenlerin müsterilere ait mülkiyetlerde gerçeklestirecekleri bakım/tamir faaliyetlerinin çizelgelenmesi, gezici saglık ekiplerinin/hemsirelerin is çizelgelerinin hazırlanması, güvenlik ekiplerinin hedef alanı rotalayacak sekilde günlük rotalarının belirlenmesi gibi problemler, isgücü çizelgeleme ve rotalama problemleri olarak ele alınmaktadır. Bu problemlerde, farklı lokasyonlarda, çesitli yetenek gereksinimleri ve öncelikleri olan isler ve isleri gerçeklestirebilecek çesitli yeteneklere sahip personeller vardır. Gerçeklestirilecek is sayısı, personel sayısından fazla oldugu için personeller isleri gerçeklestirmek için seyahat ederler. Bir isin birden fazla yetenek gereksiniminin oldugu, dolayısıyla ekip olusturulması gereken durumlar bulunmaktadır. Amaç, islerin önceliklerini ve yetenek gereksinimlerini dikkate alarak en az maliyet ile en çok isin gerçeklestirilmesini saglamak üzere ekiplerin olusturulması ve ekiplerin is atamaları ile rotalarının belirlenmesidir. Projede, yerinde servis hizmeti saglayan tüm servis operasyonlarında gözlemlenen yetenek gereksinimleri varlıgında isgücü rotalama ve çizelgeleme problemleri çalısılmıstır. Proje kapsamında, öncelikle, verilen isleri ekiplere atamak üzere literatürde daha önce çalısılmamıs amaçları ve kısıtları içeren statik problem tanımlanmıstır. Statik problem için, yetenek gereksinimlerini dikkate alarak ekipler olusturan, isleri ekiplere atayan ve öncelikli amacı önceliklerine göre is atamasını gerçeklestirmek, ikincil öncelikli amacı operasyonel maliyetleri en küçükleyerek ekipleri en etkin sekilde kullanmak olan çözüm yöntemleri gelistirilmistir. Planlı islerin yanında gün içinde ortaya çıkan islerin en büyük fayda, en az etki ile günlük planlamaya dâhil edilmesini amaçlayan dinamik problem de projede çalısılmıs ve büyük ölçekli problemler için en kısa zamanda etkin bir çözüm sunmaya yönelik yöntemler gelistirilmistir. Literatürdeki çalısmalardan farklı olarak, proje ile problem için gün basından gün sonuna kadar anlık degisimleri de kapsayan uçtan uca çözüm sunulmustur. Böylelikle, hızla büyüyen servis sektöründeki firmalar için hem operasyonel maliyetlerin azalması, hem de servis seviyesinin ve müsteri memnuniyetinin artması hedeflenmistir. Proje kapsamında, iki yüksek lisans, iki lisans ögrencisi çesitli asamalarda görev almıslardır. Proje kapsamındaki çalısmalar ulusal ve uluslararası konferans bildirileri, hakemli ULAKBIM ve SCI dergi yayınları olarak proje çıktılarına dönüstürülmüstür.
Anahtar Kelime: sezgisel yöntemler çoklu amaçlar çoklu yetenek dinamik rotalama ısgücü çizelgeleme ve rotalama

Konular: Endüstri Mühendisliği
Erişim Türü: Erişime Açık
  • Akjiratikarl, C., Yenradee, P., & Drake, P. R. 2007. “Pso-based algorithm for home care worker scheduling in the UK”. Computers and Industrial Engineering, 53(4), 559 – 583.
  • 1- Öncelik Seviyelerine Sahip Çoklu Yetenek Gerektiren Isler içinEkip Olusturma, Çizelgeleme ve Rotalama (Makale - Diger Hakemli Makale),
  • Allaoua, H., Borne, S., L´etocart, L., and Calvo, R. W. 2013. “A matheuristic approach for solving a home health care problem”, Electronic Notes in Discrete Mathematics, 41(0):471 – 478, 2013
  • 2- An integrated solution approach for multi-objective, multi-skill workforce scheduling and routing problems (Makale - Diger Hakemli Makale),
  • Almada-Lobo, B., Oliveira, J. F., & Carravilla, M. A. 2008. “Production planning and scheduling in the glass container industry: A vns approach”. International Journal of Production Economics,114(1), 363 – 375. Special Section on Competitive Advantage through Global Supply Chains.
  • 3- A Matheuristic Approach for Forming, Scheduling and Routing Field Service Teams with Prioritized Multi-Skill Tasks (Bildiri - Uluslararası Bildiri - Sözlü Sunum),
  • Alsheddy, A. & Tsang, E. P. K. 2011. “Empowerment scheduling for a field workforce”. Journal of Scheduling, 14(6), 639–654.
  • 4- An Optimization Framework for Dynamic Multi-Skill Workforce Scheduling and Routing Problem (Bildiri - Uluslararası Bildiri - Sözlü Sunum),
  • Anghinolfi, D. & Paolucci, M. 2007. “Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach”. Computers Operations Research, 34(11), 3471 – 3490.
  • 5- Çoklu Yetenekli Isgücü Rotalama ve Çizelgeleme Problemi için Bütünlesik Çözüm Yaklasımları (Bildiri - Ulusal Bildiri - Sözlü Sunum),
  • Arroyo, J. E. C., dos Santos Ottoni, R., & de Paiva Oliveira, A. 2011. “Multi-objective variable neighborhood search algorithms for a single machine scheduling problem with distinct due Windows”. Electronic Notes in Theoretical Computer Science, 281, 5 – 19. Proceedings of the 2011 Latin American Conference in Informatics CLEI).
  • 6- Dinamik Çok Yetenekli Is Gücü Planlama ve Rotalama Problemi için Optimizasyon Çatısı (Bildiri - Ulusal Bildiri - Sözlü Sunum),
  • Attanasio, A., Cordeau J.F., Ghiani G., Laporte G. 2004. “Parallel tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem”, Parallel Computing, 30, 377–387.
  • Barcelo, J., H. Grzybowska, S. Pardo, “Vehicle routing and scheduling models, simulation and city logistics”, in Dynamic Fleet Management, ed. by V. Zeimpekis, C.D. Tarantilis, G.M.
  • Giaglis, I. Minis. Operations Research/Computer Science Interfaces, vol. 38 (Springer, New York, 2007), pp. 163–195
  • Bard, J. F., Shao, Y., & Jarrah, A. I. 2014. “A sequential GRASP for the therapist routing and scheduling problem”. Journal of Scheduling,17(2), 109–133.
  • Barrera, D., Velasco, N., & Amaya, C.-A. 2012. “A network-based approach to the multi-activity combined timetabling and crew scheduling problem: Workforce scheduling for public health policy implementation”. Computers & Industrial Engineering, 63(4), 802–812.
  • Barrera, D., Velasco, N., & Amaya, C.-A., 2012. “A network-based approach to the multiactivity combined timetabling and crew scheduling problem: Workforce scheduling for public health policy implementation”. Computers & Industrial Engineering, 63(4), 802–812.
  • Beaudry, A., G. Laporte, T. Melo, S. Nickel, 2010. “Dynamic transportation of patients in hospitals”. OR Spectr. 32, 77–107 doi:10.1007/s00291-008-0135-6
  • Belhaiza, S., Hansen, P., & Laporte, G. 2014. “A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time Windows”. Computers Operations Research, 52, 269 – 281. Recent advances in Variable neighborhood search.
  • B ́erub ́e, J.-F., Gendreau, M., & Potvin, J.-Y. 2009. “An exact [epsilon]-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits”. European Journal of Operational Research, 194(1), 39–50.
  • Bent, R., P. Van Hentenryck, (2004). “Scenario-based planning for partially dynamic vehicle routing with stochastic customers”. Oper. Res. 52(6), 977–987
  • Benyahia, I., J.Y. Potvin, (1998) “Decision support for vehicle dispatching using genetic programming”. IEEE Trans. Syst. Man Cybern. A: Syst. Humans 28(3), 306–314
  • Berbeglia, G., Cordeau J.F., Laporte G. 2010. “Dynamic pickup and delivery problems”, European Journal of Operations Research, 202, 8-15.
  • Bieding, T., Görtz S., Klose A. 2009. “On-line routing per mobile phone: a case on subsequent deliveries of newspapers”. Innovations in Distribution Logistics, Lecture Notes in Economics and Mathematical Systems, vol. 619. Editör: M. Beckmann, H.P. Künzi, G. Fandel, W. Trockel, A. Basile, A. Drexl, H. Dawid, K. Inderfurth, W. Kürsten, J.A. Nunen, M.G. Speranza, L. Bertazzi, Berlin Heidelberg: Springer.
  • Blakeley, F., Arg ̈uello, B., Cao, B., Hall, W., & Knolmajer, J. (2003). Optimizing periodic maintenance operations for schindler elevator corporation. Interfaces,33(1), 67–79.
  • Blakeley, F., Bozkaya, B., Cao, B., Hall, W., Knolmajer, J., 2003. “Optimizing periodic maintenance operations for Schindler Elevator Corporation”. Interfaces 33 (1), 67–79
  • Borenstein, Y., Shah, N., Tsang, E., Dorne, R., Alsheddy, A., Voudouris, C., 2008. “On the partitioning of dynamic scheduling problems”, pp. 1691–1692. doi:10.1145/1389095.1389412.
  • Bostel, N., Dejax, P., Guez, P., & Tricoire, F., 2008. “Multiperiod planning and routing on a rolling horizon for field force optimization logistics”. In Bruce Golden, S. Raghavan, & Edward Wasil (Eds.). The vehicle routing problem: Latest advances and new challenges (43, pp. 503– 525).
  • Bradley, P. & Mangasarian, O. 1997. “Clustering via concave minimization” (mathematical programming technical report 96-03), may 1996. Advances in Neural Information Processing Systems, 9, 368–374.
  • Braekers, K., Hartl, R. F., Parragh, S. N., & Tricoire, F. 2016. “A bi-objective home care scheduling problem: Analyzing the trade-off between costs and client inconvenience”. European Journal of Operational Research, 248(2), 428 – 443.
  • Cakırgil, S., Yucel, E., Kuyzu, G., 2020. “An integrated solution approach for multi-objective, multi-skill workforce scheduling and routing problems”. Computers & Operations Research , 104908doi:10.1016/j.cor. 2020.104908.
  • Campbell, A.M., Savelsbergh M. W. P. 2005 “Decision Support for Consumer Direct Grocery Initiatives”, Transportation Science 39(3):313-327.
  • Castillo-Salazar, J. A., Landa-Silva, D., & Qu, R. (2016). Workforce scheduling and routing problems: literature survey and computational study. Annals of Operations Research, 239(1), 39–67.
  • Chang, M.S., S. Chen, C. Hsueh, “Real-time vehicle routing problem with time windows and simultaneous delivery/pickup demands”. J. East. Asia Soc. Transp. Stud. 5, 2273–2286 (2003)
  • Chankong, V. & Haimes, Y. 1983. “Multiobjective decision making: theory and methodology”. North-Holland series in system science and engineering. North Holland.
  • Chen, X., Thomas, B. W., & Hewitt, M. 2017. “Multi-period technician scheduling with experience-based service times and stochastic customers”. Computers & Operations Research, 82, 1 – 14.
  • Cheng, E. and Rich, J. L., 1998. “A home health care routing and scheduling problem”, Technical Report 98-04, Computational and Applied Mathematics, Rice University
  • Cheung, B.K.S., K.L. Choy, C.-L. Li, W. Shi, J. Tang. 2008.“Dynamic routing model and solution methods for fleet management with mobile Technologies”. Int. J. Prod. Econ. 113(2), 694–705. doi:10.1016/j.ijpe.2007.10.018
  • Cordeau, J. F., Laporte G. 2007. “The dial-a-ride problem: Models and Algorithms”, Annals of Operations Research, 153, 29-46.
  • Cordeau, J.-F., Laporte, G., Pasin, F., and Ropke, S., 2010. “Scheduling Technicians and Tasks in a Telecommunications Company”, Journal of Scheduling, 13, 393–409. 18
  • Cordeau, J., Laporte, G., Potvin, J., Savelsbergh, M., 2007. “Transportation on Demand”. volume 14. pp. 429 – 466.
  • Coslovich, L., Pesenti, R., Ukovich, W., 2006. “A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem”. European Journal of Operational Research 175, 1605 – 1615.
  • de Armas, J. & Melin-Batista, B. 2015. “Variable neighborhood search for a dynamic rich vehicle routing problem with time Windows”. Computers Industrial Engineering,85, 120 – 131.
  • Dohn, A., Kolind, E., & Clausen, J. 2009. “The manpower allocation problem with time windows and job-teaming constraints: A branch-and-price approach”. Computers & Operations Research, 36(4), 1145 – 1157.
  • Dutot, P., Laugier, A. & Bustos, A., 2006. “Technicians and Interventions Scheduling for Telecommunications”. Technical report, France Telecom R&D. 18
  • Eveborn, P, Rönnqvist, M, Einarsdottir, H, Eklund, M, Lidén, K, Almroth, M., 2009. “Operations Research Improves Quality and Efficiency in Home Care”, Interfaces, Vol. 39, No. 1, 18-34, DOI 10.1287/inte.1080.0411
  • Ferrucci, F., Bock, S., 2014. “Real-time control of express pickup and delivery processes in a dynamic environment”. Transportation Research Part B: Methodological 63, 1–14. doi:10.1016/j.trb.2014.02.001.
  • Fikar, C. & Hirsch, P. 2017. “Home health care routing and scheduling: A review”. Computers & Operations Research,77, 86–95.
  • Fırat, M. and Hurkens, C. A. J., 2012. “An improved MIP-based approach for a multi-skill workforce scheduling problem”, Journal of Scheduling, vol. 15, pp. 363-380
  • Fosgerau, M., Engelson, L., 2011. “The value of travel time variance”. Transportation Research Part B 45, 1–8.
  • Francis, P.M., Smilowitz, K.R., Tzur, M., 2008. “The period vehicle routing problem and its extensions”. In: Golden BL, Raghavan S, Wasil E, editors. The vehicle routing problem: latest advances and new challenges.
  • Geiger, M. J. 2008. “Randomised variable neighbourhood search for multi objective optimisation”. CoRR, abs/0809.0271.
  • Gendreau, M., Guertin F., Potvin J.Y., Séguin R. 2006. “Neighborhood search heuristics for a dynamic vehicle dispatching problem with pick-ups and deliveries”, Transportation Research Part C: Emerging Technologies, 14(3), 157-174.
  • Gendreau, M., Guertin, F., Potvin, J.Y., Taillard, E., 1999. “Parallel tabu search for real-time vehicle routing and dispatching”. Transportation Science 33, 381–390. doi:10.1287/trsc.33.4.381.
  • Goel, A., Meisel, F., 2013. “Workforce routing and scheduling for electricity network maintenance with downtime minimization”. European Journal of Operational Research 231 (1), 210–228
  • Haghani, A., S. Jung, “A dynamic vehicle routing problem with time-dependent travel times”. Comput. Oper. Res. 32(11), 2959–2986 (2005). doi:10.1016/j.cor.2004.04.013
  • Hansen, P. & Mladenovic, N. 2001. “J-means: a new local search heuristic for minimum sum of squares clustering”. Pattern Recognition, 34(2), 405 – 413.
  • Hashimoto, H., Boussier, S., Vasquez, M., & Wilbaut, C. 2011. “A grasp-based approach for technicians and interventions scheduling for telecommunications”. Annals of Operations Research, 183(1), 143–161.
  • van Hemert, J., la, J., 2004. “Dynamic routing problems with fruitful regions: Models and evolutionary computation”. doi:10.1007/978-3-540-30217-9_70.
  • Hiermann, G., Prandtstetter, M., Rendl, A., Puchinger, J., & Raidl, G. R. 2015. “Metaheuristics for solving a multimodal home-healthcare scheduling problem”. Central European Journal of Operations Research, 23(1),89–113.
  • Hiermann, G., Puchinger, J., Ropke, S., and Hartl, R. F., 2015. “The Electric Fleet Size and Mix Vehicle Routing Problem with Time Windows and Recharging Stations”, Transportation Science. In press.
  • Hindle, T., Hindle, A., Spollent, M., 2000. “Resource allocation modelling for homebased health and social care services in areas having differential population density levels: a case study in Northern Ireland”. Health Services Management Research 13, 164–169
  • Horn, M.E. T. 2002. “Fleet scheduling and dispatching for demand-responsive passenger services”, Transportation Research Part C, 10, 35–63.
  • Horn, M., 2002. “Multi-modal and demand-responsive passenger transport systems: A modelling framework with embedded control systems”. Transportation Research Part A: Policy and Practice 36, 167–188. doi:10. 1016/S0965-8564(00)00043-4.
  • Ichoua, S., Gendreau, M., Potvin, J.Y., 2000. “Diversion issues in real-time vehicle dispatching”. Transportation Science 34, 426–438. doi:10.1287/trsc.34.4.426.12325.
  • Ichoua, S., Gendreau, M., Potvin, J.Y., 2003. “Vehicle dispatching with time - dependent travel times”. European Journal of Operational Research 144, 379–396. doi:10.1016/S0377- 2217(02)00147-9.
  • Ichoua, S., Gendreau M., Potvin J.Y. 2007. “Planned Route Optimization For Real-Time Vehicle Routing “, Dynamic Fleet Management Volume 38 of the series Operations Research/Computer Science Interfaces Series, chapter 1. Editör: V. Zeimpekis, C.D. Tarantilis, G.M. Giaglis, I. Minis, Springer, US.
  • Jones, D., Mirrazavi, S., & Tamiz, M. 2002. “Multi-objective meta-heuristics: An overview of the current state-of-the-art”. European Journal of Operational Research,137(1), 1 – 9.
  • Julien Soler, Laurent Gaubert, F. T. & Buche, C. 2013. “Data clustering and similarity. In 26th International Florida Artificial Intelligence Research Society Conference”, (pp. 492–495). St. Pete Beach, Florida.
  • Karp, R. M. 1972. “Reducibility among combinatorial problems”. In Complexity of computer computations (pp. 85–103). Springer.
  • Koontz, W. L. G., Narendra, P. M., & Fukunaga, K. 1975. “A branch and bound clustering algorithm”. IEEE Transactions on Computers, C-24(9), 908–915.
  • Kovacs, A., Parragh, A. A., Doerner, K. F., Hartl, R. F., 2012. “Adaptive large neighborhood search for service technician routing and scheduling problems”, Journal of Scheduling, 15(5) 579-600.
  • Lanzarone, E., Matta A. 2014. “Robust nurse-to-patient assignment in home care services to minimize overtimes under continuity of care”, Operations Research for Health Care, 3(2), 48- 58.
  • Larsen, A. 2001. “The Dynamic Vehicle Routing Problem”, PhD thesis, Technical University of Denmark (DTU).
  • Lau, H. C. & Gunawan, A. 2012. “The patrol scheduling problem”. In Practice and Theory of Automated Timetabling (PATAT).
  • Li, J., Yi, K., & Zhang, Q. 2010. “Clustering with diversity. In International Colloquium on Automata, Languages, and Programming”, (pp. 188–200). Springer.
  • Liang, Y.-C. & Lo, M.-H. 2010. “Multi-objective redundancy allocation optimization using a variable neighborhood search algorithm”. Journal of Heuristics, 16(3), 511–535.
  • Lois, A., Ziliaskopoulos, A., 2017. “Online algorithm for dynamic dial a ride problem and its metrics”. Transportation Research Procedia 24, 377 – 384. URL: http://www.sciencedirect.com/science/article/pii/ S2352146517303782, doi:https://doi.org/10.1016/j.trpro.2017.05.097. 3rd Conference on Sustainable Urban Mobility, 3rd CSUM 2016, 26 – 27 May 2016, Volos, Greece.
  • Lim, A., Rodrigues, B., & Song, L. 2004. “Manpower allocation with time Windows”. Journal of the Operational Research Society, 55(11), 1178–1186.
  • Liu, M., Yang, D., Su, Q., & Xu, L. 2018. “Bi-objective approaches for home healthcare medical team planning and scheduling problem”. Computational and Applied Mathematics, 37(4), 4443–4474.
  • Lu, M., Qin, Z., Cao, Y., Liu, Z., & Wang, M. 2014. “Scalable news recommendation using multi-dimensional similarity and jaccard–kmeans clustering”. Journal of Systems and Software,95, 242–251.
  • Lund, K., Madsen O.B.G., Rygaard J.M. 1996. “Vehicle routing problems with varying degrees of dynamism”, Technical Report, IMM Institute of Mathematical Modeling.
  • Mathlouthi, I., Gendreau, M., & Potvin, J.-Y. 2018. “Mixed integer linear programming for a multi-attribute technician routing and scheduling problem”. INFOR: Information Systems and Operational Research, 56(1), 33–49.
  • Misir, M., Smet, P., & Vanden Berghe, G., 2015. “An analysis of generalised heuristics for vehicle routing and personnel rostering problems”. Journal of the Operational Research Society, 66(5), 858–870.
  • Misir, M., Smet, P., Verbeeck, K., & Vanden Berghe, G. 2011. “Security personnel routing and rostering: a hyper-heuristic approach”. In Proceedings of the 3rd International Conference on Applied Operational Research,volume 3, (pp. 193–205). Tadbir.
  • Mladenovi ́c, N. & Hansen, P. (1997). “Variable neighborhood search”. Computers & operations research,24(11),1097–1100.
  • Montemanni, R., L.M. Gambardella, A.E. Rizzoli, A.V. Donati, “Ant colony system for a dynamic vehicle routing problem”. J. Comb. Optim. 10(4), 327–343 (2005). doi:10.1007/s10878-005-4922-6
  • Or, I. (1976). “Traveling salesman-type combinatorial problems and their relation to the logistics of blood banking”. PhD thesis, Evanston (IL): Department of Industrial Engineering and Management Sciences, North- western University.
  • Papamichail, G. P. & Papamichail, D. P. 2007. “The k-means range algorithm for personalized data clustering in e-commerce”. European Journal of Operational Research,177(3), 1400– 1408.
  • Pillac, V., Gendreau M., Gueret C., Medaglia A.L. 2013. “A review of dynamic vehicle routing problems”, European Journal of Operations Research, 225, 1-11.
  • Pillac, V., Gu ́eret, C., & Medaglia, A. L. 2013. “A parallel matheuristic for the technician routing and scheduling problem”. Optimization Letters, 7(7), 1525–1535.
  • Pillac, V., Gu ́eret, C., Medaglia, A., 2018. “A Fast Reoptimization Approach for the Dynamic Technician Routing and Scheduling Problem”. pp. 347–367. doi:10.1007/978-3-319-58253- 5_20. Pisinger, D., Ropke, S., 2007. A general heuristic for vehicle routing problems. Computers & Operations Research 34, 2403–2435.
  • Potvin, J.Y., Rousseau, J.M., 1993. “A parallel route building algorithm for the vehicle routing and scheduling problem with time Windows”. European Journal of Operational Research 66, 331–340.
  • Rao, M. R. 1971. “Cluster analysis and mathematical programming”. Journal of the American Statistical Association,66(335), 622–626.
  • Rasmussen, M. S., Justesen, T., Dohn, A., & Larsen, J. 2012. “The home care crew scheduling problem: Preference-based visit clustering and temporal dependencies”. European Journal of Operational Research,219(3), 598–610.
  • Regnier-Coudert, O., McCall J., Ayodele M., Anderson S. 2016. “Truck and trailer scheduling in a real world, dynamic and heterogeneous context”, Transportation Research Part E: Logistics and Transportation Review, 93, 389-408.
  • Rest K. D., Hirsch P., 2015. “Daily scheduling of home health care services using timedependent public transport”, Flexible Services and Manufacturing Journal.
  • Ropke, S., Pisinger, D., 2006a. “An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows”. Transportation Science 40, 455–472.
  • Ropke, S., Pisinger, D., 2006b. “A unified heuristic for a large class of vehicle routing problems with backhauls”. European Journal of Operational Research 171, 750–775.
  • Saglam, B., Salman, F. S., Sayin, S., & Turkay, M. 2006. “A mixed-integer programming approach to the clustering problem with an application in customer segmentation”. European Journal of Operational Research, 173 (3), 866 – 879.
  • Savelsbergh, M.W., Sol M., 1995. “The general pickup and delivery problem”, Transportation Science. 29, 17–29.
  • Savelsbergh, M., Sol, M., 1997. “Drive: Dynamic routing of independent vehicles”. Operations Research 46. doi:10.1287/opre.46.4.474.
  • Shao, Y., Jonathan, F. B. and Jarrah, A. I., 2012. “The therapist routing and scheduling problem”, IIE Trans. Oper. Eng. Anal. 44 (10) (2012) 868–893
  • Shaw, P., 1997. “A new local search algorithm providing high quality solutions to vehicle routing problems”. APES Group, Dept of Computer Science, University of Strathclyde, Glasgow, Scotland, UK .
  • Shaw, P., 1998. “Using constraint programming and local search methods to solve vehicle routing problems”, in: International conference on principles and practice of constraint programming, Springer. pp. 417–431.
  • Solomon, M. M. 1987. “Algorithms for the vehicle routing and scheduling problems with time windowconstraints”. Operations research,35(2), 254–265.
  • Taillard, E., Gambardella, L.M., Gendreau, M., Potvin, J.Y., 2001. “Adaptive memory programming: A unified view of metaheuristics”. European Journal of Operational Research 135, 1–16. doi:10.1016/S0377-2217(00) 00268-X.
  • Tang, H., Miller-Hooks, E., & Tomastik, R. 2007. “Scheduling technicians for planned maintenance of geographically distributed equipment”. Transportation Research Part E: Logistics and Transportation Review,43(5), 591–609.
  • Trautsamwieser, A. & Hirsch, P. 2011. “Optimization of daily scheduling for home health care services”. Journal of Applied Operational Research,3(3), 124–136.
  • Trautsamwieser, A., & Hirsch, P., 2014. “A branch-price-and-cut approach for solving the medium-term home health care planning problem”, Networks 64(3), 143-159
  • Tsang, E. & Voudouris, C. 1997. “Fast local search and guided local search and their application to British Telecom’s workforce scheduling problem”. Operations Research Letters, 20(3), 119 – 127.
  • Urquhart, N. & Fonzone, A. 2017. “Evolving solution choice and decision support for a realworld optimisation problem”. In Proceedings of the Genetic and Evolutionary Computation Conference, GECCO ’17, (pp. 1264– 1271)., New York, NY, USA. ACM.
  • Wilson, N., Colvin N. 1977. “Computer control of the Rochester dial-a-ride system”. Technical Report R77-31. Dept of Civil Engineering, Massachusetts Institute of Technology, Cambridge, Massachusetts.
  • Weigel, D. & Cao, B. 1999. “Applying GIS and or techniques to solve sears techniciandispatching and home delivery problems”. INFORMS Journal on Applied Analytics, 29(1), 112– 130.
  • Xu, J. & Chiu, S. Y. 2001. “Effective heuristic procedures for a field technician scheduling problem”. Journal of Heuristics, 7(5), 495–509.
  • Yuan, B., Liu, R., & Jiang, Z. 2015. “A branch-and-price algorithm for the home health care scheduling and routing problem with stochastic service times and skill requirements”. International Journal of ProductionResearch,53(24), 7450–7464.
  • Yun-Chia Liang, Angela Hsiang-Ling Chen, C.-Y. T. 2009. “Variable neighborhood search for multi-objectiveparallel machine scheduling problems”. InProceedings of the 8th International Conference on Information andManagement Sciences, (pp. 519522).
  • Zamorano, E. & Stolletz, R. 2017. “Branch-and-price approaches for the multiperiod technician routing andscheduling problem”. European Journal of Operational Research,257(1), 55–68.
  • Zhan, Y. & Wan, G. 2018. “Vehicle routing and appointment scheduling with team assignment for homeservices”. Computers & Operations Research,100, 1–11.
  • Zhu, X. & Wilhelm, W. E. 2006. “Scheduling and lot sizing with sequence-dependent setup: A literature review”. IIE Transactions, 38(11), 987–1007.
APA YÜCEL E, KUYZU G (2020). Farklı Lokasyonlarda, Farklı ve Çoklu Yetenek Gerektiren İşler İçeren Sistemlerde İşgücü Çizelgeleme ve Rotalama Optimizasyonu. , 1 - 105.
Chicago YÜCEL Eda,KUYZU Güültekin Farklı Lokasyonlarda, Farklı ve Çoklu Yetenek Gerektiren İşler İçeren Sistemlerde İşgücü Çizelgeleme ve Rotalama Optimizasyonu. (2020): 1 - 105.
MLA YÜCEL Eda,KUYZU Güültekin Farklı Lokasyonlarda, Farklı ve Çoklu Yetenek Gerektiren İşler İçeren Sistemlerde İşgücü Çizelgeleme ve Rotalama Optimizasyonu. , 2020, ss.1 - 105.
AMA YÜCEL E,KUYZU G Farklı Lokasyonlarda, Farklı ve Çoklu Yetenek Gerektiren İşler İçeren Sistemlerde İşgücü Çizelgeleme ve Rotalama Optimizasyonu. . 2020; 1 - 105.
Vancouver YÜCEL E,KUYZU G Farklı Lokasyonlarda, Farklı ve Çoklu Yetenek Gerektiren İşler İçeren Sistemlerde İşgücü Çizelgeleme ve Rotalama Optimizasyonu. . 2020; 1 - 105.
IEEE YÜCEL E,KUYZU G "Farklı Lokasyonlarda, Farklı ve Çoklu Yetenek Gerektiren İşler İçeren Sistemlerde İşgücü Çizelgeleme ve Rotalama Optimizasyonu." , ss.1 - 105, 2020.
ISNAD YÜCEL, Eda - KUYZU, Güültekin. "Farklı Lokasyonlarda, Farklı ve Çoklu Yetenek Gerektiren İşler İçeren Sistemlerde İşgücü Çizelgeleme ve Rotalama Optimizasyonu". (2020), 1-105.
APA YÜCEL E, KUYZU G (2020). Farklı Lokasyonlarda, Farklı ve Çoklu Yetenek Gerektiren İşler İçeren Sistemlerde İşgücü Çizelgeleme ve Rotalama Optimizasyonu. , 1 - 105.
Chicago YÜCEL Eda,KUYZU Güültekin Farklı Lokasyonlarda, Farklı ve Çoklu Yetenek Gerektiren İşler İçeren Sistemlerde İşgücü Çizelgeleme ve Rotalama Optimizasyonu. (2020): 1 - 105.
MLA YÜCEL Eda,KUYZU Güültekin Farklı Lokasyonlarda, Farklı ve Çoklu Yetenek Gerektiren İşler İçeren Sistemlerde İşgücü Çizelgeleme ve Rotalama Optimizasyonu. , 2020, ss.1 - 105.
AMA YÜCEL E,KUYZU G Farklı Lokasyonlarda, Farklı ve Çoklu Yetenek Gerektiren İşler İçeren Sistemlerde İşgücü Çizelgeleme ve Rotalama Optimizasyonu. . 2020; 1 - 105.
Vancouver YÜCEL E,KUYZU G Farklı Lokasyonlarda, Farklı ve Çoklu Yetenek Gerektiren İşler İçeren Sistemlerde İşgücü Çizelgeleme ve Rotalama Optimizasyonu. . 2020; 1 - 105.
IEEE YÜCEL E,KUYZU G "Farklı Lokasyonlarda, Farklı ve Çoklu Yetenek Gerektiren İşler İçeren Sistemlerde İşgücü Çizelgeleme ve Rotalama Optimizasyonu." , ss.1 - 105, 2020.
ISNAD YÜCEL, Eda - KUYZU, Güültekin. "Farklı Lokasyonlarda, Farklı ve Çoklu Yetenek Gerektiren İşler İçeren Sistemlerde İşgücü Çizelgeleme ve Rotalama Optimizasyonu". (2020), 1-105.
Sayfa Oluşturulma Tarihi
24-04-2024 1:46

İLETİŞİM

TÜBİTAK ULAKBİM TR Dizin

Yüzüncüyıl, İşçi Blokları Mahallesi

Muhsin Yazıcıoğlu Caddesi No:51/C

06530 Çankaya / ANKARA +90 (312) 298 92 00

trdizin@tubitak.gov.tr

TÜBİTAK ULAKBİM Ulusal Akademik Ağ ve Bilgi Merkezi Cahit Arf Bilgi Merkezi © Tüm Hakları Saklıdır. Gizlilik Politikası Kullanım Şartları