default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIsmail Karaoglan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j14]Gözde Can Atasagun, Ismail Karaoglan:
Integrated production and outbound distribution scheduling problem with multiple facilities/vehicles and perishable items. Appl. Soft Comput. 166: 112144 (2024)- [j13]Gözde Can Atasagun
, Ismail Karaoglan:
Solution approaches for the integrated production and outbound distribution scheduling problem with multiple plants and perishable items. Expert Syst. Appl. 237(Part C): 121318 (2024) - 2023
- [j12]Ece Arzu Demircan-Yildiz, Ismail Karaoglan, Fulya Altiparmak:
An exact algorithm for Two-Echelon Location-Routing problem with simultaneous pickup and delivery. Expert Syst. Appl. 231: 120598 (2023) - 2018
- [j11]Onder Belgin, Ismail Karaoglan, Fulya Altiparmak:
Two-echelon vehicle routing problem with simultaneous pickup and delivery: Mathematical model and heuristic approach. Comput. Ind. Eng. 115: 1-16 (2018) - [j10]Ismail Karaoglan, Günes Erdogan, Çagri Koç:
The Multi-Vehicle Probabilistic Covering Tour Problem. Eur. J. Oper. Res. 271(1): 278-287 (2018) - 2017
- [j9]Ismail Karaoglan, Saadettin Erhan Kesen:
The coordinated production and transportation scheduling problem with a time-sensitive product: a branch-and-cut algorithm. Int. J. Prod. Res. 55(2): 536-557 (2017) - 2016
- [j8]Çagri Koç, Ismail Karaoglan:
The green vehicle routing problem: A heuristic based exact solution approach. Appl. Soft Comput. 39: 154-164 (2016) - 2015
- [j7]Ismail Karaoglan, Fulya Altiparmak:
A memetic algorithm for the capacitated location-routing problem with mixed backhauls. Comput. Oper. Res. 55: 200-216 (2015) - 2013
- [j6]Fatma Pinar Goksal, Ismail Karaoglan, Fulya Altiparmak:
A hybrid discrete particle swarm optimization for vehicle routing problem with simultaneous pickup and delivery. Comput. Ind. Eng. 65(1): 39-53 (2013) - [j5]Cihan Çetinkaya, Ismail Karaoglan, Hadi Gökçen:
Two-stage vehicle routing problem with arc time windows: A mixed integer programming formulation and a heuristic approach. Eur. J. Oper. Res. 230(3): 539-550 (2013) - 2012
- [j4]Emel Kizilkaya Aydogan, Ismail Karaoglan, Panos M. Pardalos:
hGA: Hybrid genetic algorithm in fuzzy rule-based classification systems for high-dimensional problems. Appl. Soft Comput. 12(2): 800-806 (2012) - 2011
- [j3]Ismail Karaoglan, Fulya Altiparmak, Imdat Kara, Berna Dengiz:
A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery. Eur. J. Oper. Res. 211(2): 318-332 (2011) - 2009
- [j2]Fulya Altiparmak, Mitsuo Gen, Lin Lin, Ismail Karaoglan:
A steady-state genetic algorithm for multi-product supply chain network design. Comput. Ind. Eng. 56(2): 521-537 (2009) - 2008
- [j1]Fulya Altiparmak, Ismail Karaoglan:
An adaptive tabu-simulated annealing for concave cost transportation problems. J. Oper. Res. Soc. 59(3): 331-341 (2008)
Conference and Workshop Papers
- 2024
- [c3]Nursah Yilmaz, Ismail Karaoglan:
The Generalized One-to-One Pickup and Delivery Vehicle Routing Problem. APMS (6) 2024: 291-306 - 2016
- [c2]Ece Arzu Demircan-Yildiz, Ismail Karaoglan, Fulya Altiparmak:
Two Echelon Location Routing Problem with Simultaneous Pickup and Delivery: Mixed Integer Programming Formulations and Comparative Analysis. ICCL 2016: 275-289 - 2007
- [c1]Fulya Altiparmak, Ismail Karaoglan:
A genetic ant colony optimization approach for concave cost transportation problems. IEEE Congress on Evolutionary Computation 2007: 1685-1692
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-10-23 21:29 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:
