Please use this identifier to cite or link to this item:
Title: A multi-depot travelling salesman problem and its iterative and integrated approaches
Authors: Ho, W
Ji, P 
Dey, PK
Keywords: Logistics management
Distribution management
Mathematical modelling
Quadratic assignment problem
Multi-depot travelling salesman problem
Issue Date: 2006
Publisher: Inderscience Publishers
Source: International journal of operational research, 2006, v. 1, no. 4, p. 382-395 How to cite?
Journal: International journal of operational research 
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.
ISSN: 1745-7645
DOI: 10.1504/IJOR.2006.010211
Appears in Collections:Journal/Magazine Article

View full-text via PolyU eLinks SFX Query
Show full item record


Last Week
Last month
Citations as of Feb 15, 2019

Page view(s)

Last Week
Last month
Citations as of Feb 18, 2019

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.