An airport limousine service which parks all its limos at the airport can minimize its cost by using a proper order to pick up passengers from their houses and return to the airport using a
A) set covering problem
B) traveling salesman problem
C) knapsack problem
D) fixed charge problem

Question

Quizplus · Accepted Answer

The traveling salesman problem (TSP) is the most suitable for this scenario. It involves finding the shortest possible route that visits each location exactly once and returns to the origin point, which aligns with the goal of minimizing costs for picking up passengers from their houses and returning to the airport.

An Airport Limousine Service Which Parks All Its Limos at the Airport