Multirobot search for a stationary object placed in a known environment with a combination of GRASP and VND

DOI10.1111/itor.12794OpenAlexW3015265293MaRDI QIDQ6070871

Miroslav Kulich, Libor Přeučil

Publication date: 24 November 2023

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/itor.12794

zbMATH Keywords

combinatorial optimizationmetaheuristicsgraph search problemtraveling deliveryman problem

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Mathematical formulations and exact algorithm for the multitrip cumulative capacitated single-vehicle routing problem
• Heuristics for the traveling repairman problem with profits
• A two-phase metaheuristic for the cumulative capacitated vehicle routing problem
• 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
• An effective memetic algorithm for the cumulative capacitated vehicle routing problem
• A new formulation for the traveling deliveryman problem
• Foundations of computational intelligence. Volume 3: Global optimization
• Variable neighborhood search
• A classification of formulations for the (time-dependent) traveling salesman problem
• Delaunay refinement algorithms for triangular mesh generation
• A meta-heuristic based goal-selection strategy for mobile robot search in an unknown environment
• A branch-and-price algorithm for the minimum latency problem
• Polynomial formulation and heuristic based approach for the \(k\)-travelling repairman problem
• An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem
• Greedy randomized adaptive search procedures
• A comparison of three metaheuristics for the workover rig routing problem
• A simple and effective metaheuristic for the minimum latency problem
• Variable neighborhood search for the travelling deliveryman problem
• The time dependent traveling salesman problem: polyhedra and algorithm
• Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints
• A \(2+\varepsilon\) approximation algorithm for the \(k\)-MST problem
• A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem
• Facets and valid inequalities for the time-dependent travelling salesman problem
• A unified solution framework for multi-attribute vehicle routing problems
• An integer programming approach for the time-dependent TSP
• A GRASP/VND heuristic for the phylogeny problem using a new neighborhood structure
• Optimization by GRASP
• An annotated bibliography of GRASP-Part II: Applications
• An annotated bibliography of GRASP – Part I: Algorithms
• The complexity of the travelling repairman problem
• TSPLIB—A Traveling Salesman Problem Library
• Efficient Algorithms for Shortest Paths in Sparse Networks
• The Delivery Man Problem and Cumulative Matroids
• The k -traveling repairmen problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem

This page was built for publication: Multirobot search for a stationary object placed in a known environment with a combination of GRASP and VND