Abstract
This study focuses on the capacitated location-routing problem (CLRP), which is a combination of capacitated facility location problem and capacitated vehicle routing problem. We propose a novel ap...
Highlights
Capacitated location-routing problem (CLRP) is a conjunction of two combinatorial optimization problems namely facility location problem (FLP) and vehicle routing problem (VRP)
This study focuses on the capacitated location-routing problem (CLRP), which is a combination of capacitated facility location problem and capacitated vehicle routing problem
The proposed approach consists of unique assignment techniques of the customers to the opened depots and a tri-fold particle swarm optimization (PSO) based searching strategy which combines the influence of both hierarchical and iterative techniques in order to find near optimal solutions to a CLRP
Summary
ISSN: (Print) 2331-1916 (Online) Journal homepage: https://www.tandfonline.com/loi/oaen. A novel approach to combine the hierarchical and iterative techniques for solving capacitated location-routing problem.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
