A meta-heuristic based goal-selection strategy for mobile robot search in an unknown environment
From MaRDI portal
Publication:1652330
DOI10.1016/j.cor.2016.04.029zbMath1391.90657OpenAlexW2346822594MaRDI QIDQ1652330
Juan José Miranda-Bront, Libor Přeučil, Miroslav Kulich
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2016.04.029
Related Items (3)
Meta-heuristic algorithms for the control tuning of omnidirectional mobile robots ⋮ Multirobot search for a stationary object placed in a known environment with a combination of GRASP and VND ⋮ Solving the traveling delivery person problem with limited computational time
Uses Software
Cites Work
- Heuristics for the traveling repairman problem with profits
- The delivery man problem with time windows
- Natural and extended formulations for the time-dependent traveling salesman problem
- Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem
- Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem
- A new formulation for the traveling deliveryman problem
- Variable neighborhood search
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- Greedy randomized adaptive search procedures
- A simple and effective metaheuristic for the minimum latency problem
- The time dependent traveling salesman problem: polyhedra and algorithm
- Facets and valid inequalities for the time-dependent travelling salesman problem
- An integer programming approach for the time-dependent TSP
- TSPLIB—A Traveling Salesman Problem Library
- The Delivery Man Problem and Cumulative Matroids
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A meta-heuristic based goal-selection strategy for mobile robot search in an unknown environment
