東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Tabu search: Modifications, algorith...

University of Louisville.

Linked to FindBook

Google Book

Amazon

博客來

Tabu search: Modifications, algorithms and applications.

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Tabu search: Modifications, algorithms and applications./
Author:	Huang, Yan.
Description:	162 p.
Notes:	Co-Directors: Gerald W. Evans; Suraj M. Alexander.
Contained By:	Dissertation Abstracts International58-07B.
Subject:	Engineering, Industrial. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoeng/servlet/advanced?query=9801878
ISBN:	9780591515183

Tabu search: Modifications, algorithms and applications.
Huang, Yan.

Tabu search: Modifications, algorithms and applications. - 162 p.

Co-Directors: Gerald W. Evans; Suraj M. Alexander.

Thesis (Ph.D.)--University of Louisville, 1997.

Simulated annealing and tabu search are two search methods that have been proposed for solving combinatorial optimization problems. Since their emergence, experiments have been conducted with them in solving many types of optimization problems and have been largely successful. Approaches combining the characteristics of the two methods have been proposed, but have not yet been widely evaluated for specific problems.

ISBN: 9780591515183Subjects--Topical Terms:

626639
Engineering, Industrial.

Tabu search: Modifications, algorithms and applications.
LDR:03559nam 2200325 a 45 001 858048
005 20100712
008 100712s1997 ||||||||||||||||| ||eng d
020 $a 9780591515183
035 $a (UMI)AAI9801878
035 $a AAI9801878
040 $a UMI $c UMI
100 1 $a Huang, Yan. $3 784621
245 1 0 $a Tabu search: Modifications, algorithms and applications.
300 $a 162 p.
500 $a Co-Directors: Gerald W. Evans; Suraj M. Alexander.
500 $a Source: Dissertation Abstracts International, Volume: 58-07, Section: B, page: 3854.
502 $a Thesis (Ph.D.)--University of Louisville, 1997.
520 $a Simulated annealing and tabu search are two search methods that have been proposed for solving combinatorial optimization problems. Since their emergence, experiments have been conducted with them in solving many types of optimization problems and have been largely successful. Approaches combining the characteristics of the two methods have been proposed, but have not yet been widely evaluated for specific problems.
520 $a In this research, tabu search as applied to a dial-a-ride problem is first investigated. The potential of applying tabu search on a parameter space, rather than the solution space as commonly practiced, is explored. The dial-a-ride problem, derived from a hospital delivery problem, is solved via a heuristic in conjunction with tabu search. A parametric objective function is formulated and is used as the search region for tabu search.
520 $a The potential of integrating simulated annealing and tabu search is investigated by solving a class of vehicle routing problem, and a class of single machine scheduling problem. The vehicle routing problem belongs to the class of classical M-vehicle routing problem. The use of a probabilistic tabu search algorithm for the solution of this type of problem is tested.
520 $a A probabilistic tabu search approach is also designed to solve a class of the single machine absolute deviation from due date problem, in which earliness and tardiness are both penalized. Finally, some conclusions are drawn from this research and directions for future research are discussed.
520 $a The conclusions from this study can be summarized as follows: (1) Tabu search, as a "metaheuristic", has the flexibility to handle a variety of combinatorial problems over different search grounds. Not only can it be effective when applied to the solution space of a problem, as a metaheuristic, it also can be applied to other types of spaces, such as parameter space and guide other heuristics in the search for optimality. This is demonstrated by the application of a dial-a-ride problem. (2) Probabilistic tabu search is very effective and efficient for solving single machine scheduling problems when combined with a good starting heuristic. (3) Probabilistic tabu search provided mixed results for the vehicle routing problems. The efficiency and effectiveness can both be improved through better design of the parameters of the algorithm. Though more experiments need to be carried out to be conclusive, nevertheless, the experiments conducted in this research revealed that probabilistic tabu search is quite promising for solving vehicle routing problems.
590 $a School code: 0110.
650 4 $a Engineering, Industrial. $3 626639
690 $a 0546
710 2 $a University of Louisville. $3 1017614
773 0 $t Dissertation Abstracts International $g 58-07B.
790 $a 0110
790 1 0 $a Alexander, Suraj M., $e advisor
790 1 0 $a Evans, Gerald W., $e advisor
791 $a Ph.D.
792 $a 1997
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoeng/servlet/advanced?query=9801878