Pages that link to "Item:Q976006"

The following pages link to A GRASP\(\times \)ELS approach for the capacitated location-routing problem (Q976006):

Displaying 38 items.

• A new formulation approach for location-routing problems (Q264241) (← 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)
• The fleet size and mix location-routing problem with time windows: formulations and a heuristic algorithm (Q320620) (← links)
• A solution method for a two-layer sustainable supply chain distribution model (Q337368) (← 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)
• Variable neighborhood search for location routing (Q339539) (← links)
• A two-phase hybrid heuristic algorithm for the capacitated location-routing problem (Q339543) (← links)
• An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics (Q339671) (← links)
• Technical note: Split algorithm in \(O(n)\) for the capacitated vehicle routing problem (Q342313) (← links)
• Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking (Q421715) (← links)
• Multiperiod location-routing with decoupled time scales (Q439365) (← links)
• A hybrid evolutionary algorithm for the periodic location-routing problem (Q531435) (← links)
• A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem (Q609809) (← links)
• Efficient frameworks for greedy split and new depth first search split procedures for routing problems (Q613510) (← links)
• A GRASP with evolutionary path relinking for the truck and trailer routing problem (Q632678) (← links)
• Planning a capacitated road network with flexible travel times: a genetic algorithm (Q894559) (← links)
• A simple and effective evolutionary algorithm for the capacitated location-routing problem (Q1651634) (← links)
• A survey of the standard location-routing problem (Q1698292) (← links)
• Optimization of a two-echelon location lot-sizing routing problem with deterministic demand (Q1720647) (← links)
• Column generation based heuristics for a generalized location routing problem with profits arising in space exploration (Q1926985) (← links)
• Selective capacitated location-routing problem with incentive-dependent returns in designing used products collection network (Q1991177) (← links)
• A location-or-routing problem with partial and decaying coverage (Q2108134) (← links)
• An efficient GRASP-like algorithm for the multi-product straight pipeline scheduling problem (Q2108188) (← 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)
• 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)
• Hybrid adaptive large neighborhood search for vehicle routing problems with depot location decisions (Q2676276) (← links)
• (Q2861505) (← links)
• A taxonomical analysis, current methods and objectives on location-routing problems (Q2865162) (← links)
• Comments on: Routing problems with loading constraints (Q5966101) (← links)
• Model and algorithm for bilevel multisized terminal location‐routing problem for the last mile delivery (Q6087621) (← links)
• Exact and metaheuristic approaches to solve the integrated production scheduling, berth allocation and storage yard allocation problem (Q6164375) (← links)
• A conceptually simple algorithm for the capacitated location-routing problem (Q6491328) (← links)