The aim of this paper is to present the suitability of three different global optimization methods for specifically the exact optimum solution of the nonlinear transportation problem (NTP). The evaluated global optimization methods include the branch and reduce method, the branch and cut method and the combination of global and local search strategies. The considered global optimization methods were applied to solve NTPs with reference to literature. NTPs were formulated as nonlinear programming (NLP) optimization problems. The obtained optimal results were compared with those got from literature. A comparative evaluation of global optimization methods is presented at the end of the paper to show their suitability for solving NTPs.


    Zugriff

    Download


    Exportieren, teilen und zitieren



    Titel :

    Solving the nonlinear transportation problem by global optimization


    Beteiligte:
    U. Klanšek (Autor:in) / M. Pšunder (Autor:in)


    Erscheinungsdatum :

    2010



    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Unbekannt




    Solving the nonlinear transportation problem by global optimization

    Uroš Klanšek / Mirko Pšunder | DOAJ | 2010

    Freier Zugriff



    A New Global Optimization Method for Solving the Stackelberg Problem

    Shimizu, K. / Lu, M. | British Library Online Contents | 1993


    Solving a discrete multimodal transportation network design problem

    Zhang, Lihui / Yang, Hai / Wu, Di et al. | Elsevier | 2014