Articles, Blog , , , , , , , , , , , , , , , , , , , 5 Comments

– WELCOME TO A LESSON ON THE BRUT FORCE ALGORITHM IN ORDER TO FIND THE LOWEST COST HAMILTONIAN CIRCUIT. TO REVIEW, A HAMILTONIAN CIRCUIT IS A CIRCUIT THAT VISITS EVERY VERTEX ONCE WITH NO REPEATS. BEING A CIRCUIT, IT MUST AND START AND END AT THE SAME VERTEX. TO ANSWER THE QUESTION OF HOW TO

Read More

Articles, Blog , , , , , , , , , , , , , , , , 1 Comment

– WELCOME TO A LESSON ON THE DECREASING TIME ALGORITHM. IN THIS LESSON WE WILL APPLY THE DECREASING TIME ALGORITHM TO DETERMINE A PRIORITY LIST AND THEN CREATE A SCHEDULE USING THE LIST PROCESSING ALGORITHM. IN OUR PREVIOUS EXAMPLES WE WERE GIVEN THE PRIORITY LIST, BUT NOW WE’LL LOOK AT A METHOD OF CREATING A

Read More

Articles, Blog , , , , , , , , , , , , , , , , , , 1 Comment

– WELCOME TO THE SECOND LESSON ON VERSION 1 OF THE CRITICAL PATH ALGORITHM. IN THIS LESSON WE’LL APPLY VERSION 1 OF THE CRITICAL PATH ALGORITHM TO GREATER PRIORITY LIST AND THEN ALSO CREATE A SCHEDULE. SO FOR REVIEW FROM THE FIRST LESSON, HERE ARE THE FOUR STEPS FOR A VERSION 1 OF THE CRITICAL

Read More

Articles, Blog , , , , , , , , , , , , , , , , , , 7 Comments

– WELCOME TO A LESSON ON THE LIST PROCESSING ALGORITHM FOR SCHEDULING. IN THE INTRODUCTION LESSON, WE LOOKED AT COMPLETED SCHEDULES. SMALL SCHEDULES CAN BE EQUATED USING GUESS AND CHECK, BUT WOULD NOT WORK WELL WITH DOZENS OR HUNDREDS OF TASKS. TO CREATE A MORE PROCEDURAL APPROACH, WE MIGHT BEGIN WITH A PRIORITY LIST. ONCE

Read More

Articles, Blog , , , , , , , , , , , , , , , , , , , , , , 4 Comments

– WELCOME TO A LESSON ON THE REPEATED NEAREST NEIGHBOR ALGORITHM. USING THE GRAPH HERE ON THE LEFT IN A PREVIOUS LESSON, WE FOUND THE LOWEST COST HAMILTONIAN CIRCUIT USING THE BRUTE FORCE ALGORITHM TO BE THE CIRCUIT “A,” B, C, E, D, “A” TO HAVE A TOTAL WEIGHT OF 19. WE KNEW THIS WAS

Read More

Articles, Blog , , , , , , , , , , , , , , , , , , , , , , , , 11 Comments

– WELCOME TO A LESSON ON KRUSKAL’S ALGORITHM THAT’S USED TO FIND THE MINIMUM COSTS OF SPANNING TREE. FOR REVIEW, A SPANNING TREE IS A CONNECTED GRAPH USING ALL VERTICES IN WHICH THERE ARE NO CIRCUITS. IN OTHER WORDS, THERE’S A PATH FROM ANY VERTEX TO ANY OTHER VERTEX, BUT NO CIRCUITS. THE DARK BLUE

Read More

Articles, Blog , , , , , , , , , , , , 1 Comment

Determine whether each number is prime or composite. A prime number is a natural number or counting number greater than one that has only two factors, one and itself. A prime number is also only divisible by one and itself. And here’s a list of the first several prime numbers. A composite number is a

Read More

Articles, Blog , , , , , , , , , , , , , , , , , , , , , 3 Comments

– WELCOME TO A LESSON ON THE SORTED EDGES ALGORITHM THAT CAN BE USED TO TRY TO FIND THE OPTIMAL OR LOWEST COST HAMILTONIAN CIRCUIT. SO AS AN ALTERNATIVE OUR NEXT APPROACH WE’LL STEP BACK AND LOOK AT THE BIG PICTURE. WE DETERMINE A HAMILTONIAN CIRCUIT BY SELECTING EDGES WITH THE LEAST WEIGHT AND THEN

Read More

Articles, Blog , , , , , , , , , , , , , , , , , , , , 21 Comments

– WELCOME TO A LESSON ON DIJKSTRA’S ALGORITHM. WHEN YOU VISIT A WEBSITE LIKE GOOGLE MAPS OR USE YOUR SMART PHONE FOR DRIVING DIRECTIONS YOU’RE USUALLY LOOKING FOR A SHORTEST PATH BETWEEN TWO LOCATIONS. THESE COMPUTER APPLICATIONS USE REPRESENTATIONS OF THE STREET MAPS AS GRAPHS, WITH THE ESTIMATED DRIVING TIMES AS EDGE WEIGHTS. OFTEN IT

Read More

Articles, Blog , , , , , , , , , , , , , , , , , , , , , 3 Comments

– WELCOME TO A LESSON ON THE NEAREST NEIGHBOR ALGORITHM THAT CAN BE USED WHEN ATTEMPTING TO FIND THE OPTIMAL HAMILTONIAN CIRCUIT. UNFORTUNATELY NO ONE HAS FOUND AN EFFICIENT AND OPTIMAL ALGORITHM TO SOLVE THE TRAVELING SALESPERSON PROBLEM. IT SEEMS UNLIKELY ANYONE EVER WILL. IF YOU WERE ABLE TO SOLVE THE TSP PROBLEM, YOU WOULD

Read More