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 res...
Main Author: | |
---|---|
Format: | Article |
Language: | English |
Published: |
Vilnius Gediminas Technical University
2014-03-01
|
Series: | Transport |
Subjects: | |
Online Access: | https://journals.vgtu.lt/index.php/Transport/article/view/1781 |
id |
doaj-f5aaf9376605472994aae05b47618f75 |
---|---|
record_format |
Article |
spelling |
doaj-f5aaf9376605472994aae05b47618f752021-07-02T01:25:24ZengVilnius Gediminas Technical UniversityTransport1648-41421648-34802014-03-0129110.3846/16484142.2013.815134Solving the nonlinear discrete transportation problem by MINLP optimizationUroš Klanšek0Faculty of Civil Engineering, University of Maribor, Slovenia 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 https://journals.vgtu.lt/index.php/Transport/article/view/1781transportation problemsdiscrete transporting flowsnonlinear cost functionsoptimization methodsmixed-integer nonlinear programming |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Uroš Klanšek |
spellingShingle |
Uroš Klanšek Solving the nonlinear discrete transportation problem by MINLP optimization Transport transportation problems discrete transporting flows nonlinear cost functions optimization methods mixed-integer nonlinear programming |
author_facet |
Uroš Klanšek |
author_sort |
Uroš Klanšek |
title |
Solving the nonlinear discrete transportation problem by MINLP optimization |
title_short |
Solving the nonlinear discrete transportation problem by MINLP optimization |
title_full |
Solving the nonlinear discrete transportation problem by MINLP optimization |
title_fullStr |
Solving the nonlinear discrete transportation problem by MINLP optimization |
title_full_unstemmed |
Solving the nonlinear discrete transportation problem by MINLP optimization |
title_sort |
solving the nonlinear discrete transportation problem by minlp optimization |
publisher |
Vilnius Gediminas Technical University |
series |
Transport |
issn |
1648-4142 1648-3480 |
publishDate |
2014-03-01 |
description |
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
|
topic |
transportation problems discrete transporting flows nonlinear cost functions optimization methods mixed-integer nonlinear programming |
url |
https://journals.vgtu.lt/index.php/Transport/article/view/1781 |
work_keys_str_mv |
AT urosklansek solvingthenonlineardiscretetransportationproblembyminlpoptimization |
_version_ |
1721345042163957760 |