![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Hitoshi Kanoh
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
- [c23]Claus Aranha, Jair Pereira Junior, Hitoshi Kanoh:
Comparative study on discrete SI approaches to the graph coloring problem. GECCO (Companion) 2018: 81-82 - 2017
- [c22]Kui Chen, Hitoshi Kanoh:
A discrete firefly algorithm based on similarity for graph coloring problems. SNPD 2017: 65-70 - [c21]Dongqing Zhao, Claus Aranha, Hitoshi Kanoh:
Solving real-world facility layout problems using GA with Levy Flights and multi-decoding. SNPD 2017: 333-338 - [c20]Claus Aranha, Keita Toda, Hitoshi Kanoh:
Solving the Graph Coloring Problem Using Cuckoo Search. ICSI (1) 2017: 552-560 - 2016
- [c19]Dongqing Zhao, Claus Aranha, Hitoshi Kanoh:
Solving facility layout problems using evolutionary strategy based on levy flight. IWCIA 2016: 39-44 - [c18]Kui Chen, Hitoshi Kanoh:
A Discrete Artificial Bee Colony Algorithm Based on Similarity for Graph Coloring Problems. TPNC 2016: 73-84 - 2015
- [c17]Takuya Aoki, Claus Aranha, Hitoshi Kanoh:
PSO Algorithm with Transition Probability Based on Hamming Distance for Graph Coloring Problem. SMC 2015: 1956-1961 - 2014
- [j5]Hitoshi Kanoh, Junichi Ochiai, Yosuke Kameda:
Pheromone trail initialization with local optimal solutions in ant colony optimization. Int. J. Knowl. Based Intell. Eng. Syst. 18(1): 11-21 (2014) - 2013
- [c16]Hitoshi Kanoh, Satoshi Chen:
Particle Swarm Optimization with Transition Probability for Timetabling Problems. ICANNGA 2013: 256-265 - 2012
- [c15]Hitoshi Kanoh, Junichi Ochiai:
Solving Time-Dependent Traveling Salesman Problems Using Ant Colony Optimization Based on Predicted Traffic. DCAI 2012: 25-32 - 2011
- [c14]Sonomi Kitamura, Hitoshi Kanoh:
Developing Support System for Making Posters with Interactive Evolutionary Computation. ISCID (1) 2011: 48-51 - 2010
- [j4]Hitoshi Kanoh, Souichi Tsukahara:
Solving real-world vehicle routing problems with time windows using virus evolution strategy. Int. J. Knowl. Based Intell. Eng. Syst. 14(3): 115-126 (2010) - [c13]Shohei Sato, Hitoshi Kanoh:
Evolutionary design of edge detector using rule-changing Cellular automata. NaBIC 2010: 60-65 - [c12]Hitoshi Kanoh, Yosuke Kameda:
Pheromone trail initialization with local optimal solutions in ant colony optimization. SoCPaR 2010: 338-343
2000 – 2009
- 2008
- [j3]Hitoshi Kanoh, Yuusuke Sakamoto:
Knowledge-based genetic algorithm for university course timetabling problems. Int. J. Knowl. Based Intell. Eng. Syst. 12(4): 283-294 (2008) - [c11]Hitoshi Kanoh, Kenta Hara:
Hybrid genetic algorithm for dynamic multi-objective route planning with predicted traffic in a real-world road network. GECCO 2008: 657-664 - [c10]Yuji Muraki, Hitoshi Kanoh:
Wide-area Traffic Signal Control Using Predicted Traffic Based on Real-time Information. ITSC 2008: 1055-1060 - [c9]Hitoshi Kanoh, Souichi Tsukahara:
Virus Evolution Strategy for Vehicle Routing Problems with Time Windows. PPSN 2008: 1041-1050 - 2007
- [j2]Hitoshi Kanoh:
Dynamic route planning for car navigation systems using virus genetic algorithms. Int. J. Knowl. Based Intell. Eng. Syst. 11(1): 65-78 (2007) - [c8]Hitoshi Kanoh, Shohei Sato:
Improved evolutionary design for rule-changing cellular automata based on the difficulty of problems. SMC 2007: 1243-1248 - 2004
- [c7]Hitoshi Kanoh, Yuusuke Sakamoto:
Interactive timetabling system using genetic algorithms. SMC (6) 2004: 5852-5857 - 2003
- [c6]Hitoshi Kanoh, Yun Wu:
Evolutionary Design of Rule Changing Cellular Automata. KES 2003: 258-264 - 2001
- [j1]Kazunori Mizuno, Seiichi Nishihara, Hitoshi Kanoh, Isao Kishi:
Population migration: a meta-heuristics for stochastic approaches to constraint satisfaction problems. Informatica (Slovenia) 25(3) (2001) - [c5]Hideki Kozuka, Yohsuke Matsui, Hitoshi Kanoh:
Traffic flow simulation using cellular automata under non-equilibrium environment. SMC 2001: 1341-1345 - 2000
- [c4]Hitoshi Kanoh, Tomohiro Nakamura:
Knowledge based genetic algorithm for dynamic route selection. KES 2000: 616-619 - [c3]Nobuko Kato, Tomoe Okuno, Rizu Suzuki, Hitoshi Kanoh:
Modeling virtual cities based on interaction between cells. SMC 2000: 143-148
1990 – 1999
- 1998
- [c2]Nobuko Kato, Tomoe Okuno, Aya Okano, Hitoshi Kanoh, Seiichi Nishihara:
An ALife approach to modeling virtual cities. SMC 1998: 1168-1173 - 1992
- [c1]Masahisa Kaneta, Hitoshi Kanoh, Kimiharu Kanemaru, Toshio Nagai:
Image Processing Method for Intruder Detection around Power Line Towers. MVA 1992: 353-356
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-24 23:03 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint