A fast metaheuristic for the travelling salesperson problem with hotel selection

DOI10.1007/S10288-014-0264-5MaRDI QIDQ2342916zbMATH OpenOpenAlexFDO

Authors Marco Castro, K. Sörensen, Pieter Vansteenwegen, P. Goos

Publication date 29 April 2015

Published in 4OR (Search for Journal in Brave)

Full work available at URL https://lirias.kuleuven.be/handle/123456789/464307

zbMATH Keywords

combinatorial optimisationhotel selectionmetaheuristicstravelling salesperson problem

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A memetic algorithm for the travelling salesperson problem with hotel selection
• 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
• A memetic algorithm for the orienteering problem with hotel selection

Cites work

• A hybrid guided local search for the vehicle-routing problem with intermediate replenishment facilities
• A memetic algorithm for the travelling salesperson problem with hotel selection
• A method for solving traveling-salesman problems
• A note on two problems in connexion with graphs
• A simple and effective evolutionary algorithm for the vehicle routing problem
• A tabu search heuristic for periodic and multi-depot vehicle routing problems
• A variable neighborhood search for the capacitated arc routing problem with intermediate facilities
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Column Generation
• Memetic evolutionary algorithms
• The capacitated arc routing problem with intermediate facilities
• The multi-depot vehicle routing problem with inter-depot routes
• The periodic vehicle routing problem with intermediate facilities
• The traveling salesman problem. A computational study.
• The vehicle routing problem
• Variable neighbourhood search: Methods and applications
• Waste collection vehicle routing problem with time windows

Cited in

(6)

• A hybrid dynamic programming and memetic algorithm to the traveling salesman problem with hotel selection
• A greedy randomized adaptive search procedure for the orienteering 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
• A memetic algorithm for the travelling salesperson problem with hotel selection
• scientific article; zbMATH DE number 2243051 (Why is no real title available?)

Describes a project that uses

Uses Software

• VRP
• Concorde

This page was built for publication: A fast metaheuristic 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 Q2342916)