A Branch and Cut method for the Capacitated Location-Routing Problem

Routing Problem ◽

Location Routing ◽

Cut Method ◽

Branch And Cut Method ◽

A Branch-and-Cut method for the Capacitated Location-Routing Problem

Computers & Operations Research ◽

10.1016/j.cor.2010.09.019 ◽

2011 ◽

Vol 38 (6) ◽

pp. 931-941 ◽

Cited By ~ 131

Author(s):

José-Manuel Belenguer ◽

Enrique Benavent ◽

Christian Prins ◽

Caroline Prodhon ◽

Roberto Wolfler Calvo

Keyword(s):

Branch And Cut ◽

Routing Problem ◽

Location Routing ◽

Cut Method ◽

Branch And Cut Method ◽

A GRASP + ILP-based metaheuristic for the capacitated location-routing problem

Journal of Heuristics ◽

10.1007/s10732-013-9230-1 ◽

2013 ◽

Vol 20 (1) ◽

pp. 1-38 ◽

Cited By ~ 33

Author(s):

Claudio Contardo ◽

Jean-François Cordeau ◽

Bernard Gendron

Keyword(s):

Routing Problem ◽

Location Routing ◽

A Memetic Algorithm for the Capacitated Location-Routing Problem

International Journal of Advanced Computer Science and Applications ◽

10.14569/ijacsa.2016.070628 ◽

2016 ◽

Vol 7 (6) ◽

Cited By ~ 2

Author(s):

Laila KECHMANE ◽

Benayad NSIRI ◽

Azeddine BAALAL

Keyword(s):

Memetic Algorithm ◽

Routing Problem ◽

Location Routing ◽

Variable Neighborhood Search with Path-Relinking for the Capacitated Location Routing Problem

Proceedings of the Institute of Industrial Engineers Asian Conference 2013 ◽

10.1007/978-981-4451-98-7_34 ◽

2013 ◽

pp. 279-286

Author(s):

Meilinda F. N. Maghfiroh ◽

A. A. N. Perwira Redi ◽

Vincent F. Yu

Keyword(s):

Variable Neighborhood Search ◽

Path Relinking ◽

Neighborhood Search ◽

Routing Problem ◽

Location Routing ◽

Multi-objective sustainable capacitated location routing problem formulation in sustainable supply-chain management

Engineering Optimization ◽

10.1080/0305215x.2021.2014476 ◽

2021 ◽

pp. 1-16

Author(s):

Luis Fernando Galindres ◽

Frederico Gadelha Guimarães ◽

Ramón Alfonso Gallego-Rendón

Keyword(s):

Supply Chain ◽

Supply Chain Management ◽

Problem Formulation ◽

Sustainable Supply Chain ◽

Routing Problem ◽

Chain Management ◽

Multi Objective ◽

Location Routing ◽

A simheuristic algorithm for the capacitated location routing problem with stochastic demands

Journal of Simulation ◽

10.1080/17477778.2019.1680262 ◽

2019 ◽

pp. 1-18

Author(s):

Carlos L. Quintero-Araujo ◽

Daniel Guimarans ◽

Angel A. Juan

Keyword(s):

Routing Problem ◽

Stochastic Demands ◽

Location Routing ◽

Particle Swarm Optimization for Capacitated Location-Routing Problem

IFAC-PapersOnLine ◽

10.1016/j.ifacol.2017.08.2495 ◽

2017 ◽

Vol 50 (1) ◽

pp. 14668-14673 ◽

Cited By ~ 6

Author(s):

Z. Peng ◽

H. Manier ◽

M.-A. Manier

Keyword(s):

Particle Swarm Optimization ◽

Particle Swarm ◽

Swarm Optimization ◽

Routing Problem ◽

Location Routing ◽

Lecture Notes in Computer Science - Knowledge-Based Intelligent Information and Engineering Systems ◽

A Combination of Simulated Annealing and Ant Colony System for the Capacitated Location-Routing Problem

10.1007/11892960_50 ◽

2006 ◽

pp. 409-416 ◽

Cited By ~ 20

Author(s):

Lyamine Bouhafs ◽

Amir hajjam ◽

Abder Koukam

Keyword(s):

Simulated Annealing ◽

Ant Colony ◽

Ant Colony System ◽

Routing Problem ◽

Location Routing ◽

A GRASP algorithm based new heuristic for the capacitated location routing problem

Journal of Experimental & Theoretical Artificial Intelligence ◽

10.1080/0952813x.2017.1421268 ◽

2018 ◽

Vol 30 (3) ◽

pp. 369-387 ◽

Cited By ~ 2

Author(s):

Imene Ferdi ◽

Abdesslem Layeb

Keyword(s):

Routing Problem ◽

Location Routing ◽

A Bi-Objective Capacitated Location-Routing Problem for Multiple Perishable Commodities

IEEE Access ◽

10.1109/access.2019.2941363 ◽

2019 ◽

Vol 7 ◽

pp. 136729-136742 ◽

Cited By ~ 1

Author(s):

Pu Li ◽

Hongjie Lan ◽

Francisco Saldanha-Da-Gama

Keyword(s):

Routing Problem ◽

Location Routing ◽