Pages that link to "Item:Q862819"
From MaRDI portal
The following pages link to Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking (Q862819):
Displaying 50 items.
- 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)
- Sequential and parallel large neighborhood search algorithms for the periodic location routing problem (Q319012) (← links)
- The fleet size and mix location-routing problem with time windows: formulations and a heuristic algorithm (Q320620) (← links)
- The latency location-routing problem (Q323569) (← links)
- Location-arc routing problem: heuristic approaches and test instances (Q336937) (← 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)
- 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)
- Lower and upper bounds for the two-echelon capacitated location-routing problem (Q339668) (← links)
- An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics (Q339671) (← links)
- Modeling and solving profitable location and distribution problems (Q375987) (← links)
- Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking (Q421715) (← links)
- A hybrid evolutionary algorithm for the periodic location-routing problem (Q531435) (← links)
- Efficient frameworks for greedy split and new depth first search split procedures for routing problems (Q613510) (← links)
- A Branch-and-Cut method for the Capacitated Location-Routing Problem (Q622138) (← links)
- A GRASP with evolutionary path relinking for the truck and trailer routing problem (Q632678) (← links)
- A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery (Q713116) (← links)
- Solving the capacitated location-routing problem. Abstract of Thesis (Q926566) (← links)
- A path relinking approach for the team orienteering problem (Q975993) (← links)
- A GRASP\(\times \)ELS approach for the capacitated location-routing problem (Q976006) (← links)
- Solving the bus evacuation problem and its variants (Q1651627) (← 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)
- Optimization of two-stage location-routing-inventory problem with time-windows in food distribution network (Q1730648) (← links)
- A comparative study of two hybrid grouping evolutionary techniques for the capacitated P-median problem (Q1761153) (← links)
- Selective capacitated location-routing problem with incentive-dependent returns in designing used products collection network (Q1991177) (← links)
- New formulations and solution approaches for the latency location routing problem (Q2147033) (← 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)
- Distribution systems design with two-level routing considerations (Q2267311) (← links)
- Using greedy clustering method to solve capacitated location-routing problem with fuzzy demands (Q2355806) (← links)
- Evolution-inspired local improvement algorithm solving orienteering problem (Q2399337) (← links)
- A particle swarm optimization algorithm with path relinking for the location routing problem (Q2481605) (← 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)
- 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)
- A taxonomical analysis, current methods and objectives on location-routing problems (Q2865162) (← links)
- An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem (Q2967616) (← links)
- A heuristic two-phase solution approach for the multi-objective dial-a-ride problem (Q3057122) (← links)
- A relax‐and‐price heuristic for the inventory‐location‐routing problem (Q5246829) (← links)
- Comments on: Routing problems with loading constraints (Q5966101) (← links)
- The location routing problem with facility sizing decisions (Q6056170) (← links)
- Hybrid heuristic for the location‐inventory‐routing problem in closed‐loop supply chain (Q6070502) (← links)
- Using horizontal cooperation concepts in integrated routing and facility‐location decisions (Q6070979) (← links)
- Cooperative game‐theoretic features of cost sharing in location‐routing (Q6090481) (← links)
