Pages that link to "Item:Q1926986"

The following pages link to Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints (Q1926986):

Displaying 11 items.

• The multiple vehicle pickup and delivery problem with LIFO constraints (Q319195) (← links)
• A tabu search algorithm for the multi-period inspector scheduling problem (Q337536) (← links)
• A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading (Q337617) (← links)
• Exact algorithms for the double vehicle routing problem with multiple stacks (Q342039) (← links)
• Multi-restart iterative search for the pickup and delivery traveling salesman problem with FIFO loading (Q1652699) (← links)
• Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review (Q1730669) (← links)
• Vehicle routing problems with loading constraints: state-of-the-art and future directions (Q2018104) (← links)
• Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem (Q2255966) (← links)
• A mathematical model and algorithms for the aircraft hangar maintenance scheduling problem (Q2307234) (← links)
• Valid inequalities and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks (Q2670579) (← links)
• A metaheuristic algorithm for a locomotive routing problem arising in the steel industry (Q6167423) (← links)