Trace table

Trace table

Debugging programs

Published in Stuart Anderson, Microprocessor Technology, 2012

The trace table is built up by working out by hand what should be in the registers and memory locations after each line of program execution and comparing this with what actually happens by stepping through the program one line at a time. Many micros allow you to do this; the EMMA, for example, provides the single-stepping facility.

Heuristic approaches to solve the fixed-charge transportation problem with discount supposition

View Article

Journal Information

Published in Journal of Industrial and Production Engineering, 2018

Komeil Yousefi, Ahmad J. Afshari, Mostafa Hajiaghaei-Keshteli

By using this approach, we reach to a chromosome include the priorities of sources and depots to make a transportation tree. The length of a chromosome is the sum of sources (m) and depots (n). We begin the priority assignment from the highest value (m + n) to the lowest until assigning priority to all nodes. Consequently, the corresponding transportation tree is then generated by sequential arcs appending between sources and depots. The decoding algorithm of priority-based encoding and its trace table are given in Figure 6 and Table 4. By simultaneously considering the chromosome and transportation cost matrix, the transportation tree is formed by the links (1, 2): 57; (4, 4): 73; (3, 5): 33; (2, 3): 24; (3, 1): 17; (2, 1): 69; and (4, 1): 2, respectively.

Explore chapters and articles related to this topic

Debugging programs

Heuristic approaches to solve the fixed-charge transportation problem with discount supposition