Abstract
Vehicle routing problems (VRPs) have usually been studied with a single objective function defined by the distances associated with the routing of vehicles. The central problem is to design a set of routes to meet the demands of customers at minimum cost. However, in real life, it is necessary to take into account other objective functions, such as social functions, which consider, for example, the drivers' workload balance. This has led to growth in both the formulation of multiobjective models and exact and approximate solution techniques. In this article, to verify the quality of the results, first, a mathematical model is proposed that takes into account both economic and work balance objectives simultaneously and is solved using an exact method based on the decomposition approach. This method is used to compare the accuracy of the proposed approximate method in test cases of medium mathematical complexity. Second, an approximate method based on the Iterated Local Search (ILS) metaheuristic and Decomposition (ILS/D) is proposed to solve the biobjective Capacitated VRP (bi-CVRP) using test cases of medium and high mathematical complexity. Finally, the nondominated sorting genetic algorithm (NSGA-II) approximate method is implemented to compare both medium- and high-complexity test cases with a benchmark. The obtained results show that ILS/D is a promising technique for solving VRPs with a multiobjective approach.
Highlights
The capacitated vehicle routing problem (CVRP) consists of the distribution of goods from a depot to a set of clients
To solve the problem in an approximate way, we propose a novel method based on the metaheuristic Iterated Local Search (ILS), and again the concept of decomposition (ILS/D), to generate the front
The results show that the NSGA-II can find diverse solutions and good convergence close to the optimal Pareto front in comparison to the multiobjective evolutionary algorithms (MOEAs)
Summary
The capacitated vehicle routing problem (CVRP) consists of the distribution of goods from a depot to a set of clients. Vehicle routing problems (VRPs) have usually been studied with a single objective function; in real life, it is necessary to take into account other objective functions, such as social functions, which consider, for example, the drivers' workload balance. The economic objective is to minimize the cost associated with the CVRP route design; the social objective is to balance the workload of each of the drivers (Matl, Hartl, & Vidal, 2017). In some cases, depending on the characteristics of the goods and services, the concept of equity is essential (Schwarze & Voß, 2013)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: International Journal of Industrial Engineering Computations
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.