A Tabu Scatter Search Metaheuristic for the Arc Routing Problem
- 28 February 2003
- journal article
- Published by Elsevier BV in Computers & Industrial Engineering
- Vol. 44 (2), 249-266
- https://doi.org/10.1016/s0360-8352(02)00178-x
Abstract
No abstract availableKeywords
This publication has 30 references indexed in Scilit:
- Solving arc routing problems with turn penaltiesJournal of the Operational Research Society, 2001
- Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated treesEuropean Journal of Operational Research, 2000
- Heuristics for the Mixed Rural Postman ProblemComputers & Operations Research, 1999
- Chapter 5 Arc routing methods and applicationsPublished by Elsevier BV ,1995
- Routeing Road Sweepers in a Rural AreaJournal of the Operational Research Society, 1991
- Sequencing of Insertions in Printed Circuit Board AssemblyOperations Research, 1988
- The Capacitated Chinese Postman Problem: Lower Bounds and Solvable CasesAmerican Journal of Mathematical and Management Sciences, 1987
- The optimum traversal of a graphOmega, 1973
- Matching, Euler tours and the Chinese postmanMathematical Programming, 1973
- Scheduling of Vehicles from a Central Depot to a Number of Delivery PointsOperations Research, 1964