What question did this study set out to answer?

This research aims to develop a combinatorial optimization model for routing spacecraft in multi-spacecraft missions.

April 10, 2026Open Access

Interplanetary Vehicle Routing Problem (IVRP)

Key Points

This research aims to develop a combinatorial optimization model for routing spacecraft in multi-spacecraft missions.
Introduces the Interplanetary Vehicle Routing Problem (IVRP) as a variant of the capacitated Vehicle Routing Problem with Time Windows (VRPTW).
Utilizes time-dependent transfer costs computed via Lambert’s problem.
Considers planetary alignment windows as hard time constraints similar to VRPTW time windows.
Demonstrates the applicability of IVRP for optimizing spacecraft routes.
Shows that routing can meet both payload and propellant constraints effectively.

Abstract

The Interplanetary Vehicle Routing Problem (IVRP) is introduced as a novel combinatorial optimization variant that extends the capacitated Vehicle Routing Problem with Time Windows (VRPTW) to the domain of multi-spacecraft mission design. In IVRP, a fleet of spacecraft departs from a central orbital depot and must visit a set of planetary or orbital targets, delivering cargo subject to payload and propellant (∆V-budget) constraints. Arc costs are not fixed distances but time-dependent transfer costs computed via Lambert’s problem, an orbital two-point boundary-value problem. Planetary alignment windows induce hard time constraints analogous to VRPTW time windows.

Read Full Paperexternally

Bookmark

View Full Paper

Cite This Study

Guilherme A. Zeni (Wed,) studied this question.

synapsesocial.com/papers/69d896406c1944d70ce07870 https://doi.org/https://doi.org/10.5281/zenodo.19475129

Bookmark

View Full Paper