Summary:
This paper proposes a mathematical optimization model to address the parking place demand and offer assignment problem. Starting from job assignment and timetabling problems, some new constraints and modifications are made in order to adapt them to this kind of problem. The parking place assignment model takes into account the preferences of the users to park in an already known parking place and the distance between demanded and offered parking places. It is stated with a daily scope and executed on an hourly basis modifying the assignments already made, depending on the confirmation of the clients. Using randomly generated parameters, several case studies are presented that show the strength of the current approach.
Keywords: Car parking places; assignment; scheduling; timetabling
Registration date: 01/04/2009
IIT-09-019A
Due to copyright restriction we cannot distribute this content on the web. However, using the next form you can contact the authors, which are allowed to redistribute a limited number of copies of it by email. Please, check your spam folder.
Legal notice | Cookies policy | Privacy policy
Calle de Santa Cruz de Marcenado, 26 - 28015 Madrid, Spain - Tel: (+34) 91 542 28 00
We use our own and third-party cookies to improve the functionality of our website and the quality of our service, by analyzing your browsing habits. I accept this site's cookies.
|
|