東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Solving a class of time-dependent co...

Diaz, Rigoberto.

FindBook

Google Book

Amazon

博客來

Solving a class of time-dependent combinatorial optimization problems with abstraction, transformation and simulated annealing.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Solving a class of time-dependent combinatorial optimization problems with abstraction, transformation and simulated annealing./
作者:	Diaz, Rigoberto.
面頁冊數:	109 p.
附註:	Source: Dissertation Abstracts International, Volume: 65-03, Section: B, page: 1398.
Contained By:	Dissertation Abstracts International65-03B.
標題:	Computer Science. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3127380
ISBN:	0496746440

Solving a class of time-dependent combinatorial optimization problems with abstraction, transformation and simulated annealing.
Diaz, Rigoberto.

Solving a class of time-dependent combinatorial optimization problems with abstraction, transformation and simulated annealing. - 109 p.

Source: Dissertation Abstracts International, Volume: 65-03, Section: B, page: 1398.

Thesis (D.P.S.)--Pace University, 2004.

While the operations research community has been working on combinatorial optimization problems for over half a century, most of the problems considered so far have constant event costs. This dissertation is dedicated to efficient solutions to a class of real-world combinatorial optimization problems whose event costs are time-dependent.

ISBN: 0496746440Subjects--Topical Terms:

626642
Computer Science.

Solving a class of time-dependent combinatorial optimization problems with abstraction, transformation and simulated annealing.
LDR:02982nmm 2200325 4500 001 1839725
005 20050630133813.5
008 130614s2004 eng d
020 $a 0496746440
035 $a (UnM)AAI3127380
035 $a AAI3127380
040 $a UnM $c UnM
100 1 $a Diaz, Rigoberto. $3 1928103
245 1 0 $a Solving a class of time-dependent combinatorial optimization problems with abstraction, transformation and simulated annealing.
300 $a 109 p.
500 $a Source: Dissertation Abstracts International, Volume: 65-03, Section: B, page: 1398.
500 $a Adviser: Lixin Tao.
502 $a Thesis (D.P.S.)--Pace University, 2004.
520 $a While the operations research community has been working on combinatorial optimization problems for over half a century, most of the problems considered so far have constant event costs. This dissertation is dedicated to efficient solutions to a class of real-world combinatorial optimization problems whose event costs are time-dependent.
520 $a A class of time-dependent problems is first identified and abstracted into a mathematical model. Based on some critical observation on the model, a problem transformation algorithm is proposed to significantly shrink the solution space while maintaining equivalency to the original problem. This problem transformation can benefit any solution strategies for this class of problems.
520 $a Since the class of problems is NP-hard, a comprehensive literature survey is conducted for the prevailing meta-heuristics for solving NP-hard problems, including local optimization, genetic algorithms, simulated annealing, and tabu search. Simulated annealing is adopted as the base of this research's solution strategy due to its proven convergence to global optimum when its temperature is reduced slowly enough. Comprehensive experiments are conducted to study the sensitivity of the simulated annealing algorithm to the values and strategy of its multiple parameters including initial temperature, cooling schedule, stopping criteria for the same temperature, and stopping criteria for the algorithm.
520 $a More than 70 problem instances are generated to evaluate the relative performance of the proposed simulated annealing algorithm against repeated random solutions and one of the published genetic algorithms for the same problem. The size of the problem instances ranges from 4 to 200. Considered performance categories include both solution quality and running time. Experiments show that the proposed simulated annealing algorithm outperforms the published genetic algorithm by a factor of 5% to 116% while reducing the latter's running time by a factor of 2 to 145.
590 $a School code: 0483.
650 4 $a Computer Science. $3 626642
650 4 $a Operations Research. $3 626629
650 4 $a Engineering, System Science. $3 1018128
690 $a 0984
690 $a 0796
690 $a 0790
710 2 0 $a Pace University. $3 1024552
773 0 $t Dissertation Abstracts International $g 65-03B.
790 1 0 $a Tao, Lixin, $e advisor
790 $a 0483
791 $a D.P.S.
792 $a 2004
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3127380