On the benefits of co-collection: experiments with a multi-compartment vehicle routing algorithm

DOI10.1016/j.ejor.2010.02.020zbMath1188.90036OpenAlexW3121988186MaRDI QIDQ976404

G. Pang, Luc Muyldermans

Publication date: 11 June 2010

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2010.02.020

zbMATH Keywords

meta-heuristicsroutingguided local searchco-collectionmulti-compartment routingseparate collection

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 ⋮ Rich vehicle routing problems: from a taxonomy to a definition ⋮ Classification, models and exact algorithms for multi-compartment delivery problems ⋮ The multi-compartment vehicle routing problem with flexible compartment sizes ⋮ A variable neighborhood search for the multi-period collection of recyclable materials ⋮ An iterated tabu search for the multi-compartment vehicle routing problem ⋮ The commodity-split multi-compartment capacitated arc routing problem ⋮ The fuel replenishment problem: a split-delivery multi-compartment vehicle routing problem with multiple trips ⋮ Finished-vehicle transporter routing problem solved by loading pattern discovery ⋮ A new two‐phase heuristic for a problem of food distribution with compartmentalized trucks and trailers ⋮ A unified matheuristic for solving multi-constrained traveling salesman problems with profits ⋮ Vehicle routing with compartments: applications, modelling and heuristics ⋮ 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 ⋮ A guided local search procedure for the multi-compartment capacitated arc routing problem ⋮ A multi-compartment vehicle routing problem in cold-chain distribution ⋮ A districting-based heuristic for the coordinated capacitated arc routing problem ⋮ 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 ⋮ An inventory-routing problem with the objective of travel time minimization ⋮ Solving the vehicle routing problem with multi-compartment vehicles for city logistics ⋮ A branch-and-cut algorithm for the multi-compartment vehicle routing problem with flexible compartment sizes

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A heuristic for the multi-period petrol station replenishment problem
• Solving a fuel delivery problem by heuristic and exact approaches.
• Scheduling deliveries in vehicles with multiple compartments
• Solving the vehicle routing problem with adaptive memory programming methodology
• Guided local search and its application to the traveling salesman problem
• A guided local search heuristic for the capacitated arc routing problem
• A simple and effective evolutionary algorithm for the vehicle routing problem
• A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem
• Very large-scale vehicle routing: new test problems, algorithms, and results
• The Truck Dispatching Problem
• The Vehicle Routing Problem
• The Granular Tabu Search and Its Application to the Vehicle-Routing Problem
• Fast Algorithms for Geometric Traveling Salesman Problems
• Exploring Variants of 2-Opt and 3-Opt for the General Routing Problem
• Computer Solutions of the Traveling Salesman Problem