2019
DOI: 10.1007/s12469-019-00204-1
|View full text |Cite
|
Sign up to set email alerts
|

A*-guided heuristic for a multi-objective bus passenger Trip Planning Problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
1
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 11 publications
0
1
0
Order By: Relevance
“…The trip planning problem (TPP) in this paper is the problem that finds the optimal route to visit a series of point-ofinterests (POIs) and hotels over multiple days [1]- [4]. For example, Sylejmani et al [1] presented a method that solves the trip planning problem using a heuristic algorithm based on tabu search; Saeki et al [2] presented a method for planning a multi-objective trip using antcolony optimization; Fournier et al [3] showed a method that solves the bus passenger trip planning problem using an A*-guided and Pareto dominance-based heuristic; Garcia et al [4] presented two different methods to solving the time-dependent team orienteering problem with time windows; Shuai et al [5] presented a method that solves multiple traveling salesman problems by applying an NSGA-II framework; He et al [6] presented a hybrid method based on tabu search and intratour optimization to solve the multiple traveling salesman problems.…”
Section: A Trip Planning Problemmentioning
confidence: 99%
“…The trip planning problem (TPP) in this paper is the problem that finds the optimal route to visit a series of point-ofinterests (POIs) and hotels over multiple days [1]- [4]. For example, Sylejmani et al [1] presented a method that solves the trip planning problem using a heuristic algorithm based on tabu search; Saeki et al [2] presented a method for planning a multi-objective trip using antcolony optimization; Fournier et al [3] showed a method that solves the bus passenger trip planning problem using an A*-guided and Pareto dominance-based heuristic; Garcia et al [4] presented two different methods to solving the time-dependent team orienteering problem with time windows; Shuai et al [5] presented a method that solves multiple traveling salesman problems by applying an NSGA-II framework; He et al [6] presented a hybrid method based on tabu search and intratour optimization to solve the multiple traveling salesman problems.…”
Section: A Trip Planning Problemmentioning
confidence: 99%
“…Their approach consists of the use of connected vehicle technologies and the implementation and an adaptive optimization model of signal synchronization. The authors of [38] are also interested in the optimization of transit based on AVL data.…”
Section: Automatic Vehicle Locationmentioning
confidence: 99%