Michael Haythorpe

Dr. Michael Haythorpe

orcid

Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
22 May 2018 in International Journal of Production Research
Verified
Journal Article
Closed access
Mehdi FoumaniMehdi Foumani
Mehdi Foumani
AMAsghar Moeini
Asghar Moeini
MHMichael Haythorpe
Michael Haythorpe
PSProfessor Smith-Miles
Professor Smith-Miles
In this paper, we consider a robotic automated storage and retrieval system (AS/RS) where a Cartesian robot picks and palletises items onto a mixed pallet for any order. This robotic AS/RS not only retrieves orders in an optimal sequence, but also creates an optimal store ready pallet of any order. Adapting the Travelling Salesman Problem to warehousing, the decision to be made includes finding the optimal sequence of orders, and optimal sequence of items inside each order, that jointly minimise total travel times. In the first phase, as a control problem, we develop an avoidance strategy for the robot (or automatic stacker crane) movement sequence. This approach detects the collision occurrence causing unsafe handling of hazardous items and prevents the occurrence of it by a collision-free robot movement sequence. Due to the complexity of the problem, the second phase is attacked by a Cross-Entropy (CE) method. To evaluate the performance of the CE method, a computational analysis is performed over various test problems. The results obtained from the CE method are compared to those of the optimal solutions obtained using CPLEX. The results indicate high performance of the solution procedure to solve the sequencing problem of robotic AS/RSs.

28 September 2013 in Mathematical Programming Computation
Verified
Journal Article
Closed access
PDF file
PBPouya Baniasadi
Pouya Baniasadi
VEVladimir Ejov
Vladimir Ejov
JFJerzy A. Filar
Jerzy A. Filar
MHMichael Haythorpe
Michael Haythorpe
SRSerguei Rossomakhine
Serguei Rossomakhine

21 May 2009 in Annals of Operations Research
Verified
Journal Article
Closed access
PDF file
AEAli Eshragh
Ali Eshragh
JFJerzy A. Filar
Jerzy A. Filar
MHMichael Haythorpe
Michael Haythorpe

1 January 2019 in Journal of Graph Algorithms and Applications
Verified
Journal Article
Open access
KCKieran Clancy
Kieran Clancy
MHMichael Haythorpe
Michael Haythorpe
ANAlex Newcombe
Alex Newcombe
We present a new heuristic method for minimising crossings in a graph. The method is based upon repeatedly solving the so-called star insertion problem in the setting where the combinatorial embedding is fixed, and has several desirable characteristics for practical use. We introduce the method, discuss some aspects of algorithm design for our implementation, and provide some experimental results. The results indicate that our method compares well to existing methods, and also that it is suitable for dense instances.

3 April 2017 in Experimental Mathematics
Verified
Journal Article
Open access
MHMichael Haythorpe
Michael Haythorpe
A graph construction that produces a k-regular graph on n vertices for any choice of k ⩾ 3 and n = m(k + 1) for integer m ⩾ 2 is described. The number of Hamiltonians cycles in such graphs can be explicitly determined as a function of n and k, and empirical evidence is provided that suggests that this function gives a tight upper bound on the minimum number of Hamiltonian cycles in k-regular graphs on n vertices for k ⩾ 5 and n ⩾ k + 3. An additional graph construction for 4-regular graphs is described for which the number of Hamiltonian cycles is superior to the above function in the case when k = 4 and n ⩾ 11.

1 August 2009 in Mathematics of Operations Research
Verified
Journal Article
Closed access
VEVladimir Ejov
Vladimir Ejov
JFJerzy A. Filar
Jerzy A. Filar
MHMichael Haythorpe
Michael Haythorpe
GNGiang T. Nguyen
Giang T. Nguyen
We consider the famous Hamiltonian cycle problem (HCP) embedded in a Markov decision process (MDP). More specifically, we consider the HCP as an optimisation problem over the space of occupation measures induced by the MDP's stationary policies. In recent years, this approach to the HCP has led to a number of alternative formulations and algorithmic approaches. In this paper, we focus on a specific embedding, because of the work of Feinberg. We present a “branch-and-fix” type algorithm that solves the HCP. At each branch of the algorithm, only a linear program needs to be solved and the dimensions of the successive linear programs are shrinking rather than expanding. Because the nodes of the branch-and-fix tree correspond to specially structured 1-randomised policies, we characterise the latter. This characterisation indicates that the total number of such policies is significantly smaller than the subset of all 1-randomised policies. Finally, we present some numerical results.