We address a special TSP in which the set of cities is partitioned into two subsets: mandatory cities and selective cities. All mandatory cities should be visited once within one of the corresponding predefined multiple time windows. A subset of the selective cities, whose cardinality depends on the tour completion time, should be visited within one of the associated multiple time windows. The objective is to plan a tour, not exceeding a predefined number of days, that minimizes a linear combination of the total traveled distance as well as the total waiting time. We present a mixed integer linear programming (MILP) model for the problem and propose a heuristic approach to solve it. Computational experiments address two real world problems that arise in different practical contexts. © 2013 Springer-Verlag.
CITATION STYLE
Mesquita, M., Murta, A., Paias, A., & Wise, L. (2013). TSP with multiple time-windows and selective cities. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8197 LNCS, pp. 158–172). Springer Verlag. https://doi.org/10.1007/978-3-642-41019-2_12
Mendeley helps you to discover research relevant for your work.