Multiobjective Shortest Path Problem

[ Welcome | The problem | Library | Public code | Guiness record | Latest news ]

The problem

• Brief description

The library

• Pseudo-random number generators
• File network format (similar to DIMACS format)
• Network types
• Instances database

Public code

It is a non optimized public executable code for the label correcting algorithm using a label selection policy with the FIFO rule to select the next label to be scanned.

It is available on the following platforms:

• Executable version for download: Windows (??? bytes) and Unix (24739 bytes)
• Performance of the public code for solving the instances of this data base
• If you are unable to download/run the code or if you are working on a different computer system, please send a e-mail to: zeluis@mat.uc.pt

Extended computational results

You can find here other computational results that complement the one presented in the following papers:

• J.P. Paixão and J.L. Santos. Labelling methods for the general case of the multi-objective shortest path problem – a computational study.

Working Paper 07-42, CMUC and submitted for publication, 2007. (extended results)

Guiness record

• Guiness table (last update: )

Latest news

• New presentation for the web page (Dec 24, 2007)
• Turn this web page available (March 18, 2005)

[ Welcome | The problem | Library | Public code | Guiness record | Latest news ]

====================

Last update: Mon Dec 24 01:00:19 WET 2007