Location-arc routing problem: heuristic approaches and test instances
From MaRDI portal
(Redirected from Publication:336937)
Recommendations
Cites work
- scientific article; zbMATH DE number 4051316 (Why is no real title available?)
- scientific article; zbMATH DE number 44281 (Why is no real title available?)
- scientific article; zbMATH DE number 2050708 (Why is no real title available?)
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- A decade of capacitated arc routing
- A guided local search heuristic for the capacitated arc routing problem
- A note on two problems in connexion with graphs
- A taxonomical analysis, current methods and objectives on location-routing problems
- A variable neighborhood descent algorithm for a real waste collection problem with mobile depots
- A variable neighborhood search for the capacitated arc routing problem with intermediate facilities
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Capacitated arc routing problems
- Eulerian location problems
- Exact methods based on node-routing formulations for undirected arc-routing problems
- Future paths for integer programming and links to artificial intelligence
- Guidelines for the use of meta-heuristics in combinatorial optimization.
- Handbook of metaheuristics
- Location-routing: issues, models and methods
- Lower and upper bounds for the mixed capacitated arc routing problem
- Metaheuristics. From design to implementation.
- Routeing winter gritting vehicles
- Routing, districting and location for arc traversal problems. (Abstract of thesis).
- Solving capacitated arc routing problems using a transformation to the CVRP
- Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking
- The Capacitated Arc Routing Problem: Lower bounds
- The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
- The capacitated arc routing problem with refill points
- Transforming arc routing into node routing problems
- Using clustering analysis in a capacitated location-routing problem
- Variable neighborhood search
- Variable neighborhood search: Principles and applications
Cited in
(11)- Optimization of two-stage location-routing-inventory problem with time-windows in food distribution network
- Location arc routing problem with inventory constraints
- An open-source desktop application for generating arc-routing benchmark instances
- A branch-and-cut algorithm for the windy profitable location rural postman problem
- Location‐routing problem: a classification of recent research
- An updated annotated bibliography on arc routing problems
- 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
- Arc routing problems: A review of the past, present, and future
- 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
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)
