Abstract
Idling, or running the engine when the vehicle is not moving, accounts for 13%-23% of vehicle driving time and costs billions of gallons of fuel each year. In this paper, we consider the problem of idling reduction under the uncertainty of vehicle stop time. We abstract it as a classic ski rental problem, and propose a constrained version with two statistics μB-and qB+, the expectation of short stops' lengths and the probability of long stops. We develop an online algorithm that combines the best of the well-known deterministic and randomized schemes to minimize the worst case competitive ratio. We demonstrate the robustness of the algorithm in terms of both worst case guarantee and average case performance using simulation and real-world driving data. Copyright 2014 ACM.
| Original language | English |
|---|---|
| Title of host publication | dac 51 - DESIGN AUTOMATION CONFERENCE, Conference Proceedings |
| Publisher | Association for Computing Machinery |
| ISBN (Print) | 9781479930173 |
| DOIs | |
| Publication status | Published - Jun 2014 |
| Externally published | Yes |
| Event | 51st Design Automation Conference (DAC 2014) - Moscone Center, San Francisco, United States Duration: 1 Jun 2014 → 5 Jun 2014 https://www.dac.com/content/51st-dac-0 |
Publication series
| Name | Proceedings - Design Automation Conference |
|---|---|
| ISSN (Print) | 0738-100X |
Conference
| Conference | 51st Design Automation Conference (DAC 2014) |
|---|---|
| Abbreviated title | DAC'14 |
| Place | United States |
| City | San Francisco |
| Period | 1/06/14 → 5/06/14 |
| Internet address |
Fingerprint
Dive into the research topics of 'A Cost Efficient Online Algorithm for Automotive Idling Reduction'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver