Distributed routing and rebalancing optimization for autonomous mobility-on-demand system주문형 자율주행 교통 시스템을 위한 차량 경로 및 재배치 계획 분산 최적화

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 110
  • Download : 0
DC FieldValueLanguage
dc.contributor.advisorChoi, Han-Lim-
dc.contributor.advisor최한림-
dc.contributor.authorKim, Ho-Yeon-
dc.date.accessioned2023-06-23T19:35:09Z-
dc.date.available2023-06-23T19:35:09Z-
dc.date.issued2022-
dc.identifier.urihttp://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=1007902&flag=dissertationen_US
dc.identifier.urihttp://hdl.handle.net/10203/309356-
dc.description학위논문(박사) - 한국과학기술원 : 항공우주공학과, 2022.8,[vi, 103 p. :]-
dc.description.abstractThis thesis addresses decision-making for networked autonomous vehicles in mobility on demand (MoD) systems. We introduce an optimization formulation, Decentralized Dial-A-Ride Problem (DDARP), that simultaneously accounts for the dispatching of vehicles in response to existing service requests and the routing vehicles for assigned requests. Additionally, we extend the D-DARP for ride-sharing and transfer problems, Decentralized Dial-A-Ride Problem with transfer (D-DARPT). The DARP comprises optimization to assign transportation requests and planning of individual vehicle routes. In the case of self-optimizing on-demand mobility, a dispatcher does not know the exact cost of the vehicle to perform each request. So we decompose DARP into D-DARP with sub-problems of decision-makers in the decentralized AMoD system. We develop an alternating direction method of multipliers (ADMM) based decomposition method to solve this optimization problem in a distributed manner effectively. The ADMM-based framework enables (i) decomposing the DARP into a dispatching problem and vehicle sub-problems with a subset of assigning decisions based on an ADMM-
dc.description.abstractand (ii) optimizing individual vehicles to ensure the convergence to the feasible solution of the global system by an individual heuristic algorithm. The coordination algorithm is based on a variable neighborhood search and adaptive penalty selection strategy, accelerating the ADMM considering the binary decision. Numerical examples demonstrate the efficacy and the benefits of the optimization model in the context of real-world autonomous mobility-on-demand systems. Additionally, these optimization algorithms provide a hierarchical solution structure that aids in solving the autonomous mobility-on-demand system decision-making problems.-
dc.languageeng-
dc.publisher한국과학기술원-
dc.subjectMobility on demand systems▼aAutonomous vehicle systems▼aVehicle routing problem▼aPick-up and delivery problem▼aVehicle rebalancing▼aNon-myopic transportation planning▼aDecentralized mission planning▼aPlan consensus▼aDistributed optimization-
dc.subject주문형 교통 시스템▼a자율 차량 시스템▼a분산 최적화▼a합의 기반 최적화▼a배차 및 차량 경로 계획 문제▼a이종 차량 협업▼a멀티 에이전트 시스템-
dc.titleDistributed routing and rebalancing optimization for autonomous mobility-on-demand system-
dc.title.alternative주문형 자율주행 교통 시스템을 위한 차량 경로 및 재배치 계획 분산 최적화-
dc.typeThesis(Ph.D)-
dc.identifier.CNRN325007-
dc.description.department한국과학기술원 :항공우주공학과,-
dc.contributor.alternativeauthor김호연-
Appears in Collection
AE-Theses_Ph.D.(박사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0