My Publications

Refereed Journal Articles
  1. An Adaptive Bin Framework Search for a Protein-like Homopolymer Model. Shmygelska, A., Hoos, H. H., BMC Bioinformatics, 2007 8:136.
  2. A Replica Exchange Monte Carlo for Protein Folding in the HP Model. Thachuk, C., Shmygelska, A., Hoos, H. H., BMC Bioinformatics, 2007, 8:342.
  3. Search for folding nuclei in native protein structures. Shmygelska, A. Bioinformatics, 2005, 21: i394 - i402. This paper won the Best Student Paper award at ISMB 2005.
  4. An ant colony optimisation algorithm for the 2D and 3D hydrophobic polar protein folding problem. Shmygelska, A. and Hoos, H. H. BMC Bioinformatics, 2005, 6:30 (14 Feb 2005). ACO-HPPFP Projet Page.
Refereed Conference Papers
  1. An Extremal Optimization Search Method to the Protein Folding Problem. Shmygelska, A., Genetic and Evolutionary Computation Conference (GECCO 2007).
  2. An Improved Ant Colony Optimisation Algorithm for the 2D HP Protein Folding Problem. Shmygelska, A. and Holger, H. H., Proc. of the Sixteenth Canadian Conference on Artificial Intelligence (AI'2003), 2003.
  3. An Ant Colony Optimization Algorithm for the 2D HP Protein Folding Problem Shmygelska, A., Aguirre-Hernández, R. and Holger, H. H., Third International Workshop, ANTS 2002, Proceedings. Springer's Lecture Notes in Computer Science (LNCS) series, Vol. 2463., pp. 40-52. This paper won the ANTS 2002 Best Paper Award.
  4. Multi-Depot VRP with Time Windows: A Distributed Computer Systems Approach. Thangiah, S. and Shmygelska, A. IFORS 2002
    Abstract: Multi-depot VRP with Time Windows involves servicing a set of customers within earliest and latest time windows with vehicles from multiple depots. The objectives of the problem are, first, minimize the total number of trucks and , second, minimize the total distance traveled. The constraint is the capacity of the trucks and servicing the customers within the required time widow. A distributed computer architecture using heuristic algorithms for solving the problem is explained. Comparison and computational experience with traditional heuristic algorithms is presented.
  5. An agent architecture for vehicle routing problems. Thangiah, S. R., Shmygelska, A. and Mennell, W.: SAC 2001: 517-521

Publications | Updated: Summer, 2008