Location-arc routing problem: heuristic approaches and test instances
type: Item
instance of: scholarly article
title: Location-arc routing problem: heuristic approaches and test instances
zbMATH Open document ID: 1348.90404
author: Rui Borges Lopes
author: Carlos Ferreira
author: Beatriz Sousa Santos
author: Frank Plastria
published in: Computers \& Operations Research
publication date: 2016-11-10T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6650634
zbMATH Keywords: location-routing
zbMATH Keywords: arc routing
zbMATH Keywords: heuristics
zbMATH Keywords: test instances
MaRDI profile type: Publication
full work available at URL: j.cor.2013.10.003
OpenAlex ID: W1964126501
Wikidata QID: Q61441931
cites work: Location-routing: issues, models and methods
cites work: A taxonomical analysis, current methods and objectives on location-routing problems
cites work: Capacitated arc routing problems
cites work: Transforming arc routing into node routing problems
cites work: Exact methods based on node-routing formulations for undirected arc-routing problems
cites work: Solving capacitated arc routing problems using a transformation to the CVRP
cites work: A Decade of Capacitated Arc Routing
cites work: Q3787762
cites work: Eulerian location problems
cites work: Routing, districting and location for arc traversal problems. (Abstract of thesis).
cites work: A variable neighborhood descent algorithm for a real waste collection problem with mobile depots
cites work: The capacitated arc routing problem with refill points
cites work: Q3993417
cites work: Guidelines for the use of meta-heuristics in combinatorial optimization.
cites work: Lower and upper bounds for the mixed capacitated arc routing problem
cites work: Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking
cites work: A guided local search heuristic for the capacitated arc routing problem
cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem
cites work: The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
cites work: Handbook of metaheuristics
cites work: Q5191184
cites work: Variable neighborhood search
cites work: Variable neighborhood search: Principles and applications
cites work: A variable neighborhood search for the capacitated arc routing problem with intermediate facilities
cites work: A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
cites work: Future paths for integer programming and links to artificial intelligence
cites work: Using clustering analysis in a capacitated location-routing problem
cites work: Q4452897
cites work: A note on two problems in connexion with graphs
cites work: The Capacitated Arc Routing Problem: Lower bounds
cites work: Routeing winter gritting vehicles
DOI: 10.1016/J.COR.2013.10.003
description: scientific article; zbMATH DE number 6650634