JiscMail Logo
Email discussion lists for the UK Education and Research communities

Help for UTSG Archives


UTSG Archives

UTSG Archives


UTSG@JISCMAIL.AC.UK


View:

Message:

[

First

|

Previous

|

Next

|

Last

]

By Topic:

[

First

|

Previous

|

Next

|

Last

]

By Author:

[

First

|

Previous

|

Next

|

Last

]

Font:

Proportional Font

LISTSERV Archives

LISTSERV Archives

UTSG Home

UTSG Home

UTSG  October 2014

UTSG October 2014

Options

Subscribe or Unsubscribe

Subscribe or Unsubscribe

Log In

Log In

Get Password

Get Password

Subject:

Research Fellow in Train Scheduling (Hybridised Optimisation)

From:

Raymond Kwan <[log in to unmask]>

Reply-To:

Raymond Kwan <[log in to unmask]>

Date:

Thu, 23 Oct 2014 16:11:58 +0100

Content-Type:

text/plain

Parts/Attachments:

Parts/Attachments

text/plain (20 lines)

(Apologies for multiple postings)

Applications are invited for a full-time fixed-term (3 years) Research Fellow in Train Scheduling (Hybridised Optimisation) under the EPSRC grant EP/M007243/1 in School of Computing, University of Leeds, UK.
University Grade 7 (£31,342 - £37,394 p.a.)

The aim of the project is to derive efficient practical methods for producing train unit schedules that are operable in real life practice. Efficient passenger rail, critical to the UK economy, requires optimised operations planning. Well before a timetable goes live, train unit scheduling is part of resource planning as to how the daily train services would be covered. A train unit is assigned a sequence of timetabled journeys ensuring all the connections are feasible, both in terms of time and physical constraints. The problem is like an enormous jigsaw puzzle balancing between minimising the train unit resources and satisfying passenger demands and operational constraints.

This project builds on successful research collaboration with First ScotRail and Tracsis Plc. The planned research is grounded on an exact mathematical approach. While the mathematical approach has superior optimisation power, computational time escalates exponentially to becoming impractical beyond small to medium sized problem instances. You will investigate a new method that could make a step change. Recognising that there is a practical limit on how large a problem instance the mathematical optimiser can solve 'comfortably' a heuristics is used to compress and transform the problem instance into a much smaller one for the mathematical solver to be applied. Over a number of cycles, more and more is learnt about the key data points to be retained in the compressed instance whereby the hybridised algorithm would converge to the optimal or very near optimal solution.

The above work will be interacting with that of another Research Fellow employed on this project, who will mainly investigate improving especially in terms of computational performance the core mathematical solver.  Furthermore, both Research Fellows will be engaged in activities with our industrial collaborators to ensure that the most realistic model is built, the solution schedules produced are fully operable and testing and evaluation are as thorough as possible. The activities include short placements, regular contacts, on-site testing/evaluation and three seminar workshops that other train companies will also be invited to.

The successful candidate will have a PhD or near completion of a PhD in a relevant subject (including, but not limited to, scheduling, combinatorial optimisation, meta-heuristics search and computer science); a track record in the design and implementation of meta-heuristics search algorithms for practical problem solving; programming skills for algorithmic and multi-threaded software development (C++, C).

Application and further details at:
https://jobs.leeds.ac.uk/vacancy.aspx?ref=ENGCP1003

Closing date: Thursday 20 November 2014

Informal enquires to Dr Raymond Kwan, Senior Lecturer, tel +44 (0)113 343 5760, email [log in to unmask]<mailto:[log in to unmask]>

Top of Message | Previous Page | Permalink

JiscMail Tools


RSS Feeds and Sharing


Advanced Options


Archives

March 2024
February 2024
January 2024
December 2023
November 2023
October 2023
September 2023
August 2023
July 2023
June 2023
May 2023
April 2023
March 2023
February 2023
January 2023
December 2022
November 2022
October 2022
September 2022
August 2022
July 2022
June 2022
May 2022
April 2022
March 2022
February 2022
January 2022
December 2021
November 2021
October 2021
September 2021
August 2021
July 2021
June 2021
May 2021
April 2021
March 2021
February 2021
January 2021
December 2020
November 2020
October 2020
September 2020
August 2020
July 2020
June 2020
May 2020
April 2020
March 2020
February 2020
January 2020
December 2019
November 2019
October 2019
September 2019
August 2019
July 2019
June 2019
May 2019
April 2019
March 2019
February 2019
January 2019
December 2018
November 2018
October 2018
September 2018
August 2018
July 2018
June 2018
May 2018
April 2018
March 2018
February 2018
January 2018
December 2017
November 2017
October 2017
September 2017
August 2017
July 2017
June 2017
May 2017
April 2017
March 2017
February 2017
January 2017
December 2016
November 2016
October 2016
September 2016
August 2016
July 2016
June 2016
May 2016
April 2016
March 2016
February 2016
January 2016
December 2015
November 2015
October 2015
September 2015
August 2015
July 2015
June 2015
May 2015
April 2015
March 2015
February 2015
January 2015
December 2014
November 2014
October 2014
September 2014
August 2014
July 2014
June 2014
May 2014
April 2014
March 2014
February 2014
January 2014
December 2013
November 2013
October 2013
September 2013
August 2013
July 2013
June 2013
May 2013
April 2013
March 2013
February 2013
January 2013
December 2012
November 2012
October 2012
September 2012
August 2012
July 2012
June 2012
May 2012
April 2012
March 2012
February 2012
January 2012
December 2011
November 2011
October 2011
September 2011
August 2011
July 2011
June 2011
May 2011
April 2011
March 2011
February 2011
January 2011
December 2010
November 2010
October 2010
September 2010
August 2010
July 2010
June 2010
May 2010
April 2010
March 2010
February 2010
January 2010
December 2009
November 2009
October 2009
September 2009
August 2009
July 2009
June 2009
May 2009
April 2009
March 2009
February 2009
January 2009
December 2008
November 2008
October 2008
September 2008
August 2008
July 2008
June 2008
May 2008
April 2008
March 2008
February 2008
January 2008
December 2007
November 2007
October 2007
September 2007
August 2007
July 2007
June 2007
May 2007
April 2007
March 2007
February 2007
January 2007
2006
2005
2004
2003
2002
2001
2000
1999
1998


JiscMail is a Jisc service.

View our service policies at https://www.jiscmail.ac.uk/policyandsecurity/ and Jisc's privacy policy at https://www.jisc.ac.uk/website/privacy-notice

For help and support help@jisc.ac.uk

Secured by F-Secure Anti-Virus CataList Email List Search Powered by the LISTSERV Email List Manager