Solving the traveling delivery person problem with limited computational time

DOI10.1007/s10100-021-00793-yOpenAlexW4205632582MaRDI QIDQ2103948

Jan Mikula, Miroslav Kulich

Publication date: 9 December 2022

Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10100-021-00793-y

zbMATH Keywords

metaheuristicsvariable neighborhood searchminimum latency problemrun-time distributiontraveling delivery person problem

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Uses Software

• TSPLIB
• PERL
• Tttplots-compare
• GTSP-LIB

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Orienteering problem: a survey of recent variants, solution approaches and applications
• Natural and extended formulations for the time-dependent traveling salesman problem
• Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem
• Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms
• A new formulation for the traveling deliveryman problem
• A probabilistic heuristic for a computationally difficult set covering problem
• Variable neighborhood search
• A classification of formulations for the (time-dependent) traveling salesman problem
• A meta-heuristic based goal-selection strategy for mobile robot search in an unknown environment
• GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem
• A branch-and-price algorithm for the minimum latency problem
• Semi-greedy heuristics: An empirical study
• Probability distribution of solution time in GRASP: an experimental investigation
• A simple and effective metaheuristic for the minimum latency problem
• Variable neighborhood search for the travelling deliveryman problem
• The time dependent traveling salesman problem: polyhedra and algorithm
• \texttt{tttplots-compare}: a Perl program to compare time-to-target plots or general runtime distributions of randomized algorithms
• Approximation algorithms for the traveling repairman and speeding deliveryman problems
• Facets and valid inequalities for the time-dependent travelling salesman problem
• The minimum latency problem
• Optimization by GRASP
• A Faster, Better Approximation Algorithm for the Minimum Latency Problem
• TSPLIB—A Traveling Salesman Problem Library
• P-Complete Approximation Problems
• The Delivery Man Problem and Cumulative Matroids
• A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
• Time‐dependent traveling salesman problem–the deliveryman case
• The travelling salesman problem with neighbourhoods: MINLP solution
• The k -traveling repairmen problem
• Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem
• The traveling salesman problem with cumulative costs
• In Pursuit of the Traveling Salesman

This page was built for publication: Solving the traveling delivery person problem with limited computational time