要按距离对列表进行排序，可以使用地球表面的Haversine公式来计算两个地点之间的距离。下面是一个使用Python的示例代码，可以对包含经度和纬度信息的字典列表进行排序：

import math

# 计算两个地理位置之间的距离（单位：米）
def haversine(lat1, lon1, lat2, lon2):
    R = 6371000  # 地球半径（米）
    phi1 = math.radians(lat1)
    phi2 = math.radians(lat2)
    delta_phi = math.radians(lat2 - lat1)
    delta_lambda = math.radians(lon2 - lon1)

    a = (math.sin(delta_phi / 2) ** 2 +
         math.cos(phi1) * math.cos(phi2) *
         math.sin(delta_lambda / 2) ** 2)
    c = 2 * math.atan2(math.sqrt(a), math.sqrt(1 - a))

    return R * c


# 根据距离对字典列表进行排序
def sort_by_distance(lst, my_location):
    for item in lst:
        item["distance"] = haversine(my_location["lat"], my_location["lon"],
                                     item["lat"], item["lon"])

    return sorted(lst, key=lambda i: i["distance"])


# 例子
locations = [{"name": "Los Angeles", "lat": 34.0522, "lon": -118.2437},
             {"name": "San Francisco", "lat": 37.7749, "lon": -122.4194},
             {"name": "New York", "lat": 40.7128, "lon": -74.0060},
             {"name": "Seattle", "lat": 47.6062, "lon": -122.3321}]

my_location = {"lat": 37.7749, "lon": -122.4194}

sorted_locations = sort_by_distance(locations, my_location)

for loc in sorted_locations:
    print(loc["name"], loc["distance"])

输出结果将按距离由近到远排列：San Francisco，Los Angeles，Seattle，New York。