 A new mathematical model for non-fixed destination multi-depot multiple travelling salesmen with time window problemMohammad Taher Shirafkan, Hany Seidgar and Nikbakhsh Javadian International Journal of Services and Operations Management, 2018, vol. 31, issue 4, 530-538 Abstract: Consider the problem of having a team of cooperative and autonomous vehicles to repeatedly visit a set of target locations and return back to their initial locations. This problem is known as multi-depot multiple travelling salesman problems (MD-MTSP), which applies to several mobile robots applications. The non-fixed destination multi-depot multiple travelling salesmen with time window problem (MmTSPTW) is a generalisation of a well-known MmTSP with considering time window for each node in a tour. The salesmen also are not forced to return to their starting depot. This problem is of great complexity and belongs to NP-complete class of problems. In this paper, a new mathematical model is proposed for MmTSPTW by considering waiting penalties and time window is defined for each depot (city). The salesmen only can service the customers within these time windows and also some penalties are considered for any deviation of start time. The objective function of problem is to minimise the total costs and penalties of the tours. Keywords: multi-depot multiple travelling salesmen problem; MmTSP; time windows. (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:ids:ijsoma:v:31:y:2018:i:4:p:530-538 Access Statistics for this article More articles in International Journal of Services and Operations Management from Inderscience Enterprises Ltd |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.