Approximate and exact algorithms for an energy minimization traveling salesman problem

Energy saving is a great challenge for clean transportation. In this paper, we study the Energy Minimization Traveling Salesman Problem (EMTSP), which is a generation of the classical Traveling Salesman Problem (TSP), and an important theoretical basis and a special case of the Energy Minimization V...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of cleaner production Vol. 249; p. 119433
Main Authors:	Wang, Shijin, Liu, Ming, Chu, Feng
Format:	Journal Article
Language:	English
Published:	Elsevier Ltd 10.03.2020 Elsevier
Subjects:	algorithms Approximation algorithm Branch and bound Christofides’s heuristic Computer Science energy energy conservation Energy minimization Operations Research transportation Traveling salesman problem Traveling salesman problem Energy minimization Branch and bound Approximation algorithm Christofides’s heuristic Christofides's heuristic
ISSN:	0959-6526, 1879-1786
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!