A Near-Optimal Heuristic Algorithm for Single-Flow Routing

Authors:
L. C. Liu;H. C. Du
Affiliations:
Univ. of Minnesota, Minneapolis;Univ. of Minnesota, Minneapolis
Venue:
IEEE Transactions on Computers
Year:
1989

Citing 1
Cited 1

Heuristic Algorithms for Single Row Routing

IEEE Transactions on Computers

Sequential and Parallel Meta-Heuristics for Solving the Single Row Routing Problem

Cluster Computing

Quantified Score

Hi-index	14.98

Visualization

Abstract

The authors obtain a tighter lower bound on the street congestion of optimal realizations. Then a heuristic algorithm based on necessary and sufficient conditions of optimality is proposed. Although it cannot be guaranteed that this algorithm always generates optimal realizations, it indeed generates optimal realizations for all the 60 test instances with which they experimented. This algorithm is also shown to be time efficient.