2020 American Control Conference (ACC) 2020
DOI: 10.23919/acc45564.2020.9147207
|View full text |Cite
|
Sign up to set email alerts
|

Market Approach to Length Constrained Min-Max Multiple Depot Multiple Traveling Salesman Problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 10 publications
(3 citation statements)
references
References 19 publications
0
3
0
Order By: Relevance
“…Recently, MinMax mTSPs with other constraints have also been considered in surveillance applications. In [ 67 ], a mixed-integer linear program (MILP) based approach is presented along with market based heuristics for a min-max problem with additional revisit constraints to the targets. In [ 68 ], a min-max routing problem is considered where the vehicles are functionally heterogeneous, i.e., there are vehicle-target assignment constraints that specify the sub-set of targets that each vehicle can visit.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Recently, MinMax mTSPs with other constraints have also been considered in surveillance applications. In [ 67 ], a mixed-integer linear program (MILP) based approach is presented along with market based heuristics for a min-max problem with additional revisit constraints to the targets. In [ 68 ], a min-max routing problem is considered where the vehicles are functionally heterogeneous, i.e., there are vehicle-target assignment constraints that specify the sub-set of targets that each vehicle can visit.…”
Section: Literature Reviewmentioning
confidence: 99%
“…In this period, many heuristics [37][38][39][40][41], exact algorithms [42][43][44][45][46][47], and IPs [6,42,44,[48][49][50][51][52][53][54] were proposed. Metaheuristics dominated the scene with neural networks [31,55,56], genetic algorithms , clustering strategies [83], ant colony optimization [76,[84][85][86][87][88][89], firefly algorithm [89], ant colony system [90,91], marketbased algorithms [92,93], imperialist competitive algorithm [94], tabu search [56], gravitational emulation local search algorithm [95], variable neighborhood search [96][97][98][99], bee colony optimization [100], invasive weed optimization [100], wolf pack search algorithm [101], discrete...…”
Section: Mtsp From 2006 To Datementioning
confidence: 99%
“…Accordingly, the revisit period constraints are not dynamically changed between the consecutive routes. An extension to this problem appeared in [31], formulated as a multiple depot TSP.…”
Section: Introductionmentioning
confidence: 99%