- Tình trạng: Closed
- Giải thưởng: $150
- Các bài thi đã nhận: 11
- Người chiến thắng: yuriiherula
Tóm tắt cuộc thi
Setup an algorithm to determine optimal appointment times.
I attached a very simple example of data you may receive
Here is the input you will have.
Appointments (Array of objects containing time and location of an appointment)
WorkingArea (Array of zipcodes, this tells you the entire region this user works in)
MaximumDistanceBetweenAppointments (Number of miles the user is willing to travel for an appointment. must be inside WorkingArea)
MinimumBufferTime (Number, minimum number of mininutes between ETA and start time of next appointment)
NewAppointmentZipcode(Number, the zipcode where a user is requesting a meeting)
UrgencyLevel (Scale of 0-4. 0 being get this person is asap and 4 being get the person in within 2 weeks)
LengthOfAppointment(Number of minutes)
UrgencyLevel will be used so that if we have an inconvenient appointment the same day but a convenient appointment in 1 day with an UrgencyLevel of 1 then we will not display the inconvenient one to the user. If the user had an UrgencyLevel of 0, as long as all requirements are met we will display the appointment
The overall goal is that with all this information we will call some function telling it the 'NewAppointmentZipcode' and using other appointments, the distance between the current appointment im working on and this new zipcode, the minimum factors I have in place and it will return all available appointments.
We need to make sure the following are accounted for
how far am I from the next appointment (use google maps api?)
how long will I be at the current appointment and how long will it take to get to the next
How do I try to favor 1 location throughout the course of a day without minimizing business. I want to try to group appointments tightly together but I dont want to force that to make someone not have availability if we have a higher urgency level.
Ensure the appointment is being scheduled within a working area
Ensure we remain within the max distance between appointments
Các kĩ năng yêu cầu
Những bài dự thi tốt nhất dự cuộc thi này
bestprograme United States
Bảng thông báo công khai
Làm thế nào để bắt đầu với cuộc thi
Đăng cuộc thi của bạn Nhanh chóng và dễ dàng
Nhận được vô số Bài dự thi Từ khắp nơi trên thế giới
Trao giải cho bài thi xuất sắc nhất Download File - Đơn giản!