Dr. Daniel Karapetyan
Main Research Areas
- Combinatorial Optimization;
- Local Search heuristics;
- Metaheuristic approaches;
- Mixed Integer Programming;
- Efficient implementations;
- Theoretical and empirical evalutation of algorithms;
- Computational experiments design;
- Application of Operational Research;
|
|
Current Position
Postdoctoral Fellow at Simon Fraser University, Department of Mathematics.
Supervisor: Abraham Punnen.
PhD
Design, Evaluation and
Analysis of Combinatorial Optimization Heuristic Algorithms.
Supervisor: Gregory
Gutin.
Examiners: Natalio Krasnogor
and Tomasz Radzik.
Selected Publications
- Daniel Karapetyan and Abraham Punnen.
Reduced Mixed Integer Formulation of the Ferry Routing And Scheduling Problem. Submitted.
- Daniel Karapetyan and Gregory Gutin.
Effcient Local Search Algorithms for Known and New Neighborhoods for the Generalized Traveling Salesman Problem.
European Journal of Operational Research 219, pages 234-251, 2012.
- Daniel Karapetyan and Gregory Gutin.
A New Approach to Population Sizing for Memetic Algorithms: A Case Study for the Multidimensional Assignment Problem.
Evolutionary Computation 19(3), pages 345-371, 2011.
- Daniel Karapetyan and Gregory Gutin.
Lin-Kernighan Heuristic
Adaptation for the Generalized Traveling Salesman Problem.
European Journal
of Operational Research 208(3), pages 221-232,
2011.
- Daniel Karapetyan and Gregory Gutin.
Local Search Heuristics For The
Multidimensional Assignment Problem.
Journal of
Heuristics 17(3), pages 201-249.
Springer 2011.
Download extra
tables.
- Gregory Gutin and Daniel Karapetyan. A Memetic Algorithm for the
Generalized Traveling Salesman Problem.
Natural Computing 9(1), pages 47-60,
Springer 2010.
Download full source
codes (80 Kb).
Download instances (20
Mb).
- Gregory Gutin, Daniel Karapetyan and Igor Razgon.
FPT Algorithms in Analysis of
Heuristics for Extracting Networks in Linear Programs.
In proc. of the 4th International Workshop on Parameterized and Exact
Computation, IWPEC 2009,
Lecture Notes Comp. Sci. 5917, pages 222-233,
Springer 2009.
- Gregory Gutin and Daniel Karapetyan. A Memetic Algorithm for the
Multidimensional Assignment Problem.
In proc. of Stochastic Local Search '09 in Brussels,
Lecture Notes Comp. Sci. 5752, pages 125-129,
Springer
2009.
- Gregory Gutin and Daniel Karapetyan.
Gene
ralized Traveling Salesman Problem Reduction Algorithms.
Algorithmic Operations Research 4, pages 144-154, 2009.
- Gregory Gutin and Daniel Karapetyan. A
Selection of Useful Theoretical Tools for the Design and Analysis of
Optimization Heuristics.
Memetic Computing 1(1), pages 25-34,
Springer
2009.
- Gregory Gutin and Daniel Karapetyan.
Local Search Heuristics For The Multidimensional Assignment Problem.
In proc. of Graph Theory 2008 in Haifa,
Lecture Notes Comp. Sci. 5420, pages 100-115,
Springer
2009.
- Daniel Karapetyan, Gregory Gutin and Boris Goldengorin. Empirical evaluation of construction
heuristics for the multidimensional assignment problem. In Proc. London
Algorithmics 2008: Theory and Practice, eds: J. Chan, J. W. Daykin, M.
S. Rahman. Texts in Algorithmics 11, pages 107-122, College
Publications, 2009.
- Gregory Gutin and Daniel Karapetyan. Greedy Like Algorithms for the Traveling Salesman and
Multidimensional Assignment Problems. Chapter in Advances in Greedy
Algorithms, pages 291-304, IN-TECH 2008.
- Gregory Gutin, Daniel Karapetyan, and Natalio Krasnogor.
A
Memetic Algorithm for the Generalized Asymmetric Traveling Salesman
Problem.
In Proc. NICSO 2007, Studies in Computational Intelligence 129,
pages 199-210,
Springer
2008.
Conferences
- CORS 2012,
11-13 June 2012, Niagara Falls, Ontario, Canada.
An Algorithm for the Satellite Downlink Scheduling Problem.
- SLS'09,
3-5 September 2009, Brussels, Belgium.
A Memetic Algorithm for the Multidimensional Assignment Problem.
- 20th PCC, 22-24 June
2009, London, UK. A Memetic Algorithm for the Multidimensional Assignment
Problem.
- ECCO
XXII, 15-17 May 2009, Jerusalem, Israel. Local Search Heuristics For The
Multidimensional Assignment Problem.
Contacts: 