Skip to Main content Skip to Navigation
Conference papers

Memetic Algorithm with Population Management for the 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 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.
Document type :
Conference papers
Complete list of metadatas

https://hal-utt.archives-ouvertes.fr/hal-02735905
Contributor : Jean-Baptiste Vu Van <>
Submitted on : Tuesday, June 2, 2020 - 4:50:08 PM
Last modification on : Wednesday, June 3, 2020 - 3:45:21 AM

Links full text

Identifiers

Collections

ROSAS | UTT | CNRS

Citation

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⟩

Share

Metrics

Record views

13