Minimum Cycle Partition with Length Requirements

  • In this article we introduce a Minimum Cycle Partition Problem with Length Requirements (CPLR). This generalization of the Travelling Salesman Problem (TSP) originates from routing Unmanned Aerial Vehicles (UAVs). Apart from nonnegative edge weights, CPLR has an individual critical weight value associated with each vertex. A cycle partition, i.e., a vertex disjoint cycle cover, is regarded as a feasible solution if the length of each cycle, which is the sum of the weights of its edges, is not greater than the critical weight of each of its vertices. The goal is to find a feasible partition, which minimizes the number of cycles. In this article, a heuristic algorithm is presented together with a Mixed Integer Programming (MIP) formulation of CPLR. We furthermore introduce a conflict graph, whose cliques yield valid constraints for the MIP model. Finally, we report on computational experiments conducted on TSPLIB-based test instances.

Export metadata

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:Kai Hoppmann-Baum, Gioni Mexi, Oleg Burdakov, Carl Johan Casselgren, Thorsten Koch
Editor:Emmanuel Hebrard, Nysret Musliu
Document Type:Proceedings
Volume:12296
Series:CPAIOR 2020 - Lecture Notes in Computer Science
Publisher:Springer
Year of first publication:2020
DOI:https://doi.org/10.1007/978-3-030-58942-4_18