東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

FindBook

Google Book

Amazon

博客來

Constraint Programming Approaches to Electric Vehicle and Robot Routing Problems.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Constraint Programming Approaches to Electric Vehicle and Robot Routing Problems./
作者:	Booth, Kyle Ewart Coventry.
出版者:	Ann Arbor : ProQuest Dissertations & Theses, : 2021,
面頁冊數:	182 p.
附註:	Source: Dissertations Abstracts International, Volume: 83-02, Section: B.
Contained By:	Dissertations Abstracts International83-02B.
標題:	Industrial engineering. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=28415831
ISBN:	9798522938222

Constraint Programming Approaches to Electric Vehicle and Robot Routing Problems.
Booth, Kyle Ewart Coventry.

Constraint Programming Approaches to Electric Vehicle and Robot Routing Problems. - Ann Arbor : ProQuest Dissertations & Theses, 2021 - 182 p.

Source: Dissertations Abstracts International, Volume: 83-02, Section: B.

Thesis (Ph.D.)--University of Toronto (Canada), 2021.

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

Driven by global efforts to curb greenhouse gas emissions, there has been significant investment in electric vehicle (EV) technology in recent years, resulting in a substantial increase in EV market share. Concurrently, the demand for mobile robots, such as unmanned aerial vehicles (UAVs) and land-based robots, has also experienced rapid growth, encouraged by recent advances in the autonomy and capabilities of these systems. Common to both of these technologies is the use of electric motors for propulsion and batteries for mobile energy storage. Techniques for the coordination of electric vehicle fleets, whether human-operated or autonomous, must address a variety of unique challenges, including sparse recharging infrastructure, significant recharge durations, and limited battery capacities.The central thesis of this dissertation is that constraint programming (CP) can be an effective and flexible paradigm for modeling and solving routing problems involving electric vehicles. While efforts on the development of mixed-integer linear programming (MILP) approaches to electric vehicle routing problems within the vehicle routing literature are expansive and consistently growing, the exploration of CP for approaching these increasingly pervasive problems has been, thus far, limited.Throughout this dissertation, we address this thesis by developing novel CP formulations for both existing and new electric vehicle routing problem domains, leveraging modeling strategies from the MILP literature. Specifically, we propose novel CP models based on recharging path multigraphs as well as introduce a novel single resource modeling strategy that exploits symmetry in vehicle fleets for CP models involving interval, sequence, and cumulative function expression variables. These methodological contributions are then applied to four problem domains, where applicable. The first two problem domains involve electric vehicle routing with traditional logistics fleets. The third domain requires the synchronization of heterogeneous fleets involving UAVs and ground-based vehicles in a large-scale surveillance setting. Finally, the last problem domain involves the routing of social robots in a retirement home setting under complex real-world constraints, including synchronization and optional task precedence. For each of these domains, we empirically demonstrate the effectiveness of our CP approaches.

ISBN: 9798522938222Subjects--Topical Terms:

526216
Industrial engineering.
Subjects--Index Terms:

Constraint programming

Constraint Programming Approaches to Electric Vehicle and Robot Routing Problems.
LDR:03659nmm a2200397 4500 001 2348059
005 20220906075155.5
008 241004s2021 ||||||||||||||||| ||eng d
020 $a 9798522938222
035 $a (MiAaPQ)AAI28415831
035 $a AAI28415831
040 $a MiAaPQ $c MiAaPQ
100 1 $a Booth, Kyle Ewart Coventry. $3 3687379
245 1 0 $a Constraint Programming Approaches to Electric Vehicle and Robot Routing Problems.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2021
300 $a 182 p.
500 $a Source: Dissertations Abstracts International, Volume: 83-02, Section: B.
500 $a Advisor: Beck, J. Christopher.
502 $a Thesis (Ph.D.)--University of Toronto (Canada), 2021.
506 $a This item must not be sold to any third party vendors.
520 $a Driven by global efforts to curb greenhouse gas emissions, there has been significant investment in electric vehicle (EV) technology in recent years, resulting in a substantial increase in EV market share. Concurrently, the demand for mobile robots, such as unmanned aerial vehicles (UAVs) and land-based robots, has also experienced rapid growth, encouraged by recent advances in the autonomy and capabilities of these systems. Common to both of these technologies is the use of electric motors for propulsion and batteries for mobile energy storage. Techniques for the coordination of electric vehicle fleets, whether human-operated or autonomous, must address a variety of unique challenges, including sparse recharging infrastructure, significant recharge durations, and limited battery capacities.The central thesis of this dissertation is that constraint programming (CP) can be an effective and flexible paradigm for modeling and solving routing problems involving electric vehicles. While efforts on the development of mixed-integer linear programming (MILP) approaches to electric vehicle routing problems within the vehicle routing literature are expansive and consistently growing, the exploration of CP for approaching these increasingly pervasive problems has been, thus far, limited.Throughout this dissertation, we address this thesis by developing novel CP formulations for both existing and new electric vehicle routing problem domains, leveraging modeling strategies from the MILP literature. Specifically, we propose novel CP models based on recharging path multigraphs as well as introduce a novel single resource modeling strategy that exploits symmetry in vehicle fleets for CP models involving interval, sequence, and cumulative function expression variables. These methodological contributions are then applied to four problem domains, where applicable. The first two problem domains involve electric vehicle routing with traditional logistics fleets. The third domain requires the synchronization of heterogeneous fleets involving UAVs and ground-based vehicles in a large-scale surveillance setting. Finally, the last problem domain involves the routing of social robots in a retirement home setting under complex real-world constraints, including synchronization and optional task precedence. For each of these domains, we empirically demonstrate the effectiveness of our CP approaches.
590 $a School code: 0779.
650 4 $a Industrial engineering. $3 526216
650 4 $a Operations research. $3 547123
650 4 $a Artificial intelligence. $3 516317
650 4 $a Automotive engineering. $3 2181195
650 4 $a Robotics. $3 519753
650 4 $a Experiments. $3 525909
650 4 $a Electric vehicles. $3 1613392
650 4 $a Graph representations. $3 3560730
650 4 $a Robots. $3 529507
650 4 $a Linear programming. $3 560448
653 $a Constraint programming
653 $a Electric vehicle routing
653 $a Mixed-integer linear programming
653 $a Optimization
653 $a Robot routing
690 $a 0546
690 $a 0796
690 $a 0800
690 $a 0771
690 $a 0540
710 2 $a University of Toronto (Canada). $b Mechanical and Industrial Engineering. $3 2100959
773 0 $t Dissertations Abstracts International $g 83-02B.
790 $a 0779
791 $a Ph.D.
792 $a 2021
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=28415831