An effective PSO-inspired algorithm for the team orienteering problem

DOI10.1016/J.EJOR.2013.02.049MaRDI QIDQ2355862zbMATHOpenAlexFDO

Authors Duc-Cuong Dang, Rym Nesrine Guibadj, A. Moukrim

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

swarm intelligenceknapsack problemvehicle routinginterval graphoptimal split

Mathematics Subject Classification ID

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

Recommendations

• A memetic algorithm for the team orienteering problem
• Solving the team orienteering problem with cutting planes
• A Branch-and-Cut Algorithm for Solving the Team Orienteering Problem
• A path relinking approach for the team orienteering problem
• A hybrid adaptive large neighborhood search heuristic for the team orienteering problem

Cites work

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

Cited in

(26)

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

Describes a project that uses

Uses Software

• TSPLIB
• VRP

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

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