東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

FindBook

Google Book

Amazon

博客來

An Exploration of Heuristics Applied to Genetic Algorithms on the Capacitated Pickup and Delivery Problem with Time Windows.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	An Exploration of Heuristics Applied to Genetic Algorithms on the Capacitated Pickup and Delivery Problem with Time Windows./
作者:	Little, Connor.
面頁冊數:	1 online resource (102 pages)
附註:	Source: Masters Abstracts International, Volume: 84-10.
Contained By:	Masters Abstracts International84-10.
標題:	Integer programming. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=30365412click for full text (PQDT)
ISBN:	9798377681960

An Exploration of Heuristics Applied to Genetic Algorithms on the Capacitated Pickup and Delivery Problem with Time Windows.
Little, Connor.

An Exploration of Heuristics Applied to Genetic Algorithms on the Capacitated Pickup and Delivery Problem with Time Windows. - 1 online resource (102 pages)

Source: Masters Abstracts International, Volume: 84-10.

Thesis (M.Sc.)--Queen's University (Canada), 2023.

Includes bibliographical references

Pickup and delivery is a ubiquitous part of everyday life. Being able to move goods and people between locations in the shortest amount of time and with the fewest vehicles allows packages to arrive on time, allows the just-in-time delivery paradigm that much of our industries rely on, and much more. Solving this problem is a complex task that interests both academia and industry.As time goes on the size and complexity of the problems we wish to solve also increase. Additionally, time is often a critical parameter that cannot be changed. This in turn leads to a need for better and more efficient algorithms. Due to the scale of the problems, exact solutions are often eschewed in exchange for satisfactory solutions. Many heuristics and algorithms have been designed to try and improve the solutions while not increasing the time to completion. These algorithms use local search operations to iteratively improve solutions in hopes they become better over time.This thesis aims to address the need for better algorithms. The first problem that we approach is an exploration of how different local search operations compare against each other. By identifying the operators that most improve the final solution, more intelligent algorithms can be constructed. Using genetic algorithms as the base, typical genetic algorithm operators are compared against vehicle routing operators to determine which most improves the solution. The second problem introduces a new heuristic that uses historical information to improve solutions. Previous solutions can be deconstructed into subroutes, with the most frequently occurring being extracted. Using these previously found subroutes, the new heuristic attempts to insert them into newly created solutions. This is done by removing each part of the pattern from the solution, creating route fragments. These fragments can then be recombined to create a new solution. The two principal ideas are that common routes will tend to be good routes and this process allows higher-order operations to be performed.

Electronic reproduction.
Ann Arbor, Mich. :
ProQuest,
2023

Mode of access: World Wide Web

ISBN: 9798377681960Subjects--Topical Terms:

648270
Integer programming.
Index Terms--Genre/Form:

542853
Electronic books.

An Exploration of Heuristics Applied to Genetic Algorithms on the Capacitated Pickup and Delivery Problem with Time Windows.
LDR:03374nmm a2200361K 4500 001 2360873
005 20231015185440.5
006 m o d
007 cr mn ---uuuuu
008 241011s2023 xx obm 000 0 eng d
020 $a 9798377681960
035 $a (MiAaPQ)AAI30365412
035 $a (MiAaPQ)QueensUCan_197431401
035 $a AAI30365412
040 $a MiAaPQ $b eng $c MiAaPQ $d NTU
100 1 $a Little, Connor. $3 3701512
245 1 3 $a An Exploration of Heuristics Applied to Genetic Algorithms on the Capacitated Pickup and Delivery Problem with Time Windows.
264 0 $c 2023
300 $a 1 online resource (102 pages)
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
500 $a Source: Masters Abstracts International, Volume: 84-10.
500 $a Advisor: Choudhury, Salimur; Salomaa, Kai.
502 $a Thesis (M.Sc.)--Queen's University (Canada), 2023.
504 $a Includes bibliographical references
520 $a Pickup and delivery is a ubiquitous part of everyday life. Being able to move goods and people between locations in the shortest amount of time and with the fewest vehicles allows packages to arrive on time, allows the just-in-time delivery paradigm that much of our industries rely on, and much more. Solving this problem is a complex task that interests both academia and industry.As time goes on the size and complexity of the problems we wish to solve also increase. Additionally, time is often a critical parameter that cannot be changed. This in turn leads to a need for better and more efficient algorithms. Due to the scale of the problems, exact solutions are often eschewed in exchange for satisfactory solutions. Many heuristics and algorithms have been designed to try and improve the solutions while not increasing the time to completion. These algorithms use local search operations to iteratively improve solutions in hopes they become better over time.This thesis aims to address the need for better algorithms. The first problem that we approach is an exploration of how different local search operations compare against each other. By identifying the operators that most improve the final solution, more intelligent algorithms can be constructed. Using genetic algorithms as the base, typical genetic algorithm operators are compared against vehicle routing operators to determine which most improves the solution. The second problem introduces a new heuristic that uses historical information to improve solutions. Previous solutions can be deconstructed into subroutes, with the most frequently occurring being extracted. Using these previously found subroutes, the new heuristic attempts to insert them into newly created solutions. This is done by removing each part of the pattern from the solution, creating route fragments. These fragments can then be recombined to create a new solution. The two principal ideas are that common routes will tend to be good routes and this process allows higher-order operations to be performed.
533 $a Electronic reproduction. $b Ann Arbor, Mich. : $c ProQuest, $d 2023
538 $a Mode of access: World Wide Web
650 4 $a Integer programming. $3 648270
650 4 $a Computer science. $3 523869
650 4 $a Mutation. $3 837917
650 4 $a Genetic algorithms. $3 533907
650 4 $a Optimization. $3 891104
650 4 $a Linear programming. $3 560448
650 4 $a Vehicles. $3 2145288
650 4 $a Transportation. $3 555912
655 7 $a Electronic books. $2 lcsh $3 542853
690 $a 0984
690 $a 0800
690 $a 0796
690 $a 0709
710 2 $a ProQuest Information and Learning Co. $3 783688
710 2 $a Queen's University (Canada). $3 1017786
773 0 $t Masters Abstracts International $g 84-10.
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=30365412 $z click for full text (PQDT)