4.6 Article

A modified ACO with K-Opt for restricted covering salesman problems in different environments

相关参考文献

注意:仅列出部分参考文献,下载原文获取全部文献信息。
Article Operations Research & Management Science

A parallel variable neighborhood search for solving covering salesman problem

Xiaoning Zang et al.

Summary: This paper reformulates the covering salesman problem as a bilevel CSP and proposes two parallel variable neighborhood search heuristics to solve it. Extensive computational experiments indicate the effectiveness of the proposed approaches.

OPTIMIZATION LETTERS (2022)

Article Computer Science, Artificial Intelligence

Two hybrid metaheuristic approaches for the covering salesman problem

Venkatesh Pandiri et al.

NEURAL COMPUTING & APPLICATIONS (2020)

Article Computer Science, Artificial Intelligence

A Hybrid PSO-GA Algorithm for Traveling Salesman Problems in Different Environments

Indadul Khan et al.

INTERNATIONAL JOURNAL OF UNCERTAINTY FUZZINESS AND KNOWLEDGE-BASED SYSTEMS (2019)

Proceedings Paper Computer Science, Artificial Intelligence

A Multi-start Iterated Local Search Algorithm with Variable Degree of Perturbation for the Covering Salesman Problem

Pandiri Venkatesh et al.

HARMONY SEARCH AND NATURE INSPIRED OPTIMIZATION ALGORITHMS (2019)

Article Computer Science, Artificial Intelligence

Three level partial trade credit with promotional cost sharing

Prasenjit Pramanik et al.

APPLIED SOFT COMPUTING (2017)

Proceedings Paper Computer Science, Artificial Intelligence

Profit Maximization of TSP with Uncertain Parameters Through a Hybrid Algorithm

Aditi Khanra et al.

PROCEEDINGS OF THE 4TH INTERNATIONAL CONFERENCE ON FRONTIERS IN INTELLIGENT COMPUTING: THEORY AND APPLICATIONS (FICTA) 2015 (2016)

Article Computer Science, Interdisciplinary Applications

Combining ant colony optimization algorithm and dynamic programming technique for solving the covering salesman problem

Majid Salari et al.

COMPUTERS & INDUSTRIAL ENGINEERING (2015)

Article Computer Science, Interdisciplinary Applications

An integer programming-based local search for the covering salesman problem

Majid Salari et al.

COMPUTERS & OPERATIONS RESEARCH (2012)

Article Computer Science, Interdisciplinary Applications

The Generalized Covering Salesman Problem

Bruce Golden et al.

INFORMS JOURNAL ON COMPUTING (2012)

Article Operations Research & Management Science

Routing for relief efforts

Ann Melissa Campbell et al.

TRANSPORTATION SCIENCE (2008)

Article Management

Locating median cycles in networks

M Labbé et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2005)

Article Computer Science, Hardware & Architecture

The Ring Star Problem:: Polyhedral analysis and exact algorithm

M Labbé et al.

NETWORKS (2004)

Article Computer Science, Interdisciplinary Applications

Heuristics for the multi-vehicle covering tour problem

M Hachicha et al.

COMPUTERS & OPERATIONS RESEARCH (2000)