Memetic Algorithm with Population Management for the Two-dimensional Loading Vehicle Routing Problem with Partial Conflicts - Archive ouverte HAL Access content directly
Conference Papers Year :

Memetic Algorithm with Population Management for the Two-dimensional Loading Vehicle Routing Problem with Partial Conflicts

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

Abstract

The two-dimensional loading vehicle routing problem with partial conflicts combines two NP-hard problems: the capacitated vehicle routing problem (CVRP) and the two-dimensional bin-packing problem with partial conflicts (2BPPC). This problem arises for example in hazardous waste collection, where some materials can be partially conflicting. In this paper, we propose a memetic algorithm with population management to resolve this new problem. A modified SHF-D heuristic is used to obtain feasible packing in each vehicle. The proposed approach is tested on a new benchmark, created by adding partial conflicts to instances from the literature.
Not file

Dates and versions

hal-02735905 , version 1 (02-06-2020)

Identifiers

Cite

Khaoula Dhaoui, Nacima Labadie, Alice Yalaoui. Memetic Algorithm with Population Management for the Two-dimensional Loading Vehicle Routing Problem with Partial Conflicts. 4th International Joint Conference on Computational Intelligence, Oct 2012, Barcelona, Spain. ⟨10.5220/0004149501890195⟩. ⟨hal-02735905⟩

Collections

CNRS UTT LOSI
13 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More