A New Mathematical Programming Model for a Vehicle Routing Problem in a Competitive Environment: A Real Case Study

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

Authors

R. Tavakkoli-Moghaddam

M. Alinaghian

Abstract

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...

Keywords

vehicle routing problem

Vehicle routing problem- mathematical programming- cash flow- competitive environment - hpbird simulated annealing

mathematical programming

Cash Flow

Competitive environment

hpbird simulated annealing