## Abstract

A traveling salesman has to complete a tour comprised out of n cities. The tour starts and ends at one of the cities and must pass through all n cities. There are several travelling options between every pair of cities which differ in their costs and durations. When completing the tour, the travelling salesman will receive a predefined known income. The salesman's profit per time is defined as the profit gained after completing the tour (calculated by subtracting the route's costs from the profit) divided by the total time required to complete the tour. This problem is a new practical and more complex (due to the multiple travelling options) extension of the well-studied TSP. This paper defines the problem and presents an iterative solution procedure, which converges after a limited number of iterations, with the same time complexity of solving the classical TSP (optimally or heuristically).

Original language | English |
---|---|

State | Published - 1 Jan 2013 |

Event | 22nd International Conference on Production Research, ICPR 2013 - Parana, Brazil Duration: 28 Jul 2013 → 1 Aug 2013 |

### Conference

Conference | 22nd International Conference on Production Research, ICPR 2013 |
---|---|

Country/Territory | Brazil |

City | Parana |

Period | 28/07/13 → 1/08/13 |

## Keywords

- Meta-heuristics
- Profit per unit time
- Travelling salesman problem

## ASJC Scopus subject areas

- Computer Science Applications
- Industrial and Manufacturing Engineering
- Control and Systems Engineering