AbstractHub-and-spoke networks are employed in cargo transportation. This paper presents a model for hub location in these kinds of networks. Hubs are considered capacity limited. For that reason, costs due to congestion in hubs are introduced into the model. A Simulated Annealing algorithm has been developed to solve the model. The algorithm includes a balanced module, the purpose of which is to reduce congestion. Each hub is modelled as an M/M/1 queuing system. The algorithm has been tested in randomly created networks. The results show that when a situation of congestion occurs, the proposed algorithm enables better solutions to be found, thereby improving the standard of service.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Hub location under capacity constraints


    Beteiligte:
    Rodríguez, V. (Autor:in) / Alvarez, M.J. (Autor:in) / Barcos, L. (Autor:in)


    Erscheinungsdatum :

    2006-01-12


    Format / Umfang :

    11 pages




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    Hub location under capacity constraints

    Rodríguez, V. | Online Contents | 2007


    Ordered median hub location problems with capacity constraints

    Puerto, J. / Ramos, A.B. / Rodríguez-Chía, A.M. et al. | Elsevier | 2015



    Dynamic activity-travel assignment in multi-state supernetworks under transport and location capacity constraints

    Liu, Peng / Liao, Feixiong / Huang, Hai-Jun et al. | Taylor & Francis Verlag | 2016

    Freier Zugriff