A Neighborhood Search and Set Cover Hybrid Heuristic for the Two-Echelon Vehicle Routing Problem - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2018
Fichier non déposé

Dates et versions

hal-02005206 , version 1 (03-02-2019)

Licence

Paternité

Identifiants

Citer

Youcef Amarouche, Rym Nesrine Guibadj, Aziz Moukrim. A Neighborhood Search and Set Cover Hybrid Heuristic for the Two-Echelon Vehicle Routing Problem. 18th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, (ATMOS 2018), Aug 2018, Helsinki, Finland. pp.11:1--11:15, ⟨10.4230/OASIcs.ATMOS.2018.11⟩. ⟨hal-02005206⟩
68 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More