A new approach on auxiliary vehicle assignment in capacitated location routing problem
From MaRDI portal
Publication:2795191
DOI10.1080/00207721.2014.906770zbMath1333.93033MaRDI QIDQ2795191
Ehsan Fallahzade, Zeinab Rasoulinejad, Mahdi Bashiri
Publication date: 18 March 2016
Published in: International Journal of Systems Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207721.2014.906770
Related Items
Cites Work
- A simulated annealing heuristic for the team orienteering problem with time windows
- A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem
- Location-routing: issues, models and methods
- A column generation approach to the heterogeneous fleet vehicle routing problem
- A heuristic based on multi-exchange techniques for a regional fleet assignment location-routing problem
- The effect of ignoring routes when locating depots
- A comparative study of heuristics for a two-level routing-location problem
- Optimizing solid waste collection in Brussels
- Combined location-routing problems: A synthesis and future research directions
- A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem.
- On the capacitated vehicle routing problem
- Heuristic solutions to multi-depot location-routing problems
- A two-phase tabu search approach to the location routing problem
- A simple and effective evolutionary algorithm for the vehicle routing problem
- A compact model and tight bounds for a combined location-routing problem
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
- Multi-objective metaheuristics for a location-routing problem with multiple use of vehicles on real data and simulated data
- Combined location and routing problems for drug distribution
- Vehicle Routing with Stochastic Demands: Properties and Solution Frameworks
- A two-stage vehicle routing model for large-scale bioterrorism emergencies
- On the location selection problem using analytic hierarchy process and multi-choice goal programming
- The capacitated multi-facility location–allocation problem with probabilistic customer location and demand: two hybrid meta-heuristic algorithms
- A multiple-depot, multiple-vehicle, location-routing problem with stochastically processed demands