Zobrazeno 1 - 1
of 1
pro vyhledávání: '"InsertionandReinsertionHeuristics"'
Publikováno v:
Lecture Notes in Computer Science book series
Lecture Notes in Computer Science book series, 11536, springer, pp.81-95, 2019, Computational Science – ICCS 2019 19th International Conference, Faro, Portugal, June 12–14, 2019, Proceedings, Part I, ⟨10.1007/978-3-030-22734-0_7⟩
International Conference on Computational ScienceICCS 2019: Computational Science Proceedings, Part I – ICCS 2019
International Conference on Computational Science ICCS 2019: Computational Science Proceedings, Part I – ICCS 2019, pp.81-95, 2019, ⟨10.1007/978-3-030-22734-0_7⟩
Lecture Notes in Computer Science ISBN: 9783030227333
ICCS (1)
Lecture Notes in Computer Science book series, 11536, springer, pp.81-95, 2019, Computational Science – ICCS 2019 19th International Conference, Faro, Portugal, June 12–14, 2019, Proceedings, Part I, ⟨10.1007/978-3-030-22734-0_7⟩
International Conference on Computational ScienceICCS 2019: Computational Science Proceedings, Part I – ICCS 2019
International Conference on Computational Science ICCS 2019: Computational Science Proceedings, Part I – ICCS 2019, pp.81-95, 2019, ⟨10.1007/978-3-030-22734-0_7⟩
Lecture Notes in Computer Science ISBN: 9783030227333
ICCS (1)
International audience; The Dial-a-Ride Problem (DARP) consists in serving a set of customers who specify their pickup and drop-off locations using a fleet of vehicles. The aim of DARP is designing vehicle routes satisfying requests of customers and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::808c83197588baa1bb6cc5d32ec5b57e
https://hal.univ-lorraine.fr/hal-02982807
https://hal.univ-lorraine.fr/hal-02982807