東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Models and Algorithms for Transporta...

Freund, Daniel.

FindBook

Google Book

Amazon

博客來

Models and Algorithms for Transportation in the Sharing Economy.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Models and Algorithms for Transportation in the Sharing Economy./
作者:	Freund, Daniel.
出版者:	Ann Arbor : ProQuest Dissertations & Theses, : 2018,
面頁冊數:	262 p.
附註:	Source: Dissertations Abstracts International, Volume: 80-03, Section: B.
Contained By:	Dissertations Abstracts International80-03B.
標題:	Applied Mathematics. -
電子資源:	https://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10844758
ISBN:	9780438343429

Models and Algorithms for Transportation in the Sharing Economy.
Freund, Daniel.

Models and Algorithms for Transportation in the Sharing Economy. - Ann Arbor : ProQuest Dissertations & Theses, 2018 - 262 p.

Source: Dissertations Abstracts International, Volume: 80-03, Section: B.

Thesis (Ph.D.)--Cornell University, 2018.

This item must not be sold to any third party vendors.

This thesis consist of two parts. The first deals with bike-sharing systems which are now ubiquitous across the U.S.A. We have worked with Motivate, the operator of the systems in, for example, New York City, Chicago, and San Francisco, to innovate a data-driven approach to managing both their day-to-day operations and to provide insight on several central issues in the design of their systems. This work required the development of a number of new optimization models, characterizing their mathematical structure, and using this insight in designing algorithms to solve them. Many of these projects have been fully implemented to improve the design, rebalancing, and maintenance of Motivate's systems across the country. In the second part, we study a queueing-theoretic model of on-demand transportation systems (e.g., Uber/Lyft, Scoot, etc.) to derive approximately optimal pricing, dispatch, and rebalancing policies. Though the resulting problems are high-dimensional and non-convex, we develop a general approximation framework, based on a novel convex relaxation. Our approach provides efficient algorithms with rigorous approximation guarantees for a wide range of objectives and controls.

ISBN: 9780438343429Subjects--Topical Terms:

1669109
Applied Mathematics.
Subjects--Index Terms:

Algorithms

Models and Algorithms for Transportation in the Sharing Economy.
LDR:02466nmm a2200409 4500 001 2275939
005 20210416101953.5
008 220723s2018 ||||||||||||||||| ||eng d
020 $a 9780438343429
035 $a (MiAaPQ)AAI10844758
035 $a (MiAaPQ)cornellgrad:10983
035 $a AAI10844758
040 $a MiAaPQ $c MiAaPQ
100 1 $a Freund, Daniel. $3 3554184
245 1 0 $a Models and Algorithms for Transportation in the Sharing Economy.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2018
300 $a 262 p.
500 $a Source: Dissertations Abstracts International, Volume: 80-03, Section: B.
500 $a Publisher info.: Dissertation/Thesis.
500 $a Advisor: Shmoys, David B.
502 $a Thesis (Ph.D.)--Cornell University, 2018.
506 $a This item must not be sold to any third party vendors.
520 $a This thesis consist of two parts. The first deals with bike-sharing systems which are now ubiquitous across the U.S.A. We have worked with Motivate, the operator of the systems in, for example, New York City, Chicago, and San Francisco, to innovate a data-driven approach to managing both their day-to-day operations and to provide insight on several central issues in the design of their systems. This work required the development of a number of new optimization models, characterizing their mathematical structure, and using this insight in designing algorithms to solve them. Many of these projects have been fully implemented to improve the design, rebalancing, and maintenance of Motivate's systems across the country. In the second part, we study a queueing-theoretic model of on-demand transportation systems (e.g., Uber/Lyft, Scoot, etc.) to derive approximately optimal pricing, dispatch, and rebalancing policies. Though the resulting problems are high-dimensional and non-convex, we develop a general approximation framework, based on a novel convex relaxation. Our approach provides efficient algorithms with rigorous approximation guarantees for a wide range of objectives and controls.
590 $a School code: 0058.
650 4 $a Applied Mathematics. $3 1669109
650 4 $a Operations research. $3 547123
650 4 $a Computer science. $3 523869
653 $a Algorithms
653 $a Data science
653 $a Optimization
653 $a Sharing economy
653 $a Stochastic modeling
653 $a Transportation
690 $a 0364
690 $a 0796
690 $a 0984
710 2 $a Cornell University. $b Applied Mathematics. $3 3174634
773 0 $t Dissertations Abstracts International $g 80-03B.
790 $a 0058
791 $a Ph.D.
792 $a 2018
793 $a English
856 4 0 $u https://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10844758