Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Published in:
Hierarchical Matrix-Matrix Multiplication Based on Multiprocessor Tasks Read chapter Read first chapter

2004 | OriginalPaper | Chapter

Evolving TSP Heuristics Using Multi Expression Programming

Authors : Mihai Oltean, D. Dumitrescu

Published in: Computational Science - ICCS 2004

Publisher: Springer Berlin Heidelberg

Included in: Professional Book Archive

Get Access

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Multi Expression Programming (MEP) is used for evolving a Traveling Salesman Problem (TSP) heuristic for graphs satisfying triangle inequality. Evolved MEP heuristic is compared with Nearest Neighbor Heuristic (NN) and Minimum Spanning Tree Heuristic (MST) on some difficult problems in TSPLIB. The results emphasizes that evolved MEP heuristic is better than the compared algorithm for the considered test problems.

previous chapter A Hybrid Algorithm Based on PSO and SA and Its Application for Two-Dimensional Non-guillotine Cutting Stock Problem
next chapter Improving the Performance of Evolutionary Algorithms for the Multiobjective 0/1 Knapsack Problem Using ε-Dominance
Metadata
Title
Evolving TSP Heuristics Using Multi Expression Programming
Authors
Mihai Oltean
D. Dumitrescu
Copyright Year
2004
Publisher
Springer Berlin Heidelberg
Book
Computational Science - ICCS 2004

Print ISBN: 978-3-540-22115-9

Electronic ISBN: 978-3-540-24687-9

Copyright Year: 2004

DOI
https://doi.org/10.1007/978-3-540-24687-9_99

Premium Partner

    Image Credits