A multi-depot travelling salesman problem and its iterative and integrated approaches (Q2505255): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
Property / describes a project that uses | |||
Property / describes a project that uses: QAPLIB / rank | |||
Normal rank |
Revision as of 00:49, 29 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A multi-depot travelling salesman problem and its iterative and integrated approaches |
scientific article |
Statements
A multi-depot travelling salesman problem and its iterative and integrated approaches (English)
0 references
4 October 2006
0 references
Summary: 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.
0 references
logistics management
0 references
distribution management
0 references
mathematical modelling
0 references
optimisation
0 references
quadratic assignment problem
0 references
multi-depot travelling salesman problem
0 references