The Construction of a Prototype Software Solution for Vehicle Routing Problem Using Minimum Spanning Tree and TSP Approach
碩士 === 國立臺北科技大學 === 管理國際學生碩士專班 (IMBA) === 102 === Vehicle routing problem (VRP) was first introduced by Dantizng & Ramser in 1959. The objective is to visit and serve a number of customers with a fleet of vehicles. Since it was introduced, many studies have been conducted by researchers to solve...
Main Authors: | Rahi Ghaffari Saravi, Rahi |
---|---|
Other Authors: | Yu-Hsien Lin |
Format: | Others |
Language: | en_US |
Published: |
2014
|
Online Access: | http://ndltd.ncl.edu.tw/handle/ajjay6 |
Similar Items
-
Solving Heterogeneous Fleet Vehicle Routing Problems by Genetic Algorithms and Minimum Spanning Trees
by: 連家慧
Published: (2009) -
Balancing Minimum Spanning Trees and Multiple-Source Minimum Routing Cost Spanning Trees on Metric Graphs
by: Chung-Ming Lin, et al.
Published: (2003) -
The capacitated minimum spanning tree problem
by: Ruiz y Ruiz, Héctor Efraín
Published: (2013) -
On the Minimum Ranking Spanning Tree Problem
by: Jui-Yuan Chang, et al.
Published: (2014) -
Approximation Algorithms for the Minimum Routing Cost Spanning Tree Problem and Its Generalizations
by: Bang Ye Wu, et al.
Published: (1999)