Solving the vehicle routing problem with multi-compartment vehicles for city logistics
DOI10.1016/j.cor.2019.104859zbMath1458.90084OpenAlexW2990322253WikidataQ126645782 ScholiaQ126645782MaRDI QIDQ2289931
Reza Eshtehadi, Emrah Demir, Yu-An Huang
Publication date: 27 January 2020
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://orca.cardiff.ac.uk/127320/1/Eshtehadi%20et%20al.%202020.pdf
time windowsvehicle routing problemmetaheuristic algorithmcity logisticsfreight transportmulti-compartment vehicles
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (5)
Uses Software
Cites Work
- Unnamed Item
- A review of recent research on green road freight transportation
- An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics
- The vehicle routing problem. Latest advances and new challenges.
- On the benefits of co-collection: experiments with a multi-compartment vehicle routing algorithm
- An iterated tabu search for the multi-compartment vehicle routing problem
- Vehicle selection for a multi-compartment vehicle routing problem
- A metaheuristic for the time-dependent pollution-routing problem
- An adaptive large neighborhood search heuristic for the pollution-routing problem
- The bi-objective pollution-routing problem
- A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem
- Robust Convex Optimization
- The Truck Dispatching Problem
- Vehicle Routing
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- What you should know about the vehicle routing problem
This page was built for publication: Solving the vehicle routing problem with multi-compartment vehicles for city logistics