Pages that link to "Item:Q319195"
From MaRDI portal
The following pages link to The multiple vehicle pickup and delivery problem with LIFO constraints (Q319195):
Displaying 18 items.
- The vehicle routing problem with simultaneous pick-ups and deliveries and two-dimensional loading constraints (Q322687) (← links)
- A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading (Q337617) (← links)
- Lasso solution strategies for the vehicle routing problem with pickups and deliveries (Q1011218) (← links)
- The pickup and delivery problem with time windows and handling operations (Q1652028) (← links)
- Multi-restart iterative search for the pickup and delivery traveling salesman problem with FIFO loading (Q1652699) (← links)
- Dynamic courier routing for a food delivery service (Q1738833) (← links)
- The pickup and delivery traveling salesman problem with handling costs (Q1752776) (← links)
- Optimal routing of multiple-load AGV subject to LIFO loading constraints (Q1869912) (← links)
- Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints (Q1926986) (← links)
- The single-vehicle two-echelon one-commodity pickup and delivery problem (Q2027019) (← links)
- Mixed-integer linear optimization for full truckload pickup and delivery (Q2047182) (← links)
- The pickup and delivery problem with time windows, multiple stacks, and handling operations (Q2140213) (← links)
- The vehicle routing problem with simultaneous pickup and delivery and handling costs (Q2289929) (← links)
- The paired many-to-many pickup and delivery problem: an application (Q2343076) (← links)
- Valid inequalities and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks (Q2670579) (← links)
- Competition and Cooperation in Pickup and Multiple Delivery Problems (Q2980177) (← links)
- A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading (Q3057131) (← links)
- A metaheuristic algorithm for a locomotive routing problem arising in the steel industry (Q6167423) (← links)