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


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.

Download

[img] PDF rcsp.pdf - Other
Download (188kB)

Description/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.

Item Type: Article
Keywords: Resource constrained shortest path, lazy functional programming, dynamic programming, benchmarking.
Organisations: Web & Internet Science
ePrint ID: 250587
Date :
Date Event
January 1996Published
Date Deposited: 22 Jun 1999
Last Modified: 18 Apr 2017 00:19
Further Information:Google Scholar
URI: http://eprints.soton.ac.uk/id/eprint/250587

Actions (login required)

View Item View Item