Pages that link to "Item:Q2669771"

The following pages link to Hybrid genetic search for the CVRP: open-source implementation and SWAP* neighborhood (Q2669771):

Displaying 18 items.

• Deep policy dynamic programming for vehicle routing problems (Q2170197) (← links)
• Guidelines for the computational testing of machine learning approaches to vehicle routing problems (Q2670511) (← links)
• Multi-shuttle crane scheduling in automated storage and retrieval systems (Q2672114) (← links)
• Adjusting the order crossover operator for capacitated vehicle routing problems (Q2676389) (← links)
• A branch-and-cut embedded matheuristic for the inventory routing problem (Q6047912) (← links)
• The consistent production routing problem (Q6064169) (← links)
• Multi-armed bandit-based hyper-heuristics for combinatorial optimization problems (Q6069215) (← links)
• Hybrid genetic algorithm for undirected traveling salesman problems with profits (Q6139377) (← links)
• Memetic search for the minmax multiple traveling salesman problem with single and multiple depots (Q6167324) (← links)
• The board packing problem (Q6167668) (← links)
• A hybrid genetic algorithm for the Hamiltonian <i>p</i>‐median problem (Q6196877) (← links)
• An improved hybrid genetic search with data mining for the CVRP (Q6541031) (← links)
• Routing one million customers in a handful of minutes (Q6551178) (← links)
• Two-echelon time-dependent vehicle routing problem with simultaneous pickup and delivery and satellite synchronization (Q6568433) (← links)
• A triple bottom line optimization model for assignment and routing of on-demand home services (Q6568459) (← links)
• Vehicle routing with time-dependent travel times: theory, practice, and benchmarks (Q6602334) (← links)
• A heuristic with a performance guarantee for the commodity constrained split delivery vehicle routing problem (Q6659085) (← links)
• Selecting fast algorithms for the capacitated vehicle routing problem with machine learning techniques (Q6659088) (← links)