Processing, Please wait...

  • Publisher Home
  • Home
  • 🔙 Back
  • 📚 Journals
    • ⚙️ IJIEC - Industrial Engineering Computations
    • 🌐 IJDNS - Data and Network Science
    • 🧪 CCL - Current Chemistry Letters
    • 💹 AC - Accounting
    • 🎯 DSL - Decision Science Letters
    • 🚛 USCM - Uncertain Supply Chain Management
    • 🏗️ JPM - Journal of Project Management
    • 🏥 HE - Healthcare Engineering
    • 📈 SCI - Scientometrica
    • 🔩 ESM - Engineering Solid Mechanics
    • 🌿 JFS - Journal of Future Sustainability
    • 💼 MSL - Management Science Letters
  • 📝 Submit Article
  • 📊 Statistics
  • 📋 About
    • 📄 About Us
    • 📰 Blog
    • 📢 News
    • 📧 Contact
  • 📺 Tutorial
  • Search:
  • Advanced Search

Growing Science » Tags cloud » Open close multiple travelling salesmen problem

⭐ Highly Cited Articles

  • Jaya Algorithm
  • Rao Algorithm
  • TLBO Algorithm
  • ChatGPT and Blended Learning

Journals

  • IJIEC (840)
  • IJDS (1032)
  • DSL (759)
  • ESM (434)
  • CCL (563)
  • JPM (350)
  • AC (572)
  • JFS (106)
  • MSL (2658)
  • USCM (1104)
  • HE (57)
  • SCI (53)

🔑 Keywords

Jordan(175)
Supply chain management(172)
Vietnam(154)
Customer satisfaction(124)
Performance(117)
Supply chain(115)
Artificial intelligence(108)
Service quality(101)
Competitive advantage(100)
SMEs(95)
Sustainability(94)
Tehran Stock Exchange(94)
optimization(88)
Financial performance(86)
TOPSIS(85)
Trust(85)
Organizational performance(81)
Job satisfaction(81)
Genetic Algorithm(81)
Social media(80)


» Show all keywords

✍️ Authors

Naser Azad(82)
Zeplin Jiwa Husada Tarigan(70)
Mohammad Reza Iravani(65)
Endri Endri(45)
Hotlan Siagian(43)
Muhammad Alshurideh(42)
Dmaithan Almajali(39)
Jumadil Saputra(37)
Muhammad Turki Alshurideh(35)
Ahmad Makui(33)
Sautma Ronni Basana(33)
Barween Al Kurdi(32)
Basrowi Basrowi(31)
Mohammad Khodaei Valahzaghard(30)
Haitham M. Alzoubi(30)
Ni Nyoman Kerti Yasa(30)
Hassan Ghodrati(30)
Shankar Chakraborty(29)
Sulieman Ibraheem Shelash Al-Hawary(28)
Mahmoud Allahham(28)


» Show all authors

🌍 Countries

1. Algeria (52)
2. Angola (2)
3. Argentina (22)
4. Armenia (2)
5. Australia (52)
6. Austria (2)
7. Bahrain (26)
8. Bangladesh (58)
9. Belarus (4)
10. Belgium (3)
11. Benin (2)
12. Benin Republic (1)
13. Bhutan (1)
14. Bosnia and Herzegovina (1)
15. Botswana (9)
16. Brazil (40)
17. Brunei (1)
18. Bulgaria (1)
19. Burkina Faso (1)
20. Cameroon (1)
Total: 121 countries

Show all countries
Sort articles by: 📖 Volume | 📅 Date | ⭐ Most Rates | 👁️ Most Views | 🚀 Rising Stars | 🔗 Citations (Scopus) | 🔥 Hot Papers
1.

An open close multiple travelling salesman problem with single depot Pages 121-136 PDF Download PDF

Authors: Jayanth Kumar Thenepalle, Purusotham Singamsetty

doi 10.5267/j.dsl.2018.8.002

🔑 Keywords: Open close multiple travelling salesmen problem, Lexi-search algorithm, Pattern recognition technique

Abstract:
This paper introduces a novel practical variant, namely an open close multiple travelling salesmen problem with single depot (OCMTSP) that concerns the generalization of classical travelling salesman problem (TSP). In OCMTSP, the overall salesmen can be categorized into internal/permanent and external/outsourcing ones, where all the salesmen are positioned at the depot city. The primary objective of this problem is to design the optimal route such that all salesmen start from the depot/base city, and then visit a given set of cities. Each city is to be visited precisely once by exactly one salesman, and only the internal salesmen have to return to the depot city whereas the external ones need not return. To find optimal solutions, an exact pattern recognition technique based Lexi-search algorithm (LSA) is developed which has been subjected in Matlab. Comparative computational results of the LSA have been made with the existing methods for general multiple travelling salesman problem (MTSP). Further, to test the performance of LSA, computational experiments have been carried out on some benchmark as well as randomly generated test instances for OCMTSP, and results are reported. The overall computational results demonstrate that the proposed LSA is efficient in providing optimal and sub-optimal solutions within the considerable CPU times.
Details
  • 68
  • 1
  • 2
  • 3
  • 4
  • 5

Journal: DSL | Year: 2019 | Volume: 8 | Issue: 2 | Views: 3577

 

® 2010-2026 GrowingScience.Com