Name
Abstract | ||
|---|---|---|
The traveling car renter problem (CaRS) is an extension of the classical traveling salesman problem (TSP) where different cars are available for use during the salesman’s tour. In this study we present three integer programming formulations for CaRS, of which two have quadratic objective functions and the other has quadratic constraints. The first model with a quadratic objective function is grounded on the TSP interpreted as a special case of the quadratic assignment problem in which the assignment variables refer to visitation orders. The second model with a quadratic objective function is based on the Gavish and Grave’s formulation for the TSP. The model with quadratic constraints is based on the Dantzig–Fulkerson–Johnson’s formulation for the TSP. The formulations are linearized and implemented in two solvers. An experiment with 50 instances is reported. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1007/s11590-017-1138-5 | Optimization Letters |
Keywords | Field | DocType |
Traveling car renter problem, Traveling salesman, Integer programming, Combinatorial optimization | Bottleneck traveling salesman problem,Traveling purchaser problem,Mathematical optimization,Quadratic assignment problem,Cross-entropy method,Combinatorial optimization,Travelling salesman problem,2-opt,Quadratic programming,Mathematics | Journal |
Volume | Issue | ISSN |
12 | 4 | 1862-4472 |
Citations | PageRank | References |
1 | 0.36 | 13 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Marco César Goldbarg | 1 | 96 | 10.64 |
| Elizabeth F.G. Goldbarg | 2 | 119 | 16.22 |
| H. P. Luna | 3 | 55 | 7.39 |
| Matheus da Silva Menezes | 4 | 2 | 0.72 |
| Lucas Corrales | 5 | 1 | 0.36 |