SOLVING THE NONLINEAR DISCRETE TRANSPORTATION PROBLEM BY MINLP OPTIMIZATION

作     者：Klansek, Uros 

作者机构：Univ Maribor Fac Civil Engn Maribor Slovenia 

出 版 物：《TRANSPORT》 (运输)

年 卷 期：2014年第29卷第1期

页      面：1-11页

核心收录：

学科分类：12[管理学] 0202[经济学-应用经济学] 02[经济学] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 020205[经济学-产业经济学] 08[工学] 082303[工学-交通运输规划与管理] 0823[工学-交通运输工程] 

基　　金：Slovenian Research Agency [P2-0129] 

主　　题：transportation problems discrete transporting flows nonlinear cost functions optimization methods mixed-integer nonlinear programming 

摘      要：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.