An effective PSO-inspired algorithm for the team orienteering problem

DOI10.1016/J.EJOR.2013.02.049zbMATH Open1317.90114OpenAlexW1996002457MaRDI QIDQ2355862FDOQ2355862

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

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

zbMATH Keywords

swarm intelligenceknapsack problemvehicle routinginterval graphoptimal split

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (26)

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

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)