How to use combinatorial optimization problems (traveling salesman problem) for procedural landscape generation

Alan Ehret, Peter Jamieson, Lindsay Grace

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this paper, we examine how the traveling salesman problem (a combinatorial optimization problem) can be used to create virtual landscapes. For this work, we show how the entire search space of ten city TSP instances can be organized into virtual landscapes, and illustrate how by changing the TSP instance problem we can control some properties of these landscapes. We provide three different methodologies for producing landscapes and show results for TSP problem instances. Our results show that our one of our methodologies generates the best aesthetically looking results and can be controlled by the problem.

Original languageEnglish (US)
Title of host publication16th International Conference on Intelligent Games and Simulation, GAME ON 2015
EditorsFrank Nack, Sander Bakkes
PublisherEUROSIS
Pages94-98
Number of pages5
ISBN (Electronic)9789077381915
StatePublished - 2015
Externally publishedYes
Event16th International Conference on Intelligent Games and Simulation, GAME ON 2015 - Amsterdam, Netherlands
Duration: Dec 2 2015Dec 4 2015

Publication series

Name16th International Conference on Intelligent Games and Simulation, GAME ON 2015

Conference

Conference16th International Conference on Intelligent Games and Simulation, GAME ON 2015
Country/TerritoryNetherlands
CityAmsterdam
Period12/2/1512/4/15

Keywords

  • Landscape generation
  • Traveling salesman problem

ASJC Scopus subject areas

  • Artificial Intelligence
  • Human-Computer Interaction
  • Modeling and Simulation

Fingerprint

Dive into the research topics of 'How to use combinatorial optimization problems (traveling salesman problem) for procedural landscape generation'. Together they form a unique fingerprint.

Cite this