Highlights A real-world multi-period territory design problem is presented. The scheduling subproblem is formally defined as a mixed integer program (MIP). A heuristic based on a location-allocation scheme is developed. Experiments on real-word instances show the effectiveness of the proposed method.

    Abstract In service territory design applications, a field service workforce is responsible for providing recurring services at their customers’ sites. We introduce the associated planning problem, which consists of two subproblems: In the partitioning subproblem, customers must be grouped into service territories. In the scheduling subproblem, customer visits must be scheduled throughout the multi-period planning horizon. The emphasis of this paper is put on the scheduling subproblem. We propose a mixed integer programming model for this subproblem and present a location-allocation heuristic. The results of extensive experiments on real-world instances show that the proposed heuristic produces high-quality solutions.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    The multi-period service territory design problem – An introduction, a model and a heuristic approach


    Contributors:


    Publication date :

    2016-09-18


    Size :

    23 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English





    An improved heuristic for the period vehicle routing problem

    Chao, I-Ming / Golden, B.L. / Wasil, E. | Tema Archive | 1995



    An adaptive large-neighborhood search heuristic for a multi-period vehicle routing problem

    Dayarian, Iman / Crainic, Teodor Gabriel / Gendreau, Michel et al. | Elsevier | 2016


    A heuristic approach to the AIAA Design Challenge problem

    SUNG, TING-YI / SHEU, HER-JIUN / NADDEF, DENIS | AIAA | 1987