The Resource constrained shortest path problem implemented in a lazy functional language
The Resource constrained shortest path problem implemented in a lazy functional language
The resource constrained shortest path problem is an NP-hard problem for which many ingenious algorithms have been developed. These algorithms are usually implemented in FORTRAN or another imperative programming language. We have implemented some of the simpler algorithms in a lazy functional language. Benefits accrue in the software engineering of the implementations. Our implementations have been applied to a standard benchmark of data files, which is available from the Operational Research Library of Imperial College, London. The performance of the lazy functional implementations, even with the comparatively simple algorithms that we have used, is competitive with a reference FORTRAN implementation.
Resource constrained shortest path, lazy functional programming, dynamic programming, benchmarking.
29-45
Hartel, Pieter H.
bdcf6621-5fcf-4822-9553-45f551f81c48
Glaser, Hugh
df88ca22-a72f-4fb6-9784-6578737d8af4
January 1996
Hartel, Pieter H.
bdcf6621-5fcf-4822-9553-45f551f81c48
Glaser, Hugh
df88ca22-a72f-4fb6-9784-6578737d8af4
Hartel, Pieter H. and Glaser, Hugh
(1996)
The Resource constrained shortest path problem implemented in a lazy functional language.
Journal of Functional Programming, 6 (1), .
Abstract
The resource constrained shortest path problem is an NP-hard problem for which many ingenious algorithms have been developed. These algorithms are usually implemented in FORTRAN or another imperative programming language. We have implemented some of the simpler algorithms in a lazy functional language. Benefits accrue in the software engineering of the implementations. Our implementations have been applied to a standard benchmark of data files, which is available from the Operational Research Library of Imperial College, London. The performance of the lazy functional implementations, even with the comparatively simple algorithms that we have used, is competitive with a reference FORTRAN implementation.
More information
Published date: January 1996
Keywords:
Resource constrained shortest path, lazy functional programming, dynamic programming, benchmarking.
Organisations:
Web & Internet Science
Identifiers
Local EPrints ID: 250587
URI: http://eprints.soton.ac.uk/id/eprint/250587
PURE UUID: 26718c8d-6899-458a-8824-0cdf116facc0
Catalogue record
Date deposited: 22 Jun 1999
Last modified: 14 Mar 2024 04:53
Export record
Contributors
Author:
Pieter H. Hartel
Author:
Hugh Glaser
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics