AbstractThis paper introduces a new problem called the capacitated plant location problem with customer and supplier matching (CLCSM). The product distribution from plants to customers and the material supply from suppliers to plants are considered together. We merge a distribution trip and a supply trip into one triangular trip for saving allocation cost. Vehicles from plants visit a customer and a supplier for each trip. We provide a heuristic solution procedure based on Lagrangian relaxation. Computational results indicate that the proposed heuristic solution procedure is shown to be efficient yielding optimal or near-optimal solutions for randomly generated instances.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    The capacitated plant location problem with customers and suppliers matching


    Beteiligte:
    Zhu, Zhanguo (Autor:in) / Chu, Feng (Autor:in) / Sun, Linyan (Autor:in)


    Erscheinungsdatum :

    2009-09-03


    Format / Umfang :

    12 pages




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch





    Capacitated Centralized Carrier Collaboration Multihub Location Problem

    Wang, Hao / Unnikrishnan, Avinash / Hernández, Salvador et al. | Transportation Research Record | 2014


    Reliable capacitated facility location problem with service levels

    Santiváñez, José A. / Carlo, Héctor J. | Online Contents | 2018