Variable neighborhood search for location routing
From MaRDI portal
(Redirected from Publication:339539)
Recommendations
- scientific article; zbMATH DE number 6004949
- Skewed general variable neighborhood search for the location routing scheduling problem
- Variable neighborhood search for solving the balanced location problem
- A variable neighborhood search approach for the two-echelon location-routing problem
- Variable Neighborhood Search
Cites work
- scientific article; zbMATH DE number 1076399 (Why is no real title available?)
- A GRASP\(\times \)ELS approach for the capacitated location-routing problem
- A compact model and tight bounds for a combined location-routing problem
- A comparative study of heuristics for a two-level routing-location problem
- A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem
- A multi-level composite heuristic for the multi-depot vehicle fleet mix problem
- A reactive variable neighborhood search for the vehicle-routing problem with time windows
- A variable neighborhood search for the capacitated arc routing problem with intermediate facilities
- An effective VNS for the capacitated \(p\)-median problem
- An exact algorithm for minimizing routing and operating costs in depot location
- An iterated local search for solving a location-routing problem
- BoneRoute: An adaptive memory-based method for effective fleet management
- Location-routing: issues, models and methods
- Nested Heuristic Methods for the Location-Routeing Problem
- Optimization by simulated annealing
- Optimizing solid waste collection in Brussels
- Solving the \(p\)-median problem with pos/neg weights by variable neighborhood search and some results for special cases
- Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking
- Sum-of-squares clustering on networks
- Tabu Search—Part I
- Variable Neighborhood Search
- Variable neighborhood search
- Variable neighborhood search for the dial-a-ride problem
- Variable neighborhood search for the p-median
- Variable neighborhood search: Principles and applications
- Variable neighbourhood search: methods and applications
Cited in
(39)- A variable neighborhood search algorithm for the vehicle routing problem with multiple trips
- A variable neighborhood search based matheuristic for a waste cooking oil collection network design problem
- Mathematical modelling and heuristic approaches to the location-routing problem of a cost-effective integrated solid waste management
- Parallel-machine group scheduling with inclusive processing set restrictions, outsourcing option and serial-batching under the effect of step-deterioration
- Combinatorial GVNS (general variable neighborhood search) optimization for dynamic garbage collection
- Variable neighborhood search approach for the location and design problem
- Designing a sustainable supply chain network integrated with vehicle routing: a comparison of hybrid swarm intelligence metaheuristics
- Multilayer variable neighborhood search for two-level uncapacitated facility location problems with single assignment
- Solving the joint production distribution problem by the variable neighbourhood search algorithm
- A variable neighborhood search for the network design problem with relays
- A survey of recent research on location-routing problems
- Multiple traveling salesperson problem with drones: general variable neighborhood search approach
- A hybrid variable neighborhood search for the orienteering problem with mandatory visits and exclusionary constraints
- A general variable neighborhood search for the swap-body vehicle routing problem
- The vacation planning problem: a multi-level clustering-based metaheuristic approach
- Solving a bi-objective transportation location routing problem by metaheuristic algorithms
- A taxonomical analysis, current methods and objectives on location-routing problems
- 0-1 quadratic knapsack problem solved with VNS algorithm
- An integration of mixed VND and VNS: the case of the multivehicle covering tour problem
- Variable neighborhood search-based solution methods for the pollution location-inventory-routing problem
- A survey of the standard location-routing problem
- A metaheuristic to solve a location-routing problem with nonlinear costs
- Many-to-many location-routing with inter-hub transport and multi-commodity pickup-and-delivery
- Efficient metaheuristics for the home (health)-care routing and scheduling problem with time windows and synchronized visits
- The latency location-routing problem
- A parallel variable neighborhood search for solving covering salesman problem
- A covering traveling salesman problem with profit in the last mile delivery
- A fuzzy correlation based heuristic for dual-mode integrated location routing problem
- Introduction of an underground waste container system-model and solution approaches
- Metaheuristics for solving the biobjective single‐path multicommodity communication flow problem
- A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion
- A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows
- Variable neighborhood search for the pharmacy duty scheduling problem
- Hybrid evolutionary search for the traveling repairman problem with profits
- Skewed general variable neighborhood search for the location routing scheduling problem
- A matheuristic for the 0--1 generalized quadratic multiple knapsack problem
- A variable neighborhood search approach for the two-echelon location-routing problem
- Solving the dynamic capacitated location-routing problem with fuzzy demands by hybrid heuristic algorithm
- The multi-zone location-routing problem with pricing: a flow-based formulation and two heuristic approaches
This page was built for publication: Variable neighborhood search for location routing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q339539)
