A Simulated Annealing Based Algorithm for the Hub Location Problem
碩士 === 大葉大學 === 工業工程學系碩士班 === 92 === The location of hub facilities is fundamental to the design of a “hub-and-spoke network”, as it greatly affects the total transportation costs of system. Hub is a special type of facility, which is designed to act as switching point for internal flows of a netw...
Main Authors: | Liu-Hsun Chen, 陳柳勳 |
---|---|
Other Authors: | Tai-Hsi Wu |
Format: | Others |
Language: | zh-TW |
Published: |
2004
|
Online Access: | http://ndltd.ncl.edu.tw/handle/47680980212477276294 |
Similar Items
-
Solving uncapacitated multiple allocation p-hub center problem by Dijkstra’s algorithm-based genetic algorithm and simulated annealing
by: Masoud Rabbani, et al.
Published: (2015-09-01) -
Combined Simulated Annealing Algorithm for the Discrete Facility Location Problem
by: Jin Qin, et al.
Published: (2012-01-01) -
Simulated annealing algorithm for customer-centric location routing problem
by: Sohn, Eugene
Published: (2018) -
Location of Facility Based on Simulated Annealing and “ZKW” Algorithms
by: Yukun Dong, et al.
Published: (2017-01-01) -
A Simulated Annealing Algorithm for the Charger Deployment Problem in Wireless Rechargeable Sensor Networks
by: Yang, Chun-Hsun, et al.
Published: (2019)