A simulated annealing for multi-criteria network path problems
From MaRDI portal
Recommendations
- Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms
- scientific article; zbMATH DE number 2102229
- Simulated annealing based GRASP for Pareto-optimal dissimilar paths problem
- Multicriteria path and tree problems: discussion on exact algorithms and applications
- On a multicriteria shortest path problem
Cites work
- scientific article; zbMATH DE number 3965788 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3997507 (Why is no real title available?)
- scientific article; zbMATH DE number 821272 (Why is no real title available?)
- scientific article; zbMATH DE number 3240118 (Why is no real title available?)
- A comparison of solution strategies for biobjective shortest path problems
- A genetic algorithms to solve the bicriteria shortest path problem
- A label correcting approach for solving bicriterion shortest-path problems
- A note on two problems in connexion with graphs
- A penalty function heuristic for the resource constrained shortest path problem
- An effective genetic algorithm approach to multiobjective routing problems (MORPs)
- An improved FPTAS for Restricted Shortest Path.
- Chance-constrained programming
- Dynamic shortest path in stochastic dynamic networks: Ship routing problem
- Fuzzy shortest path problems incorporating interactivity among paths.
- Genetic algorithms for rerouting shortest paths in dynamic and stochastic networks
- Graph theory
- Heuristics for the bi-objective path dissimilarity problem
- Least possible time paths in stochastic, time-varying networks.
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- Near-shortest and K-shortest simple paths
- On finding dissimilar paths
- On the shortest route through a network
- Optimization by simulated annealing
- Simulated annealing: A tool for operational research
- Solving the bicriteria traffic equilibrium problem with variable demand and nonlinear path costs
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
- The shortest route through a network with time-dependent internodal transit times
- The transit route arc-node service maximization problem
- Theory and practice of uncertain programming
- User equilibrium in traffic assignment problem with fuzzy N-A incidence matrix
Cited in
(12)- scientific article; zbMATH DE number 5116456 (Why is no real title available?)
- scientific article; zbMATH DE number 1488895 (Why is no real title available?)
- Exact algorithms for multi-criteria multi-modal shortest path with transfer delaying and arriving time-window in urban transit network
- A conflict-congestion model for pedestrian-vehicle mixed evacuation based on discrete particle swarm optimization algorithm
- Common route planning for carpoolers -- model and exact algorithm
- A simulated annealing methodology to distribution network design and management
- The cross-entropy method for solving bi-criteria network flow problems in discrete-time dynamic networks
- Planning efficient 4D trajectories in air traffic flow management.
- Ant algorithms and simulated annealing for multicriteria dynamic programming
- Generic constraints handling techniques in constrained multi-criteria optimization and its application
- A personalized urban multicriteria shortest path stochastic optimization algorithm
- Simulated annealing based GRASP for Pareto-optimal dissimilar paths problem
This page was built for publication: A simulated annealing for multi-criteria network path problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q339658)
