Hybrid algorithms for the vehicle routing problem with clustered backhauls and 3D loading constraints
From MaRDI portal
Publication:319021
DOI10.1016/j.ejor.2014.12.001zbMath1346.90079OpenAlexW1988939893MaRDI QIDQ319021
Andreas Bortfeldt, Dirk Männel, Lars Mönch, Thomas Hahn
Publication date: 6 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.2014.12.001
transportationvariable neighborhood searchlarge neighborhood searchvehicle routing with clustered backhauls
Related Items
An extension of Queiroz and Miyazawa's method for vertical stability in two-dimensional packing problems to deal with horizontal stability, An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization, A hybrid algorithm for the vehicle routing problem with pickup and delivery and three-dimensional loading constraints, An adaptive large neighborhood search for the full truckload pickup and delivery problem with resource synchronization, Vehicle routing with backhauls: review and research perspectives, Airfreight forwarder's shipment planning: shipment consolidation and containerization, Variable neighborhood search based approaches to a vehicle scheduling problem in agriculture, Variable neighborhood search algorithms for the vehicle routing problem with two‐dimensional loading constraints and mixed linehauls and backhauls, A model‐based heuristic to the vehicle routing and loading problem, Delivery route optimization with automated vehicle in smart urban environment, Solving the pickup and delivery problem with three-dimensional loading constraints and reloading ban, Multi-objective vehicle routing and loading with time window constraints: a real-life application, Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review, The multi-pickup and delivery problem with time windows, Heuristics for vehicle routing problems with backhauls, time windows, and 3D loading constraints
Uses Software
Cites Work
- A hybrid approach for the vehicle routing problem with three-dimensional loading constraints
- Packing first, routing second -- a heuristic for the vehicle routing and loading problem
- Routing problems with loading constraints
- A unified heuristic for a large class of vehicle routing problems with backhauls
- An integrated approach to the vehicle routing and container loading problems
- A memetic algorithm for a vehicle routing problem with backhauls
- An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
- Self-organizing feature maps for the vehicle routing problem with backhauls
- The vehicle routing problem. Latest advances and new challenges.
- Metaheuristics for vehicle routing problems with three-dimensional loading constraints
- The vehicle routing problem with backhauls
- Variable neighborhood search
- A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls
- 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 variable neighborhood search heuristic for periodic routing problems
- Multi-ant colony system (MACS) for a vehicle routing problem with backhauls
- A new tabu search algorithm for the vehicle routing problem with backhauls
- A unified solution framework for multi-attribute vehicle routing problems
- Heuristic approaches to vehicle routing with backhauls and time windows
- The Vehicle Routing Problem
- An Exact Method for the Vehicle Routing Problem with Backhauls
- Extreme Point-Based Heuristics for Three-Dimensional Bin Packing
- An Exact Algorithm for the Vehicle Routing Problem with Backhauls
- Computer Solutions of the Traveling Salesman Problem
- Variable neighborhood search: Principles and applications
- Unnamed Item
- Unnamed Item