Report
Vehicle Sharing System Optimization: Scenario-based approach
| Τίτλος: | Vehicle Sharing System Optimization: Scenario-based approach |
|---|---|
| Συγγραφείς: | Waserhole, Ariel, Jost, Vincent, Brauner, Nadia |
| Συνεισφορές: | Recherche Opérationnelle pour les Systèmes de Production (G-SCOP_ROSP), Laboratoire des sciences pour la conception, l'optimisation et la production (G-SCOP), Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP)-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP)-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS) |
| Πηγή: | https://hal.science/hal-00727040 ; 2012. |
| Στοιχεία εκδότη: | CCSD |
| Έτος έκδοσης: | 2012 |
| Συλλογή: | Université Grenoble Alpes: HAL |
| Θεματικοί όροι: | Pricing, Vehicle Sharing Systems, Scenario-based approach, Queuing network, Complexity & approximation, Revenue Management, Graph vertex pricing, [INFO.INFO-RO]Computer Science [cs]/Operations Research [math.OC] |
| Περιγραφή: | One-way Vehicle Sharing Systems (VSS), such as Velib' Paris, have a poor performance without regulation. We want to improve the efficiency of VSS using design strategies or pricing as incentive. Stochastic models are intractable for the size of systems we want to tackle. We therefore discuss a scenario-based approach, i.e. off-line deterministic optimization problems on a given stochastic realization (scenario). This deterministic model could be used to provide heuristics and bound for on-line stochastic optimization. This approach raises a new constraint the First Come First Served constrained flow (FCFS flow). We derive three problems based on FCFS flows: a design problem, optimizing station capacities, and two operational problems setting static prices. We show that they are all APX-Hard. We study the upper bound given by the classical Max Flow problem and prove its poor worst case ratio. |
| Τύπος εγγράφου: | report |
| Γλώσσα: | English |
| Διαθεσιμότητα: | https://hal.science/hal-00727040 https://hal.science/hal-00727040v4/document https://hal.science/hal-00727040v4/file/Waserhole_VSS_ScenarioBasedApproach_May2013.pdf |
| Rights: | https://about.hal.science/hal-authorisation-v1/ ; info:eu-repo/semantics/OpenAccess |
| Αριθμός Καταχώρησης: | edsbas.E8AC5FCA |
| Βάση Δεδομένων: | BASE |
| Η περιγραφή δεν είναι διαθέσιμη |