A memetic algorithm for the capacitated location-routing problem with mixed backhauls
From MaRDI portal
Publication:337427
DOI10.1016/J.COR.2014.06.009zbMath1348.90100OpenAlexW2065581253MaRDI QIDQ337427
Fulya Altiparmak, Ismail Karaoglan
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.06.009
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (5)
The latency location-routing problem ⋮ A novel matheuristic approach for a two-stage transportation problem with fixed costs associated to the routes ⋮ A new bi-objective location-routing problem for distribution of perishable products: evolutionary computation approach ⋮ Location‐routing problem: a classification of recent research ⋮ A bi-level model and memetic algorithm for arc interdiction location-routing problem
Cites Work
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- A new formulation approach for location-routing problems
- A survey of recent research on location-routing problems
- A two-phase hybrid heuristic algorithm for the capacitated location-routing problem
- Lower and upper bounds for the two-echelon capacitated location-routing problem
- An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics
- Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking
- A Branch-and-Cut method for the Capacitated Location-Routing Problem
- A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery
- The multiple depot, multiple traveling salesmen facility-location problem: Vehicle range, service frequency, and heuristic implementations
- Location-routing: issues, models and methods
- 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
- A GRASP\(\times \)ELS approach for the capacitated location-routing problem
- The effect of ignoring routes when locating depots
- A comparative study of heuristics for a two-level routing-location problem
- A large scale location-allocation problem in the natural rubber industry
- An exact algorithm for minimizing routing and operating costs in depot location
- Hamiltonian location problems
- The many-to-many location-routing problem
- Combined location-routing problems: A synthesis and future research directions
- A heuristic solution to the warehouse location-routing problem
- The travelling salesman problem with pick-up and delivery
- Heuristic solutions to multi-depot location-routing problems
- A two-phase tabu search approach to the location routing problem
- Distribution network design: New problems and related models
- A simple and effective evolutionary algorithm for the vehicle routing problem
- A compact model and tight bounds for a combined location-routing problem
- A particle swarm optimization algorithm with path relinking for the location routing problem
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
- A taxonomical analysis, current methods and objectives on location-routing problems
- An Exact Method for the Capacitated Location-Routing Problem
- An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem
- A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling
- Distribution network design on the battlefield
- Solving the Multi-Depot Location-Routing Problem with Lagrangian Relaxation
- A Bumble Bees Mating Optimization Algorithm for Global Unconstrained Optimization Problems
This page was built for publication: A memetic algorithm for the capacitated location-routing problem with mixed backhauls
