On routing and scheduling a fleet of resource-constrained vessels to provide ongoing continuous patrol coverage

DOI10.1007/s10479-021-04474-6zbMath1494.90094OpenAlexW4205111079MaRDI QIDQ2673804

Menkes H. L. van den Briel, Timothy J. Surendonk, Toby Walsh, Paul A. Chircop

Publication date: 13 June 2022

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-021-04474-6

zbMATH Keywords

branch-and-priceroute planningcontinuous coverage problemsurveillance scheduling

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A minimum cost network flow model for the maximum covering and patrol routing problem
• An improved formulation for the maximum coverage patrol routing problem
• A constraint programming based column generation approach to nurse rostering problems
• A method for solving ship routing problems with inventory constraints
• An intelligent system for US Coast Guard cutter scheduling
• Solving shortest path problems with a weight constraint and replenishment arcs
• Scheduling United States Coast Guard helicopter deployment and maintenance at Clearwater Air Station, Florida
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• A Suggested Computation for Maximal Multi-Commodity Network Flows
• A Polyhedral Approach to Simplified Crew Scheduling and Vehicle Scheduling Problems
• Integer Programming
• Decomposition Principle for Linear Programs
• A Linear Programming Approach to the Cutting-Stock Problem
• Scheduling patrol boats and crews for the Royal Australian Navy
• A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows
• On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm
• Selected Topics in Column Generation
• Shortest Path Problems with Resource Constraints
• Cutting Stock Problems
• Implementing Mixed Integer Column Generation
• Constraint programming-based column generation
• On the computational complexity of the patrol boat scheduling problem with complete coverage

This page was built for publication: On routing and scheduling a fleet of resource-constrained vessels to provide ongoing continuous patrol coverage