What is the optimal solution for the Traveling Doctor Problem?

  • Thread starter Thread starter firkser
  • Start date Start date
  • Tags Tags
    Doctor
firkser
Messages
1
Reaction score
0
his problem is related in some ways to a TSP, or a Quota-TSP, but has a lot more information that must be taken into account:

There are a number of clinics, all run by the same organisation, employing a number of doctors, who are free to work at any of the clinics. Each clinic is open 6 days a week, 10 hours a day. There need not be a doctor at each clinic during every, but each week, a certain number of patients have to be seen at each clinic (a number which is different for each of the clinics). each doctor makes a salary based on how many hours they work per week, regardless of which clinic they are at. each doctor is able to see a certain number of patients per hour, again, not necessarily the same for each doctor.

Furthermore, the problem takes into account travel time for each of the doctors. The doctors are reimbursed for their travel time to and from work each morning, from their home to the clinic, then from the clinic back home. To complicate things, doctors may travel between clinics during the day. For the time they spend traveling between clinics, doctors are paid their salaries, but cannot see any patients. The patients lost during this time are split between the starting clinic and the destination clinic (for example, if a doctor can see 4 patients in an hour, and travels at 4 pm from a clinic to another that is half an hour away, 1 patient fewer is seen at each of these clinics than would be if travel time were not considered).

The goal of the problem is to minimise the cost to the organisation, making sure that the requisite number of patients are seen weekly at each of the clinics.
 
Mathematics news on Phys.org
It looks like an ordinary linear optimization problem with several constraints. There are algorithms to solve this. In contrast to the TSP we obviously have a version of finite length, so the question about complexity doesn't arise.
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.

Similar threads

Replies
3
Views
600
Replies
3
Views
2K
Replies
3
Views
1K
Replies
38
Views
10K
Replies
7
Views
2K
Replies
2
Views
2K
Back
Top