A biased-randomized metaheuristic for the capacitated location routing problem
From MaRDI portal
Publication:5364072
Recommendations
- A two-phase hybrid heuristic algorithm for the capacitated location-routing problem
- Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking
- A GRASP\(\times \)ELS approach for the capacitated location-routing problem
- A survey of recent research on location-routing problems
- An exact method for the capacitated location-routing problem
Cited in
(30)- A progressive filtering heuristic for the location-routing problem and variants
- A biased-randomized discrete-event heuristic for coordinated multi-vehicle container transport across interconnected networks
- A new approach on auxiliary vehicle assignment in capacitated location routing problem
- A simheuristic algorithm for time-dependent waste collection management with stochastic travel times
- Two-stage heuristic algorithm for the large-scale capacitated location routing problem
- A biased‐randomized iterated local search for the distributed assembly permutation flow‐shop problem
- An iterative biased‐randomized heuristic for the fleet size and mix vehicle‐routing problem with backhauls
- Agile optimization for a real‐time facility location problem in Internet of Vehicles networks
- A biased-randomized algorithm for optimizing efficiency in parametric earthquake (re) insurance solutions
- MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems
- Solving the stochastic team orienteering problem: comparing simheuristics with the sample average approximation method
- Modelling and multi-criteria analysis of the sustainability dimensions for the green vehicle routing problem
- An exact method for the capacitated location-routing problem
- A survey of recent research on location-routing problems
- A conceptually simple algorithm for the capacitated location-routing problem
- Location‐routing problem: a classification of recent research
- A review of the role of heuristics in stochastic optimisation: from metaheuristics to learnheuristics
- A metaheuristic for the periodic location-routing problem
- A biased‐randomized algorithm for redistribution of perishable food inventories in supermarket chains
- Biased‐randomized iterated local search for a multiperiod vehicle routing problem with price discounts for delivery flexibility
- Green hybrid fleets using electric vehicles: solving the heterogeneous vehicle routing problem with multiple driving ranges and loading capacities
- The capacitated family traveling salesperson problem
- The location routing problem with facility sizing decisions
- A two-phase tabu search approach to the location routing problem
- Using horizontal cooperation concepts in integrated routing and facility‐location decisions
- A memetic algorithm for the capacitated location-routing problem with mixed backhauls
- A simheuristic algorithm for the stochastic permutation flow‐shop problem with delivery dates and cumulative payoffs
- Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking
- A biased random-key genetic algorithm for the two-level hub location routing problem with directed tours
- Solving the capacitated location-routing problem. Abstract of Thesis
This page was built for publication: A biased-randomized metaheuristic for the capacitated location routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5364072)
