About Me

I am an EngD student in my last year of research in the department of computer science at the University of York. My research interests include machine learning, heuristic methods and optimisation problems. My current research considers an optimised scheduling strategy to support a large-scale asset maintenance system.


Contact Me

If you're interested in my work please get in touch:


Email: yc1005@york.ac.uk

Some resource of period routing problems

Data files:

The first line contains the following information: problem_type m n t


The second line contains the following information for each customers: i x y d q f a list


Each visit combination is coded with the decimal equivalent of the corresponding binary bit string. For example, in a 5-day period, the code 10 which is equivalent to the bit string 01010 means that a customer is visited on days 2 and 4. (Days are numbered from left to right.)

The real-world gully pot maintenance map: Download

Here we provide 6 small maps generated based on real-world gully pot locations. They are all strongly structured as shown below. Then we artifically assign other factors such as visit frequency and service duration to each gully pot due to the confidential problem of the orginal data.

Best found results for the 6 instances: Download

More PVRP problems can be found from Periodic VRP Instances

University of York