The multi-compartment vehicle routing problem with flexible compartment sizes

DOI10.1016/j.ejor.2015.05.020zbMath1346.90121OpenAlexW226211203MaRDI QIDQ319854

Mohammad Hasan, M. Dambrine

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.2015.05.020

zbMATH Keywords

heuristicsvehicle routingvariable neighborhood searchglass waste collectionmultiple compartments

Mathematics Subject Classification ID

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

Related Items

An improved tabu search algorithm for the petrol-station replenishment problem with adjustable demands, Solving the petroleum replenishment and routing problem with variable demands and time windows, The commodity-split multi-compartment capacitated arc routing problem, The prisoner transportation problem, A mixed truck and robot delivery approach for the daily supply of customers, The fuel replenishment problem: a split-delivery multi-compartment vehicle routing problem with multiple trips, Same‐day deliveries in omnichannel retail: Integrated order picking and vehicle routing with vehicle‐site dependencies, A new two‐phase heuristic for a problem of food distribution with compartmentalized trucks and trailers, Efficient GRASP solution approach for the prisoner transportation problem, The multi-vehicle truck-and-robot routing problem for last-mile delivery, A hybrid ant colony optimization algorithm for multi-compartment vehicle routing problem, Product-oriented time window assignment for a multi-compartment vehicle routing problem, Vehicle selection for a multi-compartment vehicle routing problem, Optimizing routing and delivery patterns with multi-compartment vehicles, Multi-compartment vehicle routing problems: state-of-the-art, modeling framework and future directions, Exact algorithms for the multi-compartment vehicle routing problem with flexible compartment sizes, A branch-and-cut algorithm for the multi-compartment vehicle routing problem with flexible compartment sizes

Uses Software

• LKH
• VRP

Cites Work

• Vehicle routing with compartments: applications, modelling and heuristics
• Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
• A heuristic for the multi-period petrol station replenishment problem
• The vehicle routing problem. Latest advances and new challenges.
• A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands
• On the benefits of co-collection: experiments with a multi-compartment vehicle routing algorithm
• Solving a fuel delivery problem by heuristic and exact approaches.
• Scheduling deliveries in vehicles with multiple compartments
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem
• Vehicle Routing
• A combined ship scheduling and allocation problem
• Variable neighborhood search for the p-median
• A Tabu Search Heuristic for the Vehicle Routing Problem
• Computer Solutions of the Traveling Salesman Problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Variable neighborhood search: Principles and applications