A memetic algorithm for the travelling salesperson problem with hotel selection
DOI10.1016/J.COR.2013.01.006zbMATH Open1348.90438OpenAlexW2089461976MaRDI QIDQ336356FDOQ336356
Authors: K. Sörensen, Pieter Vansteenwegen, Marco Castro, P. 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
Recommendations
- A fast metaheuristic for the travelling salesperson problem with hotel selection
- A hybrid dynamic programming and memetic algorithm to the traveling salesman problem with hotel selection
- A memetic algorithm for the orienteering problem with hotel selection
- A hybrid iterated local search heuristic for the traveling salesperson problem with hotel selection
- Solving of TSP with time restraints by memetic algorithm
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Case-oriented studies in operations research (90B90)
Cites Work
- A note on two problems in connexion with graphs
- Tabu Search—Part I
- A simple and effective evolutionary algorithm for the vehicle routing problem
- The vehicle routing problem
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- A unified tabu search heuristic for vehicle routing problems with time windows
- Location-routing: issues, models and methods
- The String-to-String Correction Problem
- The periodic vehicle routing problem with intermediate facilities
- Title not available (Why is that?)
- Capacitated arc routing problems
- Tabu Search—Part II
- A tabu search heuristic for periodic and multi-depot vehicle routing problems
- An Effective Heuristic Algorithm for the Traveling-Salesman 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
- Parallel iterative search methods for vehicle routing problems
- Title not available (Why is that?)
- A Tabu Search Heuristic for the Vehicle Routing Problem
- Computer Solutions of the Traveling Salesman Problem
- A hybrid guided local search for the vehicle-routing problem with intermediate replenishment facilities
- The multi-depot vehicle routing problem with inter-depot routes
- A variable neighborhood search for the capacitated arc routing problem with intermediate facilities
- A Cutting Planes Algorithm for the m-Salesmen Problem
- Tabu search heuristics for the arc routing problem with intermediate facilities under capacity and length restrictions
Cited In (13)
- Title not available (Why is that?)
- A metaheuristic approach to fisheries survey route planning
- A memetic algorithm for the orienteering problem with mandatory visits and exclusionary constraints
- A hybrid dynamic programming and memetic algorithm to the traveling salesman problem with hotel selection
- A memetic algorithm for the generalized traveling salesman problem
- A branch-cut-and-price algorithm for the traveling salesperson problem with hotel selection
- A tabu search algorithm for the multi-period inspector scheduling problem
- A fast metaheuristic for the travelling 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
- Solving of TSP with time restraints by memetic algorithm
- A memetic algorithm for the orienteering problem with hotel selection
- A greedy randomized adaptive search procedure for the orienteering problem with hotel selection
Uses Software
This page was built for publication: A memetic algorithm for the travelling salesperson problem with hotel selection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336356)
