Economics at your fingertips  

Branch-and-Price for a Multi-attribute Technician Routing and Scheduling Problem

Ines Mathlouthi, Michel Gendreau and Jean-Yves Potvin ()
Additional contact information
Ines Mathlouthi: Université de Montréal
Michel Gendreau: Université de Montréal
Jean-Yves Potvin: Université de Montréal

SN Operations Research Forum, 2021, vol. 2, issue 1, 1-35

Abstract: Abstract In this paper, we present an exact branch-and-price algorithm for a multi-attribute technician routing and scheduling problem. This problem integrates a number of distinctive features from a real-world application, like management of an inventory of different parts and multiple time windows for service. Based on the fact that not all tasks need to be performed, a new ternary branching scheme is introduced within the branch-and-price algorithm. Computational results show that our algorithm can solve instances with up to 45 tasks and greatly improves upon a commercial solver applied to an arc-based mixed integer linear program.

Keywords: Technician routing and scheduling; Multiple time windows; Column generation; Branch-and-price; Elementary shortest path with resource constraints; Ternary branching (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1) Track citations by RSS feed

Downloads: (external link) Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link:

Ordering information: This journal article can be ordered from

DOI: 10.1007/s43069-020-00044-x

Access Statistics for this article

SN Operations Research Forum is currently edited by Marco Lübbecke

More articles in SN Operations Research Forum from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().

Page updated 2022-05-12
Handle: RePEc:spr:snopef:v:2:y:2021:i:1:d:10.1007_s43069-020-00044-x