An efficient branch-and-cut algorithm for the parallel drone scheduling traveling salesman problem

DOI10.1007/s10288-022-00527-zarXiv2111.11307MaRDI QIDQ6142940

Minh Hoàng Hà, Hai Long Luong, Ha-Bang Ban, Minh Anh Nguyen

Publication date: 23 January 2024

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2111.11307

zbMATH Keywords

traveling salesman problembranch-and-cutbenchmark instancesparallel drone scheduling

Mathematics Subject Classification ID

Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

• Facet identification for the symmetric traveling salesman polytope
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• The parallel drone scheduling problem with multiple drones and vehicles
• Matheuristic algorithms for the parallel drone scheduling traveling salesman problem
• Minimization and maximization versions of the quadratic travelling salesman problem

This page was built for publication: An efficient branch-and-cut algorithm for the parallel drone scheduling traveling salesman problem