MULTI TRAVELING SALESMAN PROBLEM (M-TSP)
<b>Abstrak :</b><p align="justify">An extension of TSP is the Multi Traveling Salesman Problem (m-TSP), which is TSP with more than one salesman. The m-TSP can be stated follows : there are m salesmen who must visit a set of n cities (clients). Each salesman tour starts a...
Saved in:
Main Author: | Setiyono, Budi |
---|---|
Format: | Theses |
Language: | Indonesia |
Online Access: | https://digilib.itb.ac.id/gdl/view/5222 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Institut Teknologi Bandung |
Language: | Indonesia |
Similar Items
-
PENERAPAN ALGORITMA NEW ADAPTIVE CUCKOO SEARCH PADA TRAVELLING SALESMAN PROBLEM (TSP)
by: REGINA DEVI LOANITA LAPIAN, 081411633005
Published: (2018) -
Implementasi Ant Colony Optimization (Aco) Dan Modified Ant Colony Optimization (Maco) Pada Traveling Salesman Problem (Tsp)
by: Jessica Putri Wandira
Published: (2019) -
PENERAPAN HYBRID DISCRETE CAT SWARM OPTIMIZATION (DCSO)
DAN SIMULATED ANNEALING (SA) UNTUK MENGOPTIMALKAN
TRAVELLING SALESMAN PROBLEM (TSP)
by: GREGORIUS YOGA DARU NARENDRA, 081211232046
Published: (2016) -
PENERAPAN ALGORITMA ANT SYSTEM DALAM
MENEMUKAN JALUR OPTIMAL PADA TRAVELING
SALESMAN PROBLEM (TSP) DENGAN KEKANGAN
KONDISI JALAN
by: , Andhi Akhmad Ismail, ST., et al.
Published: (2012) -
Columnar competitive model for solving multi-traveling salesman problem
by: Tang, H., et al.
Published: (2014)