A simulated annealing heuristic for the open location-routing problem
From MaRDI portal
(Redirected from Publication:337651)
Recommendations
- Heuristic solutions to multi-depot location-routing problems
- Solving the truck and trailer routing problem based on a simulated annealing heuristic
- A threshold accepting approach to the Open Vehicle Routing problem
- A simulated annealing heuristic for the facility location problem
- Two-stage heuristic algorithm for the large-scale capacitated location routing problem
Cites work
- A GRASP\(\times \)ELS approach for the capacitated location-routing problem
- A heuristic method for the open vehicle routing problem
- A new tabu search heuristic for the open vehicle routing problem
- A particle swarm optimization algorithm with path relinking for the location routing problem
- A tabu search algorithm for the open vehicle routing problem
- A taxonomical analysis, current methods and objectives on location-routing problems
- A threshold accepting approach to the Open Vehicle Routing problem
- A two-phase tabu search approach to the location routing problem
- A variable neighbourhood search algorithm for the open vehicle routing problem
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- Equation of state calculations by fast computing machines
- Optimization by simulated annealing
- Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking
- The open vehicle routing problem: algorithms, large-scale test problems, and computational results
- Using clustering analysis in a capacitated location-routing problem
Cited in
(16)- Adaptive neighborhood simulated annealing for the heterogeneous fleet vehicle routing problem with multiple cross-docks
- Optimization of two-stage location-routing-inventory problem with time-windows in food distribution network
- The open location-routing problem for multi-objective optimization of sustainable supply chain considering social concerns
- A two-echelon location routing problem with mobile satellites for last-mile delivery: mathematical formulation and clustering-based heuristic method
- Research on the vehicle routing problem with interval demands
- Model and algorithm for bilevel multisized terminal location‐routing problem for the last mile delivery
- A simulated annealing-based heuristic for the single allocation maximal covering hub location problem
- Location‐routing problem: a classification of recent research
- Simulated annealing heuristic for the general share-a-ride problem
- A multi-depot two-echelon vehicle routing problem with delivery options arising in the last mile distribution
- A two-stage stochastic location-routing problem for electric vehicles fast charging
- Solving Location-Allocation Problems with Rectilinear Distances by Simulated Annealing
- Improvement heuristics for the vehicle routing problem based on simulated annealing
- Two-echelon time-dependent vehicle routing problem with simultaneous pickup and delivery and satellite synchronization
- A fuzzy correlation based heuristic for dual-mode integrated location routing problem
- A variable neighborhood search algorithm for an integrated physician planning and scheduling problem
This page was built for publication: A simulated annealing heuristic for the open location-routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337651)
