A simple and effective metaheuristic for the minimum latency problem
type: Item
instance of: scholarly article
title: A simple and effective metaheuristic for the minimum latency problem
zbMATH Open document ID: 1253.90012
author: Marcos Melo Silva
author: A. Subramanian
author: T. Vidal
author: Luiz S. Ochi
published in: European Journal of Operational Research
publication date: 2012-12-29T00:00:00Z
Mathematics Subject Classification ID: 90-08
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 68M10
zbMATH DE Number: 6119468
zbMATH Keywords: metaheuristics
zbMATH Keywords: minimum latency problem
zbMATH Keywords: GRASP
zbMATH Keywords: iterated local search
describes a project that uses: TSPLIB
MaRDI profile type: Publication
full work available at URL: j.ejor.2012.03.044
OpenAlex ID: W2087852198
cites work: The time dependent traveling salesman problem: polyhedra and algorithm
cites work: Q5417636
cites work: Q4471278
cites work: Approximation Schemes for Minimum Latency Problems
cites work: Q4503935
cites work: The traveling salesman problem with cumulative costs
cites work: The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times
cites work: The minimum latency problem
cites work: Heuristics for the traveling repairman problem with profits
cites work: The k -traveling repairmen problem
cites work: Greedy randomized adaptive search procedures
cites work: The Delivery Man Problem and Cumulative Matroids
cites work: A note on the traveling repairman problem
cites work: An improved approximation ratio for the minimum latency problem
cites work: A classification of formulations for the (time-dependent) traveling salesman problem
cites work: The delivery man problem with time windows
cites work: Q4365135
cites work: Q4452900
cites work: Time‐dependent traveling salesman problem–the deliveryman case
cites work: Q3981972
cites work: A new formulation for the traveling deliveryman problem
cites work: Variable neighborhood search
cites work: The Directed Minimum Latency Problem
cites work: An effective memetic algorithm for the cumulative capacitated vehicle routing problem
cites work: The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
cites work: TSPLIB—A Traveling Salesman Problem Library
cites work: An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem
cites work: P-Complete Approximation Problems
cites work: Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem
cites work: Q4737530
cites work: A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
cites work: Special cases of traveling salesman and repairman problems with time windows
cites work: Exact algorithms for the minimum latency problem
DOI: 10.1016/J.EJOR.2012.03.044
Recommended article: A Meta-Heuristic Algorithm Combining Between Tabu and Variable Neighborhood Search for the Minimum Latency Problem
Recommended article: Effective metaheuristics for the latency location routing problem
Recommended article: A Faster, Better Approximation Algorithm for the Minimum Latency Problem
Recommended article: An improved approximation ratio for the minimum latency problem
Recommended article: Q4875179
Recommended article: Reoptimization of Minimum Latency problem
Recommended article: Q4471278
Recommended article: Approximation Schemes for Minimum Latency Problems
description: scientific article; zbMATH DE number 6119468