Group Business Presentation

8/17/2019 Group Business Presentation

1/21

GROUP BUSINESSPRESENTATION

EAT ON GO


2/21

MARKETING STRATEGIES

• ORDER ON WEBSITE OR APP.

• ORDER FROM WIDE VARIETY OF RESTAURANTS ACROSS THE STATE.

• CAN SELECT YOUR OWN MEAL BY SELECTING FROM DIFFERENT RESTAURANTS AT

TIME.

• DELIVERY WITHIN 45 MINS (SAME CITY AND IF NUMBER OF RESTAURANTS LESS T

• OPTION TO ORDER IN ADVANCE.

• FOOD TO BE DELIVERED IN BIO DEGRADABLE OR REUSABLE CONTAINERS.

• NO USE OF PLASTIC BAGS.

• CUTLERY COST RS 5 FOR EDIBLE CUTLERY SET (ONE FORK, SPOON AND KNIFE) A

FOR PLASTIC SET.


3/21

STRATEGIES

• FREE DELIVERY ON ORDERS OF ABOVE RS ! (E"CLUDING TA") WITH A MIORDER VALUE OF RS #5 FROM EACH RESTAURANT.

• 1#$ DELIVERY CHARGE ON TOTAL AMOUNT OF EACH RESTAURANT IF ORDE

LESS THAN RS 15.

• %$ DELIVERY CHARGE ON TOTAL AMOUNT OF EACH RESTAURANT IF ORDER

RS 15

• RS #5 PACKAGING CHARGE ON ORDERS FROM 4 OR MORE RESTAURANTS.

• RS 1 DELIVERY CHARGE IF ORDER IS FROM DIFFERENT CITY (#5KMS) WIT

ADDITIONAL CHARGE OF RS 3&KM ON ADDITIONAL KILOMETERS.

• ADDITIONAL CHARGE OF RS 1&KG ON BULK ORDERS.


4/21

DISTRIBUTION NETWORK


5/21

ROUTING AND SCHEDULING IN TRANSPORTATION

• ASSUME THAT

• THERE ARE ORDERS FROM 5 DIFFERENT CUSTOMERS

• THERE ARE # VEHICLES EACH CAPABLE OF CARRYING # UNITS


6/21

• THE MANAGER MUST SOLVE TWO SUB'PROBLEMS

1. SPLIT THE CITY INTO SEVERAL SMALLER REGIONS, EACH OF WHIC

SERVED BY ONE VEHICLE. THIS CAN BE DONE BY CONSIDERING A C

FIRST, ASSIGNING THE CUSTOMER TO A VEHICLE, AND THEN ASSIG

OTHER NEARBY CUSTOMERS TO THE SAME VEHICLE. SO, THIS SUB

WILL BE CALLED ASSIGNING CUSTOMERS TO VEHICLES.

#. SEUENCE CUSTOMERS SERVED BY THE SAME VEHICLE


7/21

• THE OBECTIVES OF THE VEHICLE SCHEDULING PROBLEM CAN B

• FOLLOWING ARE SOME E"AMPLES*

• MINIMI+E NUMBER OF VEHICLES REUIRED

• MINIMI+E TOTAL DISTANCE TRAVELED

• MINIMI+E TOTAL TRAVEL TIME• MINIMI+E COST

• WE SHALL CONSIDER THE PROBLEM WITH THE OBECTIVE OF M

TOTAL DISTANCE.


8/21

X Coordinate Y Coordinate Order Size

W 0 0

1 0 12 48

2 6 5 60

3 7 15 43

4 9 12 92

5 15 3 80

ASSUME THAT THE CUSTOMER LOCATIONS AND ORDERSI+ES ARE AS SHOWN ABOVE. THE LOCATIONS AREPLOTTED ON THE NE"T SLIDE.


9/21

W

1

2

3

4

5

L o c a t i o n o f W a r e h o u s e a n d C u s t o m e r s

T- /02- 267280 0298 28 - :-;72/0 07


10/21

F22978> 6- - 0-:0 2? - S6;78>0 M67@ M-2


11/21

Outlet

Cust 1 Cust 2 Cust 3 Cust 4 C

O/-

C/0 1 1#

C/0 # .% .#

C/0 3 1!.! .! 1

C/0 4 15 .! 3.!

C/0 5 15.3 15 .# 14.4 1.%

D7068- M67@


12/21

SAVINGS MATRI"Cust 1 Cust 2 Cust 3 Cust 4 C

C/0 1

C/0 # 1.5

C/0 3 #. 14.3

C/0 4 1% 15.# #.

C/0 5 .% 13. 1.4 1.5


13/21

Assign Customers to Vehicles

To merge the

highest

saings !air

"3#4$# the

ca!acit%

re&uired '

43(92' 135 )

200 ' ca!acit%aai*a+*e, -o#

merge 3 and

4,

W

1

2

3

4

5

Location of Warehouse and Custom

Custo

1

2

3

4

5


14/21

W

1

2

3

4

5

L o c a t i o n o f W a r e h o u s e a n d C u s t o m e r

C u s t o m

1

2

3

4

5


To merge the

net !air "1#3$#

ca!acit%

re&uired '

43(92(40'

175 ) 200 '

ca!acit%

aai*a+*e, -o#merge 1 and 3

"and 4$,


15/21

W

1

2

3

4

5

L o c a t i o n o f W a r e h o u s e a n d C u s t o m e

C u s t o

1

2

3

4

5


erging "4#5$#

"3#5$# "2#4$ and

"2#3$ re&uires

more ca!acit%

than aai*a+*e,

The !air "1#4$

is a*read%

merged, -o#the !airs are

crossed out,


16/21

W

1

2

3

4

5

L o c a t i o n o f W a r e h o u s e a n d C u s t o m e r

C u s t o m

1

2

3

4

5


The net !air

"2#5$ are

merged and

assigned to a

ne ehic*e as

the ca!acit%

aai*a+*e '

200 60 ( 80' 140 '

ca!acit%

re&uired,


17/21

• T- 8-@ 0-: 70 0-/-878> /02-0 6007>8-< 2

06- ;-7-. A /-0728 70 78 96 0-/-8- 97 - ;-7- ;707 /02-0 1, 3 68< 4 68< -/8 2 -96-2/0- S776, 682- /-0728 70 78 960-/-8- 97 - 2- ;-7- ;707 /02-0 # 68<

• W- 06 /0- - 8-6-0 8-7>=2 /- 97 06-0 6960 ;707 - /02- 6 70 8-6-0.


18/21

• -T# C.- T: ;.C? C>-T.- 1# 3

W:. @ @--? T. T: -@ A:CL,

W

1

2

3

4

5

L o c a t i o n


19/21

• AMONG 1, 3 AND 4 IS 1 IS THE NEAREST TO WAREHOUSE. SO, THE

WILL FIRST TRAVEL FROM WAREHOUSE TO CUSTOMER 1. BETWEEN

IS 3 IS THE NEAREST TO 1. SO, THE VEHICLE WILL TRAVEL FROM 1

ONLY POSSIBLE TOUR IS THEN W'1'3'4'W.

• BETWEEN # AND 5 IS # IS THE NEAREST TO THE WAREHOUSE. SO,

VEHICLE WILL TRAVEL FROM THE WAREHOUSE TO CUSTOMER #. T

TOUR IS THEN W'#'5'W. NOTE* DUE TO SYMMETRY BOTH W'#'5'W A

W HAVE THE SAME DISTANCE TRAVELED


20/21

W

1

2

3

4

5

L o c a t i o n


21/21

THANK YOU

Documents

Group Business Presentation