The adult training centre problem: a case study

Area of Science:

• Operations Research
• Logistics Management
• Combinatorial Optimization

Background:

• Real-world logistics often involve complex routing challenges.
• The multiple travelling-salesman problem (mTSP) is a common NP-hard problem in vehicle routing.
• Efficiently servicing multiple locations with limited vehicles is crucial for operational efficiency.

Purpose of the Study:

• To find an optimal solution for a practical routing problem with mTSP characteristics.
• To determine the most efficient daily routes for four service vehicles visiting 38 distinct locations.
• To apply a combination of heuristic and exact algorithms for route optimization.

Main Methods:

• Formulated the problem as a variation of the multiple travelling-salesman problem.
• Employed a hybrid approach combining heuristic and exact algorithms.
• Developed algorithms to determine the optimal sequence of visits for 38 locations.

Main Results:

• An optimal routing solution was successfully identified for the specified scenario.
• The study demonstrates the effectiveness of combined algorithmic approaches for complex routing.
• The derived routes aim to minimize travel distance and time for daily vehicle services.

Conclusions:

• The integration of heuristic and exact algorithms provides an effective method for solving real-world mTSP instances.
• Optimized routing significantly enhances the efficiency of daily logistics operations.
• This approach offers a scalable solution for businesses managing multi-vehicle delivery or service networks.