A hybrid dynamic programming and memetic algorithm to the traveling salesman problem with hotel selection

DOI10.1016/j.cor.2017.09.008zbMath1391.90524OpenAlexW2755170405MaRDI QIDQ1652522

Yongliang Lu, Una Benlic, Qinghua Wu

Publication date: 11 July 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2017.09.008

zbMATH Keywords

dynamic programmingtraveling salesman probleminfeasible local search

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Dynamic programming (90C39)

Related Items (4)

A hybrid iterated local search heuristic for the traveling salesperson problem with hotel selection ⋮ A greedy randomized adaptive search procedure for the orienteering problem with hotel selection ⋮ Finding the shortest path with vertex constraint over large graphs ⋮ Local-ideal-points based autonomous space decomposition framework for the multi-objective periodic generalized directed rural postman problem under length restrictions with intermediate facilities

Uses Software

• VRP
• CBMix

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• A hybrid metaheuristic approach for the capacitated arc routing problem
• A memetic algorithm for the travelling salesperson problem with hotel selection
• A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows
• The multi-depot vehicle routing problem with inter-depot routes
• The periodic vehicle routing problem with intermediate facilities
• A simple and effective evolutionary algorithm for the vehicle routing problem
• A fast metaheuristic for the travelling salesperson problem with hotel selection
• Waste collection vehicle routing problem with time windows
• A memetic algorithm for the orienteering problem with hotel selection
• A Hybrid Guided Local Search for the Vehicle-Routing Problem with Intermediate Replenishment Facilities
• Advanced Scatter Search for the Max-Cut Problem
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• AN ALGORITHM FOR SINGLE CONSTRAINT MAXIMUM COLLECTION PROBLEM
• A linear space algorithm for computing maximal common subsequences
• Bounds on the Complexity of the Longest Common Subsequence Problem
• A tabu search heuristic for periodic and multi-depot vehicle routing problems
• A unified tabu search heuristic for vehicle routing problems with time windows
• A Tabu Search Heuristic for the Vehicle Routing Problem
• Computer Solutions of the Traveling Salesman Problem
• The Capacitated Minimum Spanning Tree
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem

This page was built for publication: A hybrid dynamic programming and memetic algorithm to the traveling salesman problem with hotel selection