Zobrazeno 1 - 10
of 33
pro vyhledávání: '"Farzad Didehvar"'
Publikováno v:
Mathematics Interdisciplinary Research, Vol 8, Iss 3, Pp 247-260 (2023)
Let $S$ be a set of $n$ points in the plane, $\nabla(S)$ the set of all simple polygons crossing $S$, $\gamma_P$ the maximum angle of polygon $P \in \nabla(S)$ and $\theta =min_{P\in\nabla(S)} \gamma_P$. In this paper, we p
Externí odkaz:
https://doaj.org/article/30e0c98d7af840ed8036348303eb1950
Publikováno v:
Bulletin of the Polish Academy of Sciences: Technical Sciences, Vol 72, Iss 1 (2023)
The fixed fleet heterogeneous open vehicle routing problem (HFFOVRP) is one of the most practical versions of the vehicle routing problem (VRP) defined because the use of rental vehicles reduces the cost of purchasing and routing for shipping compani
Externí odkaz:
https://doaj.org/article/e3dbf3cfc1ef4b6dad48550142f879ff
Publikováno v:
Mathematics, Vol 7, Iss 1, p 24 (2018)
In this paper, we generalize the problems of finding simple polygons with minimum area, maximum perimeter, and maximum number of vertices, so that they contain a given set of points and their angles are bounded by α + π where α ( 0 ≤ α ≤ π )
Externí odkaz:
https://doaj.org/article/f621519048d944b1982015a57f1f2dee
Publikováno v:
Journal of Engineering, Vol 2016 (2016)
In the heterogeneous fixed fleet open vehicle routing problem (HFFOVRP), several different types of vehicles can be used to service the customers. The types of vehicles are different in terms of capacity, fixed cost, and variable cost. In this proble
Externí odkaz:
https://doaj.org/article/869ec92aeb0f471f98d374add0d4dfaa
Publikováno v:
Kuwait Journal of Science, Vol 41, Iss 3 (2014)
The open vehicle routing problem (OVRP) is a variant of vehicle routing problem (VRP) in which the vehicles are not required to return to the depot after completing a service. Since this problem belongs to NP-hard Problems, many metaheuristic approac
Externí odkaz:
https://doaj.org/article/c658745b0f9b4142a05c95aec045840d
Autor:
Farzad Didehvar
Publikováno v:
SSRN Electronic Journal.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::879fe44cdf5b542c000da48fe5c2d7b8
https://doi.org/10.2139/ssrn.4355509
https://doi.org/10.2139/ssrn.4355509
Autor:
Farzad Didehvar
Publikováno v:
SSRN Electronic Journal.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::63afa38969da38b96fba8f3cc664eebb
https://doi.org/10.2139/ssrn.4316092
https://doi.org/10.2139/ssrn.4316092
Publikováno v:
Bulletin of the Iranian Mathematical Society. 47:1261-1288
We study the load-balanced capacitated vehicle routing problem (LBCVRP): the problem is to design a collection of tours for a fixed fleet of vehicles with capacity Q to distribute a supply from a single depot between a number of predefined clients, i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d00fcac5c9a30432cac9465d4ddb59be
https://doi.org/10.1007/s41980-020-00440-3
https://doi.org/10.1007/s41980-020-00440-3
Autor:
Farzad Didehvar
Publikováno v:
SSRN Electronic Journal.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c316ff2d95dff43a38140d45f53333d7
https://doi.org/10.2139/ssrn.4049097
https://doi.org/10.2139/ssrn.4049097
Autor:
Farzad Didehvar
Publikováno v:
SSRN Electronic Journal.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fbad8f180248cea526751ca83fe1bbba
https://doi.org/10.2139/ssrn.4060095
https://doi.org/10.2139/ssrn.4060095