학회 정보

EvoCOP 2027: European Conference on Evolutionary Computation in Combinatorial Optimisation

학회 웹사이트를 보려면 로그인해 주세요
무료 가입으로 공식 사이트 조회, 마감 추적, 이메일 리마인더를 이용할 수 있습니다.
마감 카운트다운 배지 삽입
EvoCOP
이 데이터를 API로 가져오기
검색과 순위 목록은 자격 증명이 전혀 필요 없습니다. 이 페이지의 상세 데이터에는 무료 API 키가 필요합니다. 자세한 내용은 개발자 안내 페이지를 참고하세요.
투고 마감일:
2026-11-01 53일 남음
통보일:
2027-01-10
개최일:
2027-03-31
개최지:
Mainz, Germany
개최 횟수:
ICORE: B   QUALIS: B2   조회: 22774   팔로우: 2   참가: 0

회반 지수 (CP-I)

72.0 / 100
전체 5,655개 중 295위 · 상위 6%

이론·알고리즘 분야 138개 중 20위 인공지능·기계학습 분야 736개 중 25위

학술적 인정 (35%)
72
투고 선별성 (20%)
69
개최 횟수 (20%)
90
커뮤니티 관심도 (10%)
23
공개 자료 충실도 (15%)
85

사용한 입력: 수록 등급: ICORE B, QUALIS B2 · 게재율: 37.6%(기록이 있는 5개 회차의 평균) · 확인되는 개최 횟수: 27 · 회반에서 팔로우 중인 연구자: 2명 · 지난 24개월 동안 이 페이지를 연 연구자: 4명

공개 자료에서 빠진 항목: 최우수 논문 기록 (+2.3)
주최자는 학회를 인증 신청한 뒤 이 페이지에서 바로 추가할 수 있습니다. 점수는 매일 밤 다시 계산됩니다. 이 점수를 올리는 방법

신뢰도 100% — 점수 중 중립 기준값이 아니라 실제 관측된 데이터에 근거한 비율. 이 점수는 어떻게 계산되나 · 전체 순위 보기 · 알고리즘 버전 1.1 · 산출일 2026-09-09

논문 모집

EvoCOP 2027 (European Conference on Evolutionary Computation in Combinatorial Optimisation) is a ICORE B / QUALIS B2 conference held in Mainz, Germany on 2027-03-31. The paper submission deadline is 2026-11-01. Acceptance notifications are sent on 2027-01-10.

The 27th European Conference on Evolutionary Computation in Combinatorial Optimisation is a multidisciplinary conference that brings together researchers working on applications and theory of evolutionary computation methods and other metaheuristics for solving difficult combinatorial optimisation problems appearing in various industrial, economic, and scientific domains. Successfully solved problems include, but are not limited to, multi-objective, uncertain, dynamic and stochastic problems in the context of scheduling, timetabling, network design, transportation and distribution, vehicle routing, stringology, graphs, satisfiability, energy optimisation, cutting, packing, planning, and search-based software engineering. Successfully addressed theoretical and translational challenges encompass, but are not limited to, the development and analysis of novel (components of) evolutionary and other metaheuristic algorithms, work on neighbourhood and landscape structures, problem-agnostic and problem-specific variation operators, parallelisation strategies, and hybridizations. The EvoCOP 2027 conference will be held together with EuroGP (the 30th European Conference on Genetic Programming), EvoMUSART (the 16th European conference on evolutionary and biologically inspired music, sound, art and design), EvoApplications (the 30th European Conference on the Applications of Evolutionary Computation), and EvoLearn (the 1st International Conference on Evolutionary Computation and Learning), in a joint event collectively known as EvoStar (Evo*). Accepted papers will be published by Springer Nature in the Lecture Notes in Computer Science series. Previous proceedings can be found in the EvoCOP Conference Proceedings in SpringerLink. Areas of Interest and Contributions EvoCOP welcomes submissions in all experimental and theoretical aspects of evolutionary computation and other metaheuristics to combinatorial optimisation problems, including (but not limited to) the following areas: Applications of metaheuristics to combinatorial optimization problems Theoretical developments Neighbourhoods and efficient algorithms for searching them Variation operators for stochastic search methods Constraint-handling techniques Parallelisation and grid computing Search space and landscape analyses Comparisons between different (also exact) methods Automatic algorithm configuration and design Prominent examples of metaheuristics include (but are not limited to): Evolutionary algorithms Estimation of distribution algorithms Swarm intelligence methods such as ant colony and particle swarm optimisation Artificial immune systems Local search methods such as simulated annealing, tabu search, variable neighbourhood search, iterated local search, scatter search and path relinking Hybrid methods such as memetic algorithms Matheuristics (hybrids of exact and heuristic methods) Hyper-heuristics and autonomous search Surrogate-model-based methods Notice that, by tradition, continuous/numerical optimisation is *not* part of the topics of interest of EvoCOP. Interested authors might consider submitting to other EvoStar conferences such as EvoApplications.
최종 수정: Admin Agent ()

게재율

평균 게재율: 41.6% 21년간 (2001–2022).

연도투고 수게재 수게재율(%)
2022281346.4%
2021421433.3%
2020371437.8%
2019371437.8%
2018371232.4%
2017391641%
2016441738.6%
2015461941.3%
2014422047.6%
2013502346%
2012482245.8%
2011422252.4%
2009532139.6%
2008692434.8%
2007812125.9%
2006772431.2%
2005662436.4%
2004862326.7%
2003391948.7%
2002321856.3%
2001312374.2%

관련 학회

CCFICORECP-I약칭정식 명칭투고 마감개최일
AA*92.4SIGIRInternational Conference on Research and Development in Information Retrieval2026-01-152026-07-20
AA*97.7AAAIAAAI Conference on Artificial Intelligence2026-07-212027-02-16
AA*91.1CVPRIEEE Conference on Computer Vision and Pattern Recognition2025-11-062026-06-03
BA*89.6ICRAInternational Conference on Robotics and Automation2026-09-152027-05-24
BA*94.0IJCAIInternational Joint Conference on Artificial Intelligence2026-01-312026-08-15
AA*89.2STOCACM Symposium on Theory of Computing2025-11-042026-06-22
C87.2ICCInternational Conference on Communications2026-10-022027-05-30
CB62.6IJCNNInternational Joint Conference on Neural Networks2027-01-312027-06-14
B91.1ICASSPInternational Conference on Acoustics, Speech and Signal Processing2026-09-162027-05-16
BA*79.4PODSACM SIGMOD Conference on Principles of DB Systems2026-12-032027-06-13

관련 저널

CCF정식 명칭영향력 지수출판사ISSN
Swarm and Evolutionary Computation8.5Elsevier2210-6502
BEvolutionary Computation3.4MIT Press1063-6560
Journal of Combinatorial Optimization1.1Springer1382-6905
AIEEE Transactions on Multimedia9.7IEEE1520-9210
CKnowledge-Based Systems7.2Elsevier0950-7051
BSoftware & Systems Modeling3.2Springer1619-1366
AIEEE Transactions on Computers3.8IEEE0018-9340
CFuture Generation Computer Systems5.9Elsevier0167-739X
CNeurocomputing6.5Elsevier0925-2312
CPattern Recognition Letters3.9Elsevier0167-8655

댓글 0

아직 댓글이 없습니다.

댓글을 작성하려면 로그인해 주세요