2010
DOI: 10.1007/s00170-010-2562-1
|View full text |Cite
|
Sign up to set email alerts
|

An ant colony system approach for fuzzy traveling salesman problem with time windows

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2011
2011
2023
2023

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 16 publications
(3 citation statements)
references
References 29 publications
0
3
0
Order By: Relevance
“…Furthermore, TSP variations treated with the aid of ACO approaches include (a) TSP with time windows (Sarhadi and Ghoseiri 2010), (b) asymmetric TSP (Bai et al 2013), multi-optimum TSP (Chen and Liu 2009), convergence analysis of TSP (Chen et al 2012), symmetric TSP (Valdez and Chaparro 2013), multi-depot multiple TSP (Ghafurian and Ja-vadian 2011), generalized TSP (Jun-man and Yi 2012) and (Lian-Ming 2011), dynamic TSP (Mavrovouniotis and Yang 2013).…”
Section: Literature Survey Findingsmentioning
confidence: 99%
“…Furthermore, TSP variations treated with the aid of ACO approaches include (a) TSP with time windows (Sarhadi and Ghoseiri 2010), (b) asymmetric TSP (Bai et al 2013), multi-optimum TSP (Chen and Liu 2009), convergence analysis of TSP (Chen et al 2012), symmetric TSP (Valdez and Chaparro 2013), multi-depot multiple TSP (Ghafurian and Ja-vadian 2011), generalized TSP (Jun-man and Yi 2012) and (Lian-Ming 2011), dynamic TSP (Mavrovouniotis and Yang 2013).…”
Section: Literature Survey Findingsmentioning
confidence: 99%
“…The general form of the TSP appears to have been first studied by mathematicians during the 1930s in Vienna and at Harvard.Hassler Whitney [6]at Princeton University introduced the name travelling salesman problem. Sarhadi and Ghoseiri [7] extended Travelling salesman problem with time windows to model fuzzy travelling salesman problem with time windows. basic advantage of this new modelling is its flexibility which enables us to optimize the delivery process in the network of customers with different satisfaction patterns and different priorities.…”
Section: Introductionmentioning
confidence: 99%
“…Like other heuristic algorithms, it searches optimal solution through group evolution process, composed by candidate solution. This method achieved good results when it is first applied to the famous traveling salesman problem (TSP) [2,3]. The features of ant colony algorithm's positive feedback, distributed and greed type heuristic search etc.…”
Section: Introductionmentioning
confidence: 99%