@InProceedings{amarouche_et_al:OASIcs.ATMOS.2018.11,
  author =	{Amarouche, Youcef and Guibadj, Rym N. and Moukrim, Aziz},
  title =	{{A Neighborhood Search and Set Cover Hybrid Heuristic for the Two-Echelon Vehicle Routing Problem}},
  booktitle =	{18th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2018)},
  pages =	{11:1--11:15},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-096-5},
  ISSN =	{2190-6807},
  year =	{2018},
  volume =	{65},
  editor =	{Bornd\"{o}rfer, Ralf and Storandt, Sabine},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2018.11},
  URN =		{urn:nbn:de:0030-drops-97161},
  doi =		{10.4230/OASIcs.ATMOS.2018.11},
  annote =	{Keywords: Two-Echelon Vehicle Routing Problem, City Logistics, hybrid method, integer programming}
}