Fast local search and guided local search and their application to British Telecom's workforce scheduling problem

DOI10.1016/S0167-6377(96)00042-9zbMATH Open0882.90102OpenAlexW2114712485MaRDI QIDQ1362516FDOQ1362516

Authors: Chris Voudouris, Edward Tsang 

Publication date: 10 March 1998

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-6377(96)00042-9

Recommendations

• Guided Local Search
• Guided local search joins the elite in discrete optimisation
• scientific article; zbMATH DE number 4091174
• Guided local search with shifting bottleneck for job shop scheduling
• Guided local search as a network planning algorithm that incorporates uncertain traffic demands

zbMATH Keywords

local searchhill climbing

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Case-oriented studies in operations research (90B90) Integer programming (90C10) Theory of organizations, manpower planning in operations research (90B70)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Tabu Search—Part I
• Title not available (Why is that?)
• Branch-and-Bound Methods: A Survey
• Tabu Search—Part II
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Fast Algorithms for Geometric Traveling Salesman Problems
• Guided Local Search
• Title not available (Why is that?)
• The theory of search: III. The optimum distribution of searching effort

Cited In (36)

• Guided local search as a network planning algorithm that incorporates uncertain traffic demands
• Un algorithme GRASP pour le problème de planification de techniciens et d'interventions pour les télécommunications
• Applying the attribute based hill climber heuristic to the vehicle routing problem
• Resource constrained routing and scheduling: review and research prospects
• An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
• Task assignment with start time-dependent processing times for personnel at check-in counters
• A combinatorial approach for enhancing the performance of TH-PPM UWB systems: chaotic vs. classical codes sequences
• Scheduling technicians and tasks in a telecommunications company
• A parallel matheuristic for the technician routing and scheduling problem
• Decision support for the technician routing and scheduling problem
• Workforce planning incorporating skills: state of the art
• Staff scheduling and rostering: a review of applications, methods and models.
• Multi-period technician scheduling with experience-based service times and stochastic customers
• A survey on optimization metaheuristics
• Space and time allocation in a shipyard assembly hall
• Multilocus consensus genetic maps (MCGM): Formulation, algorithms, and results
• Guided local search and its application to the traveling salesman problem
• A biased random key genetic algorithm for the field Technician scheduling problem
• Embedding a novel objective function in a two-phased local search for robust vertex coloring
• Active-guided evolution strategies for large-scale capacitated vehicle routing problems
• An integrated solution approach for multi-objective, multi-skill workforce scheduling and routing problems
• Multiperiod integrated spare parts and tour planning for on-site maintenance activities with stochastic repair requests
• Branch-and-price for a multi-attribute technician routing and scheduling problem
• Tabu search heuristics for the vehicle routing problem with time windows.
• Fast and high precision algorithms for optimization in large-scale genomic problems
• France Telecom workforce scheduling problem: a challenge
• Guided local search joins the elite in discrete optimisation
• Active guided evolution strategies for large-scale vehicle routing problems with time windows
• Hybrid metaheuristics: an introduction
• Randomized gravitational emulation search algorithm for symmetric traveling salesman problem
• Guided Local Search
• A metaheuristic based on tabu search for solving a technician routing and scheduling problem
• On the foundations and the applications of evolutionary computing
• Memory intensive AND/OR search for combinatorial optimization in graphical models
• Problems of discrete optimization: challenges and main approaches to solve them
• Mixed integer linear programming for a multi-attribute technician routing and scheduling problem

Uses Software

• Tabu search

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)