Pages that link to "Item:Q339607"

The following pages link to A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows (Q339607):

Displaying 50 items.

• Branch-and-price and constraint programming for solving a real-life technician dispatching problem (Q296755) (← links)
• Rich vehicle routing problems: from a taxonomy to a definition (Q299767) (← links)
• A matheuristic approach for the pollution-routing problem (Q319140) (← links)
• The vehicle-routing problem with time windows and driver-specific times (Q322409) (← links)
• The electric fleet size and mix vehicle routing problem with time windows and recharging stations (Q323018) (← links)
• Optimal versioning strategy for information products with behavior-based utility function of heterogeneous customers (Q336525) (← links)
• A knowledge-based evolutionary algorithm for the multiobjective vehicle routing problem with time windows (Q336957) (← links)
• An iterated local search for the multi-commodity multi-trip vehicle routing problem with time windows (Q337147) (← links)
• Hybrid metaheuristics for the clustered vehicle routing problem (Q337513) (← links)
• A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading (Q337617) (← links)
• A hybrid evolutionary algorithm for heterogeneous fleet vehicle routing problems with time windows (Q342060) (← links)
• Technical note: Split algorithm in \(O(n)\) for the capacitated vehicle routing problem (Q342313) (← links)
• A parallel matheuristic for the technician routing and scheduling problem (Q375996) (← links)
• Urban regional logistics distribution path planning considering road characteristics (Q782070) (← links)
• Integrated production and multiple trips vehicle routing with time windows and uncertain travel times (Q1634047) (← links)
• A hybrid genetic algorithm for the heterogeneous dial-a-ride problem (Q1652211) (← links)
• Designing granular solution methods for routing problems with time windows (Q1694925) (← links)
• A relax-and-repair heuristic for the swap-body vehicle routing problem (Q1695791) (← links)
• A P-based hybrid evolutionary algorithm for vehicle routing problem with time windows (Q1717814) (← links)
• Diversity controlling genetic algorithm for order acceptance and scheduling problem (Q1718199) (← links)
• Heuristics for vehicle routing problems: sequence or set optimization? (Q1722969) (← links)
• An emergency logistics distribution routing model for unexpected events (Q1730450) (← links)
• A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet (Q1730643) (← links)
• Making the most of fleets: a profit-maximizing multi-vehicle pickup and delivery selection problem (Q1751783) (← links)
• Comments on: ``Disruption management in vehicle routing and scheduling for road freight transport: a review'' (Q1752348) (← links)
• The vehicle routing problem with profits and consistency constraints (Q1755266) (← links)
• Active guided evolution strategies for large-scale vehicle routing problems with time windows (Q1764768) (← links)
• Routing a mix of conventional, plug-in hybrid, and electric vehicles (Q1991124) (← links)
• Granular tabu search for the pickup and delivery problem with time windows and electric vehicles (Q1999625) (← links)
• Designing a sustainable supply chain network integrated with vehicle routing: a comparison of hybrid swarm intelligence metaheuristics (Q2002867) (← links)
• A parallelised large neighbourhood search heuristic for the asymmetric two-echelon vehicle routing problem with swap containers for cargo-bicycles (Q2029063) (← links)
• Multi-trip time-dependent vehicle routing problem with time windows (Q2029965) (← links)
• A vehicle routing problem with distribution uncertainty in deadlines (Q2030574) (← links)
• Efficient approximation of the metric CVRP in spaces of fixed doubling dimension (Q2046271) (← links)
• Approximation of the capacitated vehicle routing problem with a limited number of routes in metric spaces of fixed doubling dimension (Q2048811) (← links)
• On the one-to-one pickup-and-delivery problem with time windows and trailers (Q2051215) (← links)
• The multi-depot \(k\)-traveling repairman problem (Q2091220) (← links)
• A variable neighborhood search-based algorithm with adaptive local search for the vehicle routing problem with time windows and multi-depots aiming for vehicle fleet reduction (Q2108102) (← links)
• The vehicle routing problem with load-dependent travel times for cargo bicycles (Q2116921) (← links)
• A hybrid algorithm for the vehicle routing problem with and/or precedence constraints and time windows (Q2147032) (← links)
• An efficient optimisation procedure for the workforce scheduling and routing problem: Lagrangian relaxation and iterated local search (Q2147119) (← links)
• Deep infeasibility exploration method for vehicle routing problems (Q2163783) (← links)
• The vehicle routing problem with arrival time diversification on a multigraph (Q2184148) (← links)
• Differential evolution with enhanced diversity maintenance (Q2192995) (← links)
• Variable neighborhood search based algorithms to solve a rich \(k\)-travelling repairmen problem (Q2228400) (← links)
• Industrial and tramp ship routing problems: closing the gap for real-scale instances (Q2294636) (← links)
• A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems (Q2327956) (← links)
• Optimal charging and repositioning of electric vehicles in a free-floating carsharing system (Q2333127) (← links)
• Heuristics for multi-attribute vehicle routing problems: a survey and synthesis (Q2356202) (← links)
• A tabu search for time-dependent multi-zone multi-trip vehicle routing problem with time windows (Q2356205) (← links)