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.
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.
|Keywords:||Resource constrained shortest path, lazy functional programming, dynamic programming, benchmarking.|
|Divisions:||Faculty of Physical and Applied Science > Electronics and Computer Science > Web & Internet Science
|Date Deposited:||22 Jun 1999|
|Last Modified:||02 Mar 2012 06:36|
|Contributors:||Hartel, Pieter H. (Author)
Glaser, Hugh (Author)
|Further Information:||Google Scholar|
|RDF:||RDF+N-Triples, RDF+N3, RDF+XML, Browse.|
Actions (login required)