Finding an exact optimal solution of the Nonlinear Discrete Transportation Problem (NDTP) represents a challenging task in transportation science. Development of an adequate model formulation and selection of an appropriate optimization method are thus significant for attaining valuable solution of the NDTP. When nonlinearities appear within the criterion of optimization, the NDTP can be formulated directly as a Mixed-Integer Nonlinear Programming (MINLP) task or it can be linearized and converted into a Mixed-Integer Linear Programming (MILP) problem. This paper presents a comparison between MILP and MINLP approaches to exact optimal solution of the NDTP. The comparison is based on obtained results of experiments executed on a set of reference test problems. The paper discusses advantages and limitations of both optimization approaches. First published online: 10 Jul 2014


    Access

    Download


    Export, share and cite



    Title :

    A comparison between MILP and MINLP approaches to optimal solution of Nonlinear Discrete Transportation Problem


    Contributors:


    Publication date :

    2015




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    Unknown





    RECIFE-MILP: An Effective MILP-Based Heuristic for the Real-Time Railway Traffic Management Problem

    Pellegrini, Paola / Marliere, Gregory / Pesenti, Raffaele et al. | IEEE | 2015



    MIDACO on MINLP space applications

    Schlueter, Martin | Online Contents | 2013


    MIDACO on MINLP space applications

    Schlueter, Martin / Erb, Sven O. / Gerdts, Matthias et al. | Elsevier | 2012