Integrated distribution and loading planning via a compact metaheuristic algorithm

DOI10.1016/j.ejor.2013.01.040zbMath1332.90361DBLPjournals/eor/ZachariadisTK13OpenAlexW2088568353WikidataQ58646214 ScholiaQ58646214MaRDI QIDQ257219

Chris T. Kiranoudis, Emmanouil E. Zachariadis, Christos D. Tarantilis

Publication date: 15 March 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.2013.01.040

zbMATH Keywords

combinatorial optimizationmetaheuristicslogisticsloading constraints

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (15)

A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints ⋮ 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 review of vehicle routing with simultaneous pickup and delivery ⋮ An exact approach for the green vehicle routing problem with two-dimensional loading constraints and split delivery ⋮ A simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints ⋮ The pallet-loading vehicle routing problem with stability constraints ⋮ An adaptive memory matheuristic for the set orienteering problem ⋮ 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 ⋮ On solving the double loading problem using a modified particle swarm optimization ⋮ The value of integrating loading and routing ⋮ Vehicle routing problems with loading constraints: state-of-the-art and future directions ⋮ A mathematical programming model for integrating production and procurement transport decisions ⋮ Designing vehicle routes for a mix of different request types, under time windows and loading constraints

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem
• Routing problems with loading constraints
• Heuristic and exact algorithms for the multi-pile vehicle routing problem
• The attribute based hill climber
• Extended guided tabu search and a new packing algorithm for the two-dimensional loading vehicle routing problem
• An integrated approach to the vehicle routing and container loading problems
• Applying the attribute based hill climber heuristic to the 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
• A guided tabu search for the vehicle routing problem with two-dimensional loading constraints
• Extreme Point-Based Heuristics for Three-Dimensional Bin Packing
• Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
• Fibonacci heaps and their uses in improved network optimization algorithms
• Metaheuristics for the vehicle routing problem with loading constraints
• A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints

This page was built for publication: Integrated distribution and loading planning via a compact metaheuristic algorithm