A biobjective capacitated vehicle routing problem using metaheuristic ILS and decomposition
- 1 January 2021
- journal article
- research article
- Published by Growing Science in International Journal of Industrial Engineering Computations
- Vol. 12 (3), 293-304
- https://doi.org/10.5267/j.ijiec.2021.2.002
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.Keywords
This publication has 19 references indexed in Scilit:
- The bi-objective mixed capacitated general routing problem with different route balance criteriaEuropean Journal of Operational Research, 2016
- Are All the Subproblems Equally Important? Resource Allocation in Decomposition-Based Multiobjective Evolutionary AlgorithmsIEEE Transactions on Evolutionary Computation, 2015
- Min–Max vs. Min–Sum Vehicle Routing: A worst-case analysisEuropean Journal of Operational Research, 2015
- GRASP-ASP: An algorithm for the CVRP with route balancingJournal of Heuristics, 2014
- A multi-objective mathematical model for the industrial hazardous waste location-routing problemEuropean Journal of Operational Research, 2013
- A simple and effective metaheuristic for the Minimum Latency ProblemEuropean Journal of Operational Research, 2012
- Improved load balancing and resource utilization for the Skill Vehicle Routing ProblemOptimization Letters, 2012
- Exact hybrid algorithms for solving a bi-objective vehicle routing problemCentral European Journal of Operations Research, 2010
- Truck scheduling for solid waste collection in the City of Porto Alegre, BrazilOmega, 2008
- Survey of multi-objective optimization methods for engineeringStructural and Multidisciplinary Optimization, 2004