Open AccessSolving Rich Vehicle Routing Problem Using Three Steps Heuristic
Author(s) -
Mohd Sapiyan Baba,
Ismail Yusuf Panessai,
Nur Iksan
Publication year - 2019
Publication title -
international journal of artificial intelligence (batam)/international journal of artificial intelligence
Language(s) - English
Resource type - Journals
eISSN - 2686-3251
pISSN - 2407-7275
DOI - 10.36079/lamintang.ijai-0101.9
Subject(s) - profitability index , vehicle routing problem , computer science , mathematical optimization , profit (economics) , heuristic , operations research , routing (electronic design automation) , mathematics , business , microeconomics , computer network , economics , finance
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 the government, accessibility takes priority over profitability. Accessibility usually reduces profit, while increasing profit tends to reduce accessibility. In this research, we look at how accessibility can be increased without penalizing the profitability. This requires the determination of routes with minimum fuel consumption, the 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, we propose a heuristic algorithm. The results from this experiment show that the algorithm proposed has better performance compared to the partitioning set.