Using clustering analysis in a capacitated location-routing problem
From MaRDI portal
Publication:864016
DOI10.1016/j.ejor.2005.06.074zbMath1163.90589OpenAlexW1998650636WikidataQ61442137 ScholiaQ61442137MaRDI QIDQ864016
Publication date: 12 February 2007
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2005.06.074
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items
A new formulation approach for location-routing problems, A hybrid clonal selection algorithm for the location routing problem with stochastic demands, Distribution network design on the battlefield, A survey of recent research on location-routing problems, 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, A variable neighborhood search based matheuristic for a waste cooking oil collection network design problem, Location-routing: issues, models and methods, Location-arc routing problem: heuristic approaches and test instances, A distribution network design problem in the automotive industry: MIP formulation and heuristics, A memetic algorithm for the capacitated location-routing problem with mixed backhauls, Skewed general variable neighborhood search for the location routing scheduling problem, A simple and effective evolutionary algorithm for the capacitated location-routing problem, A simulated annealing heuristic for the open location-routing problem, A column generation approach for the location-routing problem with time windows, A two-phase hybrid heuristic algorithm for the capacitated location-routing problem, Evolutionary hyperheuristics for location-routing problem with simultaneous pickup and delivery, Bifactor approximation for location routing with vehicle and facility capacities, A memetic algorithm for a multi-objective obnoxious waste location-routing problem: a case study, Decomposition-based hyperheuristic approaches for the bi-objective cold chain considering environmental effects, A progressive filtering heuristic for the location-routing problem and variants, Synergies between operations research and data mining: the emerging use of multi-objective approaches, Hybrid adaptive large neighborhood search for vehicle routing problems with depot location decisions, Resilient route design for collection of material from suppliers with split deliveries and stochastic demands, A fuzzy correlation based heuristic for dual-mode integrated location routing problem, The location routing problem with facility sizing decisions, A new bi-objective location-routing problem for distribution of perishable products: evolutionary computation approach, Clustering retail stores for inventory transshipment, A survey of the standard location-routing problem, Multi-objective evolutionary approach for supply chain network design problem within online customer consideration, A Metaheuristic for the Periodic Location-Routing Problem, Ant colony optimization with clustering for solving the dynamic location routing problem, Selective capacitated location-routing problem with incentive-dependent returns in designing used products collection network, A heuristic based on multi-exchange techniques for a regional fleet assignment location-routing problem, Learnheuristics: hybridizing metaheuristics with machine learning for optimization with dynamic inputs, 2-facility manifold location routing problem, A particle swarm optimization algorithm with path relinking for the location routing problem, A reactive GRASP with path relinking for capacitated clustering, Solving a bi-objective transportation location routing problem by metaheuristic algorithms, A hierarchical algorithm for the planar single-facility location routing problem, A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery, Model-based capacitated clustering with posterior regularization, Many-to-many location-routing with inter-hub transport and multi-commodity pickup-and-delivery, Comments on: Routing problems with loading constraints, Lower and upper bounds for a capacitated plant location problem with multicommodity flow, A taxonomical analysis, current methods and objectives on location-routing problems, The vacation planning problem: a multi-level clustering-based metaheuristic approach, A heuristic algorithm to solve the single-facility location routing problem on Riemannian surfaces, Using greedy clustering method to solve capacitated location-routing problem with fuzzy demands
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Hamiltonian p-median problem
- Monte Carlo comparisons of selected clustering procedures
- Hierarchical clustering schemes
- The Truck Dispatching Problem
- Finding Groups in Data
- Generalized Clustering for Problem Localization
- Unresolved Problems in Cluster Analysis
