The aim of this paper is to present the suitability of three different global optimization methods for specifically the exact optimum solution of the nonlinear transportation problem (NTP). The evaluated global optimization methods include the branch and reduce method, the branch and cut method and the combination of global and local search strategies. The considered global optimization methods were applied to solve NTPs with reference to literature. NTPs were formulated as nonlinear programming (NLP) optimization problems. The obtained optimal results were compared with those got from literature. A comparative evaluation of global optimization methods is presented at the end of the paper to show their suitability for solving NTPs.
Solving the nonlinear transportation problem by global optimization
2010
Aufsatz (Zeitschrift)
Elektronische Ressource
Unbekannt
Metadata by DOAJ is licensed under CC BY-SA 1.0
Solving the nonlinear discrete transportation problem by MINLP optimization
DOAJ | 2014
|Transportation of laundry—a nonlinear optimization problem
Elsevier | 1968
A New Global Optimization Method for Solving the Stackelberg Problem
British Library Online Contents | 1993
|Solving a discrete multimodal transportation network design problem
Elsevier | 2014
|