Solving the traveling delivery person problem with limited computational time
type: Item
instance of: scholarly article
title: Solving the traveling delivery person problem with limited computational time
author: Jan Mikula
author: Miroslav Kulich
published in: CEJOR. Central European Journal of Operations Research
publication date: 2022-12-09T00:00:00Z
Mathematics Subject Classification ID: 90Bxx
zbMATH DE Number: 7630661
zbMATH Keywords: metaheuristics
zbMATH Keywords: traveling delivery person problem
zbMATH Keywords: minimum latency problem
zbMATH Keywords: run-time distribution
zbMATH Keywords: variable neighborhood search
describes a project that uses: TSPLIB
describes a project that uses: Tttplots-compare
describes a project that uses: PERL
describes a project that uses: GTSP-LIB
MaRDI profile type: Publication
full work available at URL: s10100-021-00793-y
OpenAlex ID: W4205632582
cites work: The time dependent traveling salesman problem: polyhedra and algorithm
cites work: Probability distribution of solution time in GRASP: an experimental investigation
cites work: Q5417636
cites work: Q4471278
cites work: A Faster, Better Approximation Algorithm for the Minimum Latency Problem
cites work: Q4503935
cites work: The traveling salesman problem with cumulative costs
cites work: The minimum latency problem
cites work: A branch-and-price algorithm for the minimum latency problem
cites work: In Pursuit of the Traveling Salesman
cites work: The k -traveling repairmen problem
cites work: A probabilistic heuristic for a computationally difficult set covering problem
cites work: A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
cites work: The Delivery Man Problem and Cumulative Matroids
cites work: Approximation algorithms for the traveling repairman and speeding deliveryman problems
cites work: The travelling salesman problem with neighbourhoods: MINLP solution
cites work: Natural and extended formulations for the time-dependent traveling salesman problem
cites work: A classification of formulations for the (time-dependent) traveling salesman problem
cites work: Orienteering problem: a survey of recent variants, solution approaches and applications
cites work: Semi-greedy heuristics: An empirical study
cites work: A meta-heuristic based goal-selection strategy for mobile robot search in an unknown environment
cites work: Time‐dependent traveling salesman problem–the deliveryman case
cites work: A new formulation for the traveling deliveryman problem
cites work: Facets and valid inequalities for the time-dependent travelling salesman problem
cites work: Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem
cites work: Variable neighborhood search
cites work: Variable neighborhood search for the travelling deliveryman problem
cites work: TSPLIB—A Traveling Salesman Problem Library
cites work: Optimization by GRASP
cites work: \texttt{tttplots-compare}: a Perl program to compare time-to-target plots or general runtime distributions of randomized algorithms
cites work: Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms
cites work: P-Complete Approximation Problems
cites work: Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem
cites work: A simple and effective metaheuristic for the minimum latency problem
cites work: GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem
DOI: 10.1007/S10100-021-00793-Y
Recommended article: A new formulation for the traveling deliveryman problem
Recommended article: The traveling salesman problem with pickup, delivery, and ride-time constraints
Recommended article: Time‐dependent traveling salesman problem–the deliveryman case
Recommended article: The \(k\)-delivery traveling salesman problem: revisited
Recommended article: The traveling salesman problem with delivery and backhauls
Recommended article: An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections
Recommended article: A heuristic for the pickup and delivery traveling salesman problem
Recommended article: An algorithm for the traveling salesman problem with pickup and delivery customers
Recommended article: The travelling salesman problem with pick-up and delivery
Recommended article: Approximation algorithms for the traveling repairman and speeding deliveryman problems
description: scientific article; zbMATH DE number 7630661