A particle swarm optimization algorithm with path relinking for the location routing problem
From MaRDI portal
Publication:2481605
Recommendations
- A particle swarm optimisation algorithm for the capacitated location-routing problem
- scientific article; zbMATH DE number 5200587
- Research of reverse logistics location and routing problem based on an improved particle swarm optimization algorithm
- An efficient hybrid particle swarm optimization algorithm for solving the uncapacitated continuous location-allocation problem
- A particle swarm optimisation for vehicle routing problem with time windows
Cites work
- A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows
- 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 Heuristic Algorithm for the Traveling Salesman Location Problem on Networks
- A hybrid clonal selection algorithm for the location routing problem with stochastic demands
- A hybrid genetic-GRASP algorithm using Lagrangean relaxation for the traveling salesman problem
- A metaheuristic to solve a location-routing problem with nonlinear costs
- A two-phase tabu search approach to the location routing problem
- Combined location-routing problems: A synthesis and future research directions
- Computer Solutions of the Traveling Salesman Problem
- Discrete facility location and routing of obnoxious activities.
- Dynamic Location-routeing Problems
- Expanding neighborhood GRASP for the traveling salesman problem
- Hamiltonian location problems
- Heuristic solutions to multi-depot location-routing problems
- scientific article; zbMATH DE number 4051316 (Why is no real title available?)
- scientific article; zbMATH DE number 192876 (Why is no real title available?)
- scientific article; zbMATH DE number 2050708 (Why is no real title available?)
- scientific article; zbMATH DE number 821272 (Why is no real title available?)
- Integrating multi-product production and distribution in newspaper logistics
- Integrating purchasing and routing in a propane gas supply chain.
- Location Models with Routing Considerations for a Single Obnoxious Facility
- Location-routing: issues, models and methods
- Locational analysis
- Multi-objective metaheuristics for a location-routing problem with multiple use of vehicles on real data and simulated data
- Multiple phase neighborhood search---GRASP based on Lagrangean relaxation, random backtracking Lin-Kernighan and path relinking for the TSP
- Nested Heuristic Methods for the Location-Routeing Problem
- Scatter Search and Path Relinking: Advances and Applications
- Solving a multiobjective location routing problem with a metaheuristic based on tabu search. Application to a real case in Andalusia
- Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking
- Technical Note—Routing and Location-Routing p-Delivery Men Problems on a Path
- The multiple depot, multiple traveling salesmen facility-location problem: Vehicle range, service frequency, and heuristic implementations
- The vehicle routing problem
- Using clustering analysis in a capacitated location-routing problem
- Variable neighborhood search: Principles and applications
- Vehicle routing considerations in distribution system design
Cited in
(21)- A survey of the standard location-routing problem
- A hybrid particle swarm optimization -- variable neighborhood search algorithm for constrained shortest path problems
- Solving a bi-objective transportation location routing problem by metaheuristic algorithms
- A memetic algorithm for a multi-objective obnoxious waste location-routing problem: a case study
- Efficient computation of shortest paths in networks using particle swarm optimization and noising metaheuristics
- A particle swarm optimisation algorithm for the capacitated location-routing problem
- An efficient hybrid particle swarm optimization algorithm for solving the uncapacitated continuous location-allocation problem
- A hybrid clonal selection algorithm for the location routing problem with stochastic demands
- A taxonomical analysis, current methods and objectives on location-routing problems
- Research of reverse logistics location and routing problem based on an improved particle swarm optimization algorithm
- The latency location-routing problem
- A solution method for a two-layer sustainable supply chain distribution model
- A memetic algorithm for the capacitated location-routing problem with mixed backhauls
- A simulated annealing heuristic for the open location-routing problem
- Particle swarm optimization for split delivery vehicle routing problem
- An improved particle swarm optimization for the automobile spare part warehouse location problem
- Dynamic Adaptive Large Neighborhood Search for Inventory Routing Problem
- Comments on: Routing problems with loading constraints
- Hybrid heuristic for the location‐inventory‐routing problem in closed‐loop supply chain
- A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery
- Multiple phase neighborhood search---GRASP based on Lagrangean relaxation, random backtracking Lin-Kernighan and path relinking for the TSP
This page was built for publication: A particle swarm optimization algorithm with path relinking for the location routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2481605)
