2021
DOI: 10.1007/s00291-021-00635-y
|View full text |Cite
|
Sign up to set email alerts
|

Mixed-integer programming approaches for the time-constrained maximal covering routing problem

Abstract: In this paper, we study the recently introduced time-constrained maximal covering routing problem. In this problem, we are given a central depot, a set of facilities, and a set of customers. Each customer is associated with a subset of the facilities which can cover it. A feasible solution consists of k Hamiltonian cycles on subsets of the facilities and the central depot. Each cycle must contain the depot and must respect a given distance limit. The goal is to maximize the number of customers covered by facil… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 27 publications
0
1
0
Order By: Relevance
“…• Time-constrained Maximal Covering Routing Problem (TCMCRP) (Amiri & Salari, 2019;Sinnl, 2021), which Generalizes TCMCSP to find the K cycles (routes). In both TCMCSP and TCMCRP, customers are either visited, or covered, or left isolated.…”
Section: Vehicle Routing-allocation Problem (Vrap)mentioning
confidence: 99%
“…• Time-constrained Maximal Covering Routing Problem (TCMCRP) (Amiri & Salari, 2019;Sinnl, 2021), which Generalizes TCMCSP to find the K cycles (routes). In both TCMCSP and TCMCRP, customers are either visited, or covered, or left isolated.…”
Section: Vehicle Routing-allocation Problem (Vrap)mentioning
confidence: 99%