This book deals with complex variants of Travelling Salesman Problem (TSP) and Vehicle Routing Problem (VRP) within the manufacturing and service industries. The objective is to develop heuristics for these supply chain problems in order to offer practical solutions to improve operational efficiency. These heuristics are evaluated using benchmark and derived data-sets. Case studies pertaining to logistics in different industries including textile machinery manufacturing and banking are also included to demonstrate the created heuristics. High competition in todayas global market has forced the organizations to invest in and focus on their logistics system. The critical function of logistics is the transportation within and across various supply chain entities. Both supply and distribution procedure require effective transportation management. A small improvement in routing problems can lead to huge logistics savings in absolute terms. This book should appeal to executives, researchers and consultants seeking supply chain management solutions.VRP 59 0.12 0.12 0.07 0.07 A-n64-k9.VRP 63 0.07 0.07 0.00 0.00 P-n70-k10. VRP 69 0.11 0.11 0.05 0.05 P-n76-k4.VRP 75 0.05 0.05 0.03 0.03 B-n78-k10. VRP 77 0.07 0.07 0.04 0.04 A-n80-k10.VRP 79 0.09 0.09 0.04 0.04 P-n101-k4.
|Title||:||Models for Practical Routing Problems in Logistics|
|Author||:||S. P. Anbuudayasankar, K. Ganesh, Sanjay Mohapatra|
|Publisher||:||Springer - 2014-07-08|