IDEAS home Printed from https://ideas.repec.org/a/eee/transb/v26y1992i5p341-356.html
   My bibliography  Save this article

Bandwidth maximization: Split and unsplit solutions

Author

Listed:
  • Papola, Natale

Abstract

The mathematical formulation of the problem of maximizing the green band in a two-way street is performed. In so doing, in addition to problems for which the bandwidths are unsplit, we consider cases in which the bandwidths in a single cycle, in one or both directions, are split into two intervals separated by a red time. The expression of the bandwidth as a function of the offset and the distance between a pair of signals is not the same for every possible value of these variables. However, the system is periodic in space as well as in time. It is, moreover, symmetrical with respect to a half-period both in time and in space. These properties made it possible to find, without ambiguity, the different expressions of the bandwidth and the best solution for any given pair of signals. As a result, when the best solution is of the split type, it is, obviously, better than the one of the unsplit type; however, the differences, usually small for a pair of signals, are generally negligible or nil for a sequence of a sufficiently large number of signals.

Suggested Citation

  • Papola, Natale, 1992. "Bandwidth maximization: Split and unsplit solutions," Transportation Research Part B: Methodological, Elsevier, vol. 26(5), pages 341-356, October.
    • Handle: RePEc:eee:transb:v:26:y:1992:i:5:p:341-356
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0191-2615(92)90030-Z
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Papola, Natale & Fusco, Gaetano, 1998. "Maximal bandwidth problems: a new algorithm based on the properties of periodicity of the system," Transportation Research Part B: Methodological, Elsevier, vol. 32(4), pages 277-288, May.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:transb:v:26:y:1992:i:5:p:341-356. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/548/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.