東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Optimization Approaches for Mobility...

Yu, Miao.

FindBook

Google Book

Amazon

博客來

Optimization Approaches for Mobility and Service Sharing.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Optimization Approaches for Mobility and Service Sharing./
作者:	Yu, Miao.
出版者:	Ann Arbor : ProQuest Dissertations & Theses, : 2020,
面頁冊數:	157 p.
附註:	Source: Dissertations Abstracts International, Volume: 81-11, Section: A.
Contained By:	Dissertations Abstracts International81-11A.
標題:	Operations research. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=28006629
ISBN:	9798643185697

Optimization Approaches for Mobility and Service Sharing.
Yu, Miao.

Optimization Approaches for Mobility and Service Sharing. - Ann Arbor : ProQuest Dissertations & Theses, 2020 - 157 p.

Source: Dissertations Abstracts International, Volume: 81-11, Section: A.

Thesis (Ph.D.)--University of Michigan, 2020.

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

Mobility and service sharing is undergoing a fast rise in popularity and industrial growth in recent years. For example, in patient-centered medical home care, services are delivered to patients at home, who share a group of medical staff riding together in a vehicle that also carries shared medical devices; companies such as Amazon and Meijer have been investing tremendous human effort and money in grocery delivery to customers who share the use of delivery vehicles and staff. In such mobility and service sharing systems, decision-makers need to make a wide range of system design and operational decisions, including locating service facilities, matching supplies with demand for shared mobility services, dispatching vehicles and staff, and scheduling appointments. The complexity of the linking decisions and constraints, as well as the dimensionality of the problems in the real world, pose challenges in finding optimal strategies efficiently. In this work, we apply techniques from Operations Research to investigate the optimal and practical solution approaches to improve the quality of service, cost-effectiveness, and operational efficiency of mobility and service sharing in a variety of applications. We deploy stochastic programming, integer programming, and approximation algorithms to address the issues in decision-making for seeking fast and reliable solutions for planning and operations problems.This dissertation contains four main chapters. In Chapter 2, we consider a class of vehicle routing problems (VRPs) where the objective is to minimize the longest route taken by any vehicle as opposed to the total distance of all routes. In such a setting, the traditional decomposition approach fails to solve the problem effectively. We investigate the hardness result of the problem and develop an approximation algorithm that achieves the best approximation ratio. In Chapter 3, we focus on developing an efficient computational algorithm for the elementary shortest path problem with resource constraints, which is solved as the pricing subproblem of the column generation-based approach for many VRP variants. Inspired by the color-coding approach, we develop a randomized algorithm that can be easily implemented in parallel. We also extend the state-of-the-art pulse algorithm for elementary shortest path problem with a new bounding scheme on the load of the route. In Chapter 4, we consider a carsharing fleet location design problem with mixed vehicle types and a restriction on CO2 emission. We use a minimum-cost flow model on a spatial-temporal network and provide insights on fleet location, car-type design, and their environmental impacts. In Chapter 5, we focus on the design and operations of an integrated car-and-ride sharing system for heterogeneous users/travelers with an application of satisfying transportation needs in underserved communities. The system aims to provide self-sustained community-based shared transportation. We address the uncertain travel and service time in operations via a stochastic integer programming model and propose decomposition algorithms to solve it efficiently.Overall, our contributions are threefold: (i) providing mathematical models of various complex mobility and service sharing systems, (ii) deriving efficient solution algorithms to solve the proposed models, (iii) evaluating the solution approaches via extensive numerical experiments. The models and solution algorithms that we develop in this work can be used by practitioners to solve a variety of mobility and service sharing problems in different business contexts, and thus can generate significant societal and economic impacts.

ISBN: 9798643185697Subjects--Topical Terms:

547123
Operations research.
Subjects--Index Terms:

Service sharing

