Heuristics for routing heterogeneous unmanned vehicles with fuel constraints
type: Item
instance of: scholarly article
title: Heuristics for routing heterogeneous unmanned vehicles with fuel constraints
zbMATH Open document ID: 1407.90389
DOI: 10.1155/2014/131450
author: Erdal Karapınar
published in: Mathematical Problems in Engineering
publication date: 2019-02-08T00:00:00Z
review text: Summary: This paper addresses a multiple depot, multiple unmanned vehicle routing problem with fuel constraints. The objective of the problem is to find a tour for each vehicle such that all the specified targets are visited at least once by some vehicle, the tours satisfy the fuel constraints, and the total travel cost of the vehicles is a minimum. We consider a scenario where the vehicles are allowed to refuel by visiting any of the depots or fuel stations. This is a difficult optimization problem that involves partitioning the targets among the vehicles and finding a feasible tour for each vehicle. The focus of this paper is on developing fast variable neighborhood descent (VND) and variable neighborhood search (VNS) heuristics for finding good feasible solutions for large instances of the vehicle routing problem. Simulation results are presented to corroborate the performance of the proposed heuristics on a set of 23 large instances obtained from a standard library. These results show that the proposed VND heuristic, on an average, performed better than the proposed VNS heuristic for the tested instances.
Mathematics Subject Classification ID: 90C90
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 7015748
Wikidata QID: Q59063021
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2014/131450
OpenAlex ID: W2167861360
cites work: The traveling salesman problem and its variations
cites work: Variable neighborhood search
cites work: To Fill or Not to Fill: The Gas Station Problem
cites work: Tabu search heuristics for the arc routing problem with intermediate facilities under capacity and length restrictions
cites work: A variable neighborhood search for the capacitated arc routing problem with intermediate facilities
cites work: The Multiple Vehicle TSP with Time Windows and Equity Constraints over a Multiple Day Horizon
cites work: 3-approximation algorithm for a two depot, heterogeneous traveling salesman problem
cites work: Approximation algorithms and heuristics for a 2-depot, heterogeneous Hamiltonian path problem
cites work: Variable neighborhood search: Principles and applications
cites work: Computer Solutions of the Traveling Salesman Problem
cites work: The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
cites work: A note on two problems in connexion with graphs
description: scientific article; zbMATH DE number 7015748