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. First published online: 10 Feb 2011


    Access

    Download


    Export, share and cite



    Title :

    Solving the nonlinear transportation problem by global optimization


    Contributors:


    Publication date :

    2010




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    Unknown




    Solving the nonlinear transportation problem by global optimization

    U. Klanšek / M. Pšunder | DOAJ | 2010

    Free access



    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