Transportation, which has a specific division in production economics and service systems, has a great value in a gross national product (GNP) in every country. Thus, most researchers worked on improving routes, omitting unimportant transportations, or replacing shortcut routes. For these reasons, they have developed a traveling salesman problem (TSP) and a vehicle routing problem (VRP). The classical and deterministic VRP seeks routes with the lowest cost from...
Tavakkoli-Moghaddam, R., Alinaghian, M., Alinaghian, M., & Alinaghian, M. (2010). A New Mathematical Programming Model for a Vehicle Routing Problem in a Competitive Environment: A Real Case Study. Journal of Transportation Research, 7(1), -.
MLA
R. Tavakkoli-Moghaddam; M. Alinaghian; M. Alinaghian; M. Alinaghian. "A New Mathematical Programming Model for a Vehicle Routing Problem in a Competitive Environment: A Real Case Study". Journal of Transportation Research, 7, 1, 2010, -.
HARVARD
Tavakkoli-Moghaddam, R., Alinaghian, M., Alinaghian, M., Alinaghian, M. (2010). 'A New Mathematical Programming Model for a Vehicle Routing Problem in a Competitive Environment: A Real Case Study', Journal of Transportation Research, 7(1), pp. -.
VANCOUVER
Tavakkoli-Moghaddam, R., Alinaghian, M., Alinaghian, M., Alinaghian, M. A New Mathematical Programming Model for a Vehicle Routing Problem in a Competitive Environment: A Real Case Study. Journal of Transportation Research, 2010; 7(1): -.
)