This event is endorsed
and organized by

9th EAI International Conference on Bio-inspired Information and Communications Technologies (formerly BIONETICS)

December 3–5, 2015 | New York City, New York, United States

CFP: BICT 2015 Special Track on Combinatorial Optimization (COP)

8th International Conference on Bio-inspired Information and Communications Technologies (formerly BIONETICS)

December 3 (Thu) - December 5 (Sat), 2015
New York City, NY, USA

In-cooperation with ACM (pending)

A combinatorial optimization problem is one in which we must optimize a discrete structure, such as a set, permutation, or graph. Applications of combinatorial optimization abound, including problems like vehicle routing, circuit layout, planning and scheduling, DNA sequence alignment, cutting-stock problems, among many others. One characteristic shared by many of the most important combinatorial optimization problems is that they are very often in the class of NP-Hard problems; and thus, no polynomial-time algorithms likely exist for these problems.

The most common approaches to solving combinatorial optimization problems include various metaheuristics that seek sufficiently high-quality solutions, while trading off guarantees of optimality. Many of these metaheuristics are bioinspired, such as genetic algorithms, and other forms of evolutionary computation, as well as algorithms such as ant colony optimization, particle swarm optimization, memetic algorithms, among others; and others are inspired by other naturally occurring processes, such as simulated annealing. Though such approaches are not guaranteed to find the globally optimal solution, they are often quite effective at finding near-optimal solutions quickly. One especially desirable property shared by many of these approaches is the anytime property, where they are capable of providing some solution under any limitations on computational time, but where the quality of that solution improves the more time you have available.

This special track on combinatorial optimization at the International Conference on Bioinspired Information and Communications Technologies solicits contributions on the theory, application, and practice of any bioinspired or nature inspired approach to combinatorial optimization.


Regular paper submission due: August 31
Short and poster/demo paper submission due: September 22
Notification for regular papers: September 21
Notification for short and poster/demo papers: October 1
Camera ready due: October 15


Authors are invited to submit regular papers (up to 8 pages each), short papers (up to 4 pages each) or poster/demo papers (up to 2 pages each) in ACM's paper template. Up to two extra pages are allowed for each paper with extra page charges. See for more details.


All accepted paper will be published through ACM Digital Library and submitted for indexing by SI, EI Compendex, Scopus, ACM Library, Google Scholar and many more. Selected papers will be considered for publication in leading journals including:

Track Co-Chairs:

Vincent A. Cicirello, Stockton University, New Jersey, USA.

Jun Suzuki, University of Massachusetts, Boston, USA.