People

Dr Daniel Karapetyan

Lecturer
School of Computer Science and Electronic Engineering (CSEE)
Dr Daniel Karapetyan
  • Email

  • Telephone

    +44 (0) 1206 874012

  • Location

    5B.527, Colchester Campus

  • Academic support hours

    Tuesday 11.00-12.00; Thursday 13.00-14.00. Room 5B.527

Profile

Biography

Detailed list of publications: http://csee.essex.ac.uk/staff/dkarap/?page=publications

Qualifications

  • PhD in Computer Science Royal Holloway University of London,

Research and professional activities

Research interests

Combinatorial Optimisation

Adaptive Methods

Automated generation of Algorithms

Operational Research

Transportation and Logistics

Current research

Workflow Satisfiability Problem (WSP)

BipartiteBooleanQuadratic Programming (BBQP)

Consitional Markov Chain Search (CMCS)

Bloom filters

Teaching and supervision

Current teaching responsibilities

  • Introduction to Databases (CE153)

  • Team Project Challenge (CS) (CE291)

  • Team Project Challenge (CSE) (CE292)

  • Team Project Challenge (EE) (CE293)

  • Team Project Challenge (WBL) (CE299)

  • Advanced Programming (CE303)

  • Mathematical Research Techniques Using Matlab (CE885)

Publications

Journal articles (20)

Marinov, D. and Karapetyan, D., Hyperparameter Optimisation with Early Termination of Poor Performers

Nalivajevs, O. and Karapetyan, D., Conditional Markov Chain Search for the Generalised Travelling Salesman Problem for Warehouse Order Picking

Karapetyan, D., Parkes, AJ., Gutin, G. and Gagarin, A., (2019). Pattern-Based Approach to the Workflow Satisfiability Problem with User-Independent Constraints. The Journal of Artificial Intelligence Research. 66, 85-122

Karapetyan, D., Punnen, AP. and Parkes, AJ., (2017). Markov Chain methods for the Bipartite Boolean Quadratic Programming Problem. European Journal of Operational Research. 260 (2), 494-506

Crampton, J., Gutin, G., Karapetyan, D. and Watrigant, R., (2017). The bi-objective workflow satisfiability problem and workflow resiliency. Journal of Computer Security. 25 (1), 83-115

Karapetyan, D., Atkin, JAD., Parkes, AJ. and Castro-Gutierrez, J., (2017). Lessons from building an automated pre-departure sequencer for airports. Annals of Operations Research. 252 (2), 435-453

Asta, S., Karapetyan, D., Kheiri, A., Özcan, E. and Parkes, AJ., (2016). Combining Monte-Carlo and hyper-heuristic methods for the multi-mode resource-constrained multi-project scheduling problem. Information Sciences. 373, 476-498

Karapetyan, D., Mitrovic Minic, S., Malladi, KT. and Punnen, AP., (2015). Satellite downlink scheduling problem: A case study. Omega. 53, 115-123

Punnen, AP., Sripratak, P. and Karapetyan, D., (2015). The bipartite unconstrained 0–1 quadratic programming problem: Polynomially solvable cases. Discrete Applied Mathematics. 193, 1-10

Punnen, AP., Sripratak, P. and Karapetyan, D., (2015). Average value of solutions for the bipartite boolean quadratic programs and rounding algorithms. Theoretical Computer Science. 565 (C), 77-89

Punnen, AP., Taghipour, S., Karapetyan, D. and Bhattacharyya, B., (2014). The quadratic balanced optimization problem. Discrete Optimization. 12 (1), 47-60

Karapetyan, D. and Punnen, AP., (2013). A reduced integer programming model for the ferry scheduling problem. Public Transport. 4 (3), 151-163

Reihaneh, M. and Karapetyan, D., (2012). An Efficient Hybrid Ant Colony System for the Generalized Traveling Salesman Problem. Algorithmic Operations Research. 7 (1), 21-28

Karapetyan, D. and Gutin, G., (2012). Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem. European Journal of Operational Research. 219 (2), 234-251

Karapetyan, D. and Gutin, G., (2011). Lin–Kernighan heuristic adaptations for the generalized traveling salesman problem. European Journal of Operational Research. 208 (3), 221-232

Karapetyan, D. and Gutin, G., (2011). A New Approach to Population Sizing for Memetic Algorithms: A Case Study for the Multidimensional Assignment Problem. Evolutionary Computation. 19 (3), 345-371

