A simulated annealing heuristic for the open location-routing problem
From MaRDI portal
Publication:337651
DOI10.1016/j.cor.2014.10.009zbMath1348.90426OpenAlexW2047142578MaRDI QIDQ337651
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2014.10.009
simulated annealingthird-party logisticscapacitated location-routing problemopen location-routing problem
Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)
Related Items (12)
Simulated annealing heuristic for the general share-a-ride problem ⋮ Adaptive neighborhood simulated annealing for the heterogeneous fleet vehicle routing problem with multiple cross-docks ⋮ A multi-depot two-echelon vehicle routing problem with delivery options arising in the last mile distribution ⋮ 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 ⋮ Model and algorithm for bilevel multisized terminal location‐routing problem for the last mile delivery ⋮ Location‐routing problem: a classification of recent research ⋮ A two-stage stochastic location-routing problem for electric vehicles fast charging ⋮ A two-echelon location routing problem with mobile satellites for last-mile delivery: mathematical formulation and clustering-based heuristic method ⋮ The open location-routing problem for multi-objective optimization of sustainable supply chain considering social concerns ⋮ Optimization of two-stage location-routing-inventory problem with time-windows in food distribution network ⋮ Research on the vehicle routing problem with interval demands
Uses Software
Cites Work
- Optimization by Simulated Annealing
- A tabu search algorithm for the open vehicle routing problem
- Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking
- Using clustering analysis in a capacitated location-routing problem
- The open vehicle routing problem: algorithms, large-scale test problems, and computational results
- A GRASP\(\times \)ELS approach for the capacitated location-routing problem
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- A two-phase tabu search approach to the location routing problem
- A variable neighbourhood search algorithm for the open vehicle routing problem
- A particle swarm optimization algorithm with path relinking for the location routing problem
- A taxonomical analysis, current methods and objectives on location-routing problems
- A heuristic method for the open vehicle routing problem
- A new tabu search heuristic for the open vehicle routing problem
- Equation of State Calculations by Fast Computing Machines
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- A threshold accepting approach to the Open Vehicle Routing problem
This page was built for publication: A simulated annealing heuristic for the open location-routing problem
