The period traveling salesman problem: A new heuristic algorithm
From MaRDI portal
Publication:1603331
DOI10.1016/S0305-0548(01)00035-1zbMath1038.90067MaRDI QIDQ1603331
Publication date: 11 July 2002
Published in: Computers \& Operations Research (Search for Journal in Brave)
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
Related Items
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 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, Exact and heuristic algorithms for the vehicle routing problem with multiple interdependent time windows
Cites Work
- Unnamed Item
- 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
- Computer Solutions of the Traveling Salesman Problem