>
Fa   |   Ar   |   En
   Solving Minimum Cost Multi-Commodity Network Flow Problem Using Lexicographic Goal Programming Approach  
   
نویسنده olusina jo ,nse ou
منبع journal of applied sciences and environmental management - 2018 - دوره : 22 - شماره : 3 - صفحه:414 -420
چکیده    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%.
کلیدواژه Transportation ,Road capacity ,Congestion ,Goal Programming ,Travel Time
آدرس university of lagos, faculty of engineering, department of surveying & geoinformatics, Nigeria, university of lagos, faculty of engineering, department of surveying & geoinformatics, Nigeria
پست الکترونیکی kingso4heaven@yahoo.com
 
     
   
Authors
  
 
 

Copyright 2023
Islamic World Science Citation Center
All Rights Reserved