A lagrangian-based algorithm for the multiple traveling salesmen problems
碩士 === 國立交通大學 === 資訊管理研究所 === 80 ===
Main Authors: | JIANG, FENZHEN, 江芬貞 |
---|---|
Other Authors: | LUO, JI-QUN |
Format: | Others |
Language: | zh-TW |
Published: |
1992
|
Online Access: | http://ndltd.ncl.edu.tw/handle/68706683094788740004 |
Similar Items
-
A study of feature-mapped approach to the multiple traveling salesmen problem
by: CAI,MENG-XIANG, et al.
Published: (1990) -
A novel hybrid approach for solving the multiple traveling salesmen problem
by: Youssef Harrath, et al.
Published: (2019-01-01) -
Using Grouping Genetic Algorithm to Solve Multi--Traveling Salesmen Problem
by: Chien-chih Pai, et al.
Published: (2011) -
Ant Colony Optimization Based Memetic Algorithm to Solve Bi-Objective Multiple Traveling Salesmen Problem for Multi-Robot Systems
by: Xinye Chen, et al.
Published: (2018-01-01) -
Minimization of the Total Traveling Distance and Maximum Distance by Using a Transformed-Based Encoding EDA to Solve the Multiple Traveling Salesmen Problem
by: S. H. Chen
Published: (2015-01-01)