Pages that link to "Item:Q1610130"
From MaRDI portal
The following pages link to A two-phase tabu search approach to the location routing problem (Q1610130):
Displayed 50 items.
- 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)
- The latency location-routing problem (Q323569) (← links)
- A solution method for a two-layer sustainable supply chain distribution model (Q337368) (← links)
- A survey on two-echelon routing problems (Q337424) (← 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)
- 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)
- An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics (Q339671) (← links)
- A hybrid evolutionary algorithm for the periodic location-routing problem (Q531435) (← 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)
- Tabu search heuristic for joint location-inventory problem with stochastic inventory capacity and practicality constraints (Q724317) (← 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)
- A dynamic logistics coordination model for evacuation and support in disaster response activities (Q864038) (← links)
- Planning a capacitated road network with flexible travel times: a genetic algorithm (Q894559) (← links)
- Solving the capacitated location-routing problem. Abstract of Thesis (Q926566) (← 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)
- Combined location-routing problems -- a neural network approach (Q1026597) (← links)
- Facility location and supply chain management. A review (Q1027517) (← links)
- Neighborhood search heuristics for the uncapacitated facility location problem (Q1400664) (← links)
- Resource planning and a depot location model for electric power restoration. (Q1428043) (← 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)
- Ant colony optimization with clustering for solving the dynamic location routing problem (Q1733491) (← links)
- Distribution network design: New problems and related models (Q1771348) (← links)
- A computational comparison of flow formulations for the capacitated location-routing problem (Q1799384) (← 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)
- Multi-depot two-echelon fuel minimizing routing problem with heterogeneous fleets: model and heuristic (Q2005882) (← links)
- A blood bank network design problem with integrated facility location, inventory and routing decisions (Q2005956) (← links)
- A variable neighborhood search based matheuristic for a waste cooking oil collection network design problem (Q2140329) (← links)
- The multi-zone location-routing problem with pricing: a flow-based formulation and two heuristic approaches (Q2156989) (← links)
- Bifactor approximation for location routing with vehicle and facility capacities (Q2171591) (← links)
- Designing multi-tier, multi-service-level, and multi-modal last-mile distribution networks for omni-channel operations (Q2240054) (← links)
- Solving a bi-objective transportation location routing problem by metaheuristic algorithms (Q2256166) (← links)
- Distribution systems design with two-level routing considerations (Q2267311) (← 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 tabu search approach for the livestock collection problem (Q2482370) (← links)
- A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems (Q2488912) (← links)
- Bounds for the single source modular capacitated plant location problem (Q2489136) (← links)