Variable neighborhood search for location routing
From MaRDI portal
Publication:339539
DOI10.1016/j.cor.2012.05.009zbMath1349.90091OpenAlexW2068750753MaRDI QIDQ339539
Nenad Mladenoviä, Houda Derbel, Saïd Hanafi, Bassem Jarboui
Publication date: 11 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2012.05.009
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (33)
An integration of mixed VND and VNS: the case of the multivehicle covering tour problem ⋮ A survey of recent research on location-routing problems ⋮ Solving the dynamic capacitated location-routing problem with fuzzy demands by hybrid heuristic algorithm ⋮ 0-1 quadratic knapsack problem solved with VNS algorithm ⋮ 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 ⋮ The latency location-routing problem ⋮ Variable neighborhood search for the pharmacy duty scheduling 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 ⋮ Skewed general variable neighborhood search for the location routing scheduling problem ⋮ 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 multi-zone location-routing problem with pricing: a flow-based formulation and two heuristic approaches ⋮ A fuzzy correlation based heuristic for dual-mode integrated location routing problem ⋮ Efficient metaheuristics for the home (health)-care routing and scheduling problem with time windows and synchronized visits ⋮ Multiple traveling salesperson problem with drones: general variable neighborhood search approach ⋮ Metaheuristics for solving the biobjective single‐path multicommodity communication flow problem ⋮ A survey of the standard location-routing problem ⋮ Hybrid evolutionary search for the traveling repairman problem with profits ⋮ Mathematical modelling and heuristic approaches to the location-routing problem of a cost-effective integrated solid waste management ⋮ Introduction of an underground waste container system-model and solution approaches ⋮ Designing a sustainable supply chain network integrated with vehicle routing: a comparison of hybrid swarm intelligence metaheuristics ⋮ Solving a bi-objective transportation location routing problem by metaheuristic algorithms ⋮ Parallel-machine group scheduling with inclusive processing set restrictions, outsourcing option and serial-batching under the effect of step-deterioration ⋮ Many-to-many location-routing with inter-hub transport and multi-commodity pickup-and-delivery ⋮ A matheuristic for the 0--1 generalized quadratic multiple knapsack problem ⋮ A parallel variable neighborhood search for solving covering salesman problem ⋮ Variable neighborhood search-based solution methods for the pollution location-inventory-routing problem ⋮ A covering traveling salesman problem with profit in the last mile delivery ⋮ Combinatorial GVNS (general variable neighborhood search) optimization for dynamic garbage collection ⋮ A taxonomical analysis, current methods and objectives on location-routing problems ⋮ The vacation planning problem: a multi-level clustering-based metaheuristic approach
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Location-routing: issues, models and methods
- Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking
- An effective VNS for the capacitated \(p\)-median problem
- A variable neighborhood search for the capacitated arc routing problem with intermediate facilities
- Variable neighbourhood search: methods and applications
- A GRASP\(\times \)ELS approach for the capacitated location-routing problem
- A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem
- A comparative study of heuristics for a two-level routing-location problem
- An exact algorithm for minimizing routing and operating costs in depot location
- Optimizing solid waste collection in Brussels
- A multi-level composite heuristic for the multi-depot vehicle fleet mix problem
- Variable neighborhood search
- BoneRoute: An adaptive memory-based method for effective fleet management
- A compact model and tight bounds for a combined location-routing problem
- Solving the \(p\)-median problem with pos/neg weights by variable neighborhood search and some results for special cases
- Variable neighborhood search for the dial-a-ride problem
- Sum-of-squares clustering on networks
- A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time Windows
- Tabu Search—Part I
- Variable neighborhood search for the p-median
- Variable Neighborhood Search
- Nested Heuristic Methods for the Location-Routeing Problem
- Variable neighborhood search: Principles and applications
This page was built for publication: Variable neighborhood search for location routing
