A guided tabu search for the vehicle routing problem with two-dimensional loading constraints
From MaRDI portal
Publication:2378414
DOI10.1016/j.ejor.2007.05.058zbMath1155.90331DBLPjournals/eor/ZachariadisTK09OpenAlexW1996966568WikidataQ58646234 ScholiaQ58646234MaRDI QIDQ2378414
Chris T. Kiranoudis, Christos D. Tarantilis, Emmanouil E. Zachariadis
Publication date: 8 January 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2007.05.058
Multi-objective and goal programming (90C29) Transportation, logistics and supply chain management (90B06)
Related Items (40)
A new heuristic scheduling method for the make-pack-route problem in make-to-order supply chains ⋮ A hybrid genetic algorithm for the vehicle routing problem with three-dimensional loading constraints ⋮ The pickup and delivery problem with time windows, multiple stacks, and handling operations ⋮ Tabu search for the real-world carpooling problem ⋮ A branch-and-cut algorithm for the vehicle routing problem with two-dimensional loading constraints ⋮ A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints ⋮ Thirty years of heterogeneous vehicle routing ⋮ The vehicle routing problem with simultaneous pick-ups and deliveries and two-dimensional loading constraints ⋮ A biased-randomised large neighbourhood search for the two-dimensional vehicle routing problem with backhauls ⋮ A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem ⋮ An effective tabu search approach with improved loading algorithms for the 3L-CVRP ⋮ A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem ⋮ An exact approach for the green vehicle routing problem with two-dimensional loading constraints and split delivery ⋮ Routing problems with loading constraints ⋮ A simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints ⋮ Variable neighborhood search algorithms for the vehicle routing problem with two‐dimensional loading constraints and mixed linehauls and backhauls ⋮ Finished-vehicle transporter routing problem solved by loading pattern discovery ⋮ The transit route arc-node service maximization problem ⋮ A flow based formulation and a reinforcement learning based strategic oscillation for cross-dock door assignment ⋮ Modelling and heuristically solving many-to-many heterogeneous vehicle routing problem with cross-docking and two-dimensional loading constraints ⋮ Multi-objective vehicle routing and loading with time window constraints: a real-life application ⋮ Modeling soft unloading constraints in the multi-drop container loading problem ⋮ Heuristic and exact algorithms for the multi-pile vehicle routing problem ⋮ Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review ⋮ An optimization algorithm for solving the rich vehicle routing problem based on variable neighborhood search and tabu search metaheuristics ⋮ The value of integrating loading and routing ⋮ 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 ⋮ Efficient algorithms for the double traveling salesman problem with multiple stacks ⋮ Extended guided tabu search and a new packing algorithm for the two-dimensional loading vehicle routing problem ⋮ Vehicle routing problems with loading constraints: state-of-the-art and future directions ⋮ Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows ⋮ Using biased randomization for solving the two-dimensional loading vehicle routing problem with heterogeneous fleet ⋮ An inventory-routing problem with the objective of travel time minimization ⋮ A biased‐randomized algorithm for the two‐dimensional vehicle routing problem with and without item rotations ⋮ Metaheuristics for vehicle routing problems with three-dimensional loading constraints ⋮ An optimization model for the vehicle routing problem with practical three-dimensional loading constraints ⋮ Integrated distribution and loading planning via a compact metaheuristic algorithm ⋮ Designing vehicle routes for a mix of different request types, under time windows and loading constraints ⋮ Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Metaheuristic algorithms for combinatorial optimization problems. (Abstract of thesis)
- Active-guided evolution strategies for large-scale capacitated vehicle routing problems
- Solving the vehicle routing problem with adaptive memory programming methodology
- Future paths for integer programming and links to artificial intelligence
- BoneRoute: An adaptive memory-based method for effective fleet management
- A simple and effective evolutionary algorithm for the vehicle routing problem
- Probabilistic diversification and intensification in local search for vehicle routing
- A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem
- A new tabu search algorithm for the vehicle routing problem with backhauls
- The Vehicle Routing Problem
- Exact Solution of the Two-Dimensional Finite Bin Packing Problem
- An Exact Approach to the Strip-Packing Problem
- The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
- An Exact Algorithm for Higher-Dimensional Orthogonal Packing
- A Solution Procedure for the Vehicle-Scheduling Problem Based on Iterative Route Improvement
- Orthogonal Packings in Two Dimensions
- New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
- A Tabu Search Heuristic for the Vehicle Routing Problem
- Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching
- A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
- A Method for Solving Traveling-Salesman Problems
- Erratum: A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints
- Computer Solutions of the Traveling Salesman Problem
This page was built for publication: A guided tabu search for the vehicle routing problem with two-dimensional loading constraints
