Pages that link to "Item:Q1603335"

The following pages link to Heuristic solutions to multi-depot location-routing problems (Q1603335):

Displaying 50 items.

• A new formulation approach for location-routing problems (Q264241) (← links)
• The fleet size and mix location-routing problem with time windows: formulations and a heuristic algorithm (Q320620) (← links)
• A distribution network design problem in the automotive industry: MIP formulation and heuristics (Q337173) (← 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)
• Battery swap station location-routing problem with capacitated electric vehicles (Q337428) (← links)
• Skewed general variable neighborhood search for the location routing scheduling problem (Q337608) (← 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 branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery (Q713116) (← links)
• Warehouse location with production, inventory, and distribution decisions: a case study in the lube oil industry (Q742505) (← links)
• The multiple depot, multiple traveling salesmen facility-location problem: Vehicle range, service frequency, and heuristic implementations (Q814246) (← links)
• Location-routing: issues, models and methods (Q856260) (← links)
• Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking (Q862819) (← links)
• Planning a capacitated road network with flexible travel times: a genetic algorithm (Q894559) (← links)
• A heuristic based on multi-exchange techniques for a regional fleet assignment location-routing problem (Q954046) (← links)
• A GRASP\(\times \)ELS approach for the capacitated location-routing problem (Q976006) (← links)
• Lower and upper bounds for a capacitated plant location problem with multicommodity flow (Q1025254) (← links)
• Combined location-routing problems -- a neural network approach (Q1026597) (← links)
• Facility location and supply chain management. A review (Q1027517) (← links)
• An endosymbiotic evolutionary algorithm for the hub location-routing problem (Q1665926) (← links)
• A methodology to exploit profit allocation in logistics joint distribution network optimization (Q1666679) (← links)
• A survey of the standard location-routing problem (Q1698292) (← links)
• Decomposition techniques with mixed integer programming and heuristics for home healthcare planning (Q1699130) (← links)
• A framing link based tabu search algorithm for large-scale multidepot vehicle routing problems (Q1717769) (← links)
• A multiobjective route robust optimization model and algorithm for hazmat transportation (Q1727041) (← links)
• Fresh seafood delivery routing problem using an improved ant colony optimization (Q1730650) (← links)
• Ant colony optimization with clustering for solving the dynamic location routing problem (Q1733491) (← links)
• Algorithm for directing cooperative vehicles of a vehicle routing problem for improving fault-tolerance (Q1787317) (← links)
• A computational comparison of flow formulations for the capacitated location-routing problem (Q1799384) (← links)
• Designing radio-mobile access networks based on synchronous digital hierarchy rings (Q1885949) (← links)
• High-level relay hybrid metaheuristic method for multi-depot vehicle routing problem with time windows (Q1951171) (← links)
• A blood bank network design problem with integrated facility location, inventory and routing decisions (Q2005956) (← links)
• Heuristic optimization for multi-depot vehicle routing problem in ATM network model (Q2087124) (← links)
• Logic-based benders decomposition for an inter-modal transportation problem (Q2117232) (← links)
• The multi-zone location-routing problem with pricing: a flow-based formulation and two heuristic approaches (Q2156989) (← links)
• Solving a bi-objective transportation location routing problem by metaheuristic algorithms (Q2256166) (← links)
• Distribution systems design with two-level routing considerations (Q2267311) (← links)
• Algorithms for the design of network topologies with balanced disjoint rings (Q2267818) (← links)
• Using metaheuristics on the multi-depot vehicle routing problem with modified optimization criterion (Q2283871) (← links)
• The heterogeneous fleet location routing problem with simultaneous pickup and delivery and overloads (Q2321672) (← links)
• Sustainable multi-depot emergency facilities location-routing problem with uncertain information (Q2335140) (← links)
• A memetic algorithm for a multi-objective obnoxious waste location-routing problem: a case study (Q2404310) (← links)
• Multi-objective metaheuristics for a location-routing problem with multiple use of vehicles on real data and simulated data (Q2433556) (← links)
• A location-routing problem for the conversion to the ``click-and-mortar'' retailing: the static case (Q2462150) (← links)
• A particle swarm optimization algorithm with path relinking for the location routing problem (Q2481605) (← links)
• A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems (Q2488912) (← links)
• A metaheuristic to solve a location-routing problem with nonlinear costs (Q2491322) (← links)