-
Articles citing this article
-
Same authors
- PubMed -
Related articles
- Recommend this article
- Download citation
- Alert me if this article is cited
- Alert me if this article is corrected
|
|||||||||||||||
RAIRO Oper. Res. 36 (2002) 1-19
DOI: 10.1051/ro:2002002
The Maximum Capacity Shortest Path Problem: Generation of Efficient Solution Sets
T. Brian Boffey1, R.C. Williams2, B. Pelegrín3 and P. Fernandez31 University of Liverpool, Liverpool L69 7ZL, U.K.
2 University of Abertay, Dundee, U.K.
3 University of Murcia, Murcia, Spain.
(Received August, 1997.)
Abstract
Individual items of flow in a telecommunications
or a transportation network may need to be
separated by a minimum distance or time, called a
"headway". If link dependent, such restrictions in general have
the effect that the minimum time path for a "convoy"
of items to travel from a given origin to a given destination
will depend on the size of the convoy. The Quickest Path problem
seeks a path to minimise this convoy travel time.
A closely related bicriterion problem is the
Maximum Capacity Shortest Path problem. For this latter problem,
an effective implementation is devised for an algorithm
to determine desired sets of
efficient solutions which in turn facilitates the search
for a "best" compromise solution. Numerical experience with the
algorithm is reported.
Mathematics Subject Classification. 90B10, 90B18.
Key words: Quickest path, shortest path, path capacity, efficient solution.
© EDP Sciences 2002
| What is OpenURL? |
- If your librarian has set up your subscription with an OpenURL resolver, OpenURL links appear automatically on the abstract pages.
- You can define your own OpenURL resolver with your EDPS Account. In this case your choice will be given priority over that of your library.
- You can use an add-on for your browser (Firefox or I.E.) to display OpenURL links on a page (see http://www.openly.com/openurlref/). You should disable this module if you wish to use the OpenURL server that you or your library have defined.


Document
BibSonomy
CiteUlike
Connotea
Del.icio.us
Digg
Facebook