A multi‐depot travelling salesman problem and its iterative and integrated approaches
Source: International Journal of Operational Research, Volume 1, Number 4, 10 July 2006 , pp. 382-395(14)
Publisher: Inderscience Publishers
Abstract:This paper formulates a logistics distribution problem as the multi‐depot travelling salesman problem (MDTSP). The decision makers not only have to determine the travelling sequence of the salesman for delivering finished products from a warehouse or depot to a customer, but also need to determine which depot stores which type of products so that the total travelling distance is minimised. The MDTSP is similar to the combination of the travelling salesman and quadratic assignment problems. In this paper, the two individual hard problems or models are formulated first. Then, the problems are integrated together, that is, the MDTSP. The MDTSP is constructed as both integer nonlinear and linear programming models. After formulating the models, we verify the integrated models using commercial packages, and most importantly, investigate whether an iterative approach, that is, solving the individual models repeatedly, can generate an optimal solution to the MDTSP.
Document Type: Research Article
Affiliations: 1: Operations and Information Management Group, Aston Business School, Aston University, Birmingham B4 7ET, UK. 2: Department of Industrial and Systems Engineering, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong. 3: Operations and Information Management Group, Aston Business School, Aston University, Birmingham B4 7ET, UK
Publication date: 10 July 2006