Probabilistic local search algorithms for concave cost transportation network problems

NCUIR > Engineering College > Graduate Institute of Civil Engineering > journal & Dissertation > Item 987654321/26294

Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/26294

Title:	Probabilistic local search algorithms for concave cost transportation network problems
Authors:	Yan,SY;Luo,SC
Contributors:	土木工程研究所
Keywords:	FLOW PROBLEM;OPTIMIZATION
Date:	1999
Issue Date:	2010-06-29 17:10:08 (UTC+8)
Publisher:	中央大學
Abstract:	In practice concave cost transportation problems are characterized as NP-l lard, therefore cost functions are usually simplified as linear in order to facilitate problem solving. However, linear cost functions may not reflect actual operations, which generally results in decreased operational performance. This research employs the techniques of simulated annealing and threshold accepting to develop several heuristics that would efficiently solve these concave cost transportation network problems. A network generator has also been designed to generate many instances on an HP workstation to test the heuristics. The preliminary results show that these heuristics are potentially useful. (C) 1999 Elsevier Science B.V. All rights reserved.
Relation:	EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Appears in Collections:	[Graduate Institute of Civil Engineering] journal & Dissertation

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	449	View/Open

社群 sharing