An exact method for the biobjective shortest path problem for large-scale road networks

DOI10.1016/j.ejor.2014.11.003zbMath1341.90023OpenAlexW1997822129WikidataQ58759967 ScholiaQ58759967MaRDI QIDQ2630225

Daniel Duque, Leonardo Lozano, Andrés L. Medaglia

Publication date: 26 July 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2014.11.003

zbMATH Keywords

routingmultiobjective combinatorial optimization (MOCO)multiobjective shortest pathbiobjective shortest pathpulse algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Multi-objective and goal programming (90C29) Deterministic network models in operations research (90B10)

Related Items (16)

Multi-objective particle swarm optimization for mechanical harvester route planning of sugarcane field operations ⋮ Reliability of spare routing via intersectional minimal paths within budget and time constraints by simulation ⋮ Solving the orienteering problem with time windows via the pulse framework ⋮ An Efficient Label-Correcting Algorithm for the Multiobjective Shortest Path Problem ⋮ An improved multiobjective shortest path algorithm ⋮ A discrete optimisation approach for target path planning whilst evading sensors ⋮ Exact bidirectional algorithm for the least expected travel-time path problem on stochastic and time-dependent networks ⋮ Solving the multi‐objective bike routing problem by meta‐heuristic algorithms ⋮ An exact bidirectional pulse algorithm for the constrained shortest path ⋮ Simple and efficient bi-objective search algorithms via fast dominance checks ⋮ On modelling and solving the shortest path problem with evidential weights ⋮ Optimization problems with evidential linear objective ⋮ A biobjective Dijkstra algorithm ⋮ Facing robustness as a multi-objective problem: a bi-objective shortest path problem in smart regions ⋮ Path planning and vehicle scheduling optimization for logistic distribution of hazardous materials in full container load ⋮ Shortest paths with ordinal weights

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On an exact method for the constrained shortest path problem
• A comparison of heuristic best-first algorithms for bicriterion shortest path problems
• Acceleration strategies for the weight constrained shortest path problem with replenishment
• An aggregate label setting policy for the multi-objective shortest path problem
• On a multicriteria shortest path problem
• Generalized dynamic programming for multicriteria optimization
• A comparison of solution strategies for biobjective shortest path problems
• A multicriteria Pareto-optimal path algorithm
• Shortest paths algorithms: Theory and experimental evaluation
• A label correcting approach for solving bicriterion shortest-path problems
• On the cardinality of the Pareto set in bicriteria shortest path problems
• Speeding up Martins' algorithm for multiple objective shortest path problems
• A survey of recent developments in multiobjective optimization
• Modeling of Transport Risk for Hazardous Materials
• Solving Real-World Linear Programs: A Decade and More of Progress
• An algorithm for the resource constrained shortest path problem
• Applications of Multi-Objective Evolutionary Algorithms
• Multicriteria path and tree problems: discussion on exact algorithms and applications
• Route Planning with Flexible Objective Functions
• Multicriteria Optimization
• Near-shortest and K-shortest simple paths
• Evolutionary Algorithms for Solving Multi-Objective Problems
• Label correcting methods to solve multicriteria shortest path problems

This page was built for publication: An exact method for the biobjective shortest path problem for large-scale road networks