Solving the asymmetric traveling salesman problem with periodic constraints

DOI10.1002/net.20011zbMath1103.90087OpenAlexW2000069792MaRDI QIDQ4812398

Chefi Triki, Giuseppe Paletta

Publication date: 20 August 2004

Published in: Networks (Search for Journal in Brave)

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

zbMATH Keywords

asymmetric traveling salesman problemconstruction algorithmperiodic constraintsimprovement procedure

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (max. 100)

Solving the Periodic Edge Routing Problem in the Municipal Waste Collection ⋮ Heuristic algorithms for the 2-period balanced travelling salesman problem in Euclidean graphs ⋮ A novel model for sustainable waste collection arc routing problem: Pareto-based algorithms

Cites Work

• TSPLIB—A Traveling Salesman Problem Library

This page was built for publication: Solving the asymmetric traveling salesman problem with periodic constraints