On the benefits of co-collection: experiments with a multi-compartment vehicle routing algorithm
From MaRDI portal
(Redirected from Publication:976404)
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
Cites work
- scientific article; zbMATH DE number 3643061 (Why is no real title available?)
- scientific article; zbMATH DE number 52971 (Why is no real title available?)
- scientific article; zbMATH DE number 1082106 (Why is no real title available?)
- scientific article; zbMATH DE number 1488099 (Why is no real title available?)
- scientific article; zbMATH DE number 1749224 (Why is no real title available?)
- scientific article; zbMATH DE number 1452993 (Why is no real title available?)
- A guided local search heuristic for the capacitated arc routing problem
- A heuristic for the multi-period petrol station replenishment problem
- A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem
- A simple and effective evolutionary algorithm for the vehicle routing problem
- Computer Solutions of the Traveling Salesman Problem
- Exploring Variants of 2-Opt and 3-Opt for the General Routing Problem
- Fast Algorithms for Geometric Traveling Salesman Problems
- Guided local search and its application to the traveling salesman problem
- Scheduling deliveries in vehicles with multiple compartments
- Solving a fuel delivery problem by heuristic and exact approaches.
- Solving the vehicle routing problem with adaptive memory programming methodology
- The granular tabu search and its application to the vehicle-routing problem
- The truck dispatching problem
- The vehicle routing problem
- Very large-scale vehicle routing: new test problems, algorithms, and results
Cited in
(27)- The fuel replenishment problem: a split-delivery multi-compartment vehicle routing problem with multiple trips
- Product-oriented time window assignment for a multi-compartment vehicle routing problem
- Vehicle selection for a multi-compartment vehicle routing problem
- The supply of convenience stores: challenges of short-distance routing within the constraints of working time regulations
- Solving the vehicle routing problem with multi-compartment vehicles for city logistics
- Solving the petroleum replenishment and routing problem with variable demands and time windows
- The commodity-split multi-compartment capacitated arc routing problem
- Multi-compartment vehicle routing problems: state-of-the-art, modeling framework and future directions
- A districting-based heuristic for the coordinated capacitated arc routing problem
- An improved tabu search algorithm for the petrol-station replenishment problem with adjustable demands
- A multi-compartment vehicle routing problem in cold-chain distribution
- Vehicle routing problems with multiple commodities: a survey
- Finished-vehicle transporter routing problem solved by loading pattern discovery
- Vehicle routing with compartments: applications, modelling and heuristics
- Scheduling deliveries in vehicles with multiple compartments
- An iterated tabu search for the multi-compartment vehicle routing problem
- A guided local search procedure for the multi-compartment capacitated arc routing problem
- A unified matheuristic for solving multi-constrained traveling salesman problems with profits
- The multi-compartment vehicle routing problem with flexible compartment sizes
- A variable neighborhood search for the multi-period collection of recyclable materials
- A new two‐phase heuristic for a problem of food distribution with compartmentalized trucks and trailers
- A hybrid ant colony optimization algorithm for multi-compartment vehicle routing problem
- An inventory-routing problem with the objective of travel time minimization
- Rich vehicle routing problems: from a taxonomy to a definition
- A branch-and-cut algorithm for the multi-compartment vehicle routing problem with flexible compartment sizes
- Exact algorithms for the multi-compartment vehicle routing problem with flexible compartment sizes
- Classification, models and exact algorithms for multi-compartment delivery problems
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)
