Recommendations
Cites work
- scientific article; zbMATH DE number 3643061 (Why is no real title available?)
- scientific article; zbMATH DE number 1128822 (Why is no real title available?)
- A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem
- A distribution network design problem in the automotive industry: MIP formulation and heuristics
- A hybrid evolutionary algorithm for the periodic location-routing problem
- A math-heuristic for the warehouse location-routing problem in disaster relief
- A memetic algorithm for the capacitated location-routing problem with mixed backhauls
- A memetic algorithm for the multi trip vehicle routing problem
- A particle swarm optimization algorithm with path relinking for the location routing problem
- A survey of recent research on location-routing problems
- A two-phase hybrid heuristic algorithm for the capacitated location-routing problem
- A two-phase metaheuristic 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
- An effective memetic algorithm for the cumulative capacitated vehicle routing problem
- An exact algorithm based on cut-and-column generation for the capacitated location-routing problem
- Combined location and routing problems for drug distribution
- Facility location models for distribution system design
- Multi-objective metaheuristics for a location-routing problem with multiple use of vehicles on real data and simulated data
- P-Complete Approximation Problems
- Sequential and parallel large neighborhood search algorithms for the periodic location routing problem
- Skewed general variable neighborhood search for the location routing scheduling problem
- Solving a bi-objective transportation location routing problem by metaheuristic algorithms
- Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking
- Solving the dynamic capacitated location-routing problem with fuzzy demands by hybrid heuristic algorithm
- Technical Note—Routing and Location-Routing p-Delivery Men Problems on a Path
- Variable neighborhood search for location routing
Cited in
(13)- An iterated local search algorithm for latency vehicle routing problems with multiple depots
- A probabilistic bi-objective model for a humanitarian location-routing problem under uncertain demand and road closure
- 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
- A truck and drones model for last-mile delivery: a mathematical model and heuristic approach
- Solving the humanitarian multi-trip cumulative capacitated routing problem via a grouping metaheuristic algorithm
- Charlemagne's Challenge: The Periodic Latency Problem
- An adaptive large neighborhood search for the multi-point dynamic aggregation problem
- Selective capacitated location-routing problem with incentive-dependent returns in designing used products collection network
- New formulations and solution approaches for the latency location routing problem
- Multiperiod location-routing with decoupled time scales
- Weighted online minimum latency problem with edge uncertainty
This page was built for publication: The latency location-routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q323569)
