Location-arc routing problem: heuristic approaches and test instances

DOI10.1016/j.cor.2013.10.003zbMath1348.90404OpenAlexW1964126501WikidataQ61441931 ScholiaQ61441931MaRDI QIDQ336937

Rui Borges Lopes, Beatriz Sousa Santos, Carlos Ferreira, Frank Plastria

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2013.10.003

zbMATH Keywords

heuristicsarc routinglocation-routingtest instances

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)

Related Items (7)

Solving the dynamic capacitated location-routing problem with fuzzy demands by hybrid heuristic algorithm ⋮ A survey of variants and extensions of the location-routing problem ⋮ Location arc routing problem with inventory constraints ⋮ Arc routing problems: A review of the past, present, and future ⋮ Location‐routing problem: a classification of recent research ⋮ Optimization of two-stage location-routing-inventory problem with time-windows in food distribution network ⋮ A robust location-arc routing problem under uncertainty: mathematical model with lower and upper bounds

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Location-routing: issues, models and methods
• Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking
• Using clustering analysis in a capacitated location-routing problem
• A variable neighborhood search for the capacitated arc routing problem with intermediate facilities
• Routeing winter gritting vehicles
• Variable neighborhood search
• Guidelines for the use of meta-heuristics in combinatorial optimization.
• Routing, districting and location for arc traversal problems. (Abstract of thesis).
• Transforming arc routing into node routing problems
• Future paths for integer programming and links to artificial intelligence
• A guided local search heuristic for the capacitated arc routing problem
• Lower and upper bounds for the mixed capacitated arc routing problem
• Solving capacitated arc routing problems using a transformation to the CVRP
• The capacitated arc routing problem with refill points
• A taxonomical analysis, current methods and objectives on location-routing problems
• Exact methods based on node-routing formulations for undirected arc-routing problems
• A Decade of Capacitated Arc Routing
• Capacitated arc routing problems
• The Capacitated Arc Routing Problem: Lower bounds
• The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
• A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
• Eulerian location problems
• A variable neighborhood descent algorithm for a real waste collection problem with mobile depots
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Handbook of metaheuristics
• Variable neighborhood search: Principles and applications

This page was built for publication: Location-arc routing problem: heuristic approaches and test instances