Provide a Model for Depot Location and Vehicle Routing Problem Considering the Depreciation Cost Determined by the Quantity of Vehicle Load through the Hybrid Genetic Algorithm

The Vehicle Routing Problem (VRP) is one of the most important subjects in the field of complex hybrid optimization. In the current research, a certain number of depots were responsible for delivering goods to customers. The service start time had two hard and soft time windows and each customer had a request for simultaneous delivery and loading. The main purpose of solving the minimization problem was system costs including handling, fixed cost of vehicles, cost of non-compliance with the soft time window, and additional costs resulting from depreciation due to the quantity of vehicle load. In this study, first, the conceptual model of the problem was defined, then due to the complexity of the problem, a hybrid genetic algorithm was used. In this algorithm, hybrid genetics was first created by the initial population of the particle swarm algorithm, and in each phase after the mutation operation, a neighborhood search algorithm was used.

کلیدواژه ها:

Hybrid genetic algorithm ، the quantity of vehicle load at any time ، route type ، Multi-Depot VRP ، time constraint