Highlights We present necessary and sufficient conditions for core stability. We formulate a MILP for selecting a core stable coalition with maximum savings. We combine exact and heuristic methods for soving the formulated MILP. We investigate the broader implications of our research through computational experiments.

    Abstract We study the problem of forming a core stable coalition that minimizes system-wide cost, given a set of candidate full truckload shipment lanes, which we model as players, and a characteristic function that corresponds to solving an NP-Hard cost minimizing lane covering problem. Since not every coalition has a non-empty core in this setting, we formulate a mixed integer linear program that can identify a core stable coalition with minimal system-wide cost along with a cost allocation in the core. We propose a solution method that embeds row generation, column generation, and an upper bounding heuristic into branch-and-bound, which can be considered as a form of branch-and-cut-and-price. We evaluate the performance of our solution method through extensive numerical experiments on randomly generated problem instances.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Core stable coalition selection in collaborative truckload transportation procurement


    Beteiligte:
    Öner, Nihat (Autor:in) / Kuyzu, Gültekin (Autor:in)


    Erscheinungsdatum :

    2021-08-08




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    Review of Full Truckload Transportation Service Procurement

    Jothi Basu, R. / Subramanian, Nachiappan / Cheikhrouhou, Naoufel | Taylor & Francis Verlag | 2015




    Task selection and routing problems in collaborative truckload transportation

    Liu, Ran / Jiang, Zhibin / Liu, Xiao et al. | Elsevier | 2010