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), 29-45.


[img] PDF
Download (184Kb)


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
ISSNs: 0956-7968
Keywords: Resource constrained shortest path, lazy functional programming, dynamic programming, benchmarking.
Divisions : Faculty of Physical Sciences and Engineering > Electronics and Computer Science > Web & Internet Science
ePrint ID: 250587
Accepted Date and Publication Date:
January 1996Published
Date Deposited: 22 Jun 1999
Last Modified: 31 Mar 2016 13:50
Further Information:Google Scholar

Actions (login required)

View Item View Item

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