The parking allocation problem for connected vehicles
| Autor: | Mladenovic, Marko, Hanafi, Said, Delot, Thierry, Laporte, Gilbert, Wilbaut, Christophe |
|---|---|
| Přispěvatelé: | Laboratoire d'Automatique, de Mécanique et d'Informatique industrielles et Humaines - UMR 8201 (LAMIH), Centre National de la Recherche Scientifique (CNRS)-Université Polytechnique Hauts-de-France (UPHF)-INSA Institut National des Sciences Appliquées Hauts-de-France (INSA Hauts-De-France), HEC Montréal (HEC Montréal), INSA Institut National des Sciences Appliquées Hauts-de-France (INSA Hauts-De-France)-Centre National de la Recherche Scientifique (CNRS)-Université de Valenciennes et du Hainaut-Cambrésis (UVHC), Laboratoire CIRRELT Université Laval Quebec (CIRRELT), Université Laval [Québec] (ULaval) |
| Jazyk: | angličtina |
| Rok vydání: | 2020 |
| Předmět: |
Mathematical optimization
Control and Optimization Computer Networks and Communications Computer science Heuristic (computer science) media_common.quotation_subject 0211 other engineering and technologies 02 engineering and technology Management Science and Operations Research Artificial Intelligence 11. Sustainability 0202 electrical engineering electronic engineering information engineering Quality (business) [INFO]Computer Science [cs] Parking allocation Generalized assignment problem media_common 021103 operations research business.industry 0–1 Programming Assisted GPS Programming paradigm Parking lot Global Positioning System 020201 artificial intelligence & image processing business Variable neighborhood search Software Information Systems |
| Zdroj: | Journal of Heuristics Journal of Heuristics, Springer Verlag, 2020, 26 (3), pp.377-399. ⟨10.1007/s10732-017-9364-7⟩ Mladenović, M, Delot, T, Laporte, G & Wilbaut, C 2020, ' The parking allocation problem for connected vehicles ', Journal of Heuristics, vol. 26, no. 3, pp. 377-399 . https://doi.org/10.1007/s10732-017-9364-7 BALCOR 2018 – XIII Balkan Conference on Operational Research BALCOR 2018 – XIII Balkan Conference on Operational Research, May 2018, Belgrade, Serbia. pp.377-399, ⟨10.1007/s10732-017-9364-7⟩ |
| ISSN: | 1381-1231 1572-9397 |
| Popis: | International audience; In this paper, we propose a parking allocation model that takes into account the basic constraints and objectives of a problem where parking lots are assigned to vehicles. We assume vehicles are connected and can exchange information with a central intelligence. Vehicle arrival times can be provided by a GPS device, and the estimated number of available parking slots, at each future time moment and for each parking lot is used as an input. Our initial model is static and may be viewed as a variant of the generalized assignment problem. However, the model can be rerun, and the algorithm can handle dynamic changes by frequently solving the static model, each time producing an updated solution. In practice this approach is feasible only if reliable quality solutions of the static model are obtained within a few seconds since the GPS can continuously provide new input regarding the vehicle’s positioning and its destinations. We propose a 0–1 programming model to compute exact solutions, together with a variable neighborhood search-based heuristic to obtain approximate solutions for larger instances. Computational results on randomly generated instances are provided to evaluate the performance of the proposed approaches. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink