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

András Király; János Abonyi

doi:10.1007/978-3-642-15220-7_12

ScienceGate Book Chapters

BOOK-CHAPTER

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

András Király János Abonyi

Year: 2010 Studies in computational intelligence Pages: 141-151 Publisher: Springer Nature

DOI: 10.1007/978-3-642-15220-7_12

Get Full-Text PDF Get Analytical Report

Keywords:

Travelling salesman problem 2-opt Mathematical optimization Generalization Genetic algorithm Heuristic Computer science Bottleneck traveling salesman problem Set (abstract data type) Traveling purchaser problem Combinatorial optimization Optimization problem Extension (predicate logic) Representation (politics) Algorithm Mathematics

Metrics

Cited By

3.11

FWCI (Field Weighted Citation Impact)

Refs

0.91

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

Transportation and Mobility Innovations

Physical Sciences → Engineering → Automotive Engineering

Metaheuristic Optimization Algorithms Research

Physical Sciences → Computer Science → Artificial Intelligence

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

Metrics

Citation History

Topics

Related Documents

An Effective Parallel Approach to Solve Multiple Traveling Salesmen Problem

Comparison Study of Multiple Traveling Salesmen Problem using Genetic Algorithm

Optimization of Multiple Traveling Salesmen Problem by a Novel Representation Based Genetic Algorithm

An improvement of partheno-genetic algorithm to solve multiple travelling salesmen problem

A novel hybrid approach for solving the multiple traveling salesmen problem