A metaheuristic to solve a location-routing problem with nonlinear costs
From MaRDI portal
Publication:2491322
Recommendations
- Variable neighborhood search for location routing
- A hybrid VNS–path relinking for the p-hub median problem
- scientific article; zbMATH DE number 4051316
- Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking
- A two-phase hybrid heuristic algorithm for the capacitated location-routing problem
Cites work
- A compact model and tight bounds for a combined location-routing problem
- A two-phase tabu search approach to the location routing problem
- Diversification strategies in tabu search algorithms for the maximum clique problem
- Heuristic solutions to multi-depot location-routing problems
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- Location Models with Routing Considerations for a Single Obnoxious Facility
- Technical Note—Routing and Location-Routing p-Delivery Men Problems on a Path
- The effect of ignoring routes when locating depots
- The symmetric generalized traveling salesman polytope
- Variable neighborhood decomposition search
- Variable neighborhood search for the p-median
- Variable neighborhood search: Principles and applications
Cited in
(21)- Variable neighbourhood search: Methods and applications
- An endosymbiotic evolutionary algorithm for the hub location-routing problem
- Optimization of two-stage location-routing-inventory problem with time-windows in food distribution network
- A generalized variable neighborhood search heuristic for the capacitated vehicle routing problem with stochastic service times
- Mileage bands in freight transportation
- Introduction of an underground waste container system-model and solution approaches
- Solving a bi-objective transportation location routing problem by metaheuristic algorithms
- Distribution systems design with two-level routing considerations
- A memetic algorithm for a multi-objective obnoxious waste location-routing problem: a case study
- A location-routing problem for the conversion to the ``click-and-mortar retailing: the static case
- A particle swarm optimization algorithm with path relinking for the location routing problem
- A new formulation approach for location-routing problems
- A taxonomical analysis, current methods and objectives on location-routing problems
- A survey of recent research on location-routing problems
- Distribution network design on the battlefield
- A solution method for a two-layer sustainable supply chain distribution model
- A two-phase hybrid heuristic algorithm for the capacitated location-routing problem
- A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery
- Location-routing: issues, models and methods
- Planning a capacitated road network with flexible travel times: a genetic algorithm
- Variable neighbourhood search: methods and applications
This page was built for publication: A metaheuristic to solve a location-routing problem with nonlinear costs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2491322)
