Multi-period street scheduling and sweeping
by Carmine Cerrone; Benjamin Dussault; Bruce Golden; Edward Wasil
International Journal of Metaheuristics (IJMHEUR), Vol. 3, No. 1, 2014

Abstract: In the street-sweeper problem, we seek to sweep the sides of city streets in a way that minimises the distance travelled by the street sweepers. Typically, street sweepers are blocked by parked cars that prevent the curb from being swept. We consider a problem posed to us by Washington, DC where the parking constraints are multi-period decision variables. For example, suppose the city wishes to sweep its streets over two days with available parking on at least one side of each street on each day. Before the city considers how to sweep its streets, it must first decide which street sides to make available for parking on each day in a way that obeys the parking constraint on both days. We present a genetic algorithm that generates high-quality solutions and discuss managerial implications.

Online publication date: Sat, 25-Jan-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Metaheuristics (IJMHEUR):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com