A personalized urban multicriteria shortest path stochastic optimization algorithm

DOI10.1155/2015/987358zbMATH Open1394.90444OpenAlexW2179763912WikidataQ59120146 ScholiaQ59120146MaRDI QIDQ1667149FDOQ1667149

Authors: Gong Bowen, Lin Ciyun 

Publication date: 27 August 2018

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2015/987358

Recommendations

• A shortest path problem in an urban transportation network based on driver perceived travel time
• Heuristics for the stochastic/dynamic user-optimal route choice problem
• Time dependent multiobjective best path for multimodal urban routing
• Solving an Instantaneous Dynamic User-Optimal Route Choice Model
• Mining driving preferences in multi-cost networks

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Stochastic programming (90C15)

Cites Work

• An effective genetic algorithm approach to multiobjective routing problems (MORPs)
• A simulated annealing for multi-criteria network path problems
• Label correcting methods to solve multicriteria shortest path problems
• A knowledge-based evolutionary algorithm for the multiobjective vehicle routing problem with time windows
• An aggregate label setting policy for the multi-objective shortest path problem
• Exact algorithms for multi-criteria multi-modal shortest path with transfer delaying and arriving time-window in urban transit network

Cited In (2)

• A utility measure for finding multiobjective shortest paths in urban multimodal transportation networks
• Optimizing open-pit truck route based on minimization of time-varying transport energy consumption

This page was built for publication: A personalized urban multicriteria shortest path stochastic optimization algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1667149)