Discrete Teaching-learning-based optimization Algorithm for Traveling Salesman Problems

E-ISSN： 2261-236x|128|issue|02022-02022

ISSN： 2261-236x

Source： MATEC Web of conference, Vol.128, Iss.issue, 2017-10, pp. : 02022-02022

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Optimization of Multiple Traveling Salesman Problem Based on Simulated Annealing Genetic Algorithm

MATEC Web of conference, Vol. 100, Iss. issue, 2017-03 ,pp. : 02025-02025

Edp Sciences

Access to resources Recommend Favorite

A Study on SVM Based on the Weighted Elitist Teaching-Learning-Based Optimization and Application in the Fault Diagnosis of Chemical Process

MATEC Web of conference, Vol. 22, Iss. issue, 2015-07 ,pp. : 05016-05016

Edp Sciences

Access to resources Recommend Favorite

An Improved Routing Optimization Algorithm Based on Travelling Salesman Problem for Social Networks

By Xiong Naixue Wu Wenliang Wu Chunxue

Sustainability, Vol. 9, Iss. 6, 2017-06 ,pp. : 985-985

MDPI

Access to resources Recommend Favorite

Double evolutsional artificial bee colony algorithm for multiple traveling salesman problem

MATEC Web of conference, Vol. 44, Iss. issue, 2016-03 ,pp. : 02025-02025

Edp Sciences

Access to resources Recommend Favorite

Approximation Algorithms for the Traveling Salesman Problem with Range Condition

By D. Arun Kumar C. Pandu Rangan C.

RAIRO - Theoretical Informatics and Applications, Vol. 34, Iss. 3, 2010-03 ,pp. : 173-181

Edp Sciences

Access to resources Recommend Favorite