---
_id: '48852'
abstract:
- lang: eng
  text: The Traveling Salesperson Problem (TSP) is one of the best-known combinatorial
    optimisation problems. However, many real-world problems are composed of several
    interacting components. The Traveling Thief Problem (TTP) addresses such interactions
    by combining two combinatorial optimisation problems, namely the TSP and the Knapsack
    Problem (KP). Recently, a new problem called the node weight dependent Traveling
    Salesperson Problem (W-TSP) has been introduced where nodes have weights that
    influence the cost of the tour. In this paper, we compare W-TSP and TTP. We investigate
    the structure of the optimised tours for W-TSP and TTP and the impact of using
    each others fitness function. Our experimental results suggest (1) that the W-TSP
    often can be solved better using the TTP fitness function and (2) final W-TSP
    and TTP solutions show different distributions when compared with optimal TSP
    or weighted greedy solutions.
author:
- first_name: Jakob
  full_name: Bossek, Jakob
  id: '102979'
  last_name: Bossek
  orcid: 0000-0002-4121-4668
- first_name: Aneta
  full_name: Neumann, Aneta
  last_name: Neumann
- first_name: Frank
  full_name: Neumann, Frank
  last_name: Neumann
citation:
  ama: 'Bossek J, Neumann A, Neumann F. Optimising Tours for the Weighted Traveling
    Salesperson Problem and the Traveling Thief Problem: A Structural Comparison of
    Solutions. In: <i>Parallel Problem Solving from Nature (PPSN XVI)</i>. Springer-Verlag;
    2020:346–359. doi:<a href="https://doi.org/10.1007/978-3-030-58112-1_24">10.1007/978-3-030-58112-1_24</a>'
  apa: 'Bossek, J., Neumann, A., &#38; Neumann, F. (2020). Optimising Tours for the
    Weighted Traveling Salesperson Problem and the Traveling Thief Problem: A Structural
    Comparison of Solutions. <i>Parallel Problem Solving from Nature (PPSN XVI)</i>,
    346–359. <a href="https://doi.org/10.1007/978-3-030-58112-1_24">https://doi.org/10.1007/978-3-030-58112-1_24</a>'
  bibtex: '@inproceedings{Bossek_Neumann_Neumann_2020, place={Berlin, Heidelberg},
    title={Optimising Tours for the Weighted Traveling Salesperson Problem and the
    Traveling Thief Problem: A Structural Comparison of Solutions}, DOI={<a href="https://doi.org/10.1007/978-3-030-58112-1_24">10.1007/978-3-030-58112-1_24</a>},
    booktitle={Parallel Problem Solving from Nature (PPSN XVI)}, publisher={Springer-Verlag},
    author={Bossek, Jakob and Neumann, Aneta and Neumann, Frank}, year={2020}, pages={346–359}
    }'
  chicago: 'Bossek, Jakob, Aneta Neumann, and Frank Neumann. “Optimising Tours for
    the Weighted Traveling Salesperson Problem and the Traveling Thief Problem: A
    Structural Comparison of Solutions.” In <i>Parallel Problem Solving from Nature
    (PPSN XVI)</i>, 346–359. Berlin, Heidelberg: Springer-Verlag, 2020. <a href="https://doi.org/10.1007/978-3-030-58112-1_24">https://doi.org/10.1007/978-3-030-58112-1_24</a>.'
  ieee: 'J. Bossek, A. Neumann, and F. Neumann, “Optimising Tours for the Weighted
    Traveling Salesperson Problem and the Traveling Thief Problem: A Structural Comparison
    of Solutions,” in <i>Parallel Problem Solving from Nature (PPSN XVI)</i>, 2020,
    pp. 346–359, doi: <a href="https://doi.org/10.1007/978-3-030-58112-1_24">10.1007/978-3-030-58112-1_24</a>.'
  mla: 'Bossek, Jakob, et al. “Optimising Tours for the Weighted Traveling Salesperson
    Problem and the Traveling Thief Problem: A Structural Comparison of Solutions.”
    <i>Parallel Problem Solving from Nature (PPSN XVI)</i>, Springer-Verlag, 2020,
    pp. 346–359, doi:<a href="https://doi.org/10.1007/978-3-030-58112-1_24">10.1007/978-3-030-58112-1_24</a>.'
  short: 'J. Bossek, A. Neumann, F. Neumann, in: Parallel Problem Solving from Nature
    (PPSN XVI), Springer-Verlag, Berlin, Heidelberg, 2020, pp. 346–359.'
date_created: 2023-11-14T15:58:54Z
date_updated: 2023-12-13T10:44:54Z
department:
- _id: '819'
doi: 10.1007/978-3-030-58112-1_24
extern: '1'
keyword:
- Evolutionary algorithms
- Node weight dependent TSP
- Traveling Thief Problem
language:
- iso: eng
page: 346–359
place: Berlin, Heidelberg
publication: Parallel Problem Solving from Nature (PPSN XVI)
publication_identifier:
  isbn:
  - 978-3-030-58111-4
publication_status: published
publisher: Springer-Verlag
status: public
title: 'Optimising Tours for the Weighted Traveling Salesperson Problem and the Traveling
  Thief Problem: A Structural Comparison of Solutions'
type: conference
user_id: '102979'
year: '2020'
...