Pages that link to "Item:Q339668"

The following pages link to Lower and upper bounds for the two-echelon capacitated location-routing problem (Q339668):

Displaying 32 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)
• 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)
• An adaptive large neighborhood search for an E-grocery delivery routing problem (Q342326) (← links)
• A large neighbourhood based heuristic for two-echelon routing problems (Q342576) (← links)
• A multi-depot two-echelon vehicle routing problem with delivery options arising in the last mile distribution (Q1681304) (← links)
• Flexible two-echelon location routing problem (Q1740565) (← links)
• The two-echelon capacitated electric vehicle routing problem with battery swapping stations: formulation and efficient methodology (Q1991213) (← links)
• Combining facility location and routing decisions in sustainable urban freight distribution under horizontal collaboration: how can shippers be benefited? (Q1993244) (← links)
• Multi-depot two-echelon fuel minimizing routing problem with heterogeneous fleets: model and heuristic (Q2005882) (← links)
• A multi-commodity two-echelon capacitated vehicle routing problem with time windows: model formulations and solution approach (Q2027023) (← links)
• Two-echelon vehicle routing problem with satellite bi-synchronization (Q2028760) (← links)
• A parallelised large neighbourhood search heuristic for the asymmetric two-echelon vehicle routing problem with swap containers for cargo-bicycles (Q2029063) (← links)
• Two-echelon vehicle routing problems: a literature review (Q2079391) (← links)
• A location-or-routing problem with partial and decaying coverage (Q2108134) (← 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)
• Designing a two-echelon distribution network under demand uncertainty (Q2272305) (← links)
• The effects of the tractor and semitrailer routing problem on mitigation of carbon dioxide emissions (Q2312298) (← links)
• An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem (Q2337401) (← links)
• Using greedy clustering method to solve capacitated location-routing problem with fuzzy demands (Q2355806) (← 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)
• A progressive filtering heuristic for the location-routing problem and variants (Q2668599) (← links)
• A survey of adaptive large neighborhood search algorithms and applications (Q2676311) (← links)
• A fuzzy correlation based heuristic for dual-mode integrated location routing problem (Q2676327) (← links)
• A taxonomical analysis, current methods and objectives on location-routing problems (Q2865162) (← links)
• Model and algorithm for bilevel multisized terminal location‐routing problem for the last mile delivery (Q6087621) (← links)
• The two-echelon stochastic multi-period capacitated location-routing problem (Q6106489) (← links)
• A parallel branch-and-bound heuristic for the integrated long-haul and local vehicle routing problem on an adaptive transportation network (Q6561217) (← links)
• Optimizing combined tours: the truck-and-cargo-bike case (Q6581378) (← links)