Pages that link to "Item:Q864016"

The following pages link to Using clustering analysis in a capacitated location-routing problem (Q864016):

Displaying 50 items.

• A new formulation approach for location-routing problems (Q264241) (← links)
• A hybrid clonal selection algorithm for the location routing problem with stochastic demands (Q276534) (← links)
• A survey of recent research on location-routing problems (Q296678) (← links)
• Solving the dynamic capacitated location-routing problem with fuzzy demands by hybrid heuristic algorithm (Q296782) (← links)
• Location-arc routing problem: heuristic approaches and test instances (Q336937) (← links)
• A distribution network design problem in the automotive industry: MIP formulation and heuristics (Q337173) (← links)
• A memetic algorithm for the capacitated location-routing problem with mixed backhauls (Q337427) (← links)
• Skewed general variable neighborhood search for the location routing scheduling problem (Q337608) (← links)
• A simulated annealing heuristic for the open location-routing problem (Q337651) (← links)
• A two-phase hybrid heuristic algorithm for the capacitated location-routing problem (Q339543) (← links)
• Learnheuristics: hybridizing metaheuristics with machine learning for optimization with dynamic inputs (Q521579) (← links)
• 2-facility manifold location routing problem (Q526422) (← links)
• A reactive GRASP with path relinking for capacitated clustering (Q535394) (← links)
• A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery (Q713116) (← links)
• Model-based capacitated clustering with posterior regularization (Q724144) (← links)
• Location-routing: issues, models and methods (Q856260) (← links)
• A new bi-objective location-routing problem for distribution of perishable products: evolutionary computation approach (Q894544) (← links)
• A heuristic based on multi-exchange techniques for a regional fleet assignment location-routing problem (Q954046) (← links)
• Lower and upper bounds for a capacitated plant location problem with multicommodity flow (Q1025254) (← links)
• A simple and effective evolutionary algorithm for the capacitated location-routing problem (Q1651634) (← links)
• A column generation approach for the location-routing problem with time windows (Q1652527) (← links)
• A survey of the standard location-routing problem (Q1698292) (← links)
• Ant colony optimization with clustering for solving the dynamic location routing problem (Q1733491) (← links)
• A hierarchical algorithm for the planar single-facility location routing problem (Q1761993) (← links)
• Synergies between operations research and data mining: the emerging use of multi-objective approaches (Q1926877) (← links)
• Selective capacitated location-routing problem with incentive-dependent returns in designing used products collection network (Q1991177) (← links)
• The vacation planning problem: a multi-level clustering-based metaheuristic approach (Q2108189) (← links)
• A variable neighborhood search based matheuristic for a waste cooking oil collection network design problem (Q2140329) (← links)
• Bifactor approximation for location routing with vehicle and facility capacities (Q2171591) (← links)
• Solving a bi-objective transportation location routing problem by metaheuristic algorithms (Q2256166) (← links)
• A heuristic algorithm to solve the single-facility location routing problem on Riemannian surfaces (Q2355716) (← links)
• Using greedy clustering method to solve capacitated location-routing problem with fuzzy demands (Q2355806) (← links)
• A memetic algorithm for a multi-objective obnoxious waste location-routing problem: a case study (Q2404310) (← links)
• A particle swarm optimization algorithm with path relinking for the location routing problem (Q2481605) (← links)
• Many-to-many location-routing with inter-hub transport and multi-commodity pickup-and-delivery (Q2514738) (← links)
• A survey of variants and extensions of the location-routing problem (Q2629668) (← links)
• Evolutionary hyperheuristics for location-routing problem with simultaneous pickup and delivery (Q2658463) (← links)
• Decomposition-based hyperheuristic approaches for the bi-objective cold chain considering environmental effects (Q2664375) (← links)
• A progressive filtering heuristic for the location-routing problem and variants (Q2668599) (← links)
• Hybrid adaptive large neighborhood search for vehicle routing problems with depot location decisions (Q2676276) (← links)
• Resilient route design for collection of material from suppliers with split deliveries and stochastic demands (Q2676305) (← links)
• A fuzzy correlation based heuristic for dual-mode integrated location routing problem (Q2676327) (← links)
• A taxonomical analysis, current methods and objectives on location-routing problems (Q2865162) (← links)
• Multi-objective evolutionary approach for supply chain network design problem within online customer consideration (Q2969963) (← links)
• Distribution network design on the battlefield (Q3168957) (← links)
• A Metaheuristic for the Periodic Location-Routing Problem (Q5391896) (← links)
• Comments on: Routing problems with loading constraints (Q5966101) (← links)
• The location routing problem with facility sizing decisions (Q6056170) (← links)
• Clustering retail stores for inventory transshipment (Q6096594) (← links)
• A unified exact approach for a broad class of vehicle routing problems with simultaneous pickup and delivery (Q6551059) (← links)