Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

A Tabu Search Algorithm for the Single Vehicle Routing Allocation Problem

Autor: Vogt, L., Poojari, C. A., Beasley, J. E.

Publikováno v: The Journal of the Operational Research Society, 2007 Apr 01. 58(4), 467-480.

Externí odkaz: https://www.jstor.org/stable/4622720

Two meta-heuristics for solving the multi-vehicle multi-covering tour problem with a constraint on the number of vertices

Autor: Bassem Jarboui, Manel Kammoun, Houda Derbel

Publikováno v: Yugoslav Journal of Operations Research, Vol 31, Iss 3, Pp 299-318 (2021)

In this work we deal with a generalized variant of the multi-vehicle covering tour problem (m-CTP). The m-CTP consists of minimizing the total routing cost and satisfying the entire demand of all customers, without the restriction of visiting them al

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1d2ec06b301bbf69750442c394adbd19
http://www.doiserbia.nb.rs/img/doi/0354-0243/2021/0354-02432000014K.pdf

Exact methods for mono-objective and Bi-Objective Multi-Vehicle Covering Tour Problems

Autor: Sandra Ulrich Ngueveu, Roberto Roberti, Nicolas Jozefowiez, Estèle Glize

Publikováno v: European Journal of Operational Research, 283(3), 812-824. Elsevier
Glize, E, Roberti, R, Jozefowiez, N & Ngueveu, S U 2020, ' Exact methods for mono-objective and Bi-Objective Multi-Vehicle Covering Tour Problems ', European Journal of Operational Research, vol. 283, no. 3, pp. 812-824 . https://doi.org/10.1016/j.ejor.2019.11.045
European Journal of Operational Research
European Journal of Operational Research, Elsevier, 2020, 283 (3), pp.812-824. ⟨10.1016/j.ejor.2019.11.045⟩

International audience; The Multi-vehicle Covering Tour Problem and the Bi-Objective Multi-vehicle Covering Tour Problem have been studied for more than thirty years. Both problems have several practical applications in industry. In this paper, we pr

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8ada152bdefe3f7cafc8d1391f9f1550
http://www.scopus.com/inward/record.url?scp=85076526184&partnerID=8YFLogxK

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.