Name
Title | ||
|---|---|---|
An Improved Augmented ε-Constraint and Branch-and-Cut Method to Solve the TSP With Profits. |
Abstract | ||
|---|---|---|
In this paper, a novel approach is presented to solve the traveling salesman problem with profits (TSPP). This problem is an extension of the famous traveling salesman problem (TSP) in which a prize is associated with each vertex. The aim here is to find a route that simultaneously minimizes the tour length and maximizes the collected prize. A new method, AUGMECON2-BC, was developed incorporating ... |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1109/TITS.2018.2808179 | IEEE Transactions on Intelligent Transportation Systems |
Keywords | DocType | Volume |
Optimization,Traveling salesman problems,Approximation algorithms,Intelligent transportation systems,Transforms,Libraries,Indexes | Journal | 20 |
Issue | ISSN | Citations |
1 | 1524-9050 | 0 |
PageRank | References | Authors |
0.34 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Soumaya Ait Bouziaren | 1 | 0 | 0.34 |
| Brahim Aghezzaf | 2 | 12 | 3.43 |