A Neighborhood Search and Set Cover Hybrid Heuristic for the Two-Echelon Vehicle Routing Problem - Archive ouverte HAL
Communication Dans Un Congrès Année : 2018

A Neighborhood Search and Set Cover Hybrid Heuristic for the Two-Echelon Vehicle Routing Problem

Domaines

Informatique [cs] Recherche opérationnelle [math.OC]

Youcef Amarouche  : Connectez-vous pour contacter le contributeur

https://hal.science/hal-02005206

Soumis le : dimanche 3 février 2019-19:23:37

Dernière modification le : mardi 21 mai 2024-16:48:04

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⟩

Exporter

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

CNRS UNIV-COMPIEGNE UNIV-LITTORAL ADEME HEUDIASYC MS2T TDS-MACS HDS_SCOP LISIC
87 Consultations
0 Téléchargements

Altmetric

Partager

More