Abstract

This paper considers a cyclic scheduling problem, which especially is applicable in the area of public transport. The problem is the so-called Irregular Polygon Scheduling Problem with the objective to maximize the distance between the nearest vertices of two different polygons. We give a mixed integer LP-formulation of this NP-hard problem, derive some bounds and present a hybrid meta-heuristic algorithm for solving the problem. The main idea is to combine a Tabu Search with a Genetic Algorithm component. Computational experience, based on comparative results obtained from CPLEX, shows the efficiency of the hybridization approach.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.