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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Journal of cleaner production Ročník 249; s. 119433
Hlavní autori:	Wang, Shijin, Liu, Ming, Chu, Feng
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Ltd 10.03.2020 Elsevier
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!