The University of Southampton
University of Southampton Institutional Repository

The Resource constrained shortest path problem implemented in a lazy functional language

Record type: Article

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.

PDF rcsp.pdf - Other
Download (188kB)

Citation

Hartel, Pieter H. and Glaser, Hugh (1996) The Resource constrained shortest path problem implemented in a lazy functional language J. Functional Programming, 6, (1), pp. 29-45.

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: 18 Jul 2017 10:40

Export record

Contributors

Author: Pieter H. Hartel
Author: Hugh Glaser

University divisions


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

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×