Solving the nonlinear discrete transportation problem by MINLP optimization


The Nonlinear Discrete Transportation Problem (NDTP) belongs to the class of the optimization problems that are generally difficult to solve. The selection of a suitable optimization method by which a specific NDTP can be appropriately solved is frequently a critical issue in obtaining valuable results. The aim of this paper is to present the suitability of five different Mixed-Integer Nonlinear Programming (MINLP) methods, specifically for the exact optimum solution of the NDTP. The evaluated MINLP methods include the extended cutting plane method, the branch and reduce method, the augmented penalty/outer-approximation/equality-relaxation method, the branch and cut method, and the simple branch and bound method. The MINLP methods were tested on a set of NDTPs from the literature. The gained solutions were compared and a correlative evaluation of the considered MINLP methods is shown to demonstrate their suitability for solving the NDTPs.

First Published Online: 16 Oct 2013

Keyword : transportation problems, discrete transporting flows, nonlinear cost functions, optimization methods, mixed-integer nonlinear programming

How to Cite
Klanšek, U. (2014). Solving the nonlinear discrete transportation problem by MINLP optimization. Transport, 29(1), 1–11.
Published in Issue
Mar 31, 2014
Abstract Views
PDF Downloads
Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.