The bi-objective two-dimensional loading vehicle routing problem with partial conflicts - Archive ouverte HAL Access content directly
Journal Articles International Journal of Production Research Year : 2014

The bi-objective two-dimensional loading vehicle routing problem with partial conflicts

(1) , (2) , (2)
1
2

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.
Not file

Dates and versions

hal-02521789 , version 1 (27-03-2020)

Identifiers

Cite

Khaoula Hamdi-Dhaoui, Nacima Labadie, Alice Yalaoui. The bi-objective two-dimensional loading vehicle routing problem with partial conflicts. International Journal of Production Research, 2014, 52 (19), pp.5565-5582. ⟨10.1080/00207543.2014.885181⟩. ⟨hal-02521789⟩

Collections

CNRS UTT LOSI
9 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More