mathematical programming formulation of transportation modles
rajiv kumar
Transportation problem, Bottleneck Transportation Problem, Mathematical Programming
The next generation of transportation, location, models will most probably emerge from mathematical programming formulations. Presented are simple numerical examples of trip assignment and population location, both described as optimization problems, in mathematical programming formulations. A trip assignment model with constant link costs less described first, and then the same model is modified to show the consequences of a How-dependent link cost formulation. In similar fashion, a linear model of least cost population location is transformed into a nonlinear model that incorporates dispersion of location due to differences in locators' preferences or perceptions. It less then showed how the trip assignment model and the location model can be combined into a single nonlinear programming formulation that solves both problems simultaneously.
Article Details
Unique Paper ID: 152315

Publication Volume & Issue: Volume 8, Issue 2

Page(s): 899 - 906
Article Preview & Download

Share This Article

Conference Alert


International conference on Management, Science, Technology, Engineering, Pharmact and Humanities.

Go To Issue

Call For Paper

Volume 8 Issue 4

Last Date 25 September 2021

About Us enables door in research by providing high quality research articles in open access market.

Send us any query related to your research on

Social Media

Google Verified Reviews

Contact Details