A multiperiod traveling salesman problem: Heuristic algorithms

DOI10.1016/0305-0548(92)90018-ZzbMath0758.90074MaRDI QIDQ1195106

Giuseppe Paletta

Publication date: 5 October 1992

Published in: Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

traveling salesmanheuristic algorithmsshortest path on a layered network

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

An improved heuristic for the period traveling salesman problem, A variable neighborhood search heuristic for periodic routing problems, A new heuristic for the period traveling salesman problem, Nested simulated annealing approach to periodic routing problem of a retail distribution system, Heuristic algorithms for the 2-period balanced travelling salesman problem in Euclidean graphs, The period traveling salesman problem: A new heuristic algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal distribution strategies with cyclic demands
• The period routing problem
• A Heuristic for the Periodic Vehicle Routing Problem
• An Analysis of Several Heuristics for the Traveling Salesman Problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem