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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

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


    Contributors:

    Published in:

    Publication date :

    1988-08-11


    Size :

    10 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English



    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 | European Patent Office | 2019

    Free access

    RUBRIKEN - Mailbox

    Online Contents | 2001


    MAILBOX ASSEMBLY

    WALSH RYAN / FALESCH ALEX J | European Patent Office | 2020

    Free access