Variable neighborhood search algorithms for pickup and delivery problems with loading constraints
From MaRDI portal
Publication:1687656
Recommendations
- Variable neighborhood search for the pickup and delivery traveling salesman problem with LIFO loading
- Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks
- A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints
- Neighborhood structures for the container loading problem: a VNS implementation
- A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints
Cites work
- scientific article; zbMATH DE number 192876 (Why is no real title available?)
- A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints
- A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling
- Pickup and Delivery Vehicle Routing with Multidimensional Loading Constraints
- Variable neighborhood search
Cited in
(11)- General variable neighborhood search applied to the picking process in a warehouse
- An adaptive large neighborhood search for the full truckload pickup and delivery problem with resource synchronization
- Variable neighborhood search strategies for the order batching problem
- EFFICIENT NEIGHBORHOOD SEARCH FOR THE PROBABILISTIC MULTI-VEHICLE PICKUP AND DELIVERY PROBLEM
- Neighborhood structures for the container loading problem: a VNS implementation
- Variable neighborhood search algorithms for the vehicle routing problem with two‐dimensional loading constraints and mixed linehauls and backhauls
- An adapted heuristic approach for a clustered traveling salesman problem with loading constraints
- Variable neighborhood search for the pickup and delivery traveling salesman problem with LIFO loading
- A variable neighborhood search for the last-mile delivery problem during major infectious disease outbreak
- A hybrid heuristic based on general variable neighborhood search for the single vehicle routing problem with deliveries and selective pickups
- Multi-objective iterated greedy variable neighborhood search algorithm for solving a full-load automated guided vehicle routing problem with battery constraints
This page was built for publication: Variable neighborhood search algorithms for pickup and delivery problems with loading constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1687656)