Simulated annealing based GRASP for Pareto-optimal dissimilar paths problem
From MaRDI portal
Publication:1701982
DOI10.1007/s00500-016-2137-7zbMath1391.90608OpenAlexW2344703826MaRDI QIDQ1701982
Linzhong Liu, Juhua Yang, Hai Bo 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
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)
Related Items (1)
Cites Work
- Optimization by Simulated Annealing
- A simulated annealing for multi-criteria network path problems
- On finding dissimilar Pareto-optimal paths
- On a multicriteria shortest path problem
- Finding minimum and equitable risk routes for hazmat shipments
- Tabu search and GRASP for the maximum diversity problem
- Simulated annealing: A tool for operational research
- The discrete p-dispersion problem
- A survey on metaheuristics for stochastic combinatorial optimization
- Heuristics for the bi-objective path dissimilarity problem
- A probabilistic heuristic for a computationally difficult set covering problem
- A bicriterion shortest path algorithm
- Computational aspects of the maximum diversity problem
- Greedy randomized adaptive search procedures
- On finding dissimilar paths
- Using GIS to assess the risks of hazardous materials transport in networks
- Multiobjective routing of hazardous materials in stochastic networks
- Modeling of Transport Risk for Hazardous Materials
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- Integrated Routing and Scheduling in Hazardous Materials Transportation
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Simulated annealing based GRASP for Pareto-optimal dissimilar paths problem