Gotowa bibliografia na temat „Workforce Scheduling and Routing Problem”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Spis treści
Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Workforce Scheduling and Routing Problem”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Artykuły w czasopismach na temat "Workforce Scheduling and Routing Problem"
Pereira, Dilson Lucas, Júlio César Alves i Mayron César de Oliveira Moreira. "A multiperiod workforce scheduling and routing problem with dependent tasks". Computers & Operations Research 118 (czerwiec 2020): 104930. http://dx.doi.org/10.1016/j.cor.2020.104930.
Pełny tekst źródłaPunyakum, Voravee, Kanchana Sethanan, Krisanarach Nitisiri i Rapeepan Pitakaso. "Hybrid Particle Swarm and Whale Optimization Algorithm for Multi-Visit and Multi-Period Dynamic Workforce Scheduling and Routing Problems". Mathematics 10, nr 19 (6.10.2022): 3663. http://dx.doi.org/10.3390/math10193663.
Pełny tekst źródłaXie, Fulin, Chris N. Potts i Tolga Bektaş. "Iterated local search for workforce scheduling and routing problems". Journal of Heuristics 23, nr 6 (18.07.2017): 471–500. http://dx.doi.org/10.1007/s10732-017-9347-8.
Pełny tekst źródłaAlgethami, Haneen, Anna Martínez-Gavara i Dario Landa-Silva. "Adaptive multiple crossover genetic algorithm to solve workforce scheduling and routing problem". Journal of Heuristics 25, nr 4-5 (2.08.2018): 753–92. http://dx.doi.org/10.1007/s10732-018-9385-x.
Pełny tekst źródłaCastillo-Salazar, J. Arturo, Dario Landa-Silva i Rong Qu. "Workforce scheduling and routing problems: literature survey and computational study". Annals of Operations Research 239, nr 1 (14.08.2014): 39–67. http://dx.doi.org/10.1007/s10479-014-1687-2.
Pełny tekst źródłaUrquhart, Neil, Emma Hart i William Hutcheson. "Using MAP-Elites to support policy making around Workforce Scheduling and Routing". at - Automatisierungstechnik 68, nr 2 (25.02.2020): 110–17. http://dx.doi.org/10.1515/auto-2019-0107.
Pełny tekst źródłaFukunaga, Takashi, i Junko Hosoda. "Workforce scheduling and routing problem for maintenance work with various work condition on sites". Proceedings of Manufacturing Systems Division Conference 2022 (2022): 211. http://dx.doi.org/10.1299/jsmemsd.2022.211.
Pełny tekst źródłaEliiyi, Uğur, Onur Uğurlu i Sel Tatari. "A Sequential Workforce Scheduling and Routing Problem for the Retail Industry: A Case Study". Journal of Transportation and Logistics 7, nr 2 (30.12.2022): 479–98. http://dx.doi.org/10.26650/jtl.2022.1096085.
Pełny tekst źródłaDahite, Lamiaa, Abdeslam Kadrani, Rachid Benmansour, Rym Nesrine Guibadj i Cyril Fonlupt. "Multi-Objective Model and Variable Neighborhood Search Algorithms for the Joint Maintenance Scheduling and Workforce Routing Problem". Mathematics 10, nr 11 (25.05.2022): 1807. http://dx.doi.org/10.3390/math10111807.
Pełny tekst źródłaÇakırgil, Seray, Eda Yücel i Gültekin Kuyzu. "An integrated solution approach for multi-objective, multi-skill workforce scheduling and routing problems". Computers & Operations Research 118 (czerwiec 2020): 104908. http://dx.doi.org/10.1016/j.cor.2020.104908.
Pełny tekst źródłaRozprawy doktorskie na temat "Workforce Scheduling and Routing Problem"
Algethami, Haneen. "Genetic algorithms for workforce scheduling and routing problem". Thesis, University of Nottingham, 2017. http://eprints.nottingham.ac.uk/47712/.
Pełny tekst źródłaLaesanklang, Wasakorn. "Heuristic decomposition and mathematical programming for workforce scheduling and routing problems". Thesis, University of Nottingham, 2017. http://eprints.nottingham.ac.uk/39883/.
Pełny tekst źródłaLerouge, Mathieu. "Designing and generating user-centered explanations about solutions of a Workforce Scheduling and Routing Problem". Electronic Thesis or Diss., université Paris-Saclay, 2023. http://www.theses.fr/2023UPAST174.
Pełny tekst źródłaDecision support systems based on combinatorial optimization find application in various professional domains. However, decision-makers who use these systems often lack understanding of their underlying mathematical concepts and algorithmic principles. This knowledge gap can lead to skepticism and reluctance in accepting system-generated solutions, thereby eroding trust in the system. This thesis addresses this issue in the case of the Workforce Scheduling and Routing Problems (WSRP), a combinatorial optimization problem involving human resource allocation and routing decisions.First, we propose a framework that models the process for explaining solutions to the end-users of a WSRP-solving system while allowing to address a wide range of topics. End-users initiate the process by making observations about a solution and formulating questions related to these observations using predefined template texts. These questions may be of contrastive, scenario or counterfactual type. From a mathematical point of view, they basically amount to asking whether there exists a feasible and better solution in a given neighborhood of the current solution. Depending on the question types, this leads to the formulation of one or several decision problems and mathematical programs.Then, we develop a method for generating explanation texts of different types, with a high-level vocabulary adapted to the end-users. Our method relies on efficient algorithms for computing and extracting the relevant explanatory information and populates explanation template texts. Numerical experiments show that these algorithms have execution times that are mostly compatible with near-real-time use of explanations by end-users. Finally, we introduce a system design for structuring the interactions between our explanation-generation techniques and the end-users who receive the explanation texts. This system serves as a basis for a graphical-user-interface prototype which aims at demonstrating the practical applicability and potential benefits of our approach
Xie, Fulin. "Models and algorithms for workforce scheduling and routing problems in emergency response services". Thesis, University of Southampton, 2018. https://eprints.soton.ac.uk/422176/.
Pełny tekst źródłaFransson, Rasmus, i Michael Janfjord. "Online Workforce Scheduling and Routing : A case study at an on-site service provider". Thesis, Luleå tekniska universitet, Institutionen för ekonomi, teknik och samhälle, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-64125.
Pełny tekst źródłaCastillo, Salazar José Arturo. "Optimisation models and algorithms for workforce scheduling and routing". Thesis, University of Nottingham, 2015. http://eprints.nottingham.ac.uk/30886/.
Pełny tekst źródłaAl-Hamad, Khaled. "Tabu search for ship routing and scheduling". Thesis, Brunel University, 2006. http://bura.brunel.ac.uk/handle/2438/5071.
Pełny tekst źródłaBögl, Michael, Karl Doerner i Sophie N. Parragh. "The School Bus Routing and Scheduling Problem with Transfers". Wiley Periodicals, Inc, 2015. http://dx.doi.org/10.1002/net.21589.
Pełny tekst źródłaCowling, Peter I., N. J. Colledge, Keshav P. Dahal i Stephen M. Remde. "The trade off between diversity and quality for multi-objective workforce scheduling". Springer-Verlag, 2006. http://hdl.handle.net/10454/2511.
Pełny tekst źródłaYuan, Lufeng. "A Heuristic Approach for the Home Health Care Scheduling and Routing Problem". Thesis, Université d'Ottawa / University of Ottawa, 2020. http://hdl.handle.net/10393/41277.
Pełny tekst źródłaKsiążki na temat "Workforce Scheduling and Routing Problem"
Subtour-Eliminations-Verfahren zur Lösung asymmetrischer Routing-Probleme. Göttingen: Vandenhoeck & Ruprecht, 1991.
Znajdź pełny tekst źródłaOn method and system design for a problem in vehicle routing and scheduling. Lappeenranta: Lappeenranta University of Technology, 1987.
Znajdź pełny tekst źródłaWeiss, Illa. The Resource Transfer Problem: A Framework for Integrated Scheduling and Routing Problems. Springer, 2018.
Znajdź pełny tekst źródłaA Group Theoretic Tabu Search Methodology for Solving the Theater Distribution Vehicle Routing and Scheduling Problem. Storming Media, 2002.
Znajdź pełny tekst źródłaCzęści książek na temat "Workforce Scheduling and Routing Problem"
Pinheiro, Rodrigo Lankaites, Dario Landa-Silva i Jason Atkin. "A Variable Neighbourhood Search for the Workforce Scheduling and Routing Problem". W Advances in Intelligent Systems and Computing, 247–59. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-27400-3_22.
Pełny tekst źródłaGu, Hanyu, Yefei Zhang i Yakov Zinder. "Lagrangian Relaxation in Iterated Local Search for the Workforce Scheduling and Routing Problem". W Lecture Notes in Computer Science, 527–40. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-34029-2_34.
Pełny tekst źródłaUrquhart, Neil, i Emma Hart. "Optimisation and Illumination of a Real-World Workforce Scheduling and Routing Application (WSRP) via Map-Elites". W Parallel Problem Solving from Nature – PPSN XV, 488–99. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-99253-2_39.
Pełny tekst źródłaLaesanklang, Wasakorn, Rodrigo Lankaites Pinheiro, Haneen Algethami i Dario Landa-Silva. "Extended Decomposition for Mixed Integer Programming to Solve a Workforce Scheduling and Routing Problem". W Operations Research and Enterprise Systems, 191–211. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-27680-9_12.
Pełny tekst źródłaUrquhart, Neil, Emma Hart i William Hutcheson. "Quantifying the Effects of Increasing User Choice in MAP-Elites Applied to a Workforce Scheduling and Routing Problem". W Applications of Evolutionary Computation, 49–63. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-16692-2_4.
Pełny tekst źródłaHoltvogt, Nadine. "Crew Scheduling Optimization". W The Service Routing Problem, 61–76. Wiesbaden: Springer Fachmedien Wiesbaden, 2011. http://dx.doi.org/10.1007/978-3-658-24126-1_3.
Pełny tekst źródłaHoltvogt, Nadine. "Routing and Scheduling Problems". W The Service Routing Problem, 9–59. Wiesbaden: Springer Fachmedien Wiesbaden, 2011. http://dx.doi.org/10.1007/978-3-658-24126-1_2.
Pełny tekst źródłaHoltvogt, Nadine. "Crew Scheduling and Shifting Module". W The Service Routing Problem, 95–123. Wiesbaden: Springer Fachmedien Wiesbaden, 2011. http://dx.doi.org/10.1007/978-3-658-24126-1_6.
Pełny tekst źródłaSpada, Michela, Michel Bierlaire i Thomas M. Liebling. "School Bus Routing and Scheduling Problem". W Operations Research Proceedings 2002, 180–86. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-642-55537-4_29.
Pełny tekst źródłaGoel, Asvin, Volker Gruhn i Thomas Richter. "Mobile Workforce Scheduling Problem with Multitask-Processes". W Business Process Management Workshops, 81–91. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-12186-9_9.
Pełny tekst źródłaStreszczenia konferencji na temat "Workforce Scheduling and Routing Problem"
Algethami, Haneen, Rodrigo Lankaites Pinheiro i Dario Landa-Silva. "A genetic algorithm for a workforce scheduling and routing problem". W 2016 IEEE Congress on Evolutionary Computation (CEC). IEEE, 2016. http://dx.doi.org/10.1109/cec.2016.7743889.
Pełny tekst źródła"Computational Study for Workforce Scheduling and Routing Problems". W International Conference on Operations Research and Enterprise Systems. SCITEPRESS - Science and and Technology Publications, 2014. http://dx.doi.org/10.5220/0004833904340444.
Pełny tekst źródłaLerouge, Mathieu, Céline Gicquel, Vincent Mousseau i Wassila Ouerdane. "Counterfactual Explanations for Workforce Scheduling and Routing Problems". W 12th International Conference on Operations Research and Enterprise Systems. SCITEPRESS - Science and Technology Publications, 2023. http://dx.doi.org/10.5220/0011639900003396.
Pełny tekst źródłaAlgethami, Haneen, i Dario Landa-Silva. "Diversity-based adaptive genetic algorithm for a Workforce Scheduling and Routing Problem". W 2017 IEEE Congress on Evolutionary Computation (CEC). IEEE, 2017. http://dx.doi.org/10.1109/cec.2017.7969516.
Pełny tekst źródłaLaesanklang, Wasakorn, Dario Landa-Silva i J. Arturo Castillo Salazar. "Mixed Integer Programming with Decomposition to Solve a Workforce Scheduling and Routing Problem". W International Conference on Operations Research and Enterprise Systems. SCITEPRESS - Science and and Technology Publications, 2015. http://dx.doi.org/10.5220/0005223602830293.
Pełny tekst źródłaZhou, Yalan, Manhui Huang, Hong Wu, Guoming Chen i Zhijian Wang. "Iterated Local Search with Hybrid Neighborhood Search for Workforce Scheduling and Routing Problem". W 2020 12th International Conference on Advanced Computational Intelligence (ICACI). IEEE, 2020. http://dx.doi.org/10.1109/icaci49185.2020.9177523.
Pełny tekst źródłaAlgethami, Haneen, Dario Landa-Silva i Anna Martínez-Gavara. "Selecting Genetic Operators to Maximise Preference Satisfaction in a Workforce Scheduling and Routing Problem". W 6th International Conference on Operations Research and Enterprise Systems. SCITEPRESS - Science and Technology Publications, 2017. http://dx.doi.org/10.5220/0006203304160423.
Pełny tekst źródłaAlgethami, Haneen, Dario Landa-Silva i Anna Martínez-Gavara. "Selecting Genetic Operators to Maximise Preference Satisfaction in a Workforce Scheduling and Routing Problem". W 6th International Conference on Operations Research and Enterprise Systems. SCITEPRESS - Science and Technology Publications, 2017. http://dx.doi.org/10.5220/0006203300001482.
Pełny tekst źródłaMorz, M., i N. Musliu. "Genetic algorithm for rotating workforce scheduling problem". W Second IEEE International Conference on Computational Cybernetics. IEEE, 2004. http://dx.doi.org/10.1109/icccyb.2004.1437685.
Pełny tekst źródłaHe, Chengwan, i You Shi. "Workforce Scheduling and Routing for Home Health Care Services". W the 3rd International Conference. New York, New York, USA: ACM Press, 2019. http://dx.doi.org/10.1145/3331453.3361673.
Pełny tekst źródła