A relation of dominance for the bicriterion bus routing problem
From MaRDI portal
Publication:2012147
DOI10.1515/amcs-2017-0010zbMath1367.90100OpenAlexW2604548120MaRDI QIDQ2012147
Publication date: 28 July 2017
Published in: International Journal of Applied Mathematics and Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/amcs-2017-0010
transportation problemmulticriteria optimizationvariable weightslabel correcting algorithmbicriterion shortest path problemset of non-dominated solutions
Applications of graph theory (05C90) Multi-objective and goal programming (90C29) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A column generation approach for a school bus routing problem with resource constraints
- A school bus scheduling problem
- On finding dissimilar Pareto-optimal paths
- On a multicriteria shortest path problem
- Shortest paths in networks with vector weights
- A parametric approach to solving bicriterion shortest path problems
- Graphs, networks and algorithms
- Generalized dynamic programming for multicriteria optimization
- A comparison of solution strategies for biobjective shortest path problems
- Heuristics for the bi-objective path dissimilarity problem
- The school bus routing problem: a review
- The shortest path problem with two objective functions
- A bicriterion shortest path algorithm
- A multicriteria Pareto-optimal path algorithm
- Multicriteria optimization
- Solving school bus routing using the multiple vehicle traveling purchaser problem: a branch-and-cut approach
- An empirical investigation of some bicriterion shortest path algorithms
- A label correcting approach for solving bicriterion shortest-path problems
- A Label Correcting Algorithm for the Bus Routing Problem
- Note on Multiple Objective Dynamic Programming
- School bus routing—a column generation approach
This page was built for publication: A relation of dominance for the bicriterion bus routing problem