#6428. The Steiner bi-objective shortest path problem

November 2026publication date
Proposal available till 22-05-2025
4 total number of authors per manuscript0 $

The title of the journal is available only for the authors who have already paid for
Journal’s subject area:
Computational Mathematics;
Management Science and Operations Research;
Control and Optimization;
Modeling and Simulation;
Places in the authors’ list:
place 1place 2place 3place 4
FreeFreeFreeFree
2350 $1200 $1050 $900 $
Contract №6428.1 Contract №6428.2 Contract №6428.3 Contract №6428.4
1 place - free (for sale)
2 place - free (for sale)
3 place - free (for sale)
4 place - free (for sale)

Abstract:
In this paper, we introduce the Steiner Bi-objective Shortest Path Problem. This problem is defined on a directed graph G=(V,A), with a subset T?V of terminals. Arcs are labeled with travel time and cost. The goal is to find a complete set of efficient paths between every pair of nodes in T. The motivation behind this problem stems from data preprocessing for vehicle routing problems. We propose a solution method based on a labeling approach with a multi-objective A* search strategy guiding the search towards the terminals.
Keywords:
A* algorithm; Multiple destinations; Vehicle routing with road-network information

Contacts :
0