A memetic algorithm for the orienteering problem with hotel selection
From MaRDI portal
Publication:2514808
DOI10.1016/j.ejor.2014.01.001zbMath1304.90220OpenAlexW2031583429MaRDI QIDQ2514808
Kenneth Sörensen, Pieter Vansteenwegen, Ali Divsalar, Dirk G. Cattrysse
Publication date: 4 February 2015
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://lirias.kuleuven.be/handle/123456789/376625
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
An effective approach for scheduling coupled activities in development projects ⋮ A minimum cost network flow model for the maximum covering and patrol routing problem ⋮ Time dependent orienteering problem with time windows and service time dependent profits ⋮ Orienteering problem: a survey of recent variants, solution approaches and applications ⋮ 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 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 ⋮ Design of diversified package tours for the digital travel industry: a branch-cut-and-price approach ⋮ A fast tri-individual memetic search approach for the distance-based critical node problem ⋮ A greedy randomized adaptive search procedure for the orienteering problem with hotel selection ⋮ The vacation planning problem: a multi-level clustering-based metaheuristic approach
Cites Work
- Unnamed Item
- Unnamed Item
- A memetic algorithm for the travelling salesperson problem with hotel selection
- The orienteering problem: a survey
- 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
- Ant colony optimization for the arc routing problem with intermediate facilities under capacity and length restrictions
- A memetic algorithm for the team orienteering problem
- An effective memetic algorithm for the cumulative capacitated vehicle routing problem
- A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands
- The periodic vehicle routing problem with intermediate facilities
- A simple and effective evolutionary algorithm for the vehicle routing problem
- An effective PSO-inspired algorithm for the team orienteering problem
- A memetic algorithm with dynamic population management for an integrated production-distribution problem
- Distance-constrained capacitated vehicle routing problems with flexible assignment of start and end depots
- \(\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
- A Hybrid Guided Local Search for the Vehicle-Routing Problem with Intermediate Replenishment Facilities
- State-of-the Art Review—Evolutionary Algorithms for Vehicle Routing
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- The orienteering problem
- The application of a vehicle routing model to a waste-collection problem: two case studies