Professor of Operations Research in the School of Information Technology and Electrical Engineering
Prof. Mohan Krishnamoorthy is Professor of Operations Research at ITEE, UQ and Pro Vice-Chancellor (Research Partnerships) at UQ. Prior to joining UQ Mohan Krishnamoorthy was Pro Vice-Chancellor (Industry Partnerships) at Monash University and was Professor of Operations Research in the School of Mechanical and Aerospace Engineering, Monash Uni. Prior to that, he was CEO of the IITB-Monash Research Academy, a joint-venture research academy between Monash University and Indian Institute of Technology, Bombay. Before that, Mohan Krishnamoorthy was the Associate Dean Research, Faculty of Engineering (Monash) and before that, from 1992, he was at CSIRO. He obtained his PhD from Imperial College, London and taught at the University of Kent, Canterbury before moving to Australia in 1992.
Mohan’s research interests lie in the field of integer/combinatorial optimization. He works on (and has published several papers in) areas and problems such as hub location, rostering, personnel task scheduling, machine scheduling, transportation and port logistics.
Qualifications
Mohan’s Current research interests
Journal Article: Multi-period reverse logistics network design for used refrigerators
John, Sajan T, Sridharan, R., Ram Kumar, P. N. and Krishnamoorthy, M. (2017) Multi-period reverse logistics network design for used refrigerators. Applied Mathematical Modelling, 54 311-331. doi:10.1016/j.apm.2017.09.053
Conference Publication: A Linear Programming Based Iterative Heuristic for the Recreational Vehicle Scheduling Problem
Kulkarni, S., Ernst, A. T., Ranade, A. and Krishnamoorthy, M. (2016). A Linear Programming Based Iterative Heuristic for the Recreational Vehicle Scheduling Problem. In: 2016 IEEE International Conference On Industrial Engineering and Engineering Management (IEEM). IEEE International Conference on Industrial Engineering and Engineering Management (IEEM), Bali, Indonesia, (784-788). 4-7 December 2016. doi:10.1109/IEEM.2016.7797983
Journal Article: Exact approaches for static data segment allocation problem in an information network
Sen, Goutam, Krishnamoorthy, Mohan, Rangaraj, Narayan and Narayanan, Vishnu (2015) Exact approaches for static data segment allocation problem in an information network. Computers & Operations Research, 62 282-295. doi:10.1016/j.cor.2014.05.023
data location problems in communications network design
The problem is one of locating VOD data in large networks. How do we do this efficiently? What are the difficulties in locating data efficiently to ensure minimal latency and low cost.
decomposition based matheuristics for large combinatorial optimisation problems
The problem is one of combining very large neighbourhood search heuristics with decomposition methods and lazy constraints to develop efficient algorithms to solve very large combinatorial optimisation problems.
Multi-period reverse logistics network design for used refrigerators
John, Sajan T, Sridharan, R., Ram Kumar, P. N. and Krishnamoorthy, M. (2017) Multi-period reverse logistics network design for used refrigerators. Applied Mathematical Modelling, 54 311-331. doi:10.1016/j.apm.2017.09.053
Exact approaches for static data segment allocation problem in an information network
Sen, Goutam, Krishnamoorthy, Mohan, Rangaraj, Narayan and Narayanan, Vishnu (2015) Exact approaches for static data segment allocation problem in an information network. Computers & Operations Research, 62 282-295. doi:10.1016/j.cor.2014.05.023
Thomas, Anu, Venkateswaran, Jayendran, Singh, Gaurav and Krishnamoorthy, Mohan (2014) A resource constrained scheduling problem with multiple independent producers and a single linking constraint: a coal supply chain example. European Journal of Operational Research, 236 3: 946-956. doi:10.1016/j.ejor.2013.10.006
A Stackelberg hub arc location model for a competitive environment
Sasaki, Mihiro, Campbell, James F., Krishnamoorthy, Mohan and Ernst, Andreas T. (2014) A Stackelberg hub arc location model for a competitive environment. Computers & Operations Research, 47 27-41. doi:10.1016/j.cor.2014.01.009
Dayama, Niraj Ramesh, Krishnamoorthy, Mohan, Ernst, Andreas, Narayanan, Vishnu and Rangaraj, Narayan (2014) Approaches for solving the container stacking problem with route distance minimization and stack rearrangement considerations. Computers & Operations Research, 52 PART A: 68-83. doi:10.1016/j.cor.2014.06.018
Distributed optimisation method for multi-resource constrained scheduling in coal supply chains
Thomas, Anu, Singh, Gaurav, Krishnamoorthy, Mohan and Venkateswaran, Jayendran (2012) Distributed optimisation method for multi-resource constrained scheduling in coal supply chains. International Journal of Production Research, 51 9: 2740-2759. doi:10.1080/00207543.2012.737955
Dynamic scheduling of recreational rental vehicles with revenue management extensions
Ernst, A. T., Horn, M., Kilby, P. and Krishnamoorthy, M. (2010) Dynamic scheduling of recreational rental vehicles with revenue management extensions. Journal of the Operational Research Society, 61 7: 1133-1143. doi:10.1057/jors.2009.78
A 2-phase algorithm for solving the single allocation p-hub center problem
Meyer, T., Ernst, A. T. and Krishnamoorthy, M. (2009) A 2-phase algorithm for solving the single allocation p-hub center problem. Computers & Operations Research, 36 12: 3143-3151. doi:10.1016/j.cor.2008.07.011
Uncapacitated single and multiple allocation p-hub center problems
Ernst, Andreas T., Hamacher, Horst, Jiang, Houyuan, Krishnamoorthy, Mohan and Woeginger, Gerhard (2009) Uncapacitated single and multiple allocation p-hub center problems. Computers & Operations Research, 36 7: 2230-2241. doi:10.1016/j.cor.2008.08.021
Static and dynamic order scheduling for recreational rental vehicles at tourism holdings limited
Ernst, Andreas T., Horn, Mark, Krishnarnoorthy, Mohan, Kilby, Philip, Degenhardt, Phil and Moran, Michael (2007) Static and dynamic order scheduling for recreational rental vehicles at tourism holdings limited. Interfaces, 37 4: 334-341. doi:10.1287/inte.1060.0265
Exact solutions to task allocation problems
Ernst, Andreas, Jiang, Houyuan and Krishnamoorthy, Mohan (2006) Exact solutions to task allocation problems. Management Science, 52 10: 1634-1646. doi:10.1287/mnsc.1060.0578
Hub Arc location problems: Part II - Formulations and optimal algorithms
Campbell, JF, Ernst, AT and Krishnamoorthy, M (2005) Hub Arc location problems: Part II - Formulations and optimal algorithms. Management Science, 51 10: 1556-1571. doi:10.1287/mnsc.1050.0407
Hub arc location problems: Part I - Introduction and results
Campbell, JF, Ernst, AT and Krishnamoorthy, M (2005) Hub arc location problems: Part I - Introduction and results. Management Science, 51 10: 1540-1555. doi:10.1287/mnsc.1050.0406
An annotated bibliography of personnel scheduling and rostering
Ernst, AT, Jiang, H, Krishnamoorthy, M, Owens, B and Sier, D (2004) An annotated bibliography of personnel scheduling and rostering. Annals of Operations Research, 127 1-4: 21-144. doi:10.1023/B:ANOR.0000019087.46656.e2
Staff sheduling and rostering: Theory and applications, part I - Preface
Jiang, HY, Krishnamoorthy, M and Sier, D (2004) Staff sheduling and rostering: Theory and applications, part I - Preface. Annals of Operations Research, 127 1-4: 17-20. doi:10.1023/B:ANOR.0000019145.86799.1f
Displacement problem and dynamically scheduling aircraft landings
Beasley, JE, Krishnamoorthy, M, Sharaiha, YM and Abramson, D (2004) Displacement problem and dynamically scheduling aircraft landings. Journal of the Operational Research Society, 55 1: 54-64. doi:10.1057/palgrave.jors.2601650
Solving hub arc location problems on a cluster of workstations
Campbell, JF, Stiehr, G, Ernst, AT and Krishnamoorthy, M (2003) Solving hub arc location problems on a cluster of workstations. Parallel Computing, 29 5 SPEC.: 555-574. doi:10.1016/S0167-8191(03)00042-5
Comparison of algorithms for the degree constrained minimum spanning tree
Krishnamoorthy, M, Ernst, AT and Sharaiha, YM (2001) Comparison of algorithms for the degree constrained minimum spanning tree. Journal of Heuristics, 7 6: 587-611. doi:10.1023/A:1011977126230
Boland, N, Krishnamoorthy, M and Stuckey, P (2001) Untitled - Preface. Annals of Operations Research, 108 1-4: 13-17.
An Integrated Optimization Model for Train Crew Management
Ernst, AT, Jiang, H, Krishnamoorthy, M, Nott, H and Sier, D (2001) An Integrated Optimization Model for Train Crew Management. Annals of Operations Research, 108 1-4: 211-224. doi:10.1023/A:1016019314196
Scheduling aircraft landings - The static case
Beasley, JE, Krishnamoorthy, M, Sharaiha, YM and Abramson, D (2000) Scheduling aircraft landings - The static case. Transportation Science, 34 2: 180-197. doi:10.1287/trsc.34.2.180.12302
Capacitated multiple allocation hub location problem: Formulations and algorithms
Ebery, J, Krishnamoorthy, M, Ernst, A and Boland, N (2000) Capacitated multiple allocation hub location problem: Formulations and algorithms. European Journal of Operational Research, 120 3: 614-631. doi:10.1016/S0377-2217(98)00395-6
Heuristic and exact algorithms for scheduling aircraft landings
Ernst, AT, Krishnamoorthy, M and Storer, RH (1999) Heuristic and exact algorithms for scheduling aircraft landings. Networks, 34 3: 229-241. doi:10.1002/(SICI)1097-0037(199910)34:3<229::AID-NET8>3.0.CO;2-W
Simulated annealing cooling schedules for the school timetabling problem
Abramson, D, Krishnamoorthy, M and Dang, H (1999) Simulated annealing cooling schedules for the school timetabling problem. Asia-Pacific Journal of Operational Research, 16 1: 1-22.
Solution algorithms for the capacitated single allocation hub location problem
Ernst, AT and Krishnamoorthy, M (1999) Solution algorithms for the capacitated single allocation hub location problem. Annals of Operations Research, 86 141-159. doi:10.1023/A:1018994432663
Exact and heuristic algorithms for the uncapacitated multiple allocation p-hub median problem
Ernst, AT and Krishnamoorthy, M (1998) Exact and heuristic algorithms for the uncapacitated multiple allocation p-hub median problem. European Journal of Operational Research, 104 1: 100-112. doi:10.1016/S0377-2217(96)00340-2
Neural techniques for combinatorial optimization with applications
Smith, K, Palaniswami, M and Krishnamoorthy, M (1998) Neural techniques for combinatorial optimization with applications. Ieee Transactions On Neural Networks, 9 6: 1301-1318. doi:10.1109/72.728380
Staff rostering at a large international airport
Dowling, D, Krishnamoorthy, M, Mackenzie, H and Sier, D (1997) Staff rostering at a large international airport. Annals of Operations Research, 72 125-147. doi:10.1023/A:1018992120116
Traditional heuristic versus Hopfield neural network approaches to a car sequencing problem
Smith, K, Palaniswami, M and Krishnamoorthy, M (1996) Traditional heuristic versus Hopfield neural network approaches to a car sequencing problem. European Journal of Operational Research, 93 2: 300-316. doi:10.1016/0377-2217(96)00040-9
Abramson, D, Dang, H and Krishnamoorthy, M (1996) A comparison of two methods for solving 0-1 integer programs using a general purpose simulated annealing algorithm. Annals of Operations Research, 63 129-150. doi:10.1007/BF02601642
A hybrid neural approach to combinatorial optimization
Smith, K, Palaniswami, M and Krishnamoorthy, M (1996) A hybrid neural approach to combinatorial optimization. Computers & Operations Research, 23 6 SPEC. ISS.: 597-610. doi:10.1016/0305-0548(95)00064-X
A Linear Programming Based Iterative Heuristic for the Recreational Vehicle Scheduling Problem
Kulkarni, S., Ernst, A. T., Ranade, A. and Krishnamoorthy, M. (2016). A Linear Programming Based Iterative Heuristic for the Recreational Vehicle Scheduling Problem. In: 2016 IEEE International Conference On Industrial Engineering and Engineering Management (IEEM). IEEE International Conference on Industrial Engineering and Engineering Management (IEEM), Bali, Indonesia, (784-788). 4-7 December 2016. doi:10.1109/IEEM.2016.7797983
A Triplet-Based exact method for the shift minimisation personnel task scheduling problem
Baatar, Davaatseren, Krishnamoorthy, Mohan and Ernst, Andreas T. (2015). A Triplet-Based exact method for the shift minimisation personnel task scheduling problem. In: Nikhil Bansal and Irene Finocchi, 23rd Annual European Symposium on Algorithms (ESA) as part of ALGO Conference, Patras, Greece, (59-70). 14-16 September 2015. doi:10.1007/978-3-662-48350-3_6
Multi-layer optimization for service provider transport networks
Bhamare, Deval, Gumaste, Ashwin, Srivastava, Prachi and Krishnamoorthy, Mohan (2013). Multi-layer optimization for service provider transport networks. In: Proceedings of the 2013 38Th Annual Ieee Conference On Local Computer Networks (Lcn 2013). 38th Annual IEEE Conference on Local Computer Networks (LCN), Sydney, NSW, Australia, (695-698). 21 - 24 October 2013. doi:10.1109/LCN.2013.6761313
Preprocessing and cutting for multiple allocation hub location problems
Boland, N, Krishnamoorthy, M, Ernst, AT and Ebery, J (2004). Preprocessing and cutting for multiple allocation hub location problems. In: , , (638-653). . doi:10.1016/S0377-2217(03)00072-9
Staff scheduling and rostering: A review of applications, methods and models
Ernst, AT, Jiang, H, Krishnamoorthy, M and Sier, D (2004). Staff scheduling and rostering: A review of applications, methods and models. In: , , (3-27). . doi:10.1016/S0377-2217(03)00095-X
Note for students: The possible research projects listed on this page may not be comprehensive or up to date. Always feel free to contact the staff for more information, and also with your own research ideas.
data location problems in communications network design
The problem is one of locating VOD data in large networks. How do we do this efficiently? What are the difficulties in locating data efficiently to ensure minimal latency and low cost.
decomposition based matheuristics for large combinatorial optimisation problems
The problem is one of combining very large neighbourhood search heuristics with decomposition methods and lazy constraints to develop efficient algorithms to solve very large combinatorial optimisation problems.