Simulated annealing based GRASP for Pareto-optimal dissimilar paths problem
DOI10.1007/S00500-016-2137-7zbMATH Open1391.90608OpenAlexW2344703826MaRDI QIDQ1701982FDOQ1701982
Authors: Linzhong Liu, Juhua Yang, Haibo Mu 
Publication date: 27 February 2018
Published in: Soft Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00500-016-2137-7
Recommendations
- Dynamic robot path planning using an enhanced simulated annealing approach
- Path-planning for an autonomous robot using a simulating annealing
- Coordinated Path Planning through Local Search and Simulated Annealing
- Dynamic path planning of mobile robot based on improved simulated annealing algorithm
- A simulated annealing for multi-criteria network path problems
- Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
- Experimental and Efficient Algorithms
- A combined procedure for discrete simulation-optimization problems based on the simulated annealing framework
- scientific article; zbMATH DE number 1086965
networkevolutionary algorithm (EA)shortest path problem (SPP)dissimilar path problem (DPP)probability and risk
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)
Cites Work
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- Title not available (Why is that?)
- Optimization by simulated annealing
- Title not available (Why is that?)
- Multi-objective optimization using evolutionary algorithms
- Title not available (Why is that?)
- A bicriterion shortest path algorithm
- A probabilistic heuristic for a computationally difficult set covering problem
- Greedy randomized adaptive search procedures
- On finding dissimilar Pareto-optimal paths
- On a multicriteria shortest path problem
- Finding minimum and equitable risk routes for hazmat shipments
- A survey on metaheuristics for stochastic combinatorial optimization
- Modeling of transport risk for hazardous materials
- Heuristics for the bi-objective path dissimilarity problem
- On finding dissimilar paths
- A simulated annealing for multi-criteria network path problems
- The discrete p-dispersion problem
- Computational aspects of the maximum diversity problem
- Integrated Routing and Scheduling in Hazardous Materials Transportation
- Tabu search and GRASP for the maximum diversity problem
- Using GIS to assess the risks of hazardous materials transport in networks
- Simulated annealing: A tool for operational research
- A genetic algorithms to solve the bicriteria shortest path problem
- Title not available (Why is that?)
- Multiobjective routing of hazardous materials in stochastic networks
- Title not available (Why is that?)
Cited In (4)
- Objectives and methods in multi-objective routing problems: a survey and classification scheme
- A simulated annealing for multi-criteria network path problems
- Heuristics for the bi-objective path dissimilarity problem
- Pareto solution set and its genetic algorithm for multi-objective network dissimilar paths
This page was built for publication: Simulated annealing based GRASP for Pareto-optimal dissimilar paths problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1701982)
