Heuristics for routing heterogeneous unmanned vehicles with fuel constraints

DOI10.1155/2014/131450zbMath1407.90389OpenAlexW2167861360WikidataQ59063021 ScholiaQ59063021MaRDI QIDQ1717710

Erdal Karapınar

Publication date: 8 February 2019

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2014/131450

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (3)

Routing problem for unmanned aerial vehicle patrolling missions -- a progressive hedging algorithm ⋮ Thirty years of heterogeneous vehicle routing ⋮ Decomposition-based exact algorithms for risk-constrained traveling salesman problems with discrete random arc costs

Cites Work

• A note on two problems in connexion with graphs
• 3-approximation algorithm for a two depot, heterogeneous traveling salesman problem
• Tabu search heuristics for the arc routing problem with intermediate facilities under capacity and length restrictions
• A variable neighborhood search for the capacitated arc routing problem with intermediate facilities
• Variable neighborhood search
• The traveling salesman problem and its variations
• Approximation algorithms and heuristics for a 2-depot, heterogeneous Hamiltonian path problem
• To Fill or Not to Fill: The Gas Station Problem
• The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
• Computer Solutions of the Traveling Salesman Problem
• The Multiple Vehicle TSP with Time Windows and Equity Constraints over a Multiple Day Horizon
• Variable neighborhood search: Principles and applications

This page was built for publication: Heuristics for routing heterogeneous unmanned vehicles with fuel constraints