Karapetyan, D. and Gutin, G., (2011). Local search heuristics for the multidimensional assignment problem. Journal of Heuristics. 17 (3), 201-249

Gutin, G. and Karapetyan, D., (2010). A memetic algorithm for the generalized traveling salesman problem. Natural Computing. 9 (1), 47-60

Gutin, G. and Karapetyan, D., (2009). A selection of useful theoretical tools for the design and analysis of optimization heuristics. Memetic Computing. 1 (1), 25-34

Gutin, G., Karapetyan, D. and Krasnogor, N., (2008). Memetic Algorithm for the Generalized Asymmetric Traveling Salesman Problem. Studies in Computational Intelligence. 129, 199-210

Book chapters (4)

Gutin, G. and Karapety, D., Greedy Like Algorithms for the Traveling Salesman and Multidimensional Assignment Problems. In: Greedy Algorithms. InTech. 9789537619275

Malladi, KT., Minic, SM., Karapetyan, D. and Punnen, AP., (2016). Satellite Constellation Image Acquisition Problem: A Case Study. In: Springer Optimization and Its Applications. Springer International Publishing. 177- 197. 9783319415062

Karapetyan, D., Mitrovic-Minic, S., Malladi, KT. and Punnen, AP., (2015). The Satellite Downlink Scheduling Problem: A Case Study of RADARSAT-2. In: International Series in Operations Research & Management Science. Springer New York. 497- 516. 9781493910069

Karapetyan, D. and Punnen, AP., (2015). An Integer Programming Model for the Ferry Scheduling Problem. In: International Series in Operations Research & Management Science. Springer New York. 517- 537. 9781493910069

Conferences (8)

Karapetyan, D. and Vernitski, A., (2017). Efficient adaptive implementation of the serial schedule generation scheme using preprocessing and bloom filters

Parkes, AJ., Özcan, E. and Karapetyan, D., (2015). A Software Interface for Supporting the Application of Data Science to Optimisation

Karapetyan, D., Gagarin, A. and Gutin, G., (2015). Pattern backtracking algorithm for the workflow satisfiability problem with user-independent constraints

Crampton, J., Gutin, G. and Karapetyan, D., (2015). Valued Workflow Satisfiability Problem

Punnen, AP., Sripratak, P. and Karapetyan, D., (2013). Domination Analysis of Algorithms for Bipartite Boolean Quadratic Programs

Gutin, G. and Karapetyan, D., (2009). A Memetic Algorithm for the Multidimensional Assignment Problem

Gutin, G. and Karapetyan, D., (2009). Local Search Heuristics for the Multidimensional Assignment Problem

Gutin, G., Karapetyan, D. and Razgon, I., (2009). Fixed-Parameter Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs

Reports and Papers (5)

Gutin, G. and Karapetyan, D., Generalized Traveling Salesman Problem Reduction Algorithms

Karapetyan, D. and Punnen, AP., Heuristic algorithms for the bipartite unconstrained 0-1 quadratic programming problem

Karapetyan, D., Gutin, G. and Goldengorin, B., Empirical evaluation of construction heuristics for the multidimensional assignment problem

Karapetyan, D., Parkes, AJ. and Stützle, T., (2019). Algorithm Configuration: Learning Policies for the Quick Termination of Poor Performers

Karapetyan, D. and Goldengorin, B., (2018). Conditional Markov Chain Search for the Simple Plant Location Problem Improves Upper Bounds on Twelve Körkel–Ghosh Instances

Thesis dissertation (1)

Karapetyan, D., Design, Evaluation and Analysis of Combinatorial Optimization Heuristic Algorithms

Grants and funding

2019

Intra-document analysis that lead to profit and performance optimisation

Stephenson Harwood

Intra-document analysis that lead to profit and performance optimisation

Stephenson Harwood

Spark EV KTP application

Innovate UK (formerly Technology Strategy Board)

2018

Business and Local Government Data Research Centre (BLG DRC)

Economic and Social Research Council

IAA ECC Challenge Lab project - Data Sharing

Catalyst Project (HEFCE Funding)

2017

Improved in-pen access free pig weighing

University of Essex

Improved real time detection of wind-turbine failures - Dicam Technologies

University of Essex

2016

Machine Learning for EV Range Calculation

Cab4one Limited

Contact

dkarap@essex.ac.uk
+44 (0) 1206 874012

Location:

5B.527, Colchester Campus

Academic support hours:

Tuesday 11.00-12.00; Thursday 13.00-14.00. Room 5B.527