Abstract Much interest has recently been shown in the combination of the distribution and assignment models. In this paper we adopt a generalized Benders' decomposition to solve this combined problem for a system optimized assignment with linear link costs and explicit capacity constraints on link flows. The master problem which is generated is used to show that the combined problem can be viewed as a modified distribution problem, of gravity form, with a minimax instead of a linear objective function. An algorithm for solving the master problem is discussed, and some computational results presented.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    An algorithm for the combined distribution and assignment problem


    Contributors:


    Publication date :

    1979-10-22


    Size :

    13 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English



    An Algorithm for the Combined Distribution and Assignment Model

    Lundgren, J. T. / Patriksson, M. / Association of European Operational Research Societies | British Library Conference Proceedings | 1998





    Algorithm for Equilibrium Transit Assignment Problem

    Babazadeh, Abbas / Aashtiani, Hedayat Z. | Transportation Research Record | 2005