Effective neighborhood search with optimal splitting and adaptive memory for the team orienteering problem with time windows

DOI10.1016/J.COR.2020.105039MaRDI QIDQ2664372zbMATH OpenOpenAlexFDO

Authors Youcef Amarouche, Rym Nesrine Guibadj, Elhadja Chaalal, A. Moukrim

Publication date 20 April 2021

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

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

zbMATH Keywords

adaptive memoryheuristicsroutingsplitting algorithmteam orienteering problemtime windows

Mathematics Subject Classification ID

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

Recommendations

• An effective large neighborhood search for the team orienteering problem with time windows
• The team orienteering problem with time windows: an LP-based granular variable neighborhood search
• A simulated annealing heuristic for the team orienteering problem with time windows
• An iterative three-component heuristic for the team orienteering problem with time windows
• Iterated local search for the team orienteering problem with time windows

Cites work

• A memetic algorithm for the team orienteering problem
• A multi-space sampling heuristic for the vehicle routing problem with stochastic demands
• A simple and effective evolutionary algorithm for the vehicle routing problem
• A simulated annealing heuristic for the team orienteering problem with time windows
• A tabu search heuristic for periodic and multi-depot vehicle routing problems
• A TABU search heuristic for the team orienteering problem
• A tabu search heuristic for the undirected selective travelling salesman problem
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• An effective large neighborhood search for the team orienteering problem with time windows
• An effective PSO-inspired algorithm for the team orienteering problem
• An iterative three-component heuristic for the team orienteering problem with time windows
• Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming
• Heuristics for the multi-period orienteering problem with multiple time windows
• scientific article; zbMATH DE number 6676558 (Why is no real title available?)
• scientific article; zbMATH DE number 3541864 (Why is no real title available?)
• Hybridized evolutionary local search algorithm for the team orienteering problem with time windows
• Iterated local search for the team orienteering problem with time windows
• New dynamic programming algorithms for the resource constrained elementary shortest path problem
• On an exact method for the constrained shortest path problem
• Orienteering problem: a survey of recent variants, solution approaches and applications
• Probabilistic diversification and intensification in local search for vehicle routing
• Solving the orienteering problem with time windows via the pulse framework
• The orienteering problem
• The orienteering problem: a survey
• The team orienteering problem with time windows: an LP-based granular variable neighborhood search
• Tour splitting algorithms for vehicle routing problems

Cited in

(6)

• An effective large neighborhood search for the team orienteering problem with time windows
• The team orienteering problem with time windows: an LP-based granular variable neighborhood search
• Using decomposition-based multi-objective algorithm to solve selective pickup and delivery problems with time windows
• A reinforcement learning approach to the orienteering problem with time windows
• The aquaculture service vessel routing problem with time dependent travel times and synchronization constraints
• Trip planning for visitors in a service system with capacity constraints

This page was built for publication: Effective neighborhood search with optimal splitting and adaptive memory for the team orienteering problem with time windows

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2664372)