Computing inter-site distances for routing and scheduling problems

doi:10.1016/0167-6377(81)90022-5

Operations Research Letters

Volume 1, Issue 1, October 1981, Pages 31-33

https://doi.org/10.1016/0167-6377(81)90022-5 Get rights and content

Abstract

Routing and scheduling problems have received considerable attention in the literature in terms of model building and algorithm development. On these fronts, progress has been substantial. However, one often neglected (yet critical) aspect concerning the use of these models and algorithms is their data requirements. In particular, the distance matrix yielding the shortest distance between each pair of sites (nodes) represents a major portion of the data required by all such problems. Yet, such data are seldom available with the degree of accuracy desired and often are not available at all.

This paper describes an efficient method for obtaining this distance matrix that is based on the underlying road structure for the geographic region in question. Thus, the distances obtained reflect ‘actual’ distances. Finally, the paper presents some brief computational experience and discusses an implementation concerning the routing of environmental inspectors in the state of Pennsylvania.

References (3)

J.J. Dinkel et al.
Environmental inspection routes and the constrained traveling salesman problem
Comput. Operations Res.
(1976)

There are more references available in the full text version of this article.

Cited by (6)

A heuristic for the location of a rapid transit line
2002, Computers and Operations Research
This article presents a mathematical model and a two-phase heuristic for the location of a rapid transit alignment in an urban setting. This method can be viewed as a building block for the multi-line network design problem. Computational results on randomly generated instances and on some Milan real data confirm the efficiency of the proposed approach.
When designing rapid transit lines, a common objective is the maximization of the toal population covered by the alignment, subject to interstation spacing constraints. This article describes an efficient and robust heuristic for generating good alignments. These can then be assessed according to other criteria before a final decision is made.
Plant location and vehicle routing in the Malaysian rubber smallholder sector: A case study
1989, European Journal of Operational Research
This paper deals with real-life problems of plant location and vehicle routing in the smallholdings sector of the Malaysian rubber industry. Operational Research methods that accomodate conditions prevailing in the smallholdings sector (size, constraints, limited finances) are tested on a test region that offers all permutations and combinations of these very conditions. The results show significant benefits to agencies that serve the smallholdings sector. Implementation issues are examined for transfer of technology (methodology) to greatest effect.
The suitability of the weighted l<inf>p</inf>-norm in estimating actual road distances
1988, European Journal of Operational Research
The weighted l_p-norm, suggested as a way to estimate actual road distances, takes time and effort to calculate because it requires two parameters. Compared to the weighted Euclidean norm, a function requiring only one parameter which is relatively easy to obtain, the weighted l_p-norm yields considerably better estimates for some countries and only negligible improvements for others. This paper evaluates whether, on the basis of easy-to-obtain data characterizing the road network of a particular area, one can predict the extent of the improvement in estimate accuracy. Such an ability to predetermine estimate accuracy would help researchers decide when to use the expensive l_p-norm. The investigation shows, however, that no such relationship can be proven. The extent of the improvement in estimate accuracy offered by the weighted l_p-norm cannot be predicted.
External labeling and algorithms for hierarchic networks
1988, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
A multi-objective model for seasonal personnel reassignment
1986, Civil Engineering Systems
Das Schätzen von realen Entfernungen bei der Warenverteilungsplanung mit gebietspaarspezifischen Umwegfaktoren
1983, OR Spektrum

View full text

Computing inter-site distances for routing and scheduling problems

Abstract

Environmental inspection routes and the constrained traveling salesman problem

Comput. Operations Res.