The period traveling salesman problem: A new heuristic algorithm

DOI10.1016/S0305-0548(01)00035-1zbMath1038.90067MaRDI QIDQ1603331

Giuseppe Paletta

Publication date: 11 July 2002

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

Mathematics Subject Classification ID

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

Related Items (10)

A heuristic for the periodic rural postman problem ⋮ An improved heuristic for the period traveling salesman problem ⋮ A variable neighborhood search heuristic for periodic routing problems ⋮ Nested simulated annealing approach to periodic routing problem of a retail distribution system ⋮ A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem ⋮ Scheduling periodic customer visits for a traveling salesperson ⋮ A set-covering based heuristic algorithm for the periodic vehicle routing problem ⋮ Heuristic algorithms for the 2-period balanced travelling salesman problem in Euclidean graphs ⋮ Exact and heuristic algorithms for the vehicle routing problem with multiple interdependent time windows ⋮ The indefinite period traveling salesman problem

Cites Work

• Unnamed Item
• A multiperiod traveling salesman problem: Heuristic algorithms
• New optimization heuristics. The great deluge algorithm and the record- to-record travel
• A new heuristic for the period traveling salesman problem
• The period routing problem
• New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
• A tabu search heuristic for periodic and multi-depot vehicle routing problems
• Computer Solutions of the Traveling Salesman Problem

This page was built for publication: The period traveling salesman problem: A new heuristic algorithm