html5-img
1 / 27

ENERGY EDUCATION INC.

ENERGY EDUCATION INC. Optimal Routing and Assignment of Consultants. About Energy Education, Inc. Who are they ? What do they do ?. Any Problems ? Manual scheduling Travel costs Staffing Meeting demand. What’s new about this problem?.

yosefu
Download Presentation

ENERGY EDUCATION INC.

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. ENERGY EDUCATION INC. Optimal Routing and Assignment of Consultants

  2. About Energy Education, Inc. • Who are they ? • What do they do ? • Any Problems ? • Manual scheduling • Travel costs • Staffing • Meeting demand

  3. What’snewaboutthis problem? Differsfromclassicroutingandassignmentproblems:

  4. CurrentStrategybySMEs (Heuristic)

  5. CurrentStrategybySMEs (Heuristic) • Assignleftovervisits • Anyunmetclientdemandfromremainingconsultantsupply • Not optimized • Costly • Gatherinformation • Consultant supply • Client demand • Assignhome-areavisits • Checkwiththeskillsfirst • Reducecapacity • Final review • Calendarreviewedbymanagement • Iffoundinfeasible, rework • Assignnear-areavisits • Allocateconsultantstoclientsnearfixedvisits • Reducecapacity • Assignfixedvisits • Depending on clientdemand • Anchorpoint • Reducecapacity

  6. Improvements • Currentmanualapproach • Usesgreedymethod. • Is laborintensive ( +16 hours / week ). • Not evencloseto optimal. • Hoff & Yucomesupwithmathematicalsolutionsthatwould • Minimize thenumber of flightsandconsultantsrequiredby EEI eachweek • Fullymeettheclientdemand. HOW DO THEY DO IT?

  7. New Approach: Cluster First, Route Second Optimizes the process of routing consultants (Set Covering) Clustering Procedure Assignment & Routing Minimizes the number of flights (VRP)

  8. Clustering 300 miles

  9. Set Covering Problem M: # of client locations P: # of potential cluster location Cj: cost associated with cluster (j) Aij: 1, if distance between i and j ≤ 300 0, otw. Xj: 1, if cluster j is used 0, otw. Min

  10. Alternatives P-median Maximal Covering • If they would limit themselves to use p cluster • There are p flights (fixed cost: p. flight cost) • If they would specify a budget • Maximize the number of clients are covered

  11. Assigning Problem (VRP) Parameters Parameters • I:# of consultants to be assigned • C: # of clusters of clients to be scheduled • N: Maximum number of trip legs allowed for a consultant • S: # of skill levels • X(i,j,s): # of visits assigned to consultant i for cluster j for s type of visit • r(j,k): flight cost between clusters j and k • q(i,k): flight cost between consultant’ i’s home and cluster k • t(i,j,s): # of s-type fixed visits needed from consultant i to cluster j • d(k,s): demand for skill level s visit by cluster k • ai: # of shifts available from consultant I • wi: weekly wage for consultant i

  12. u(i,s): y(i,j,k,n): y(i,0,k,1): y(i,j,(c+1),n): Decision Variables 1, if consultant i has skill level s 0, otw. 1, if consultatnti travels from cluster j to k on the nth leg of trip 0, otw. 1, if consultant i travels from home to cluster k on the 1st leg of trip 0, otw. 1, if consultant I returns home from cluster j on the nth leg of trip 0, otw.

  13. Objective Function Travel cost from home to 1st cluster + wage Travel cost between clusters Travel cost for returning home

  14. Constraints If consultant does not leave home on the first leg of a trip, he cannot go a cluster

  15. Constraints The first leg of a trip must be the one in which consultant leaves home

  16. Constraints Starting from the 2nd leg of a trip, a cluster will not be starting cluster of a new leg of a trip if it is not the destination in the previous leg

  17. Constraints Consultant make no more trip after returning home

  18. Constraints 1-) Consultant should return home if he leaves from home for a trip 2 & 3 -) Consultant travels from or to a particular cluster at most once in entire trip

  19. Constraints Number of visits assigned to a consultant should be less than or equal to number of shifts available from this consultant

  20. Constraints At least one visit is scheduled if a consultant stops over at a cluster

  21. Constraints All fixed visits are scheduled

  22. Constraints 1-) Consultant’s skill level 2-) Capacity constraint for consultant

  23. What else can be included? If a client is served by two cluster, two different consultants travel to same client unnecessarily. • Add constraints which require one consultant enters and leaves a client exactly once. • Add sub-tour elimination constraints

  24. ImplementationMethodology • SMEswill • Maintaineachconsultantsskill set matrix. • Tracktheconsultants’ availability. • Altertheclientdatabasewhennecessary. • Update thecost data forflights & contractconsultants. • Manuallyrunthesolver. • Publisheachconsultant’sschedule.

  25. How valid is the optimal solution? • After 1 hour – not much of an improvement

  26. Results of theImprovement • Flight Costs • Consultant VariableCosts

  27. THANK YOU FOR YOUR ATTENTION Saygın Yağ & Çiğdem Ünver

More Related