Pages that link to "Item:Q339671"

The following pages link to An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics (Q339671):

Displaying 50 items.

• A survey of recent research on location-routing problems (Q296678) (← links)
• Evaluating two new heuristics for constructing customer clusters in a VRPTW with multiple service workers (Q301906) (← links)
• Sequential and parallel large neighborhood search algorithms for the periodic location routing problem (Q319012) (← links)
• Decomposition based hybrid metaheuristics (Q319285) (← links)
• The fleet size and mix location-routing problem with time windows: formulations and a heuristic algorithm (Q320620) (← links)
• An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization (Q323288) (← links)
• Metaheuristic algorithms for solving two interconnected vehicle routing problems in a hospital complex (Q336558) (← 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)
• A hybrid method for the probabilistic maximal covering location-allocation problem (Q337483) (← links)
• Multi-period vehicle routing problem with due dates (Q337604) (← links)
• A large neighbourhood based heuristic for two-echelon routing problems (Q342576) (← links)
• The electric two-echelon vehicle routing problem (Q1634075) (← links)
• An adaptive large neighborhood search for the full truckload pickup and delivery problem with resource synchronization (Q1651513) (← links)
• A simulation based restricted dynamic programming approach for the green time dependent vehicle routing problem (Q1651558) (← 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)
• GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem (Q1652391) (← links)
• Designing sustainable mid-haul logistics networks with intra-route multi-resource facilities (Q1681274) (← 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)
• A hybrid GRASP+VND heuristic for the two-echelon vehicle routing problem arising in city logistics (Q1718582) (← links)
• A two-echelon inventory routing problem for perishable products (Q1738829) (← links)
• The multi-pickup and delivery problem with time windows (Q1744529) (← links)
• A general framework for assessing the value of social data for disaster response logistics planning (Q1750460) (← links)
• A metaheuristic for the time-dependent pollution-routing problem (Q1751914) (← links)
• Scheduling identical parallel machines with tooling constraints (Q1752870) (← links)
• A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints (Q1754109) (← 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)
• The two-echelon capacitated electric vehicle routing problem with battery swapping stations: formulation and efficient methodology (Q1991213) (← 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)
• A hybrid algorithm for time-dependent vehicle routing problem with time windows (Q2027083) (← 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)
• Multi-objective optimization of a two-echelon vehicle routing problem with vehicle synchronization and `grey zone' customers arising in urban logistics (Q2029268) (← links)
• Models and algorithms for the delivery and installation routing problem (Q2029957) (← links)
• Meta-analysis of metaheuristics: quantifying the effect of adaptiveness in adaptive large neighborhood search (Q2030591) (← links)
• The vehicle routing problem with heterogeneous locker boxes (Q2033310) (← links)
• Distance-based adaptive large neighborhood search algorithm for green-PDPTW (Q2039686) (← links)
• Two-echelon vehicle routing problems: a literature review (Q2079391) (← links)
• A location-or-routing problem with partial and decaying coverage (Q2108134) (← links)
• The vehicle routing problem with load-dependent travel times for cargo bicycles (Q2116921) (← links)
• Asynchronous optimization of part logistics routing problem (Q2124805) (← links)
• An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization (Q2125364) (← links)
• Integrating order delivery and return operations for order fulfillment in an online retail environment (Q2147018) (← links)
• The multi-zone location-routing problem with pricing: a flow-based formulation and two heuristic approaches (Q2156989) (← links)
• A waste collection problem with service type option (Q2160512) (← links)