A decomposition algorithm for the consistent traveling salesman problem with vehicle idling

Keyphrases

• Decomposition Algorithm 100%
• Traveling Salesman Problem 100%
• Provided Services 50%
• Search Methods 50%
• Benchmark Instances 50%
• Planning Horizon 50%
• Minimum Cost 50%
• Time of Arrival 50%
• Multiple Time Periods 50%
• Single-period 50%
• Exact Algorithm 50%
• Time Inconsistency 50%
• Single Vehicle 50%
• Duration Constraints 50%
• Route Duration 50%
• Branch-and-bound Search 50%

Computer Science

• Traveling Salesman Problem 100%
• Search Procedure 33%
• Exact Algorithm 33%
• Planning Horizon 33%
• Branch-and-Bound Algorithm Design 33%
• Providing Service 33%