메뉴 건너뛰기




Volumn , Issue , 2011, Pages 1-6

Dynamic resource allocation in urban settings: A "smart parking" approach

Author keywords

MILP; Resource Allocation; Smart Parking

Indexed keywords

DECISION POINTS; DYNAMIC RESOURCE ALLOCATIONS; EVENT DRIVEN MECHANISMS; FAIRNESS CONSTRAINTS; FUNCTION VALUES; MILP; MIXED INTEGER LINEAR PROGRAM; OBJECTIVE FUNCTIONS; ON CURRENTS; OPTIMAL ALLOCATION; PARKING SPACES; RESOURCE RESERVATIONS; RESOURCE UTILIZATIONS; SIMULATION RESULT; SMART PARKING; STATE INFORMATION; URBAN ENVIRONMENTS; URBAN SETTINGS;

EID: 80755171483     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CACSD.2011.6044566     Document Type: Conference Paper
Times cited : (41)

References (18)
  • 1
    • 39449086730 scopus 로고    scopus 로고
    • The modern call center: A multi-disciplinary perspective on operations management research
    • Z. Aksin, M. Armony, and V. Mehrotra. The modern call center: A multi-disciplinary perspective on operations management research. Production and Operational Management, 16(5):665-688, 2007.
    • (2007) Production and Operational Management , vol.16 , Issue.5 , pp. 665-688
    • Aksin, Z.1    Armony, M.2    Mehrotra, V.3
  • 2
    • 0029638653 scopus 로고
    • The complexity and approximability of finding maximum feasible subsystems of linear relations
    • E. Amaldi and V. Kann. The complexity and approximability of finding maximum feasible subsystems of linear relations. Theore. Comput. Sci., (147):181-210, 1995.
    • (1995) Theore. Comput. Sci. , Issue.147 , pp. 181-210
    • Amaldi, E.1    Kann, V.2
  • 3
    • 0004493166 scopus 로고    scopus 로고
    • On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems
    • E. Amaldi and V. Kann. On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems. Theore. Comput. Sci., 209:237-260, 1998.
    • (1998) Theore. Comput. Sci. , vol.209 , pp. 237-260
    • Amaldi, E.1    Kann, V.2
  • 5
    • 14544279564 scopus 로고    scopus 로고
    • Scheduling a multi-class queue with many exponential servers: Asymptotic optimality in heavy-traffic
    • R. Atar, A. Mandelbaum, and M. Reiman. Scheduling a multi-class queue with many exponential servers: asymptotic optimality in heavy-traffic. Annals of Applied Probability, (15):2606-2650, 2004.
    • (2004) Annals of Applied Probability , Issue.15 , pp. 2606-2650
    • Atar, R.1    Mandelbaum, A.2    Reiman, M.3
  • 7
    • 80755186111 scopus 로고    scopus 로고
    • Service-level differentiation in many server service systems: A solution based on fixed-queue-ratio routing
    • I. Gurvich and W. Whitt. Service-level differentiation in many server service systems: A solution based on fixed-queue-ratio routing. Operations Research, 2007.
    • (2007) Operations Research
    • Gurvich, I.1    Whitt, W.2
  • 8
    • 0019560371 scopus 로고
    • Heavy-traffic limits for queues with many exponential servers
    • S. Halfin and W. Whitt. Heavy-traffic limits for queues with many exponential servers. Operations Research, (29):567-588, 1981.
    • (1981) Operations Research , Issue.29 , pp. 567-588
    • Halfin, S.1    Whitt, W.2
  • 9
    • 19744380935 scopus 로고    scopus 로고
    • Dynamic scheduling of a multi-class queue in the halfin-whitt heavy traffic regime
    • J. Harrison and A. Zeevi. Dynamic scheduling of a multi-class queue in the Halfin-Whitt heavy traffic regime. Operations Research, (52):243-257, 2004.
    • (2004) Operations Research , Issue.52 , pp. 243-257
    • Harrison, J.1    Zeevi, A.2
  • 14
    • 75449120489 scopus 로고    scopus 로고
    • Transit-based smart parking: An evaluation of the san francisco bay area field test
    • C. J. Rodier and S. A. Shaheen. Transit-based smart parking: An evaluation of the San Francisco bay area field test. Transportation Research Part C, (18):225-233, 2010.
    • (2010) Transportation Research Part C , Issue.18 , pp. 225-233
    • Rodier, C.J.1    Shaheen, S.A.2
  • 15
    • 38049110306 scopus 로고
    • A note on resolving infeasibility in linear programs by constraint relaxation
    • J. Sankaran. A note on resolving infeasibility in linear programs by constraint relaxation. Operations Research Letter, (13):19-20, 1993.
    • (1993) Operations Research Letter , Issue.13 , pp. 19-20
    • Sankaran, J.1
  • 18
    • 0039868153 scopus 로고    scopus 로고
    • Driver's response to parking guidance and information systems
    • R.G. Thompson and P. Bonsall. Driver's response to parking guidance and information systems. Transport Review, 17(2):89-104, 1997.
    • (1997) Transport Review , vol.17 , Issue.2 , pp. 89-104
    • Thompson, R.G.1    Bonsall, P.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.