The vehicle routing problem with simultaneous pick-ups and deliveries and two-dimensional loading constraints
From MaRDI portal
Publication:322687
DOI10.1016/j.ejor.2015.11.018zbMath1346.90197OpenAlexW2183486228WikidataQ58646209 ScholiaQ58646209MaRDI QIDQ322687
Emmanouil E. Zachariadis, Chris T. Kiranoudis, Christos D. Tarantilis
Publication date: 7 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2015.11.018
Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)
Related Items (6)
A review of vehicle routing with simultaneous pickup and delivery ⋮ Minimizing late deliveries in a truck loading problem ⋮ Multi-objective vehicle routing and loading with time window constraints: a real-life application ⋮ A branch‐and‐price‐based heuristic for the vehicle routing problem with two‐dimensional loading constraints and time windows ⋮ Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review ⋮ A mathematical model and algorithms for the aircraft hangar maintenance scheduling problem
Cites Work
- Unnamed Item
- Integrated distribution and loading planning via a compact metaheuristic algorithm
- A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints
- A hybrid approach for the vehicle routing problem with three-dimensional loading constraints
- A hybrid algorithm for a class of vehicle routing problems
- Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery
- A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem
- Routing problems with loading constraints
- The attribute based hill climber
- Extended guided tabu search and a new packing algorithm for the two-dimensional loading vehicle routing problem
- Ant colony optimization for the two-dimensional loading vehicle routing problem
- Metaheuristics for vehicle routing problems with three-dimensional loading constraints
- A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP
- A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints
- Two-dimensional packing problems: a survey
- A guided tabu search for the vehicle routing problem with two-dimensional loading constraints
- A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
- Extreme Point-Based Heuristics for Three-Dimensional Bin Packing
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
- The Three-Dimensional Bin Packing Problem
- A biased‐randomized algorithm for the two‐dimensional vehicle routing problem with and without item rotations
This page was built for publication: The vehicle routing problem with simultaneous pick-ups and deliveries and two-dimensional loading constraints