Abstract
ABSTRACTThis paper considers a multi-period and product inventory-routing problem. This model involves two levels, namely, a distributor and several retailers. This problem is modeled with the aim of minimizing bi-objectives, namely, the total cost of the system (including start-up, distribution, and maintenance costs) and risk-based transportation. Products are delivered to retailers by some heterogeneous vehicles with specific capacities through a direct delivery strategy, and inventory shortage is assumed to be impermissible. To validate this new bi-objective model, the ε-constraint method is used to solve problems. Because problems without distribution planning are very complex to solve optimally, the problem considered in this paper is also Non-deterministic Polynomial (NP-hard). Therefore, a nondominated sorting genetic algorithm (NSGA-II) and a multi-objective imperialist competitive algorithm (MOICA) are used and developed to solve a number of test problems. Furthermore, the computational results are compared and the performance of the foregoing algorithms is analyzed.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
