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

András Király; János Abonyi

doi:10.1007/978-3-642-21705-0_9

ScienceGate Book Chapters

BOOK-CHAPTER

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

András Király János Abonyi

Year: 2011 Studies in computational intelligence Pages: 241-269 Publisher: Springer Nature

DOI: 10.1007/978-3-642-21705-0_9

Get Full-Text PDF Get Analytical Report

Keywords:

Travelling salesman problem 2-opt Vehicle routing problem Mathematical optimization Heuristic Traveling purchaser problem Genetic algorithm Bottleneck traveling salesman problem Generalization Combinatorial optimization Representation (politics) Computer science Algorithm Mathematics Routing (electronic design automation)

Metrics

Cited By

9.83

FWCI (Field Weighted Citation Impact)

Refs

0.98

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

Optimization and Packing Problems

Physical Sciences → Engineering → Industrial and Manufacturing Engineering

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

Metrics

Citation History

Topics

Related Documents

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

Comparison Study of Multiple Traveling Salesmen Problem using Genetic Algorithm

An ant colony optimization algorithm for the Multiple Traveling Salesmen Problem

A Lagrangian-based algorithm for a Multiple Depot, Multiple Traveling Salesmen Problem

Solving Traveling Salesmen Problem using Ant Colony Optimization Algorithm