A personalized urban multicriteria shortest path stochastic optimization algorithm

DOI10.1155/2015/987358MaRDI QIDQ1667149zbMATH OpenOpenAlexWikidataFDO

Authors Gong Bowen, Lin Ciyun

Publication date 27 August 2018

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

Copyright license Creative Commons Attribution 4.0 International

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

Mathematics Subject Classification ID

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

Review text

Summary: Drivers' route choice behavior is usually personalized and multicriteria in practice. Therefore, the urban shortest path problem is the personalized urban multicriteria shortest path (PUMSP) problem. However, the solutions of the PUMSP problem are difficult to meet the drivers' travel habits in the state of the art. To solve this problem, first, a new stochastic optimization algorithm based on the iterative calculation of a valid route set is proposed in this paper. The effective and reasonable path searching mechanism is designed based on drivers' route choice habits. Then, the evaluation method of calculation results is given. The comparative experimental results with the genetic algorithm show that the proposed algorithm has reached better results in the evaluation parameters and computing time. The experimental results also demonstrate that it is meaningful to consider drivers' travel law in the personalized urban multicriteria shortest path algorithm design for avoiding obtaining impractical routes solutions.

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

Cites work

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

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)