The Research of Solving the Multiple Constrainted Minimum Cost Path Problem by Heuristic AAlgorithm
碩士 === 國立暨南國際大學 === 資訊管理學系 === 103 === When putting into practice, multiple constraints shall be considered. Taking determining the transportation routes and method for international cargo delivery as an example, many variable factors shall be carefully looked into, such as custom duties, schedule,...
Main Authors: | Nai-Jia Chen, 陳乃嘉 |
---|---|
Other Authors: | Shiuh-Sheng Yu |
Format: | Others |
Language: | zh-TW |
Published: |
2015
|
Online Access: | http://ndltd.ncl.edu.tw/handle/96931480916230833296 |
Similar Items
-
Design of Efficient Heuristic Algorithms for Solving Scheduling Problems with Multiple Mold Constraints
by: Ting-I Chien, et al.
Published: (2010) -
Solving Minimum Cost Redundancy Allocation Problem with Chance Constraint Using Simulation Optimization
by: Lin, Chi-Ping, et al.
Published: (2017) -
Exact and Heuristic Algorithms for Solving the Generalized Minimum Filter Placement Problem
by: Mofya, Enock Chisonge
Published: (2005) -
Predicting the Moisture Ratio of Dried Tomato Slices Uusing Artificial Neural Network and Genetic Aalgorithm Modeling
by: Mohsen Mokhtarian, et al.
Published: (2021-02-01) -
Heuristic for Solving the Multiple Alignment Sequence Problem
by: Roman Anselmo Mora Gutiérrez, et al.
Published: (2011-03-01)