FINAL PROJECT Th The e Travel velling ling Multi ltiple ple Sa - - PowerPoint PPT Presentation

final project
SMART_READER_LITE
LIVE PREVIEW

FINAL PROJECT Th The e Travel velling ling Multi ltiple ple Sa - - PowerPoint PPT Presentation

< FINAL PROJECT Th The e Travel velling ling Multi ltiple ple Sa Sale lesm sman an Pr Prob oble lem Baixin Zhang < TSP TSP A list of of cities and the distan ance ces between een each pair of of cities A start


slide-1
SLIDE 1

FINAL PROJECT

< <

Baixin Zhang

Th The e Travel velling ling Multi ltiple ple Sa Sale lesm sman an Pr Prob

  • ble

lem

slide-2
SLIDE 2

TSP TSP

  • A list of
  • f cities and the distan

ance ces between een each pair of

  • f cities
  • A start poin

int for the sale lesman man

  • Find

ind a path ath that that sta tarts fr from

  • m an

and ends ends at at th the sam ame node, node, and goes through

  • ugh all the vertices

es in in the graph ph

slide-3
SLIDE 3

Travelling Salesman Problem

TSP

slide-4
SLIDE 4

Travelling Salesman Problem

TSP

slide-5
SLIDE 5

MTSP

  • A li

list of

  • f cit

itie ies and the dis istance ances between een each pair ir of

  • f cit

itie ies

  • Multipl

ple start point nts for the salesmen men

  • Each salesman

an has a set of

  • f cities to

to visit

  • Fi

Find paths hs for each sale lesmen men that min inim imize ize the total cost

slide-6
SLIDE 6

Multiple Travelling Salesman Problem

MTSP

slide-7
SLIDE 7

Multiple Travelling Salesman Problem

Algorithms

To Solve MTSP

  • Genetic Algorithm
  • Memetic Algorithm
  • Ant System
  • Particle Swarm Optimization
  • … …
slide-8
SLIDE 8

GENETIC ALGORITHM

INITIALIZATION EVALUATION SELECTION RECOMBINATION MUTATION REPLACEMENT

Dianati, Mehrdad, Insop Song, and Mark Treiber. An introduction to genetic algorithms and evolution strategies. Technical report, University of Waterloo, Ontario, N2L 3G1, Canada, 2002.

slide-9
SLIDE 9

Multiple Travelling Salesman Problem

Bibliography

  • R.Jayasutha and Dr. B. S. E. Zoraida, “The optimizing

multiple travelling salesman problem using genetic algorithm”, IJSRD, vol 1, issue 5, 2013.

  • Varunika Arya, A. Goyal and V. Jaiswal, “An optimal solution

to multiple travelling salesman problem using modified genetic algorithm”,IJAIEM ,vol 3 , Issue 1, 2014.

  • H. Larki and M. Yousefikhoshbakht, “Solving the multiple

traveling salesman problem by a novel metaheuristic algorithm”, Journal of Optimization in Industrial Engineering, 2014, pp. 55-63, to be published.

  • T. Mohammadpour and M. Yadollahi , “ Solving the problem
  • f multiple travelling salesman problem using hybrid

gravitational algorithm”, International Journal on Communications (IJC) ,Vol 3, 2014, to be published.

slide-10
SLIDE 10

Multiple Travelling Salesman Problem

Bibliography

  • S. Yuan, B. Skinner, S. Huang, D. Liu, “A new crossover

approach for solving the multiple travelling salesmen problem using genetic algorithms”, European Journal of Operational Research, 228, 2013 , pp. 72-82.

  • M. Yousefikhoshbakht, F.Didehvar, F. Rahmati,

“Modification of the ant colony optimization for solving the multiple traveling salesman problem”, Romanian journal of information science and technology ,vol16 , issue1, 2013,

  • pp. 65–80.