A metaheuristic for the delivery man problem with time windows

DOI10.1007/s10878-021-00716-2zbMath1473.90135OpenAlexW3136260147MaRDI QIDQ2045024

Ha-Bang Ban

Publication date: 11 August 2021

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-021-00716-2

zbMATH Keywords

tabu searchiterated local searchdelivery man problem with time windowsneighborhood descent with random neighborhood ordering

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

• Heuristics for the traveling repairman problem with profits
• A general VNS heuristic for the traveling salesman problem with time windows
• The delivery man problem with time windows
• Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem
• An iterated local search algorithm for the vehicle routing problem with convex time penalty functions
• Landscapes, operators and heuristic search
• Variable neighborhood search
• Minimizing latency in post-disaster road clearance operations
• Greedy randomized adaptive search procedures
• A simple and effective metaheuristic for the minimum latency problem
• A hybrid reactive GRASP heuristic for the risk-averse \(k\)-traveling repairman problem with profits
• The risk-averse traveling repairman problem with profits
• A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows
• The minimum latency problem
• A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows
• Special cases of traveling salesman and repairman problems with time windows
• The Delivery Man Problem and Cumulative Matroids
• A Meta-Heuristic Algorithm Combining Between Tabu and Variable Neighborhood Search for the Minimum Latency Problem
• An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A metaheuristic for the delivery man problem with time windows