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ženo v:
Podrobná bibliografie
Vydáno v:Journal of cleaner production Ročník 249; s. 119433
Hlavní autoři: Wang, Shijin, Liu, Ming, Chu, Feng
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier Ltd 10.03.2020
Elsevier
Témata:
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 přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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 Vehicle Routing Problem (EMVRP). The objective of the studied problem is to minimize the sum of the product of load (including curb weight of the vehicle) and traveled distances. An approximation algorithm based on the Christofides’s Heuristic is proposed and its worst-case ratio bound is proven. A branch and bound (B&B) algorithm integrated with a fast 1-tree based lower bound is developed to obtain optimal solutions. The results of computational experiments show the efficiency and the effectiveness of the B&B algorithm, as well as the heuristic methods.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0959-6526
1879-1786
DOI:10.1016/j.jclepro.2019.119433