The capacitated team orienteering and profitable tour problems
From MaRDI portal
Publication:3184456
DOI10.1057/palgrave.jors.2602603zbMath1171.90344OpenAlexW2035201919MaRDI QIDQ3184456
Alain Hertz, Dominique Feillet, Claudia Archetti, Maria Grazia Speranza
Publication date: 15 October 2009
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/palgrave.jors.2602603
column generationtabu searchvariable neighbourhood searchteam orienteering problembranch and priceprofitable tour problem
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)
Related Items
The multi-vehicle profitable pickup and delivery problem, A matheuristic approach to the orienteering problem with service time dependent profits, An adaptive large neighborhood search algorithm for a selective and periodic inventory routing problem, A matheuristic for the team orienteering arc routing problem, Orienteering problem: a survey of recent variants, solution approaches and applications, The dynamic multiperiod vehicle routing problem with probabilistic information, Solving the multi-vehicle multi-covering tour problem, A branch-price-and-cut algorithm for the workover rig routing problem, A profit-maximization location-routing-pricing problem: a branch-and-price algorithm, Integrated Charge Batching and Casting Width Selection at Baosteel, The orienteering problem with variable profits, The capacitated team orienteering problem with incomplete service, A hybrid metaheuristic for smart waste collection problems with workload concerns, A new accessibility based team orienteering approach for urban tourism routes optimization (a real life case), The vehicle routing problem with service level constraints, A branch-and-price approach to the feeder network design problem, The orienteering problem: a survey, 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, Planning robust drone-truck delivery routes under road traffic uncertainty, A generic exact solver for vehicle routing and related problems, A unified matheuristic for solving multi-constrained traveling salesman problems with profits, A selective adaptive large neighborhood search heuristic for the profitable tour problem with simultaneous pickup and delivery services, The capacitated orienteering problem, The undirected capacitated general routing problem with profits, Attractive orienteering problem with proximity and timing interactions, The vehicle routing problem with profits and consistency constraints, The undirected capacitated arc routing problem with profits, A large neighbourhood search heuristic for ship routing and scheduling with split loads, Formulation and a two-phase matheuristic for the roaming salesman problem: application to election logistics, Capacitated ring arborescence problems with profits, The split delivery capacitated team orienteering problem, Shared resources in collaborative vehicle routing, The Team Orienteering Pick-Up and Delivery Problem with Time Windows and its applications in fleet sizing, Consistent vehicle routing with pickup decisions -- insights from sport academy training transfers, Neural large neighborhood search for routing problems, The synchronized multi-assignment orienteering problem, Optimal joint maintenance and orienteering strategy for complex mission-oriented systems: a case study in offshore wind energy
