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

Help for META-HEURISTICS Archives


META-HEURISTICS Archives

META-HEURISTICS Archives


META-HEURISTICS@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

META-HEURISTICS Home

META-HEURISTICS Home

META-HEURISTICS  August 2012

META-HEURISTICS August 2012

Options

Subscribe or Unsubscribe

Subscribe or Unsubscribe

Log In

Log In

Get Password

Get Password

Subject:

Funded research studentship in Combinatorial Optimisation for “Virtual Fleet” Logistics at the University of York, UK.

From:

Peter Cowling <[log in to unmask]>

Reply-To:

Peter Cowling <[log in to unmask]>

Date:

Wed, 1 Aug 2012 16:36:20 +0100

Content-Type:

text/plain

Parts/Attachments:

Parts/Attachments

text/plain (30 lines)

This is an excellent opportunity to put abstract algorithm design, combinatorial optimisation, heuristics and evolutionary algorithms, software engineering and systems modelling skills into practice on a critically important real-world problem of routing and logistics.

Applications are invited for a student to work on a research project in Combinatorial Optimisation for “Virtual Fleet” Logistics. The project is sponsored by Transfaction Ltd and supervised by Professor Peter Cowling at the University of York, one of the UK's elite Russell group of research-intensive universities set in a beautiful, historic city. The project is fully funded paying fees plus a tax-free stipend of £16,746 p.a. The student will study for an Engineering Doctorate in Large Scale Complex IT Systems at the University of York. The EngD is a full time, 4-year doctoral level research degree involving both taught and research components. 

The Research Project: 
Road transport logistics is essential to the UK and worldwide economy, while also being a major contributor to CO2 emissions. Logistics companies with large fleets of vehicles are able to combine pick up and delivery requests from a range of customers to minimise delivery costs. Medium-sized and small logistics companies (with a turnover below £20m) receive work in an uncoordinated manner and the result is inefficient running and unladen miles. Transfaction has a unique methodology, based on decades of industry experience, for consolidating and managing the work of medium-sized and small logistics companies to create a large “virtual fleet” so that everyone benefits, and CO2 emissions are reduced through reductions in unladen miles.

In this project we will investigate combinatorial optimisation approaches for planning and routing of this “virtual fleet”. The main phases are outlined below:
- Read background literature (particularly on routing problems such as the Travelling Salesman Problem (TSP), the Pick-up and Delivery Problems with Time Windows (PDPTW) and the Vehicle Routing Problem with Time Windows (VRPTW)). 
- Discuss with Transfaction (and potentially its clients) to understand the precise nature of the business problems.
- Create a simulation environment to generate problem instances
- Write software capable of reading in real-world data and placing it in the format of the simulation environment.
- Model the problem of maximising efficiency and minimising CO2 emissions as a problem of combinatorial optimisation.
- Design heuristics (e.g. using Local Search, Variable Neighbourhood Search, Simulated Annealing, Monte Carlo Tree Search and Hyperheuristics) capable of providing high-quality plans to modelled problems in acceptable CPU time.
- Investigate mixed-initiative approaches which combine human expertise and computer power in the planning process.
- Conduct wide-ranging experiments for real and simulated problems to investigate the effectiveness of the approaches developed.

There are significant opportunities for publication during this project and for commercialisation of the work.

Peter Cowling has over 20 years experience in developing models and optimisation heuristics/algorithms for complex, real-world planning, scheduling, routing and optimisation problems. Of particular relevance to this project is experience in mobile workforce planning (two recent projects with Trimble MRM Ltd.) and experience in asset management using unprecedentedly detailed data (two current projects with Gaist Ltd.). 

The sponsoring organisation Transfaction (www.transfaction.com) is a company which passionately believes it is possible to reduce the harmful impact of road transport and logistics on our environment.  The company believes that sustainability is synonymous with best business. Transfaction works with a range of leading companies to assist them in achieving their sustainability goals and to improve their profitability. 

Entry Requirements, Funding and Applications 
Applicants should be highly motivated and have a minimum of an upper second class honours degree in Computer Science or related discipline (e.g. Maths with Computing, Electrical Engineering, operational Research). Significant programming experience, practical knowledge of AI techniques, and modelling expertise are essential. Knowledge of decision support, OR and geospatial information technologies is helpful. Applicants who have specialised in artificial intelligence or operational research (e.g. at Masters level) are particularly welcome to apply.

The successful applicant will receive fees and a tax-free stipend from the 
Engineering and Physical Sciences Council (EPSRC) of £16,746 p.a.  Please note there are eligibility requirements – see:- http://www.epsrc.ac.uk/funding/students/pages/eligibility.aspx
For further information on the EngD and how to apply for this position please visit www.cs.york.ac.uk/engd/. Informal enquiries can be made to Mrs Dawn Forrester ([log in to unmask]).

Top of Message | Previous Page | Permalink

JiscMail Tools


RSS Feeds and Sharing


Advanced Options


Archives

May 2024
April 2024
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
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


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