What does Lead Triage, Viewings and Mandates conclude, in numbers, about “The Same-Day Viewing: Routes under Time Windows, the Weight of the Anchor and How Many Units to See”?

Answer: Of the 120 orders in which five units can be visited, only 8 are feasible, and the best finishes fifty minutes before the worst feasible order; a staged order costs a quarter of an hour. Northcraft and Neale's figures imply an anchor weight of 0.4850, and experts are no exception. On a same-day viewing the previous unit's asking price forms a second anchor, and a comparison sheet handed out in advance cuts its effect to about a third. How many units to see is set by the declining marginal value of comparison and by the cost of time; under the illustrative parameters three is best, but when the time cost changes, the optimum moves anywhere from two to eight.

Scope of the numbers: The third needs boundaries: an exclusive mandate serves the owner only up to a commission rate of 0.0287 and a best term of 45 days in the illustrative model. Parameters are illustrative and every number comes from the book's programs.

中文版

Data table

The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python onlyprinted values that match the answer: 120

feasible orders8 of 120
rank order finish drive wait
1 ABCED14:45 135 0
2 ABEDC15:00 150 0
3 CABED15:00 150 0
4 ABECD15:05 155 0
5 ACBED15:10 160 0
worst feasible: BAECD15:35 160 25
staged order CABED15:00 drive 150 wait 0
orders to check for 5, 6, 7, 8 units120, 720, 5,040, 40,320
Show the full program
# Chapter 4. p41: same-day viewing order by exhaustive search.
# Start at the buyer's meeting point O at 10:00; five listings A-E, each
# with an owner or tenant window (earliest, latest start, in minutes
# after midnight) and a 30-minute viewing. Drive times in minutes are
# illustrative Klang Valley magnitudes, not a traffic model. Arriving
# early means waiting; arriving after the latest start is infeasible.
# All 5! = 120 orders are checked; the best feasible order minimises
# finishing time, then driving.
import itertools
import math

NAMES = "OABCDE"
T = [[0, 25, 35, 20, 40, 30],
     [25, 0, 20, 30, 35, 45],
     [35, 20, 0, 25, 30, 50],
     [20, 30, 25, 0, 25, 35],
     [40, 35, 30, 25, 0, 30],
     [30, 45, 50, 35, 30, 0]]
WIN = {1: (600, 720), 2: (660, 780), 3: (600, 900), 4: (780, 960),
       5: (720, 840)}
VIEW = 30
START = 600


def hhmm(m):
    return "{:02d}:{:02d}".format(m // 60, m % 60)


def simulate(order):
    t, here, drive, wait = START, 0, 0, 0
    for j in order:
        t += T[here][j]
        drive += T[here][j]
        lo, hi = WIN[j]
        if t < lo:
            wait += lo - t
            t = lo
        if t > hi:
            return None
        t += VIEW
        here = j
    return t, drive, wait


if __name__ == "__main__":
    rows = []
    for order in itertools.permutations(range(1, 6)):
        r = simulate(order)
        if r:
            rows.append((r[0], r[1], r[2], order))
    rows.sort()
    print("feasible orders: {} of 120".format(len(rows)))
    print("rank  order   finish  drive  wait")
    for i, (fin, dr, wt, order) in enumerate(rows[:5]):
        print("{:4d}  {}  {}  {:5d}  {:4d}".format(
            i + 1, "".join(NAMES[j] for j in order), hhmm(fin), dr, wt))
    fin, dr, wt, order = rows[-1]
    print("worst feasible: {}  {}  {:5d}  {:4d}".format(
        "".join(NAMES[j] for j in order), hhmm(fin), dr, wt))
    staged = (3, 1, 2, 5, 4)      # C first as a weak "warm-up" unit
    r = simulate(staged)
    print("staged order CABED: {}".format(
        "infeasible" if r is None else "{} drive {} wait {}".format(
            hhmm(r[0]), r[1], r[2])))
    print("orders to check for 5, 6, 7, 8 units: " + ", ".join(
        "{:,}".format(math.factorial(n)) for n in (5, 6, 7, 8)))

Single source and citation

Fan, Y. (2026). Three-Question Property Lead Qualification, Same-Day Multi-Viewing Closing Kinetics and Exclusive Landlord Mandates (Version 1.0.0), Chapter 4: The Same-Day Viewing: Routes under Time Windows, the Weight of the Anchor and How Many Units to See. 5D Library. DOI pending

DOI pending · monograph page goes live after publication · 5DL-B-355 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026355,
  author    = {Fan, Yafu},
  title     = {Three-Question Property Lead Qualification, Same-Day Multi-Viewing Closing Kinetics and Exclusive Landlord Mandates},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book