Name
Abstract | ||
|---|---|---|
In this paper, we introduce a class of new selection and routing problems, and name it as the traveling salesman problem with profits and stochastic customers (TSPPSC), which is an extension of the traveling salesman problem with profits (TSPP). The class of new problems is put forward to address how to deal with stochastic customer presence under the environment in which an associated profit is obtained once a customer is visited. It is defined on a complete graph in which profits are associated with the vertices and travel costs are associated with the edges. Each vertex (customer) has a probability of requiring a visit. The objective is the simultaneous optimization of the expected collected profits and expected travel costs. According to the way the two objectives (profits and travel costs) are addressed, TSPPSC is categorized into three subproblems. Mathematical formulations are provided for these problems and a genetic algorithm is proposed to solve one of these subproblems. Computational experiments conducted on several sets of instances show a good performance of the proposed algorithm. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1111/itor.12310 | INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH |
Keywords | Field | DocType |
stochastic routing, profit, stochastic customers, genetic algorithm | Mathematical optimization,Economics,Travelling salesman problem,Genetic algorithm,Stochastic routing,Profit (economics) | Journal |
Volume | Issue | ISSN |
25 | 4 | 0969-6016 |
Citations | PageRank | References |
1 | 0.35 | 18 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mengying Zhang | 1 | 8 | 6.72 |
| Jin Qin | 2 | 2 | 2.39 |
| Yugang Yu | 3 | 143 | 25.29 |
| Liang Liang | 4 | 1344 | 92.90 |