A study of vehicle routing problems with load‐balancing

In a modern business environment, employees are a key resource to a company. Hence, the competitiveness of a company depends largely on its ability to treat employees fairly. Fairness can be attained by using the load‐balancing methodology. Develops an integer programming model for vehicle routing problems. There are two objectives, first, to minimize the total distance, and second, to balance the workload among employees as much as possible. We also develop a heuristic algorithm to solve the problems. The findings show that the proposed heuristic algorithm performs well to our 11 test cases.