An effective PSO-inspired algorithm for the team orienteering problem

DOI10.1016/j.ejor.2013.02.049zbMath1317.90114OpenAlexW1996002457MaRDI QIDQ2355862

Rym Nesrine Guibadj, Aziz Moukrim, Duc-Cuong Dang

Publication date: 28 July 2015

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2013.02.049

zbMATH Keywords

vehicle routingknapsack probleminterval graphswarm intelligenceoptimal split

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (23)

Heuristic solutions for the vehicle routing problem with time windows and synchronized visits ⋮ A constructive aisle design model for unit-load warehouses with multiple pickup and deposit points ⋮ An iterated local search algorithm for the team orienteering problem with variable profits ⋮ A novel multi-objective particle swarm optimization with multiple search strategies ⋮ Orienteering problem: a survey of recent variants, solution approaches and applications ⋮ Solving the team orienteering problem with cutting planes ⋮ Algorithm selection for the team orienteering problem ⋮ An effective hybrid search algorithm for the multiple traveling repairman problem with profits ⋮ A hybrid adaptive large neighborhood search heuristic for the team orienteering problem ⋮ Effective neighborhood search with optimal splitting and adaptive memory for the team orienteering problem with time windows ⋮ The vehicle routing problem with service level constraints ⋮ Design of diversified package tours for the digital travel industry: a branch-cut-and-price approach ⋮ Trip planning for visitors in a service system with capacity constraints ⋮ Solving the team orienteering problem with nonidentical agents: A Lagrangian approach ⋮ GRASP‐ILS and set cover hybrid heuristic for the synchronized team orienteering problem with time windows ⋮ A PSO based algorithm with an efficient optimal split procedure for the multiperiod vehicle routing problem with profit ⋮ A new mathematical model and a heuristic algorithm for the tourist trip design problem under new constraints: a real-world application ⋮ Hybrid evolutionary search for the traveling repairman problem with profits ⋮ A general framework for assessing the value of social data for disaster response logistics planning ⋮ Coupling feasibility pump and large neighborhood search to solve the Steiner team orienteering problem ⋮ A memetic algorithm for the orienteering problem with hotel selection ⋮ Consistent vehicle routing with pickup decisions -- insights from sport academy training transfers ⋮ Solving the inverse graph model for conflict resolution using a hybrid metaheuristic algorithm

Uses Software

• TSPLIB
• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Efficient frameworks for greedy split and new depth first search split procedures for routing problems
• The orienteering problem: a survey
• Heuristics for the multi-period orienteering problem with multiple time windows
• A review of particle swarm optimization. II: Hybridisation, combinatorial, multicriteria and constrained optimization, and indicative applications
• An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits
• A memetic algorithm for the team orienteering problem
• A path relinking approach for the team orienteering problem
• Solving the prize-collecting rural postman problem
• Algorithms to solve the orienteering problem: A comparison
• The team orienteering problem
• A fast and effective heuristic for the orienteering problem
• An optimal solution procedure for the multiple tour maximum collection problem using column generation
• A heuristic for the multiple tour maximum collection problem
• Strong linear programming relaxations for the orienteering problem
• A TABU search heuristic for the team orienteering problem
• Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
• A guided local search metaheuristic for the team orienteering problem
• A review of particle swarm optimization. I: Background and development
• An exact algorithm for team orienteering problems
• The split delivery capacitated team orienteering problem
• The Team Orienteering Problem: Formulations and Branch-Cut and Price
• Tour splitting algorithms for vehicle routing problems
• The orienteering problem
• TSPLIB—A Traveling Salesman Problem Library
• Solving the Orienteering Problem through Branch-and-Cut

This page was built for publication: An effective PSO-inspired algorithm for the team orienteering problem