Solving dynamic facilities location problems with time covering constraint
碩士 === 國立高雄第一科技大學 === 運輸倉儲營運所 === 93 === Most of the conventional facilities location problems used Euclid distance to form the main goal while solving the optimal problem. However, it is not realistic when implementing the real world case. . Since using Euclid distance for transportation cost and c...
Main Authors: | Wei-Da Lin, 林緯達 |
---|---|
Other Authors: | Shan-Huen Huang |
Format: | Others |
Language: | zh-TW |
Published: |
2005
|
Online Access: | http://ndltd.ncl.edu.tw/handle/94424073381294076131 |
Similar Items
-
An approach for solving maximal covering location problems with fuzzy constraints
by: Virgilio C. Guzmán, et al.
Published: (2016-08-01) -
Solving the Uncapacitated Facility Location Problem with Heuristic Concentration
by: Chen, Ming-Wei, et al.
Published: (2007) -
A Study of Undesirable Facilities Covering Location Problem
by: Yu-Kun, Lee, et al.
Published: (2009) -
Using Cuckoo Search for Solving Facility Location Problem
by: Chih-Hao Chou, et al.
Published: (2015) -
Hub Covering Location Problem Considering Queuing and Capacity Constraints
by: Mehdi Seifbarghy, et al.
Published: (2018-03-01)