A hybrid and adaptive evolutionary approach for multitask optimization of post-disaster traveling salesman and repairman problems
From MaRDI portal
Publication:6568437
Cites work
- A meta-heuristic algorithm combining between tabu and variable neighborhood search for the minimum latency problem
- A simple and effective metaheuristic for the minimum latency problem
- Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem
- GGA: a modified genetic algorithm with gradient-based local search for solving constrained optimization problems
- Greedy randomized adaptive search procedures
- Landscapes, operators and heuristic search
- Minimizing latency in post-disaster road clearance operations
- Multi-vehicle synchronized arc routing problem to restore post-disaster network connectivity
- Solution methodologies for debris removal in disaster response
- The post-disaster debris clearance problem under incomplete information
- The time dependent traveling salesman problem: polyhedra and algorithm
- The traveling salesman problem. A computational study.
- Time‐dependent traveling salesman problem–the deliveryman case
- Variable neighborhood search
This page was built for publication: A hybrid and adaptive evolutionary approach for multitask optimization of post-disaster traveling salesman and repairman problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6568437)