search query: @author Berman, O. / total: 15
reference: 8 / 15
| Author: | Simchi-Levi, D. Berman, O. |
| Title: | A heuristic algorithm for the traveling salesman location problem on networks. |
| Journal: | Operations Research
1988 : MAY-JUN, VOL. 36:3, p. 478-484 |
| Index terms: | TRAVELLING SALESMAN PROBLEM NETWORKS LOCATION PROBLEM |
| Language: | eng |
| Abstract: | An efficient heuristic is developed for the travelling salesman location problem on a network. A typical scenario is where each time service tour occurs, a salesman, e. g. a repair vehicle, must visit a subset of one or more of the possible customers that are registered in a service list in a tour. In the minimum version of the problem, a service station for the salesman is to be located to minimize the expected distance travelled. A worst case analysis of the heuristic indicates that it will produce a solution which is, at most, fifty per cent worse than the optimal solution. Several asymptotic results are developed for the problem in the plane. |
SCIMA