A simulated annealing heuristic for the open location-routing problem
DOI10.1016/J.COR.2014.10.009zbMATH Open1348.90426OpenAlexW2047142578MaRDI QIDQ337651FDOQ337651
Authors: Vincent F. Yu, Shin-Yu Lin 
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
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
simulated annealingcapacitated location-routing problemopen location-routing problemthird-party logistics
Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)
Cites Work
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- Optimization by simulated annealing
- Equation of State Calculations by Fast Computing Machines
- A variable neighbourhood search algorithm for the open vehicle routing problem
- A heuristic method for the open vehicle routing problem
- A new tabu search heuristic for the open vehicle routing problem
- A threshold accepting approach to the Open Vehicle Routing problem
- A tabu search algorithm for the open vehicle routing problem
- Using clustering analysis in a capacitated location-routing problem
- A GRASP\(\times \)ELS approach for the capacitated location-routing problem
- A two-phase tabu search approach to the location routing problem
- A particle swarm optimization algorithm with path relinking for the location routing problem
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking
- A taxonomical analysis, current methods and objectives on location-routing problems
- The open vehicle routing problem: algorithms, large-scale test problems, and computational results
Cited In (16)
- A two-stage stochastic location-routing problem for electric vehicles fast charging
- Two-echelon time-dependent vehicle routing problem with simultaneous pickup and delivery and satellite synchronization
- Optimization of two-stage location-routing-inventory problem with time-windows in food distribution network
- Model and algorithm for bilevel multisized terminal location‐routing problem for the last mile delivery
- Improvement heuristics for the vehicle routing problem based on simulated annealing
- Research on the vehicle routing problem with interval demands
- 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 simulated annealing-based heuristic for the single allocation maximal covering hub location problem
- Location‐routing problem: a classification of recent research
- 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
- A multi-depot two-echelon vehicle routing problem with delivery options arising in the last mile distribution
- 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
- Solving Location-Allocation Problems with Rectilinear Distances by Simulated Annealing
Uses Software
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)
