Book Image

Applied Geospatial Data Science with Python

By : David S. Jordan
3 (1)
Book Image

Applied Geospatial Data Science with Python

3 (1)
By: David S. Jordan

Overview of this book

Data scientists, when presented with a myriad of data, can often lose sight of how to present geospatial analyses in a meaningful way so that it makes sense to everyone. Using Python to visualize data helps stakeholders in less technical roles to understand the problem and seek solutions. The goal of this book is to help data scientists and GIS professionals learn and implement geospatial data science workflows using Python. Throughout this book, you’ll uncover numerous geospatial Python libraries with which you can develop end-to-end spatial data science workflows. You’ll learn how to read, process, and manipulate spatial data effectively. With data in hand, you’ll move on to crafting spatial data visualizations to better understand and tell the story of your data through static and dynamic mapping applications. As you progress through the book, you’ll find yourself developing geospatial AI and ML models focused on clustering, regression, and optimization. The use cases can be leveraged as building blocks for more advanced work in a variety of industries. By the end of the book, you’ll be able to tackle random data, find meaningful correlations, and make geospatial data models.
Table of Contents (17 chapters)
1
Part 1:The Essentials of Geospatial Data Science
Free Chapter
2
Chapter 1: Introducing Geographic Information Systems and Geospatial Data Science
6
Part 2: Exploratory Spatial Data Analysis
10
Part 3: Geospatial Modeling Case Studies

Exploring route-based combinatorial optimization problems

Route-based combinatorial optimization problems set out to solve the most efficient route from point A to a set of destination points. These points are also referred to as nodes using terminology from graph theory. These problems can be simple, where a person or a vehicle departs a starting point and must travel to a set of destination points while visiting each point only once before returning to the origin point, all while minimizing the distance traveled. This is formally known as the Traveling Salesperson Problem (TSP). This problem can easily become more complicated when you add in a set of vehicles or people visiting destinations instead of a single vehicle or person in the TSP problem. This is known as a Vehicle Routing Problem (VRP). To solve this problem, you must find the optimal routes for a set of vehicles to traverse to visit a given set of customers. Additional complexity can be added to this problem class in instances...