default search action
Koya Ihara
Person information
- affiliation: Nagoya Institute of Technology, Japan
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c17]Ayaka Sugiura, Takahiro Suzuki, Koya Ihara, Takuto Sakuma, Shohei Kato:
Generating Products Placement in Warehouse Using BLPSO and MIQCPs. ICAART (3) 2024: 454-461 - 2023
- [c16]Kenga Mikami, Koya Ihara, Takuto Sakuma, Shohei Kato:
Development of a Production Line Work Scheduling System Considering Diversity of Work Assignment. GCCE 2023: 111-112 - 2022
- [c15]Minami Watanabe, Koya Ihara, Shohei Kato, Takuto Sakuma:
Introducing an AGV System into the Warehouse and Optimizing Product Placement for Efficient Operation. GCCE 2022: 836-837 - [c14]Kenga Mikami, Koya Ihara, Takuto Sakuma, Shohei Kato:
A Production Line Work Schedule Generation System Considering Rest Alternation. GCCE 2022: 838-839 - [c13]Takuto Sakuma
, Minami Watanabe, Koya Ihara
, Shohei Kato
:
Development of a Multiagent Based Order Picking Simulator for Optimizing Operations in a Logistics Warehouse. IEA/AIE 2022: 63-73 - 2021
- [c12]Koya Ihara, Shohei Kato:
A Novel Sampling Method with Lévy Flight for Distribution-Based Discrete Particle Swarm Optimization. CEC 2021: 2281-2288 - [c11]Minami Watanabe, Koya Ihara, Shohei Kato, Takuto Sakuma:
Initialization Effects for PSO Based Storage Assignment Optimization. GCCE 2021: 494-495 - 2020
- [c10]Koya Ihara
, Shohei Kato
:
Improving Distribution-Based Discrete Particle Swarm Optimization Using Lévy Flight. Australasian Conference on Artificial Intelligence 2020: 189-200 - [c9]Takatoshi Niwa, Koya Ihara, Shohei Kato:
Group Working Differential Evolution. GCCE 2020: 837-839 - [c8]Koya Ihara, Shohei Kato:
Lévy Flight for Distribution-Based Discrete Particle Swarm Optimization. GCCE 2020: 960-961 - [c7]Takatoshi Niwa, Koya Ihara, Shohei Kato:
Cooperative coevolutionary genetic algorithm using hierarchical clustering of linkage tree. GECCO Companion 2020: 219-220
2010 – 2019
- 2019
- [c6]Takatoshi Niwa, Koya Ihara, Shohei Kato:
Group Working Just Generation Gap with Problem Redivision. GCCE 2019: 394-396 - [c5]Takatoshi Niwa, Koya Ihara, Shohei Kato:
A group work inspired generation alternation model of real-coded GA. GECCO (Companion) 2019: 302-303 - [c4]Koya Ihara
, Shohei Kato
, Takehiko Nakaya, Tomoaki Ogi, Hiroichi Masuda:
Application of PSO-Based Constrained Combinatorial Optimization to Segment Assignment in Shield Tunneling. ICAART (Revised Selected Papers) 2019: 166-182 - [c3]Koya Ihara
, Shohei Kato, Takehiko Nakaya, Tomoaki Ogi, Hiroichi Masuda:
A PSO based Approach to Assign Segments for Reducing Excavated Soil in Shield Tunneling. ICAART (2) 2019: 328-336 - 2018
- [c2]Koya Ihara, Shohei Kato, Takehiko Nakaya, Tomoaki Ogi:
Constrained GA Based Segment Assignment in Shield Tunneling to Minimize the Amount of Excavated Soil. GCCE 2018: 229-230 - 2017
- [c1]Koya Ihara, Shohei Kato:
Neuro-Evolutionary Approach to Multi-objective Optimization in One-Player Mahjong. NBiS 2017: 492-503
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-04-25 05:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint