본문

서브메뉴

Essays on Applied Optimization Models- [electronic resource]
Essays on Applied Optimization Models - [electronic resource]
Essays on Applied Optimization Models- [electronic resource]

상세정보

자료유형  
 학위논문파일 국외
최종처리일시  
20240214100348
ISBN  
9798379706180
DDC  
658
저자명  
Gao, Zuguang.
서명/저자  
Essays on Applied Optimization Models - [electronic resource]
발행사항  
[S.l.]: : The University of Chicago., 2023
발행사항  
Ann Arbor : : ProQuest Dissertations & Theses,, 2023
형태사항  
1 online resource(401 p.)
주기사항  
Source: Dissertations Abstracts International, Volume: 84-12, Section: B.
주기사항  
Advisor: Birge, John R.;Gupta, Varun.
학위논문주기  
Thesis (Ph.D.)--The University of Chicago, 2023.
사용제한주기  
This item must not be sold to any third party vendors.
초록/해제  
요약This dissertation studies several different optimization problems, and consists of five chapters. In Chapter 1, we consider a multiperiod binary Knapsack problem, along with several extensions. We propose fully polynomial time approximation schemes to these problems where applicable. We also prove the performance guarantee of some greedy algorithms, and propose parameterized approximation algorithms for some extensions. In Chapter 2, we propose several models to aggregate the distributed energy resources, where the aggregator can be profit-seeking or regulated. We design the two-part pricing mechanism for the aggregator to achieve full market efficiency. In Chapter 3, we analyze the sample complexity of decentralized Q-learning algorithms for stochastic games, in both the tabular case and the case with linear function approximation. In Chapter 4, we design a power purchase agreement (PPA), where a firm signs a long term contract with a renewable energy generator. The contract specifies a one-time transfer payment by the firm to the renewable energy generator, as an investment to build new renewable energy facilities. The firm then owns all the generation from these facilities for an extended period of time. We formulate the firm's decision on when to sign the PPA as an optimal stopping problem, and analyze the firm's optimal policies. Chapter 5 is motivated by an application in freight forwarding, where we formulate the freight forwarder's decisions on the assignment of shipments to containers as an integer program, which turns out to be a combination of the bin packing problem and the generalized assignment problem. We propose several heuristics for this problem and run numerical experiments on their performances.
일반주제명  
Industrial engineering.
키워드  
Distributed energy resources
키워드  
Freight consolidation
키워드  
Knapsack problems
키워드  
Multi-agent Q-learning
키워드  
Optimization
키워드  
Power purchase agreement
기타저자  
The University of Chicago Business
기본자료저록  
Dissertations Abstracts International. 84-12B.
기본자료저록  
Dissertation Abstract International
전자적 위치 및 접속  
로그인 후 원문을 볼 수 있습니다.

MARC

 008240612s2023      us  |||||||||||||||c||eng  d
■001000016931919
■00520240214100348
■006m          o    d                
■007cr#unu||||||||
■020    ▼a9798379706180
■035    ▼a(MiAaPQ)AAI30426647
■040    ▼aMiAaPQ▼cMiAaPQ
■0820  ▼a658
■1001  ▼aGao,  Zuguang.▼0(orcid)0000-0003-0872-4532
■24510▼aEssays  on  Applied  Optimization  Models▼h[electronic  resource]
■260    ▼a[S.l.]:▼bThe  University  of  Chicago.  ▼c2023
■260  1▼aAnn  Arbor  :▼bProQuest  Dissertations  &  Theses,  ▼c2023
■300    ▼a1  online  resource(401  p.)
■500    ▼aSource:  Dissertations  Abstracts  International,  Volume:  84-12,  Section:  B.
■500    ▼aAdvisor:  Birge,  John  R.;Gupta,  Varun.
■5021  ▼aThesis  (Ph.D.)--The  University  of  Chicago,  2023.
■506    ▼aThis  item  must  not  be  sold  to  any  third  party  vendors.
■520    ▼aThis  dissertation  studies  several  different  optimization  problems,  and  consists  of  five  chapters.  In  Chapter  1,  we  consider  a  multiperiod  binary  Knapsack  problem,  along  with  several  extensions.  We  propose  fully  polynomial  time  approximation  schemes  to  these  problems  where  applicable.  We  also  prove  the  performance  guarantee  of  some  greedy  algorithms,  and  propose  parameterized  approximation  algorithms  for  some  extensions.  In  Chapter  2,  we  propose  several  models  to  aggregate  the  distributed  energy  resources,  where  the  aggregator  can  be  profit-seeking  or  regulated.  We  design  the  two-part  pricing  mechanism  for  the  aggregator  to  achieve  full  market  efficiency.  In  Chapter  3,  we  analyze  the  sample  complexity  of  decentralized  Q-learning  algorithms  for  stochastic  games,  in  both  the  tabular  case  and  the  case  with  linear  function  approximation.  In  Chapter  4,  we  design  a  power  purchase  agreement  (PPA),  where  a  firm  signs  a  long  term  contract  with  a  renewable  energy  generator.  The  contract  specifies  a  one-time  transfer  payment  by  the  firm  to  the  renewable  energy  generator,  as  an  investment  to  build  new  renewable  energy  facilities.  The  firm  then  owns  all  the  generation  from  these  facilities  for  an  extended  period  of  time.  We  formulate  the  firm's  decision  on  when  to  sign  the  PPA  as  an  optimal  stopping  problem,  and  analyze  the  firm's  optimal  policies.  Chapter  5  is  motivated  by  an  application  in  freight  forwarding,  where  we  formulate  the  freight  forwarder's  decisions  on  the  assignment  of  shipments  to  containers  as  an  integer  program,  which  turns  out  to  be  a  combination  of  the  bin  packing  problem  and  the  generalized  assignment  problem.  We  propose  several  heuristics  for  this  problem  and  run  numerical  experiments  on  their  performances.
■590    ▼aSchool  code:  0330.
■650  4▼aIndustrial  engineering.
■653    ▼aDistributed  energy  resources
■653    ▼aFreight  consolidation
■653    ▼aKnapsack  problems
■653    ▼aMulti-agent  Q-learning
■653    ▼aOptimization
■653    ▼aPower  purchase  agreement
■690    ▼a0796
■690    ▼a0546
■690    ▼a0501
■71020▼aThe  University  of  Chicago▼bBusiness.
■7730  ▼tDissertations  Abstracts  International▼g84-12B.
■773    ▼tDissertation  Abstract  International
■790    ▼a0330
■791    ▼aPh.D.
■792    ▼a2023
■793    ▼aEnglish
■85640▼uhttp://www.riss.kr/pdu/ddodLink.do?id=T16931919▼nKERIS▼z이  자료의  원문은  한국교육학술정보원에서  제공합니다.
■980    ▼a202402▼f2024

미리보기

내보내기

chatGPT토론

Ai 추천 관련 도서


    신착도서 더보기
    최근 3년간 통계입니다.

    소장정보

    • 예약
    • 소재불명신고
    • 나의폴더
    • 우선정리요청
    • 비도서대출신청
    • 야간 도서대출신청
    소장자료
    등록번호 청구기호 소장처 대출가능여부 대출정보
    TF09006 전자도서 마이폴더 부재도서신고 비도서대출신청

    * 대출중인 자료에 한하여 예약이 가능합니다. 예약을 원하시면 예약버튼을 클릭하십시오.

    해당 도서를 다른 이용자가 함께 대출한 도서

    관련 인기도서

    로그인 후 이용 가능합니다.