A new heuristic for the period traveling salesman problem
From MaRDI portal
Publication:1894732
DOI10.1016/0305-0548(94)00031-3zbMath0830.90129OpenAlexW1997853206MaRDI QIDQ1894732
I-Ming Chao, Edward A. Wasil, Bruce L. Golden
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
Related Items
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, Scheduling periodic customer visits for a traveling salesperson, Solving the Periodic Edge Routing Problem in the Municipal Waste Collection, 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, Validating vehicle routing zone construction using Monte Carlo simulation, The period traveling salesman problem: A new heuristic algorithm
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