Next Article in Journal
Integrated Design of a Supermarket Refrigeration System by Means of Experimental Design Adapted to Computational Problems
Previous Article in Journal
Fast and Interactive Positioning of Proteins within Membranes
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

An Algorithm for Generating a Diverse Set of Multi-Modal Journeys

Department of Computer Science, KU Leuven, 9000 Gent, Belgium
*
Author to whom correspondence should be addressed.
Algorithms 2022, 15(11), 416; https://doi.org/10.3390/a15110416
Submission received: 28 July 2022 / Revised: 24 October 2022 / Accepted: 4 November 2022 / Published: 7 November 2022
(This article belongs to the Section Combinatorial Optimization, Graph, and Network Algorithms)

Abstract

A direct way of reducing the number of cars on the road is to dissuade individuals from exclusively using their car and instead integrate public transport into their daily routine. Planning multi-modal journeys is a complex task for which individuals often rely on decision support tools. However, offering individuals different journey options represents a significant algorithmic challenge. The failure to provide users with a set of journey options that differ considerably from one another in terms of the modes of transport employed is currently preventing the widespread uptake of multi-modal journey planning among the general public. In this paper, we introduce a dynamic programming algorithm that remedies this situation by modeling different transport networks as a graph that is then pruned by various graph-reduction pre-processing techniques. This approach enables us to offer a diverse set of efficient multi-modal solutions to users almost instantaneously. A computational study on three datasets corresponding to various real-world mobility networks with up to 30,000 vertices and 596,000 arcs demonstrates the effectiveness of the proposed algorithm.
Keywords: shortest path; multi-modal transportation; solution diversity; multi-objective optimization; dynamic programming shortest path; multi-modal transportation; solution diversity; multi-objective optimization; dynamic programming

Share and Cite

MDPI and ACS Style

Mosquera, F.; Smet, P.; Vanden Berghe, G. An Algorithm for Generating a Diverse Set of Multi-Modal Journeys. Algorithms 2022, 15, 416. https://doi.org/10.3390/a15110416

AMA Style

Mosquera F, Smet P, Vanden Berghe G. An Algorithm for Generating a Diverse Set of Multi-Modal Journeys. Algorithms. 2022; 15(11):416. https://doi.org/10.3390/a15110416

Chicago/Turabian Style

Mosquera, Federico, Pieter Smet, and Greet Vanden Berghe. 2022. "An Algorithm for Generating a Diverse Set of Multi-Modal Journeys" Algorithms 15, no. 11: 416. https://doi.org/10.3390/a15110416

APA Style

Mosquera, F., Smet, P., & Vanden Berghe, G. (2022). An Algorithm for Generating a Diverse Set of Multi-Modal Journeys. Algorithms, 15(11), 416. https://doi.org/10.3390/a15110416

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop