On the impact of real-time information on field service scheduling

Authors:
Ioannis Petrakis;Christian Hass;Martin Bichler
Affiliations:
-;-;-
Venue:
Decision Support Systems
Year:
2012

Citing 9
Cited 2

Algorithms for the vehicle routing and scheduling problems with time window constraints

Operations Research
Integer Programming Formulation of Traveling Salesman Problems

Journal of the ACM (JACM)
Dynamic Workforce Scheduling for British Telecommunications plc

Interfaces
Field workforce scheduling

BT Technology Journal
A Variable Neighborhood Search for the Multi Depot Vehicle Routing Problem with Time Windows

Journal of Heuristics
A general heuristic for vehicle routing problems

Computers and Operations Research
An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows

Transportation Science
Dynamic vehicle routing using genetic algorithms

Applied Intelligence
A unified exact method for solving different classes of vehicle routing problems

Mathematical Programming: Series A and B

An event-driven optimization framework for dynamic vehicle routing

Decision Support Systems
A decision support system for public logistics information service management and optimization

Decision Support Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Mobile phone operators need to plan and schedule field force personnel for maintenance and repair tasks on mobile phone base stations across the country on a daily basis. In this paper, we will introduce the field force scheduling problem with priorities. Motivated by the rising popularity of mobile field force management solutions, we compare online and offline heuristics as well as hybrids to solve the problem. The results help understand the benefits of dynamic scheduling based on real-time position information as compared to traditional daily offline planning.