The latency location-routing problem
From MaRDI portal
Publication:323569
DOI10.1016/j.ejor.2016.05.048zbMath1346.90511OpenAlexW2461453209MaRDI QIDQ323569
Seokcheon Lee, Mohammad Moshref-Javadi
Publication date: 7 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2016.05.048
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (9)
New formulations and solution approaches for the latency location routing problem ⋮ Enabling same-day delivery using a drone resupply model with transshipment points ⋮ Effective metaheuristics for the latency location routing problem ⋮ Location‐routing problem: a classification of recent research ⋮ An iterated local search algorithm for latency vehicle routing problems with multiple depots ⋮ Weighted online minimum latency problem with edge uncertainty ⋮ A truck and drones model for last-mile delivery: a mathematical model and heuristic approach ⋮ Selective capacitated location-routing problem with incentive-dependent returns in designing used products collection network ⋮ Solving the humanitarian multi-trip cumulative capacitated routing problem via a grouping metaheuristic algorithm
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A survey of recent research on location-routing problems
- Solving the dynamic capacitated location-routing problem with fuzzy demands by hybrid heuristic algorithm
- Sequential and parallel large neighborhood search algorithms for the periodic location routing problem
- A math-heuristic for the warehouse location-routing problem in disaster relief
- A distribution network design problem in the automotive industry: MIP formulation and heuristics
- A memetic algorithm for the capacitated location-routing problem with mixed backhauls
- Skewed general variable neighborhood search for the location routing scheduling problem
- Variable neighborhood search for location routing
- A two-phase hybrid heuristic algorithm for the capacitated location-routing problem
- A two-phase metaheuristic for the cumulative capacitated vehicle routing problem
- A hybrid evolutionary algorithm for the periodic location-routing problem
- Facility location models for distribution system design
- Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking
- An effective memetic algorithm for the cumulative capacitated vehicle routing problem
- A two-phase tabu search approach to the location routing problem
- An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem
- Solving a bi-objective transportation location routing problem by metaheuristic algorithms
- 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
- A particle swarm optimization algorithm with path relinking for the location routing problem
- A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem
- A memetic algorithm for the multi trip vehicle routing problem
- An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem
- Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems
- P-Complete Approximation Problems
- Technical Note—Routing and Location-Routing p-Delivery Men Problems on a Path
This page was built for publication: The latency location-routing problem
