The family traveling salesman problem with incompatibility constraints

DOI10.1002/net.22036OpenAlexW3142352709MaRDI QIDQ6065853

Ana Paias, Raquel Bernardino

Publication date: 11 December 2023

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.22036

zbMATH Keywords

branch-and-cut algorithmnetwork flowsvalid inequalitiesant colony optimization algorithmincompatibility constraintsfamily traveling salesman problemiterated local search algorithm

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: a branch-and-price approach
• A survey on optimization metaheuristics
• Solving the family traveling salesman problem
• The directed profitable rural postman problem with incompatibility constraints
• An efficient ant colony optimization algorithm for the blocks relocation problem
• Pickup and delivery problem with incompatibility constraints
• Randomized heuristics for the family traveling salesperson problem
• Solution of a Large-Scale Traveling-Salesman Problem
• Heuristic approaches for the family traveling salesman problem
• An ILS heuristic for the ship scheduling problem: application in the oil industry

This page was built for publication: The family traveling salesman problem with incompatibility constraints