default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAhmad Hemmati
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j14]Preben Bucher Johannessen, Ahmad Hemmati, Mohammad Moshref-Javadi
:
Solving a pickup and delivery routing problem for fourth-party logistics providers. Int. Trans. Oper. Res. 31(4): 2272-2308 (2024)- 2023
- [j13]Mohammad Moshref-Javadi, Kristof P. Van Cauwenberghe, Brent A. McCunney, Ahmad Hemmati:
Enabling same-day delivery using a drone resupply model with transshipment points. Comput. Manag. Sci. 20(1): 22 (2023) - [j12]Nooshin Heidari, Ahmad Hemmati:
An ALNS-based matheuristic algorithm for a multi-product many-to-many maritime inventory routing problem. Comput. Manag. Sci. 20(1): 44 (2023) - [j11]Asal Karimpour, Mostafa Setak, Ahmad Hemmati:
Estimating energy consumption and charging duration of electric vehicle in multigraph. Comput. Oper. Res. 155: 106216 (2023) - [j10]Jakob Kallestad, Ramin Hasibi, Ahmad Hemmati, Kenneth Sörensen:
A general deep reinforcement learning hyperheuristic framework for solving combinatorial optimization problems. Eur. J. Oper. Res. 309(1): 446-468 (2023) - 2021
- [j9]Mohammad Moshref-Javadi, Ahmad Hemmati, Matthias Winkenbach:
A comparative analysis of synchronized truck-and-drone delivery models. Comput. Ind. Eng. 162: 107648 (2021)
2010 – 2019
- 2017
- [j8]Ahmad Hemmati, Lars Magnus Hvattum:
Evaluating the importance of randomization in adaptive large neighborhood search. Int. Trans. Oper. Res. 24(5): 929-942 (2017) - 2016
- [j7]Ahmad Hemmati, Lars Magnus Hvattum, Marielle Christiansen, Gilbert Laporte:
An iterative two-phase hybrid matheuristic for a multi-product short sea inventory-routing problem. Eur. J. Oper. Res. 252(3): 775-788 (2016) - 2015
- [j6]Ahmad Hemmati, Magnus Stålhane, Lars Magnus Hvattum, Henrik Andersson:
An effective heuristic for solving a combined cargo and inventory routing problem in tramp shipping. Comput. Oper. Res. 64: 274-282 (2015) - 2014
- [j5]Ahmad Hemmati, Lars Magnus Hvattum, Kjetil Fagerholt, Inge Norstad:
Benchmark Suite for Industrial and Tramp Ship Routing and Scheduling Problems. INFOR Inf. Syst. Oper. Res. 52(1): 28-38 (2014) - [j4]Mohammad Hossein Fazel Zarandi, Ahmad Hemmati, Soheil Davari, I. Burhan Türksen:
A simulated annealing algorithm for routing problems with fuzzy constrains. J. Intell. Fuzzy Syst. 26(6): 2649-2660 (2014) - 2013
- [j3]Mohammad Hossein Fazel Zarandi, Ahmad Hemmati, Soheil Davari, I. Burhan Türksen:
Capacitated location-routing problem with time windows under uncertainty. Knowl. Based Syst. 37: 480-489 (2013) - 2011
- [j2]Mohammad Hossein Fazel Zarandi, Ahmad Hemmati, Soheil Davari:
The multi-depot capacitated location-routing problem with fuzzy travel times. Expert Syst. Appl. 38(8): 10075-10084 (2011) - [j1]Soheil Davari, Mohammad Hossein Fazel Zarandi, Ahmad Hemmati:
Maximal covering location problem (MCLP) with fuzzy travel times. Expert Syst. Appl. 38(12): 14535-14541 (2011) - 2010
- [c1]Soheil Davari, Mohammad Hossein Fazel Zarandi, Ahmad Hemmati, I. Burhan Türksen:
The variable radius covering problem with fuzzy travel times. FUZZ-IEEE 2010: 1-6
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
