scispace - formally typeset
Journal ArticleDOI

GLNS: An effective large neighborhood search heuristic for the Generalized Traveling Salesman Problem

Reads0
Chats0
TLDR
This paper presents an effective algorithm for the GTSP based on adaptive large neighborhood search that operates by repeatedly removing from, and inserting vertices in, the tour and proposes a general insertion mechanism that contains as special cases the well-known nearest, farthest and random insertion mechanisms.
About
This article is published in Computers & Operations Research.The article was published on 2017-11-01. It has received 101 citations till now. The article focuses on the topics: Bottleneck traveling salesman problem & 2-opt.

read more

Citations
More filters
Journal ArticleDOI

Recent Advances in Selection Hyper-heuristics

TL;DR: This paper focuses only on selection hyper-heuristics and presents critical discussion, current research trends and directions for future research, and the existing classification of selectionhyper- heuristics is extended, in order to reflect the nature of the challenges faced in contemporary research.
Journal ArticleDOI

A Transformation Technique for the Clustered Generalized Traveling Salesman Problem with Applications to Logistics

TL;DR: The main objective of this paper is to enable the powerful framework of CGTSP for applied problems by developing a solution method by an efficient transformation from CGT SP to TSP, and demonstrating that not only the solution method provides far superior solution quality compared to existing methods for solving C GTSP, but also it enables practical solutions to far larger CGTsp instances.
Proceedings ArticleDOI

Algorithms for Routing of Unmanned Aerial Vehicles with Mobile Recharging Stations

TL;DR: In this article, the authors study the problem of finding a tour for an energy-limited UAV to visit a set of sites in the least amount of time, where the UAV can be recharged along the way either by landing on stationary recharging stations or on UGVs acting as mobile charging stations.
Journal ArticleDOI

Integrated Production and Distribution Problem of Perishable Products with a Minimum Total Order Weighted Delivery Time

Ling Liu, +1 more
TL;DR: The computational results show that the proposed improved large neighborhood search algorithm can provide higher quality solutions than the genetic algorithm.
Journal ArticleDOI

Online planning for multi-robot active perception with self-organising maps

TL;DR: The proposed methods enable multi-robot planning for online active perception tasks with continuous sets of candidate viewpoints and long planning horizons and demonstrate feasibility for the active perception task of observing a set of 3D objects.
References
More filters
Book

Reinforcement Learning: An Introduction

TL;DR: This book provides a clear and simple account of the key ideas and algorithms of reinforcement learning, which ranges from the history of the field's intellectual foundations to the most recent developments and applications.
Book

Introduction to Algorithms

TL;DR: The updated new edition of the classic Introduction to Algorithms is intended primarily for use in undergraduate or graduate courses in algorithms or data structures and presents a rich variety of algorithms and covers them in considerable depth while making their design and analysis accessible to all levels of readers.
Journal ArticleDOI

An Effective Heuristic Algorithm for the Traveling-Salesman Problem

TL;DR: This paper discusses a highly effective heuristic procedure for generating optimum and near-optimum solutions for the symmetric traveling-salesman problem based on a general approach to heuristics that is believed to have wide applicability in combinatorial optimization problems.
Journal ArticleDOI

An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows

TL;DR: This paper presents a heuristic for the pickup and delivery problem based on an extension of the large neighborhood search heuristic previously suggested for solving the vehicle routing problem with time windows that is very robust and is able to adapt to various instance characteristics.
Related Papers (5)