Asset Details
MbrlCatalogueTitleDetail
Do you wish to reserve the book?
GORTS: genetic algorithm based on one-by-one revision of two sides for dynamic travelling salesman problems
by
Yuan, Hao
, Xu, Xiaolong
, Matthew, Peter
, Trovati, Marcello
, Ray, Jeffrey
, Bagdasar, Ovidiu
in
Artificial Intelligence
/ Cities
/ Computational Intelligence
/ Control
/ Engineering
/ Genetic algorithms
/ Heuristic methods
/ Linear programming
/ Mathematical Logic and Foundations
/ Mechatronics
/ Methodologies and Application
/ Mutation
/ Revisions
/ Robotics
/ Traffic information
/ Traveling salesman problem
2020
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
You are currently in the queue to collect this book. You will be notified once it is your turn to collect the book.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
GORTS: genetic algorithm based on one-by-one revision of two sides for dynamic travelling salesman problems
by
Yuan, Hao
, Xu, Xiaolong
, Matthew, Peter
, Trovati, Marcello
, Ray, Jeffrey
, Bagdasar, Ovidiu
in
Artificial Intelligence
/ Cities
/ Computational Intelligence
/ Control
/ Engineering
/ Genetic algorithms
/ Heuristic methods
/ Linear programming
/ Mathematical Logic and Foundations
/ Mechatronics
/ Methodologies and Application
/ Mutation
/ Revisions
/ Robotics
/ Traffic information
/ Traveling salesman problem
2020
Oops! Something went wrong.
While trying to remove the title from your shelf something went wrong :( Kindly try again later!
Do you wish to request the book?
GORTS: genetic algorithm based on one-by-one revision of two sides for dynamic travelling salesman problems
by
Yuan, Hao
, Xu, Xiaolong
, Matthew, Peter
, Trovati, Marcello
, Ray, Jeffrey
, Bagdasar, Ovidiu
in
Artificial Intelligence
/ Cities
/ Computational Intelligence
/ Control
/ Engineering
/ Genetic algorithms
/ Heuristic methods
/ Linear programming
/ Mathematical Logic and Foundations
/ Mechatronics
/ Methodologies and Application
/ Mutation
/ Revisions
/ Robotics
/ Traffic information
/ Traveling salesman problem
2020
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
GORTS: genetic algorithm based on one-by-one revision of two sides for dynamic travelling salesman problems
Journal Article
GORTS: genetic algorithm based on one-by-one revision of two sides for dynamic travelling salesman problems
2020
Request Book From Autostore
and Choose the Collection Method
Overview
The dynamic travelling salesman problem (DTSP) is a natural extension of the standard travelling salesman problem, and it has attracted significant interest in recent years due to is practical applications. In this article, we propose an efficient solution for DTSP, based on a genetic algorithm (GA), and on the one-by-one revision of two sides (GORTS). More specifically, GORTS combines the global search ability of GA with the fast convergence feature of the method of one-by-one revision of two sides, in order to find the optimal solution in a short time. An experimental platform was designed to evaluate the performance of GORTS with TSPLIB. The experimental results show that the efficiency of GORTS compares favourably against other popular heuristic algorithms for DTSP. In particular, a prototype logistics system based on GORTS for a supermarket with an online map was designed and implemented. It was shown that this can provide optimised goods distribution routes for delivery staff, while considering real-time traffic information.
Publisher
Springer Berlin Heidelberg,Springer Nature B.V
Subject
This website uses cookies to ensure you get the best experience on our website.