Bi-objective orienteering for personal activity scheduling

DOI10.1016/J.COR.2017.01.009zbMath1391.90292OpenAlexW2577285698WikidataQ56476043 ScholiaQ56476043MaRDI QIDQ1652268

Pamela C. Nolz, Fabien Tricoire, Piotr Matl, Mario Ruthmair, Ulrike Ritzinger

Publication date: 11 July 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2017.01.009

zbMATH Keywords

large neighborhood searchorienteeringbi-objective metaheuristicspersonal planning

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Theory of organizations, manpower planning in operations research (90B70)

Related Items (1)

Branch-and-check approaches for the tourist trip design problem with rich constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits
• A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows
• Multi-directional local search
• Hybridized evolutionary local search algorithm for the team orienteering problem with time windows
• A simulated annealing heuristic for the team orienteering problem with time windows
• The orienteering problem: a survey
• Heuristics for the multi-period orienteering problem with multiple time windows
• Iterated local search for the team orienteering problem with time windows
• Multi-objective meta-heuristics for the traveling salesman problem with profits
• An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits
• Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems
• Greedy randomized adaptive search procedures
• The team orienteering problem with time windows: an LP-based granular variable neighborhood search
• Record breaking optimization results using the ruin and recreate principle
• An iterative three-component heuristic for the team orienteering problem with time windows
• An exact algorithm for team orienteering problems
• The Orienteering Problem with Time Windows
• The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
• Timing problems and algorithms: Time decisions for sequences of activities
• Robust ship scheduling with multiple time windows

This page was built for publication: Bi-objective orienteering for personal activity scheduling