A simulated annealing for multi-criteria network path problems
From MaRDI portal
Publication:339658
DOI10.1016/j.cor.2012.03.013zbMath1349.90861OpenAlexW2064032657MaRDI QIDQ339658
Xiaojing Li, Linzhong Liu, Haiyan Luo, Hai Bo Mu
Publication date: 11 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2012.03.013
Programming involving graphs or networks (90C35) Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)
Related Items (8)
Exact algorithms for multi-criteria multi-modal shortest path with transfer delaying and arriving time-window in urban transit network ⋮ Generic constraints handling techniques in constrained multi-criteria optimization and its application ⋮ A personalized urban multicriteria shortest path stochastic optimization algorithm ⋮ The cross-entropy method for solving bi-criteria network flow problems in discrete-time dynamic networks ⋮ Common Route Planning for Carpoolers – Model and Exact Algorithm ⋮ Simulated annealing based GRASP for Pareto-optimal dissimilar paths problem ⋮ Planning efficient 4D trajectories in air traffic flow management. ⋮ A conflict-congestion model for pedestrian-vehicle mixed evacuation based on discrete particle swarm optimization algorithm
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- Optimization by Simulated Annealing
- Solving the bicriteria traffic equilibrium problem with variable demand and nonlinear path costs
- The transit route arc-node service maximization problem
- Simulated annealing: A tool for operational research
- A comparison of solution strategies for biobjective shortest path problems
- Heuristics for the bi-objective path dissimilarity problem
- User equilibrium in traffic assignment problem with fuzzy N-A incidence matrix
- Least possible time paths in stochastic, time-varying networks.
- Fuzzy shortest path problems incorporating interactivity among paths.
- An effective genetic algorithm approach to multiobjective routing problems (MORPs)
- A penalty function heuristic for the resource constrained shortest path problem
- An improved FPTAS for Restricted Shortest Path.
- Genetic algorithms for rerouting shortest paths in dynamic and stochastic networks
- Dynamic shortest path in stochastic dynamic networks: Ship routing problem
- Theory and practice of uncertain programming
- On finding dissimilar paths
- A label correcting approach for solving bicriterion shortest-path problems
- The shortest route through a network with time-dependent internodal transit times
- On the Shortest Route Through a Network
- Chance-Constrained Programming
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- Near-shortest and K-shortest simple paths
This page was built for publication: A simulated annealing for multi-criteria network path problems