Optimization Approaches for Mobility and Service Sharing.
LDR:04941nmm a2200385 4500 001 2267673
005 20200724103034.5
008 220629s2020 ||||||||||||||||| ||eng d
020 $a 9798643185697
035 $a (MiAaPQ)AAI28006629
035 $a (MiAaPQ)umichrackham002985
035 $a AAI28006629
040 $a MiAaPQ $c MiAaPQ
100 1 $a Yu, Miao. $3 3181683
245 1 0 $a Optimization Approaches for Mobility and Service Sharing.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2020
300 $a 157 p.
500 $a Source: Dissertations Abstracts International, Volume: 81-11, Section: A.
500 $a Advisor: Nagarajan, Viswanath;Shen, Siqian May.
502 $a Thesis (Ph.D.)--University of Michigan, 2020.
506 $a This item must not be sold to any third party vendors.
506 $a This item must not be added to any third party search indexes.
520 $a Mobility and service sharing is undergoing a fast rise in popularity and industrial growth in recent years. For example, in patient-centered medical home care, services are delivered to patients at home, who share a group of medical staff riding together in a vehicle that also carries shared medical devices; companies such as Amazon and Meijer have been investing tremendous human effort and money in grocery delivery to customers who share the use of delivery vehicles and staff. In such mobility and service sharing systems, decision-makers need to make a wide range of system design and operational decisions, including locating service facilities, matching supplies with demand for shared mobility services, dispatching vehicles and staff, and scheduling appointments. The complexity of the linking decisions and constraints, as well as the dimensionality of the problems in the real world, pose challenges in finding optimal strategies efficiently. In this work, we apply techniques from Operations Research to investigate the optimal and practical solution approaches to improve the quality of service, cost-effectiveness, and operational efficiency of mobility and service sharing in a variety of applications. We deploy stochastic programming, integer programming, and approximation algorithms to address the issues in decision-making for seeking fast and reliable solutions for planning and operations problems.This dissertation contains four main chapters. In Chapter 2, we consider a class of vehicle routing problems (VRPs) where the objective is to minimize the longest route taken by any vehicle as opposed to the total distance of all routes. In such a setting, the traditional decomposition approach fails to solve the problem effectively. We investigate the hardness result of the problem and develop an approximation algorithm that achieves the best approximation ratio. In Chapter 3, we focus on developing an efficient computational algorithm for the elementary shortest path problem with resource constraints, which is solved as the pricing subproblem of the column generation-based approach for many VRP variants. Inspired by the color-coding approach, we develop a randomized algorithm that can be easily implemented in parallel. We also extend the state-of-the-art pulse algorithm for elementary shortest path problem with a new bounding scheme on the load of the route. In Chapter 4, we consider a carsharing fleet location design problem with mixed vehicle types and a restriction on CO2 emission. We use a minimum-cost flow model on a spatial-temporal network and provide insights on fleet location, car-type design, and their environmental impacts. In Chapter 5, we focus on the design and operations of an integrated car-and-ride sharing system for heterogeneous users/travelers with an application of satisfying transportation needs in underserved communities. The system aims to provide self-sustained community-based shared transportation. We address the uncertain travel and service time in operations via a stochastic integer programming model and propose decomposition algorithms to solve it efficiently.Overall, our contributions are threefold: (i) providing mathematical models of various complex mobility and service sharing systems, (ii) deriving efficient solution algorithms to solve the proposed models, (iii) evaluating the solution approaches via extensive numerical experiments. The models and solution algorithms that we develop in this work can be used by practitioners to solve a variety of mobility and service sharing problems in different business contexts, and thus can generate significant societal and economic impacts.
590 $a School code: 0127.
650 4 $a Operations research. $3 547123
650 4 $a Industrial engineering. $3 526216
650 4 $a Transportation. $3 555912
653 $a Service sharing
653 $a Vehicle routing
653 $a Approximation algorithm
653 $a Stochastic programming
690 $a 0796
690 $a 0546
690 $a 0709
710 2 $a University of Michigan. $b Industrial & Operations Engineering. $3 3344010
773 0 $t Dissertations Abstracts International $g 81-11A.
790 $a 0127
791 $a Ph.D.
792 $a 2020
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=28006629