Abstract Mailbox collection is a complex and costly operation in most postal services. The authors recently undertook a study aimed at improving this operation at the Canada Post Corporation (CPC). This paper describes an improvement to the clustering and routing algorithm currently in use. Various traffic and union rules affecting mailbox collection in an urban context are first described and their effect on shortest distance computations is explained. This is followed by a description of the clustering and routing algorithm currently used at CPC. A model and a generalized travelling salesman algorithm that take the various rules into account are then presented. It is then shown how the CPC routes can sometimes be improved by using the proposed algorithm as a postoptimizer.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    An algorithm for the design of mailbox collection routes in urban areas


    Beteiligte:

    Erschienen in:

    Erscheinungsdatum :

    11.08.1988


    Format / Umfang :

    10 pages




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    Design of arterial routes in urban areas

    Barnett, J. | Engineering Index Backfile | 1948


    Planning Statewide Routes to Serve Urban Areas

    Guyton, J. W. | British Library Conference Proceedings | 1995


    MAILBOX ASSEMBLY

    WALSH RYAN / FALESCH ALEXANDER J | Europäisches Patentamt | 2018

    Freier Zugriff

    Mailbox assembly

    WALSH RYAN / FALESCH ALEXANDER J | Europäisches Patentamt | 2019

    Freier Zugriff

    RUBRIKEN - Mailbox

    Online Contents | 2001