Title: A Minimum Cost Network Flow Model for the Maximum Covering and Patrol Routing Problem
Authors: Dewil, Reginald ×
Vansteenwegen, Pieter
Cattrysse, Dirk
Van Oudheusden, Dirk #
Issue Date: 16-Nov-2015
Publisher: Elsevier
Series Title: European Journal of Operational Research vol:- issue:- pages:27-36
Abstract: This paper shows how the maximum covering and patrol routing problem (MCPRP) can be modeled as a minimum cost network flow problem (MCNFP). Based on the MCNFP model, all available benchmark instances of the MCPRP can be solved to optimality in less than 0.4s per instance. It is furthermore shown that several practical additions to the MCPRP, such as different start and end locations of patrol cars and overlapping shift durations can be modeled by a multi-commodity minimum cost network flow model and solved to optimality in acceptable computational times given the sizes of practical instances.
ISSN: 0377-2217
Publication status: published
KU Leuven publication type: IT
Appears in Collections:Centre for Industrial Management / Traffic & Infrastructure
× corresponding author
# (joint) last author

Files in This Item:
File Description Status SizeFormat
A MCNFP for the MCPRP.pdf Published 311KbAdobe PDFView/Open Request a copy

These files are only available to some KU Leuven Association staff members


All items in Lirias are protected by copyright, with all rights reserved.

© Web of science