Pages that link to "Item:Q2629668"

The following pages link to A survey of variants and extensions of the location-routing problem (Q2629668):

Displaying 50 items.

• 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)
• Improved algorithms for joint optimization of facility locations and network connections (Q322548) (← links)
• A new bi-objective location-routing problem for distribution of perishable products: evolutionary computation approach (Q894544) (← links)
• A simple and effective evolutionary algorithm for the capacitated location-routing problem (Q1651634) (← links)
• Branch-and-price and adaptive large neighborhood search for the truck and trailer routing problem with time windows (Q1652285) (← links)
• Multi-commodity location-routing: flow intercepting formulation and branch-and-cut algorithm (Q1652448) (← links)
• A column generation approach for the location-routing problem with time windows (Q1652527) (← links)
• A profit-maximization location-routing-pricing problem: a branch-and-price algorithm (Q1653368) (← links)
• A multi-depot two-echelon vehicle routing problem with delivery options arising in the last mile distribution (Q1681304) (← links)
• A survey of the standard location-routing problem (Q1698292) (← links)
• The green location-routing problem (Q1722977) (← links)
• Optimization of two-stage location-routing-inventory problem with time-windows in food distribution network (Q1730648) (← links)
• Flexible two-echelon location routing problem (Q1740565) (← links)
• Column generation based approaches for combined routing and scheduling (Q1742215) (← links)
• An efficient heuristic algorithm for the alternative-fuel station location problem (Q1744496) (← links)
• Multi-period capacitated facility location under delayed demand satisfaction (Q1751264) (← links)
• A heuristic algorithm for solving large location-inventory problems with demand uncertainty (Q1751826) (← links)
• The value of integrating loading and routing (Q1752774) (← links)
• The electric location routing problem with time windows and partial recharging (Q1753521) (← links)
• Inventory routing with pickups and deliveries (Q1754327) (← links)
• A simultaneous facility location and vehicle routing problem arising in health care logistics in the Netherlands (Q1754370) (← links)
• Two-echelon location routing synchronized with production schedules and time windows (Q1788921) (← links)
• A column generation approach for location-routing problems with pickup and delivery (Q1991113) (← links)
• Selective capacitated location-routing problem with incentive-dependent returns in designing used products collection network (Q1991177) (← links)
• A stochastic multi-period industrial hazardous waste location-routing problem: integrating NSGA-II and Monte Carlo simulation (Q1991221) (← links)
• Combining facility location and routing decisions in sustainable urban freight distribution under horizontal collaboration: how can shippers be benefited? (Q1993244) (← links)
• Hybrid heuristic for the optimal design of photovoltaic installations considering mismatch loss effects (Q2003424) (← links)
• An exact solution method for a rich helicopter flight scheduling problem arising in offshore oil and gas logistics (Q2027044) (← links)
• A parallelised large neighbourhood search heuristic for the asymmetric two-echelon vehicle routing problem with swap containers for cargo-bicycles (Q2029063) (← links)
• Objectives and methods in multi-objective routing problems: a survey and classification scheme (Q2029300) (← links)
• The capacitated directed cycle hub location and routing problem under congestion (Q2030629) (← links)
• A two-stage robust approach to integrated station location and rebalancing vehicle service design in bike-sharing systems (Q2076869) (← links)
• A location-or-routing problem with partial and decaying coverage (Q2108134) (← links)
• Interdicting facilities in tree networks (Q2121611) (← links)
• A variable neighborhood search based matheuristic for a waste cooking oil collection network design problem (Q2140329) (← links)
• Integrating order delivery and return operations for order fulfillment in an online retail environment (Q2147018) (← links)
• New formulations and solution approaches for the latency location routing problem (Q2147033) (← links)
• The multi-zone location-routing problem with pricing: a flow-based formulation and two heuristic approaches (Q2156989) (← links)
• Dynamic pooled capacity deployment for urban parcel logistics (Q2158021) (← links)
• A waste collection problem with service type option (Q2160512) (← links)
• A branch-and-price algorithm for location-routing problems with pick-up stations in the last-mile distribution system (Q2160517) (← links)
• A large neighbourhood search metaheuristic for the contagious disease testing problem (Q2171555) (← links)
• Bifactor approximation for location routing with vehicle and facility capacities (Q2171591) (← links)
• The median routing problem for simultaneous planning of emergency response and non-emergency jobs (Q2183877) (← links)
• Optimizing the changing locations of mobile parcel lockers in last-mile distribution (Q2184067) (← links)
• A hyper-heuristic based artificial bee colony algorithm for \(k\)-interconnected multi-depot multi-traveling salesman problem (Q2198264) (← links)
• Introduction of an underground waste container system-model and solution approaches (Q2239914) (← links)
• Designing multi-tier, multi-service-level, and multi-modal last-mile distribution networks for omni-channel operations (Q2240054) (← links)
• Logistics planning of cash transfer to Syrian refugees in Turkey (Q2242358) (← links)