Solving Minimum Cost Multi-Commodity Network Flow Problem Using Lexicographic Goal Programming Approach

  • JO Olusina
  • OU Nse
Keywords: Transportation, Road capacity, Congestion, Goal Programming, Travel Time

Abstract

In an urban transport system, a dysfunction often occurred as demand for transportation infrastructure exceeds available supply. The result includes traffic congestion, higher travel time and cost, higher emission of harmful gases and general reduction in quality of life. In this research, an attempt was made to minimize travel time on three urban road segments using Lexicographic Goal Programming. The positive and negative deviations from the goals were minimized. A minimum cost multi-commodity network flow problem with multiple objectives was successfully modelled using LINDO 6.1. The modelling technique provided a solution that effectively minimized travel time by 50%.

Section
Articles

Journal Identifiers


eISSN: 2659-1502
print ISSN: 1119-8362