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

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...

Full description

Bibliographic Details
Main Author: Uroš Klanšek
Format: Article
Language:English
Published: Vilnius Gediminas Technical University 2015-06-01
Series:Transport
Subjects:
Online Access:https://journals.vgtu.lt/index.php/Transport/article/view/1725
_version_ 1818385337756418048
author Uroš Klanšek
author_facet Uroš Klanšek
author_sort Uroš Klanšek
collection DOAJ
description 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
first_indexed 2024-12-14T03:36:33Z
format Article
id doaj.art-fade7fc41be24357ae7ceb9a646cba7a
institution Directory Open Access Journal
issn 1648-4142
1648-3480
language English
last_indexed 2024-12-14T03:36:33Z
publishDate 2015-06-01
publisher Vilnius Gediminas Technical University
record_format Article
series Transport
spelling doaj.art-fade7fc41be24357ae7ceb9a646cba7a2022-12-21T23:18:37ZengVilnius Gediminas Technical UniversityTransport1648-41421648-34802015-06-0130210.3846/16484142.2014.933361A comparison between MILP and MINLP approaches to optimal solution of Nonlinear Discrete Transportation ProblemUroš Klanšek0Faculty of Civil Engineering, University of Maribor, SloveniaFinding 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 2014https://journals.vgtu.lt/index.php/Transport/article/view/1725transportation problemsdiscrete transporting flowsnonlinear costsoptimization methodsmixed-integer linear programmingmixed-integer nonlinear programming
spellingShingle Uroš Klanšek
A comparison between MILP and MINLP approaches to optimal solution of Nonlinear Discrete Transportation Problem
Transport
transportation problems
discrete transporting flows
nonlinear costs
optimization methods
mixed-integer linear programming
mixed-integer nonlinear programming
title A comparison between MILP and MINLP approaches to optimal solution of Nonlinear Discrete Transportation Problem
title_full A comparison between MILP and MINLP approaches to optimal solution of Nonlinear Discrete Transportation Problem
title_fullStr A comparison between MILP and MINLP approaches to optimal solution of Nonlinear Discrete Transportation Problem
title_full_unstemmed A comparison between MILP and MINLP approaches to optimal solution of Nonlinear Discrete Transportation Problem
title_short A comparison between MILP and MINLP approaches to optimal solution of Nonlinear Discrete Transportation Problem
title_sort comparison between milp and minlp approaches to optimal solution of nonlinear discrete transportation problem
topic transportation problems
discrete transporting flows
nonlinear costs
optimization methods
mixed-integer linear programming
mixed-integer nonlinear programming
url https://journals.vgtu.lt/index.php/Transport/article/view/1725
work_keys_str_mv AT urosklansek acomparisonbetweenmilpandminlpapproachestooptimalsolutionofnonlineardiscretetransportationproblem
AT urosklansek comparisonbetweenmilpandminlpapproachestooptimalsolutionofnonlineardiscretetransportationproblem