A new heuristic for the period traveling salesman problem
From MaRDI portal
Publication:1894732
DOI10.1016/0305-0548(94)00031-3zbMath0830.90129MaRDI QIDQ1894732
Bruce L. Golden, Edward A. Wasil, I-Ming Chao
Publication date: 24 July 1995
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0305-0548(94)00031-3
90C35: Programming involving graphs or networks
Related Items
Scheduling periodic customer visits for a traveling salesperson, The period traveling salesman problem: A new heuristic algorithm, 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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The traveling salesman problem: An overview of exact and approximate algorithms
- A multiperiod traveling salesman problem: Heuristic algorithms
- New optimization heuristics. The great deluge algorithm and the record- to-record travel
- The period routing problem
- Implementing vehicle routing algorithms
- Computer Solutions of the Traveling Salesman Problem