東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Nonlinear approximation techniques t...

Nahapetyan, Artyom.

Linked to FindBook

Google Book

Amazon

博客來

Nonlinear approximation techniques to solve network flow problems with nonlinear arc cost functions.

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Nonlinear approximation techniques to solve network flow problems with nonlinear arc cost functions./
Author:	Nahapetyan, Artyom.
Description:	152 p.
Notes:	Advisers: Siriphong Lawphongpanich; Donald W. Hearn.
Contained By:	Dissertation Abstracts International67-07B.
Subject:	Engineering, Industrial. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3228793
ISBN:	9780542807053

Nonlinear approximation techniques to solve network flow problems with nonlinear arc cost functions.
Nahapetyan, Artyom.

Nonlinear approximation techniques to solve network flow problems with nonlinear arc cost functions. - 152 p.

Advisers: Siriphong Lawphongpanich; Donald W. Hearn.

Thesis (Ph.D.)--University of Florida, 2006.

In this dissertation we investigate network flow problems with nonlinear are cost functions. The first group of problems consists of concave piecewise linear network flow, fixed charge network flow, and dynamic pricing problems that arise in the areas of supply chain management and logistics. Based on the MIP formulation, we construct bilinear reduction problems, in which the global solution of the latter is a solution of the initial formulation. To solve the reduction problem, we propose some heuristic algorithms. In the experiments, we compare the solution provided by our algorithm with an exact solution as well as a solution provided by other heuristic algorithms in the literature. Numerical experiments on randomly generated instances confirm the quality of the algorithms.

ISBN: 9780542807053Subjects--Topical Terms:

626639
Engineering, Industrial.

Nonlinear approximation techniques to solve network flow problems with nonlinear arc cost functions.
LDR:02996nam 2200313 a 45 001 967525
005 20110915
008 110915s2006 eng d
020 $a 9780542807053
035 $a (UMI)AAI3228793
035 $a AAI3228793
040 $a UMI $c UMI
100 1 $a Nahapetyan, Artyom. $3 1291395
245 1 0 $a Nonlinear approximation techniques to solve network flow problems with nonlinear arc cost functions.
300 $a 152 p.
500 $a Advisers: Siriphong Lawphongpanich; Donald W. Hearn.
500 $a Source: Dissertation Abstracts International, Volume: 67-07, Section: B, page: 4086.
502 $a Thesis (Ph.D.)--University of Florida, 2006.
520 $a In this dissertation we investigate network flow problems with nonlinear are cost functions. The first group of problems consists of concave piecewise linear network flow, fixed charge network flow, and dynamic pricing problems that arise in the areas of supply chain management and logistics. Based on the MIP formulation, we construct bilinear reduction problems, in which the global solution of the latter is a solution of the initial formulation. To solve the reduction problem, we propose some heuristic algorithms. In the experiments, we compare the solution provided by our algorithm with an exact solution as well as a solution provided by other heuristic algorithms in the literature. Numerical experiments on randomly generated instances confirm the quality of the algorithms.
520 $a The second group of problems is related to the dynamic traffic assignment problem. In particular, we consider a periodic discrete time dynamic traffic assignment problem (DTDTA), in which the travel time is a function of the number of cars on the road, and the planning horizon is circular. The mathematical formulation belongs to the class of nonlinear mixed integer problems. To obtain an appropriate solution to the problem, we construct a linear mixed integer problem for providing an upper bound and discuss an approximation scheme based on the bounding problem. However, the bounding problem involves binary variables, and when the problem is large, it is hard to solve. To overcome these difficulties, we propose a heuristic algorithm based on a bilinear relaxation of the problem. Using an approximate solution, in the dissertation we develop a toll pricing framework for the dynamic case. In particular, based on a feasible vector of DTDTA we describe a set of valid tolls and discuss several toll pricing problems. By constructing an appropriate time-expanded network, one may consider a similar toll pricing framework for other solutions obtained, for example, from a simulation.
590 $a School code: 0070.
650 4 $a Engineering, Industrial. $3 626639
650 4 $a Engineering, System Science. $3 1018128
650 4 $a Operations Research. $3 626629
690 $a 0546
690 $a 0790
690 $a 0796
710 2 0 $a University of Florida. $3 718949
773 0 $t Dissertation Abstracts International $g 67-07B.
790 $a 0070
790 1 0 $a Hearn, Donald W., $e advisor
790 1 0 $a Lawphongpanich, Siriphong, $e advisor
791 $a Ph.D.
792 $a 2006
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3228793