A simple and effective evolutionary algorithm for the capacitated location-routing problem

DOI10.1016/j.cor.2016.01.006zbMath1391.90046OpenAlexW2234744346WikidataQ61441841 ScholiaQ61441841MaRDI QIDQ1651634

Rui Borges Lopes, Carlos Ferreira, Beatriz Sousa Santos

Publication date: 12 July 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2016.01.006

zbMATH Keywords

genetic algorithmlocationlocation-routing

Mathematics Subject Classification ID

Integer programming (90C10) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (13)

Evolutionary hyperheuristics for location-routing problem with simultaneous pickup and delivery ⋮ Decomposition-based hyperheuristic approaches for the bi-objective cold chain considering environmental effects ⋮ The electric location-routing problem with heterogeneous fleet: formulation and Benders decomposition approach ⋮ Hybrid adaptive large neighborhood search for vehicle routing problems with depot location decisions ⋮ A fuzzy correlation based heuristic for dual-mode integrated location routing problem ⋮ Location‐routing problem: a classification of recent research ⋮ A two-stage stochastic location-routing problem for electric vehicles fast charging ⋮ A survey of the standard location-routing problem ⋮ A hybrid metaheuristic algorithm for the multi-objective location-routing problem in the early post-disaster stage ⋮ A bi-level model and memetic algorithm for arc interdiction location-routing problem ⋮ Selective capacitated location-routing problem with incentive-dependent returns in designing used products collection network ⋮ A minimax regret model for the leader-follower facility location problem ⋮ A location-or-routing problem with partial and decaying coverage

Uses Software

• VRP

Cites Work

• Unnamed Item
• A survey of recent research on location-routing problems
• A two-phase hybrid heuristic algorithm for the capacitated location-routing problem
• An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics
• A Branch-and-Cut method for the Capacitated Location-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 Hamiltonian p-median problem
• A GRASP\(\times \)ELS approach for the capacitated location-routing problem
• A two-phase tabu search approach to the location routing problem
• A computational comparison of flow formulations for the capacitated location-routing problem
• A simple and effective evolutionary algorithm for the vehicle routing problem
• Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
• First vs. best improvement: an empirical study
• A survey of variants and extensions of the location-routing problem
• A taxonomical analysis, current methods and objectives on location-routing problems
• An Exact Method for the Capacitated Location-Routing Problem
• The Granular Tabu Search and Its Application to the Vehicle-Routing Problem
• An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem
• Dynamic Location-routeing Problems
• The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem

This page was built for publication: A simple and effective evolutionary algorithm for the capacitated location-routing problem