ConceptConceptDocsDocuments

Pearson Edexcel IAL Mathematics D1.3.2 Practical & classical

Practise translating travelling salesperson routes into the practical sequence of towns or arcs visited, including any repeated sections.

Syllabus
First assessment 2019
Course
Mathematics YMA01
Level
AS

Exam points

  • interpret an algorithmic route as the actual town sequence or arc list travelled
  • include repeated arcs when converting a shortcut route back into practical network travel

D1.3.2 - Practical and classical question 1

[Maximum number: 1]
Table 1

Table 1

Table 1 represents a network that shows the travel times, in minutes, between eight towns, A, B, C, D, E, F, G and H.

State the best upper bound that can be obtained by using this information and your answer to (c). Give the reason for your answer.

Starting by deleting J and all of its arcs, a lower bound of 264 minutes for the duration of the salesperson's route was found.

All question bank results loaded