A hybrid dynamic programming and memetic algorithm to the traveling salesman problem with hotel selection
type: Item
instance of: scholarly article
title: A hybrid dynamic programming and memetic algorithm to the traveling salesman problem with hotel selection
zbMATH Open document ID: 1391.90524
author: Yongliang Lu
author: Una Benlic
author: Qinghua Wu
published in: Computers \& Operations Research
publication date: 2018-07-11T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C39
zbMATH DE Number: 6901538
zbMATH Keywords: dynamic programming
zbMATH Keywords: traveling salesman problem
zbMATH Keywords: infeasible local search
describes a project that uses: VRP
describes a project that uses: CBMix
MaRDI profile type: Publication
full work available at URL: j.cor.2017.09.008
OpenAlex ID: W2755170405
cites work: The periodic vehicle routing problem with intermediate facilities
cites work: A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows
cites work: A memetic algorithm for the travelling salesperson problem with hotel selection
cites work: A fast metaheuristic for the travelling salesperson problem with hotel selection
cites work: The Capacitated Minimum Spanning Tree
cites work: A hybrid metaheuristic approach for the capacitated arc routing problem
cites work: Q4184789
cites work: A tabu search heuristic for periodic and multi-depot vehicle routing problems
cites work: A unified tabu search heuristic for vehicle routing problems with time windows
cites work: The multi-depot vehicle routing problem with inter-depot routes
cites work: A note on two problems in connexion with graphs
cites work: A memetic algorithm for the orienteering problem with hotel selection
cites work: A Tabu Search Heuristic for the Vehicle Routing Problem
cites work: A linear space algorithm for computing maximal common subsequences
cites work: AN ALGORITHM FOR SINGLE CONSTRAINT MAXIMUM COLLECTION PROBLEM
cites work: Waste collection vehicle routing problem with time windows
cites work: Computer Solutions of the Traveling Salesman Problem
cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem
cites work: Advanced scatter search for the max-cut problem
cites work: A simple and effective evolutionary algorithm for the vehicle routing problem
cites work: Comparison of eight evolutionary crossover operators for the vehicle routing problem
cites work: Q4449767
cites work: Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
cites work: A hybrid guided local search for the vehicle-routing problem with intermediate replenishment facilities
cites work: Bounds on the Complexity of the Longest Common Subsequence Problem
DOI: 10.1016/J.COR.2017.09.008
description: scientific article; zbMATH DE number 6901538