Simulated annealing based GRASP for Pareto-optimal dissimilar paths problem
type: Item
instance of: scholarly article
title: Simulated annealing based GRASP for Pareto-optimal dissimilar paths problem
zbMATH Open document ID: 1391.90608
author: Linzhong Liu
author: Juhua Yang
author: Haibo Mu
published in: Soft Computing
publication date: 2018-02-27T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6844340
zbMATH Keywords: network
zbMATH Keywords: evolutionary algorithm (EA)
zbMATH Keywords: shortest path problem (SPP)
zbMATH Keywords: dissimilar path problem (DPP)
zbMATH Keywords: probability and risk
MaRDI profile type: Publication
full work available at URL: s00500-016-2137-7
OpenAlex ID: W2344703826
cites work: On finding dissimilar paths
cites work: A survey on metaheuristics for stochastic combinatorial optimization
cites work: Finding minimum and equitable risk routes for hazmat shipments
cites work: A bicriterion shortest path algorithm
cites work: Q4451071
cites work: Multi-objective optimization using evolutionary algorithms
cites work: On finding dissimilar Pareto-optimal paths
cites work: Tabu search and GRASP for the maximum diversity problem
cites work: Simulated annealing: A tool for operational research
cites work: The discrete p-dispersion problem
cites work: Modeling of transport risk for hazardous materials
cites work: A probabilistic heuristic for a computationally difficult set covering problem
cites work: Greedy randomized adaptive search procedures
cites work: Q4198056
cites work: Computational aspects of the maximum diversity problem
cites work: Q4692508
cites work: Q3968759
cites work: Optimization by Simulated Annealing
cites work: NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
cites work: A simulated annealing for multi-criteria network path problems
cites work: Heuristics for the bi-objective path dissimilarity problem
cites work: On a multicriteria shortest path problem
cites work: A genetic algorithms to solve the bicriteria shortest path problem
cites work: Integrated Routing and Scheduling in Hazardous Materials Transportation
cites work: Q4724391
cites work: Multiobjective routing of hazardous materials in stochastic networks
cites work: Using GIS to assess the risks of hazardous materials transport in networks
DOI: 10.1007/S00500-016-2137-7
Recommended article: Dynamic robot path planning using an enhanced simulated annealing approach
Recommended article: Path-planning for an autonomous robot using a simulating annealing
Recommended article: Coordinated Path Planning through Local Search and Simulated Annealing
Recommended article: Dynamic path planning of mobile robot based on improved simulated annealing algorithm
Recommended article: A simulated annealing for multi-criteria network path problems
Recommended article: Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
Recommended article: Experimental and Efficient Algorithms
Recommended article: A combined procedure for discrete simulation-optimization problems based on the simulated annealing framework
Recommended article: Q4363229
description: scientific article; zbMATH DE number 6844340