The vehicle routing problem with simultaneous pick-ups and deliveries and two-dimensional loading constraints
DOI10.1016/J.EJOR.2015.11.018zbMATH Open1346.90197DBLPjournals/eor/ZachariadisTK16OpenAlexW2183486228WikidataQ58646209 ScholiaQ58646209MaRDI QIDQ322687FDOQ322687
Authors: Emmanouil E. Zachariadis, Christos D. Tarantilis, Chris T. Kiranoudis
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
Recommendations
- The vehicle routing problem with simultaneous pickup and delivery and handling costs
- A simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints
- A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints
- A hybrid algorithm for the vehicle routing problem with pickup and delivery and three-dimensional loading constraints
- The multiple vehicle pickup and delivery problem with LIFO constraints
Deterministic network models in operations research (90B10) Transportation, logistics and supply chain management (90B06)
Cites Work
- 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
- A guided tabu search for the vehicle routing problem with two-dimensional loading constraints
- Integrated distribution and loading planning via a compact metaheuristic algorithm
- Extreme point-based heuristics for three-dimensional bin packing
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
- 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
- Two-dimensional packing problems: a survey
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
- A hybrid algorithm for a class of vehicle routing problems
- The Three-Dimensional Bin Packing Problem
- 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 tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service
- Review: An annotated bibliography of combined routing and loading problems
- Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery
- A biased-randomized algorithm for the two-dimensional vehicle routing problem with and without item rotations
Cited In (14)
- Title not available (Why is that?)
- A review of vehicle routing with simultaneous pickup and delivery
- Minimizing late deliveries in a truck loading problem
- 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
- Pickup and Delivery Vehicle Routing with Multidimensional Loading Constraints
- Multi-objective vehicle routing and loading with time window constraints: a real-life application
- A Set Covering Approach for the Pickup and Delivery Problem with General Constraints on Each Route
- The vehicle routing problem with simultaneous pickup and delivery and handling costs
- Multi-commodity demand fulfillment via simultaneous pickup and delivery for a fast fashion retailer
- Using intermediate infeasible solutions to approach vehicle routing problems with precedence and loading constraints
- A hybrid algorithm for the vehicle routing problem with pickup and delivery and three-dimensional loading constraints
- A branch‐and‐price‐based heuristic for the vehicle routing problem with two‐dimensional loading constraints and time windows
- Vehicle routing problems with loading constraints: state-of-the-art and future directions
This page was built for publication: The vehicle routing problem with simultaneous pick-ups and deliveries and two-dimensional loading constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q322687)