Pages that link to "Item:Q1687656"
From MaRDI portal
The following pages link to Variable neighborhood search algorithms for pickup and delivery problems with loading constraints (Q1687656):
Displaying 11 items.
- An adapted heuristic approach for a clustered traveling salesman problem with loading constraints (Q693154) (← links)
- An adaptive large neighborhood search for the full truckload pickup and delivery problem with resource synchronization (Q1651513) (← links)
- Variable neighborhood search strategies for the order batching problem (Q1652118) (← links)
- A variable neighborhood search for the last-mile delivery problem during major infectious disease outbreak (Q2070131) (← links)
- Neighborhood structures for the container loading problem: a VNS implementation (Q2267814) (← links)
- General variable neighborhood search applied to the picking process in a warehouse (Q2631231) (← links)
- Multi-objective iterated greedy variable neighborhood search algorithm for solving a full-load automated guided vehicle routing problem with battery constraints (Q2631250) (← links)
- A hybrid heuristic based on general variable neighborhood search for the single vehicle routing problem with deliveries and selective pickups (Q2840759) (← links)
- Variable neighborhood search for the pickup and delivery traveling salesman problem with LIFO loading (Q2892373) (← links)
- EFFICIENT NEIGHBORHOOD SEARCH FOR THE PROBABILISTIC MULTI-VEHICLE PICKUP AND DELIVERY PROBLEM (Q3580197) (← links)
- Variable neighborhood search algorithms for the vehicle routing problem with two‐dimensional loading constraints and mixed linehauls and backhauls (Q6066723) (← links)
