Variable neighborhood search algorithms for the vehicle routing problem with two‐dimensional loading constraints and mixed linehauls and backhauls
From MaRDI portal
Publication:6066723
DOI10.1111/itor.12509OpenAlexW2790626984MaRDI QIDQ6066723
José M. Valério de Carvalho, Cláudio Alves, Telmo Pinto
Publication date: 16 November 2023
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.12509
Related Items (7)
Asynchronous optimization of part logistics routing problem ⋮ Less is more approach: basic variable neighborhood search for the obnoxious p‐median problem ⋮ A variable neighborhood search heuristic algorithm for the double vehicle routing problem with multiple stacks ⋮ A variable neighborhood search for flying sidekick traveling salesman problem ⋮ A game‐theoretic approach for the location of terror response facilities with both disruption risk and hidden information ⋮ A branch‐and‐price‐based heuristic for the vehicle routing problem with two‐dimensional loading constraints and time windows ⋮ A two-stage hybrid heuristic solution for the container drayage problem with trailer reposition
Cites Work
- Unnamed Item
- Hybrid algorithms for the vehicle routing problem with clustered backhauls and 3D loading constraints
- A hybrid algorithm for the vehicle routing problem with pickup and delivery and three-dimensional loading constraints
- Skewed general variable neighborhood search for the location routing scheduling problem
- Variable neighbourhood search: methods and applications
- Variable neighborhood search
- Variable neighborhood search algorithms for pickup and delivery problems with loading constraints
- A guided tabu search for the vehicle routing problem with two-dimensional loading constraints
- Pickup and Delivery Vehicle Routing with Multidimensional Loading Constraints
- A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling
- A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints
This page was built for publication: Variable neighborhood search algorithms for the vehicle routing problem with two‐dimensional loading constraints and mixed linehauls and backhauls
