Location-arc routing problem: heuristic approaches and test instances
DOI10.1016/J.COR.2013.10.003zbMATH Open1348.90404OpenAlexW1964126501WikidataQ61441931 ScholiaQ61441931MaRDI QIDQ336937FDOQ336937
Authors: Rui Borges Lopes, Carlos Ferreira, Beatriz Sousa Santos, 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
Recommendations
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)
Cites Work
- A note on two problems in connexion with graphs
- Future paths for integer programming and links to artificial intelligence
- A decade of capacitated arc routing
- Metaheuristics. From design to implementation.
- Title not available (Why is that?)
- The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- Location-routing: issues, models and methods
- Using clustering analysis in a capacitated location-routing problem
- Variable neighborhood search
- Variable neighborhood search: Principles and applications
- Title not available (Why is that?)
- A guided local search heuristic for the capacitated arc routing problem
- The capacitated arc routing problem with refill points
- Title not available (Why is that?)
- Capacitated arc routing problems
- The Capacitated Arc Routing Problem: Lower bounds
- A variable neighborhood descent algorithm for a real waste collection problem with mobile depots
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking
- Handbook of metaheuristics
- Routing, districting and location for arc traversal problems. (Abstract of thesis).
- Lower and upper bounds for the mixed capacitated arc routing problem
- Solving capacitated arc routing problems using a transformation to the CVRP
- A taxonomical analysis, current methods and objectives on location-routing problems
- Routeing winter gritting vehicles
- Exact methods based on node-routing formulations for undirected arc-routing problems
- A variable neighborhood search for the capacitated arc routing problem with intermediate facilities
- Guidelines for the use of meta-heuristics in combinatorial optimization.
- Transforming arc routing into node routing problems
- Eulerian location problems
Cited In (10)
- Optimization of two-stage location-routing-inventory problem with time-windows in food distribution network
- Solving the dynamic capacitated location-routing problem with fuzzy demands by hybrid heuristic algorithm
- An updated annotated bibliography on arc routing problems
- Arc routing problems: A review of the past, present, and future
- A heuristic algorithm to solve the single-facility location routing problem on Riemannian surfaces
- A robust location-arc routing problem under uncertainty: mathematical model with lower and upper bounds
- Location arc routing problem with inventory constraints
- Location‐routing problem: a classification of recent research
- A branch-and-cut algorithm for the windy profitable location rural postman problem
- A survey of variants and extensions of the location-routing problem
This page was built for publication: Location-arc routing problem: heuristic approaches and test instances
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336937)
