A memetic algorithm for the travelling salesperson problem with hotel selection

DOI10.1016/j.cor.2013.01.006zbMath1348.90438OpenAlexW2089461976MaRDI QIDQ336356

Kenneth Sörensen, Pieter Vansteenwegen, Marco Castro, Peter Goos

Publication date: 10 November 2016

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

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

zbMATH Keywords

TSPmemetic algorithmhotel selection

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Case-oriented studies in operations research (90B90)

Related Items

A metaheuristic approach to fisheries survey route planning ⋮ A tabu search algorithm for the multi-period inspector scheduling problem ⋮ A hybrid dynamic programming and memetic algorithm to the traveling salesman problem with hotel selection ⋮ A branch-cut-and-price algorithm for the traveling salesperson problem with hotel selection ⋮ A hybrid iterated local search heuristic for the traveling salesperson problem with hotel selection ⋮ Designing sustainable mid-haul logistics networks with intra-route multi-resource facilities ⋮ A memetic algorithm for the orienteering problem with mandatory visits and exclusionary constraints ⋮ A greedy randomized adaptive search procedure for the orienteering problem with hotel selection ⋮ A memetic algorithm for the orienteering problem with hotel selection ⋮ A fast metaheuristic for the travelling salesperson problem with hotel selection

Uses Software

• Concorde
• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Tabu search heuristics for the arc routing problem with intermediate facilities under capacity and length restrictions
• The multi-depot vehicle routing problem with inter-depot routes
• Location-routing: issues, models and methods
• A variable neighborhood search for the capacitated arc routing problem with intermediate facilities
• The periodic vehicle routing problem with intermediate facilities
• A simple and effective evolutionary algorithm for the vehicle routing problem
• Multi-ant colony system (MACS) for a vehicle routing problem with backhauls
• \(\text{MA}\mid\text{PM}\): memetic algorithms with population management
• Waste collection vehicle routing problem with time windows
• The capacitated arc routing problem with intermediate facilities
• The Vehicle Routing Problem
• A Hybrid Guided Local Search for the Vehicle-Routing Problem with Intermediate Replenishment Facilities
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• A Cutting Planes Algorithm for the m-Salesmen Problem
• Capacitated arc routing problems
• Tabu Search—Part I
• Tabu Search—Part II
• Parallel iterative search methods for vehicle routing problems
• A tabu search heuristic for periodic and multi-depot vehicle routing problems
• The String-to-String Correction Problem
• 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
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem