A heuristic for the multiple tour maximum collection problem
From MaRDI portal
Publication:1317095
DOI10.1016/0305-0548(94)90065-5zbMath0789.90081OpenAlexW1965603691MaRDI QIDQ1317095
Steven E. Butt, Tom M. Cavalier
Publication date: 24 March 1994
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0305-0548(94)90065-5
schedulingtraveling salesmanheuristicroutingmultiple tour maximum collection problemsubset of weighted nodes
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06)
Related Items (41)
The multi-vehicle profitable pickup and delivery problem ⋮ Iterated local search for the team orienteering problem with time windows ⋮ A guided local search metaheuristic for the team orienteering problem ⋮ Integrated optimization of planetary rover layout and exploration routes ⋮ Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests ⋮ A two-stage approach to the orienteering problem with stochastic weights ⋮ A hybrid variable neighborhood search for the orienteering problem with mandatory visits and exclusionary constraints ⋮ Solving the team orienteering problem with cutting planes ⋮ The capacitated team orienteering problem with incomplete service ⋮ A hybrid adaptive large neighborhood search heuristic for the team orienteering problem ⋮ Selective routing problem with synchronization ⋮ Coupling ant colony systems with strong local searches ⋮ Column generation based heuristics for a generalized location routing problem with profits arising in space exploration ⋮ Design of diversified package tours for the digital travel industry: a branch-cut-and-price approach ⋮ The orienteering problem: a survey ⋮ Formulations for the orienteering problem with additional constraints ⋮ Solving the team orienteering problem with nonidentical agents: A Lagrangian approach ⋮ A lexicographic maximin approach to the selective assessment routing problem ⋮ Solving Relaxation Orienteering Problem Using DCA-CUT ⋮ A PSO based algorithm with an efficient optimal split procedure for the multiperiod vehicle routing problem with profit ⋮ A simulated annealing heuristic for the team orienteering problem with time windows ⋮ The capacitated orienteering problem ⋮ A general framework for assessing the value of social data for disaster response logistics planning ⋮ Solving the stochastic time-dependent orienteering problem with time windows ⋮ Solving the team orienteering arc routing problem with a column generation approach ⋮ Local search for the undirected capacitated arc routing problem with profits ⋮ Simultaneous sensor selection and routing of unmanned aerial vehicles for complex mission plans ⋮ A TABU search heuristic for the team orienteering problem ⋮ A memetic algorithm for the team orienteering problem ⋮ A path relinking approach for the team orienteering problem ⋮ The undirected capacitated arc routing problem with profits ⋮ Formulation and a two-phase matheuristic for the roaming salesman problem: application to election logistics ⋮ A two-stage vehicle routing model for large-scale bioterrorism emergencies ⋮ Pre-selection Strategies for Dynamic Collaborative Transportation Planning Problems ⋮ The split delivery capacitated team orienteering problem ⋮ Consistent vehicle routing with pickup decisions -- insights from sport academy training transfers ⋮ The Migratory Beekeeping Routing Problem: Model and an Exact Algorithm ⋮ Fairness in ambulance routing for post disaster management ⋮ A Variable Neighborhood Search Algorithm for Cost-Balanced Travelling Salesman Problem ⋮ An effective PSO-inspired algorithm for the team orienteering problem ⋮ A fast solution method for the time-dependent orienteering problem
Cites Work
This page was built for publication: A heuristic for the multiple tour maximum collection problem
