The Vehicle Routing Problem (VRP) is one of the most studied topics in Operations Research. Among numerous variants VRP, this research addresses VRP with relaxed priority rules (VRP-RPR) which customers are assigned to several groups and highest priorities typically need be served before lower ones. Additional used control trade-off between cost efficiency. We propose a Mixed Integer Linear Pro...

In this paper, a vehicle routing problem for the delivery of frozen and chilled products is explored. The formulated as mixed integer programming model to minimize total load-dependent distance instead distance. an adaptation from energy-minimizing problem. addition formulation, Cluster-First-Route-Second-based heuristic approach developed alternative solution. performance both mathematical sol...

We present a hybrid optimization algorithm for mixed-integer linear programming, embedding both heuristic and exact components. In order to validate it we use the periodic vehicle routing problem (PVRP) as a case study. This problem consists of determining a set of minimum cost routes for each day of a given planning horizon, with the constraints that each customer must be visited a required nu...