default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEmrah Demir
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j23]Ziru Lin, Xiaofeng Xu, Emrah Demir
, Gilbert Laporte:
Optimizing task assignment and routing operations with a heterogeneous fleet of unmanned aerial vehicles for emergency healthcare services. Comput. Oper. Res. 174: 106890 (2025)- [j22]Cheng Chen, Emrah Demir, Xisheng Hu, Hainan Huang:
Transforming last mile delivery with heterogeneous assistants: drones and delivery robots. J. Heuristics 31(1): 8 (2025) - 2024
- [j21]David S. W. Lai, Yasel Costa, Emrah Demir, Alexandre M. Florio, Tom Van Woensel:
The pollution-routing problem with speed optimization and uneven topography. Comput. Oper. Res. 164: 106557 (2024) - 2023
- [j20]Zhuowu Zhang, Emrah Demir, Robert Mason, Carla Di Cairano-Gilfedder:
Understanding freight drivers' behavior and the impact on vehicles' fuel consumption and CO2e emissions. Oper. Res. 23(4): 59 (2023) - [c1]Ba Luat Le, Layla Martin-Samos, Emrah Demir, Duc Minh Vu:
A* Search Algorithm for an Optimal Investment Problem in Vehicle-Sharing Systems. CSoNet 2023: 162-173 - [i1]Ba Luat Le, Layla Martin, Emrah Demir, Duc Minh Vu:
A* search algorithm for an optimal investment problem in vehicle-sharing systems. CoRR abs/2311.08834 (2023) - 2022
- [j19]David S. W. Lai, Yijun Li, Emrah Demir, Nico P. Dellaert, Tom Van Woensel:
Self-adaptive randomized constructive heuristics for the multi-item capacitated lot sizing problem. Comput. Oper. Res. 147: 105928 (2022) - 2021
- [j18]Emna Marrekchi, Walid Besbes, Diala Dhouib, Emrah Demir:
A review of recent advances in the operations research literature on the green routing problem and its variants. Ann. Oper. Res. 304(1): 529-574 (2021) - [j17]Emrah Demir, Daniel Eyers, Yuan Huang:
Competing through the last mile: Strategic 3D printing in a city logistics context. Comput. Oper. Res. 131: 105248 (2021) - [j16]Hamid Tikani, Mostafa Setak, Emrah Demir:
A risk-constrained time-dependent cash-in-transit routing problem in multigraph under uncertainty. Eur. J. Oper. Res. 293(2): 703-730 (2021) - [j15]Cheng Chen, Emrah Demir, Yuan Huang:
An adaptive large neighborhood search heuristic for the vehicle routing problem with time windows and delivery robots. Eur. J. Oper. Res. 294(3): 1164-1180 (2021) - [j14]Hamid Tikani, Mostafa Setak, Emrah Demir:
Multi-objective periodic cash transportation problem with path dissimilarity and arrival time variation. Expert Syst. Appl. 164: 114015 (2021) - 2020
- [j13]Reza Eshtehadi, Emrah Demir, Yuan Huang:
Solving the vehicle routing problem with multi-compartment vehicles for city logistics. Comput. Oper. Res. 115: 104859 (2020) - [j12]Mohamed Amine Masmoudi, Manar Hosny, Emrah Demir, Erwin Pesch:
Hybrid adaptive large neighborhood search algorithm for the mixed fleet heterogeneous dial-a-ride problem. J. Heuristics 26(1): 83-118 (2020) - [j11]Reza Moghdani, Khodakaram Salimifard, Emrah Demir, Abdelkader Benyettou:
Multi-Objective Volleyball Premier League algorithm. Knowl. Based Syst. 196: 105781 (2020)
2010 – 2019
- 2019
- [j10]Emrah Demir, Martin Hrusovský, Werner Jammernegg, Tom Van Woensel:
Green intermodal freight transportation: bi-objective modelling and analysis. Int. J. Prod. Res. 57(19): 6162-6180 (2019) - 2018
- [j9]Veaceslav Ghilas, Jean-François Cordeau, Emrah Demir, Tom Van Woensel:
Branch-and-Price for the Pickup and Delivery Problem with Time Windows and Scheduled Lines. Transp. Sci. 52(5): 1191-1210 (2018) - 2017
- [j8]Anna Franceschetti, Emrah Demir, Dorothée Honhon, Tom Van Woensel, Gilbert Laporte, Mark Stobbe:
A metaheuristic for the time-dependent pollution-routing problem. Eur. J. Oper. Res. 259(3): 972-991 (2017) - [j7]Said Dabia, Emrah Demir, Tom Van Woensel:
An Exact Approach for a Variant of the Pollution-Routing Problem. Transp. Sci. 51(2): 607-628 (2017) - 2016
- [j6]Veaceslav Ghilas, Emrah Demir, Tom Van Woensel:
An adaptive large neighborhood search heuristic for the Pickup and Delivery Problem with Time Windows and Scheduled Lines. Comput. Oper. Res. 72: 12-30 (2016) - [j5]Veaceslav Ghilas, Emrah Demir, Tom Van Woensel:
The pickup and delivery problem with time windows and scheduled lines. INFOR Inf. Syst. Oper. Res. 54(2): 147-167 (2016) - 2014
- [j4]Emrah Demir, Tolga Bektas, Gilbert Laporte:
The bi-objective Pollution-Routing Problem. Eur. J. Oper. Res. 232(3): 464-478 (2014) - [j3]Emrah Demir, Tolga Bektas, Gilbert Laporte:
A review of recent research on green road freight transportation. Eur. J. Oper. Res. 237(3): 775-793 (2014) - [j2]Emrah Demir, Tom Van Woensel, Ton G. de Kok:
Multidepot Distribution Planning at Logistics Service Provider Nabuurs B.V. Interfaces 44(6): 591-604 (2014) - 2012
- [j1]Emrah Demir, Tolga Bektas, Gilbert Laporte:
An adaptive large neighborhood search heuristic for the Pollution-Routing Problem. Eur. J. Oper. Res. 223(2): 346-359 (2012)
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 2025-02-14 02:00 CET 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:
