Fast local search and guided local search and their application to British Telecom's workforce scheduling problem
From MaRDI portal
(Redirected from Publication:1362516)
Recommendations
Cites work
- scientific article; zbMATH DE number 43238 (Why is no real title available?)
- scientific article; zbMATH DE number 41891 (Why is no real title available?)
- scientific article; zbMATH DE number 3481857 (Why is no real title available?)
- scientific article; zbMATH DE number 3497315 (Why is no real title available?)
- scientific article; zbMATH DE number 3573250 (Why is no real title available?)
- scientific article; zbMATH DE number 1488569 (Why is no real title available?)
- scientific article; zbMATH DE number 194544 (Why is no real title available?)
- Branch-and-Bound Methods: A Survey
- Fast Algorithms for Geometric Traveling Salesman Problems
- Guided Local Search
- Tabu Search—Part I
- Tabu Search—Part II
- The theory of search: III. The optimum distribution of searching effort
Cited in
(36)- Multiperiod integrated spare parts and tour planning for on-site maintenance activities with stochastic repair requests
- A survey on optimization metaheuristics
- France Telecom workforce scheduling problem: a challenge
- A biased random key genetic algorithm for the field Technician scheduling problem
- A combinatorial approach for enhancing the performance of TH-PPM UWB systems: chaotic vs. classical codes sequences
- Randomized gravitational emulation search algorithm for symmetric traveling salesman problem
- Active guided evolution strategies for large-scale vehicle routing problems with time windows
- Branch-and-price for a multi-attribute technician routing and scheduling problem
- An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
- Guided local search as a network planning algorithm that incorporates uncertain traffic demands
- Scheduling technicians and tasks in a telecommunications company
- Embedding a novel objective function in a two-phased local search for robust vertex coloring
- Guided local search and its application to the traveling salesman problem
- Multi-period technician scheduling with experience-based service times and stochastic customers
- Space and time allocation in a shipyard assembly hall
- Task assignment with start time-dependent processing times for personnel at check-in counters
- Guided local search joins the elite in discrete optimisation
- Memory intensive AND/OR search for combinatorial optimization in graphical models
- Decision support for the technician routing and scheduling problem
- Problems of discrete optimization: challenges and main approaches to solve them
- A parallel matheuristic for the technician routing and scheduling problem
- Un algorithme GRASP pour le problème de planification de techniciens et d'interventions pour les télécommunications
- Multilocus consensus genetic maps (MCGM): Formulation, algorithms, and results
- Guided Local Search
- Tabu search heuristics for the vehicle routing problem with time windows.
- Mixed integer linear programming for a multi-attribute technician routing and scheduling problem
- Workforce planning incorporating skills: state of the art
- Active-guided evolution strategies for large-scale capacitated vehicle routing problems
- Resource constrained routing and scheduling: review and research prospects
- Hybrid metaheuristics: an introduction
- Applying the attribute based hill climber heuristic to the vehicle routing problem
- Staff scheduling and rostering: a review of applications, methods and models.
- A metaheuristic based on tabu search for solving a technician routing and scheduling problem
- An integrated solution approach for multi-objective, multi-skill workforce scheduling and routing problems
- On the foundations and the applications of evolutionary computing
- Fast and high precision algorithms for optimization in large-scale genomic problems
This page was built for publication: Fast local search and guided local search and their application to British Telecom's workforce scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1362516)