On the benefits of co-collection: experiments with a multi-compartment vehicle routing algorithm
From MaRDI portal
Publication:976404
DOI10.1016/J.EJOR.2010.02.020zbMATH Open1188.90036OpenAlexW3121988186MaRDI QIDQ976404FDOQ976404
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
Recommendations
- Collaborative vehicle routing: a survey
- The selective vehicle routing problem in a collaborative environment
- Comments on: ``Shared resources in collaborative vehicle routing
- Comments on: ``Shared resources in collaborative vehicle routing
- Comments on: ``Shared resources in collaborative vehicle routing
- Rejoinder on: ``Shared resources in collaborative vehicle routing
- Cooperative receding horizon strategies for the multivehicle routing problem
- Multi-compartment vehicle routing problems: state-of-the-art, modeling framework and future directions
Approximation methods and heuristics in mathematical programming (90C59) Transportation, logistics and supply chain management (90B06)
Cites Work
- A simple and effective evolutionary algorithm for the vehicle routing problem
- The truck dispatching problem
- The vehicle routing problem
- Scheduling deliveries in vehicles with multiple compartments
- A guided local search heuristic for the capacitated arc routing problem
- Title not available (Why is that?)
- A heuristic for the multi-period petrol station replenishment problem
- Solving a fuel delivery problem by heuristic and exact approaches.
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computer Solutions of the Traveling Salesman Problem
- The granular tabu search and its application to the vehicle-routing problem
- Title not available (Why is that?)
- Fast Algorithms for Geometric Traveling Salesman Problems
- Solving the vehicle routing problem with adaptive memory programming methodology
- Title not available (Why is that?)
- Guided local search and its application to the traveling salesman problem
- Exploring Variants of 2-Opt and 3-Opt for the General Routing Problem
- Title not available (Why is that?)
Cited In (27)
- The supply of convenience stores: challenges of short-distance routing within the constraints of working time regulations
- Solving the petroleum replenishment and routing problem with variable demands and time windows
- Classification, models and exact algorithms for multi-compartment delivery problems
- An iterated tabu search for the multi-compartment vehicle routing problem
- A guided local search procedure for the multi-compartment capacitated arc routing problem
- Product-oriented time window assignment for a multi-compartment vehicle routing problem
- Vehicle routing problems with multiple commodities: a survey
- A hybrid ant colony optimization algorithm for multi-compartment vehicle routing problem
- Rich vehicle routing problems: from a taxonomy to a definition
- Exact algorithms for the multi-compartment vehicle routing problem with flexible compartment sizes
- Multi-compartment vehicle routing problems: state-of-the-art, modeling framework and future directions
- Vehicle routing with compartments: applications, modelling and heuristics
- Solving the vehicle routing problem with multi-compartment vehicles for city logistics
- The multi-compartment vehicle routing problem with flexible compartment sizes
- A multi-compartment vehicle routing problem in cold-chain distribution
- A branch-and-cut algorithm for the multi-compartment vehicle routing problem with flexible compartment sizes
- A variable neighborhood search for the multi-period collection of recyclable materials
- The commodity-split multi-compartment capacitated arc routing problem
- A districting-based heuristic for the coordinated capacitated arc routing problem
- Finished-vehicle transporter routing problem solved by loading pattern discovery
- Scheduling deliveries in vehicles with multiple compartments
- A new two‐phase heuristic for a problem of food distribution with compartmentalized trucks and trailers
- Vehicle selection for a multi-compartment vehicle routing problem
- The fuel replenishment problem: a split-delivery multi-compartment vehicle routing problem with multiple trips
- An improved tabu search algorithm for the petrol-station replenishment problem with adjustable demands
- An inventory-routing problem with the objective of travel time minimization
- A unified matheuristic for solving multi-constrained traveling salesman problems with profits
Uses Software
This page was built for publication: On the benefits of co-collection: experiments with a multi-compartment vehicle routing algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976404)
