Pages that link to "Item:Q3114307"

The following pages link to Tour splitting algorithms for vehicle routing problems (Q3114307):

Displaying 15 items.

• An exact algorithm and a metaheuristic for the generalized vehicle routing problem with flexible fleet size (Q336876) (← links)
• Efficient frameworks for greedy split and new depth first search split procedures for routing problems (Q613510) (← links)
• Shipper collaboration in forward and reverse logistics (Q781076) (← links)
• An efficiency-based path-scanning heuristic for the capacitated arc routing problem (Q1634089) (← links)
• Solving the multi-vehicle multi-covering tour problem (Q1651551) (← links)
• Computational comparison of several greedy algorithms for the minimum cost perfect matching problem on large graphs (Q1652405) (← links)
• Iterated local search and column generation to solve arc-routing as a permutation set-covering problem (Q1752200) (← links)
• Industrial and tramp ship routing problems: closing the gap for real-scale instances (Q2294636) (← links)
• An effective PSO-inspired algorithm for the team orienteering problem (Q2355862) (← links)
• A memetic algorithm for the multi trip vehicle routing problem (Q2514735) (← links)
• Implicit depot assignments and rotations in vehicle routing heuristics (Q2514807) (← links)
• The commodity-split multi-compartment capacitated arc routing problem (Q2664322) (← links)
• Effective neighborhood search with optimal splitting and adaptive memory for the team orienteering problem with time windows (Q2664372) (← links)
• Recent results on Arc Routing Problems: An annotated bibliography (Q3057167) (← links)
• The multi‐purpose <i>K</i>‐drones general routing problem (Q6180030) (← links)