C++ program Automatic waste status update: Create an automatic system that updates the waste management server about the waste statuses of bins in a city. The waste collectors can determine an optimized route based on the waste statuses and collect waste only and exactly when it is needed. • Create a class named WasteLocations in which 7 or more locations are saved • Assign a fixed, pre-defined distance to each location(assuming that this distance of each location is from the waste collector) • Every time your program is run, each waste location should get assigned with a random waste level between 0-100 (this shows waste level in %) • If the waste level of a waste location is > 40%, create a map of all those locations that waste collector must visit. • Determine cost in terms of time, fuel consumption, and wages based on the below data: o Time: 1.5 minute per km; fuel consumption: 1.5 RM per km; wage: 5.77 RM per hour Based on this info, create your algorithm that should make sense and determine correct results o o This is your algorithm. Highlight it through comments and explain your logic (if necessary) Display the so far information (waste locations, distances, waste levels, all costs (and cumulative cost) as well as save this information in a file (e.g., .txt file, giving it name WL_InitialRoute) • Create another class OptimizedRoute • In this class, determine if any waste level in WasteLocations class is < 60%, ignore that location. Now recalculate all the cost and display all the new information as well as the previous one. Save this data in a file named Optimized Route (can be a .txt file) Also display how much cost is being saved through the optimized route • User should be able to interact with your displayed information by approving the optimized route information (e.g., Press 'Y' to proceed with the optimized route, otherwise the original route will be followed) • Perform inheritance wherever necessary in the program.
C++ program Automatic waste status update: Create an automatic system that updates the waste management server about the waste statuses of bins in a city. The waste collectors can determine an optimized route based on the waste statuses and collect waste only and exactly when it is needed. • Create a class named WasteLocations in which 7 or more locations are saved • Assign a fixed, pre-defined distance to each location(assuming that this distance of each location is from the waste collector) • Every time your program is run, each waste location should get assigned with a random waste level between 0-100 (this shows waste level in %) • If the waste level of a waste location is > 40%, create a map of all those locations that waste collector must visit. • Determine cost in terms of time, fuel consumption, and wages based on the below data: o Time: 1.5 minute per km; fuel consumption: 1.5 RM per km; wage: 5.77 RM per hour Based on this info, create your algorithm that should make sense and determine correct results o o This is your algorithm. Highlight it through comments and explain your logic (if necessary) Display the so far information (waste locations, distances, waste levels, all costs (and cumulative cost) as well as save this information in a file (e.g., .txt file, giving it name WL_InitialRoute) • Create another class OptimizedRoute • In this class, determine if any waste level in WasteLocations class is < 60%, ignore that location. Now recalculate all the cost and display all the new information as well as the previous one. Save this data in a file named Optimized Route (can be a .txt file) Also display how much cost is being saved through the optimized route • User should be able to interact with your displayed information by approving the optimized route information (e.g., Press 'Y' to proceed with the optimized route, otherwise the original route will be followed) • Perform inheritance wherever necessary in the program.
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
Transcribed Image Text:C++ program
Automatic waste status update:
Create an automatic system that updates the waste management server about the waste
statuses of bins in a city.
The waste collectors can determine an optimized route based on the waste statuses and
collect waste only and exactly when it is needed.
• Crate a class named Wastelocations in which 7 or more locations are saved
• Assign a fixed, pre-defined distance to each location(assuming that this distance of each
location is from the waste collector)
• Every time your program is run, each waste location should get assigned with a random
waste level between 0-100 (this shows waste level in %)
• I the waste level of a waste location is >= 40%, create a map of all those locations that
waste collector must visit.
• Determine cost in terms of time, fuel consumption, and wages based on the below data:
• Time: 1.5 minute per km; fuel consumption: 1.5 RM per km; wage: 5.77 RM per hour
O Based on this info, create your algorithm that should make sense and determine
correct results
• This is your algorithm. Highlight it through comments and explain your logic (if
necessary)
• Display the so far information (waste locations, distances, waste levels, all costs (and
cumulative cost) as well as save this information in a file (eg. txt file, giving it name
WL_InitialRoute)
• Create another class OptimizedRoute
• In this class, determine if any waste level in Wastelocations class is < 60%, ignore that
location. Now recalculate all the cost and display all the new information as well as the
previous one. Save this data in a file named OptimizedRoute (can be a txt file)
O Also display how much cost is being saved through the optimized route
• User should be able to interact with your displayed information by approving the optimized
route information (e.g., Press 'Y' to proceed with the optimized route, otherwise the original
route will be followed)
Perform inheritance wherever necessary in the program.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 3 steps with 2 images
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY