An Effective Parallel Approach to Solve Multiple Traveling Salesmen Problem

Abdoun Othman; El Khatir Haimoudi; Rhafal Mouhssine; Mostafa Ezziyyani

doi:10.1007/978-3-030-11928-7_58

ScienceGate Book Chapters

BOOK-CHAPTER

An Effective Parallel Approach to Solve Multiple Traveling Salesmen Problem

Abdoun Othman El Khatir Haimoudi Rhafal Mouhssine Mostafa Ezziyyani

Year: 2019 Advances in intelligent systems and computing Pages: 647-664 Publisher: Springer Nature

DOI: 10.1007/978-3-030-11928-7_58

Get Full-Text PDF Get Analytical Report

Keywords:

Travelling salesman problem Computer science Ant colony optimization algorithms Mathematical optimization Combinatorial optimization Extremal optimization Shortest path problem Set (abstract data type) Path (computing) Construct (python library) Lin–Kernighan heuristic 2-opt Optimization problem Mathematics Algorithm Theoretical computer science Meta-optimization Graph

Metrics

Cited By

1.59

FWCI (Field Weighted Citation Impact)

Refs

0.82

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Vehicle Routing Optimization Methods

Physical Sciences → Engineering → Industrial and Manufacturing Engineering

Data Management and Algorithms

Physical Sciences → Computer Science → Signal Processing

Robotic Path Planning Algorithms

Physical Sciences → Computer Science → Computer Vision and Pattern Recognition

An Effective Parallel Approach to Solve Multiple Traveling Salesmen Problem

Metrics

Citation History

Topics

Related Documents

A Novel Approach to Solve Multiple Traveling Salesmen Problem by Genetic Algorithm

A clustering approach to solve the multiple travelling salesmen problem

A novel hybrid approach for solving the multiple traveling salesmen problem

The multiple traveling salesmen problem with moving targets

An effective iterated two-stage heuristic algorithm for the multiple Traveling Salesmen Problem