The bi-objective two-dimensional loading vehicle routing problem with partial conflicts
Abstract
The two-dimensional loading vehicle routing problem with partial conflicts combines two NP-hard problems: the classical vehicle routing problem and the two-dimensional bin-packing problem with partial conflicts. This new variant of transportation problems is inspired from hazardous materials classification and compatibilities, where some materials can be partially conflicting. In this case, they can be loaded together but an additional constraint on the distance separating them must be respected. We propose in this paper an NSGA-II algorithm to perform a bi-objective study in which the minimization of the total cost of transportation as well as the load balancing between different routes in terms of used area of vehicles are the considered objectives. The first results for this new problem are presented, using benchmarks available in the literature that have been adapted to deal with the problem. Moreover, the adding value of path relinking is proved with different statistical measurements.