Paper
Solving Multi-depot, Heterogeneous, Site Dependent and Asymmetric VRP Using Three Steps Heuristic
- Authors:
- Ismail Yusuf
- Abstract
- Vehicle Routing Problem (VRP) relates to the problem of providing optimum service with a fleet of vehicles to customers. It is a combinatorial optimization problem. The objective is usually to maximize the profit of the operation. However, for public transportation owned and operated by government, accessibility takes priority over profitability. Accessibility usually reduces profit, while increasing profit tends to reduce accessibility. In this research, it was explored how accessibility can be increased without penalizing the profitability. This requires the determination of routes with minimum fuel consumption, maximum number of ports of call and maximum load factor satisfying a number of pre-determined constraints: hard and soft constraints. To solve this problem, a heuristic algorithm was proposed. The results from this experiment show that the algorithm proposed had better performance compared to the partitioning set.
- Keywords
- VRP; Ship Routing; Heuristic; Multi-depot; Heterogeneous; Site Dependent; Asymmetric
- StartPage
- 28
- EndPage
- 42
- Doi