Bi-objective orienteering for personal activity scheduling
type: Item
instance of: scholarly article
title: Bi-objective orienteering for personal activity scheduling
zbMATH Open document ID: 1391.90292
author: Piotr Matl
author: Pamela C. Nolz
author: Ulrike Ritzinger
author: Mario Ruthmair
author: F. Tricoire
published in: Computers \& Operations Research
publication date: 2018-07-11T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90B70
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6901399
zbMATH Keywords: bi-objective metaheuristics
zbMATH Keywords: large neighborhood search
zbMATH Keywords: orienteering
zbMATH Keywords: personal planning
MaRDI profile type: Publication
Wikidata QID: Q56476043
full work available at URL: j.cor.2017.01.009
OpenAlex ID: W2577285698
cites work: The Orienteering Problem with Time Windows
cites work: The orienteering problem: a survey
cites work: An exact algorithm for team orienteering problems
cites work: Iterated local search for the team orienteering problem with time windows
cites work: Q2956989
cites work: Hybridized evolutionary local search algorithm for the team orienteering problem with time windows
cites work: The team orienteering problem with time windows: an LP-based granular variable neighborhood search
cites work: A simulated annealing heuristic for the team orienteering problem with time windows
cites work: An iterative three-component heuristic for the team orienteering problem with time windows
cites work: Heuristics for the multi-period orienteering problem with multiple time windows
cites work: Multi-objective meta-heuristics for the traveling salesman problem with profits
cites work: An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits
cites work: A two-phase method for bi-objective combinatorial optimization and its application to the TSP with profits
cites work: Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits
cites work: Multi-directional local search
cites work: The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
cites work: A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows
cites work: Robust ship scheduling with multiple time windows
cites work: Timing problems and algorithms: Time decisions for sequences of activities
cites work: Record breaking optimization results using the ruin and recreate principle
cites work: Greedy randomized adaptive search procedures
cites work: Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems
DOI: 10.1016/J.COR.2017.01.009
DBLP publication ID: journals/cor/MatlNRRT17
description: scientific article; zbMATH DE number 6901399