You don't use Comparable. You use Comparator.
Comparable is an interface implemented by objects to specify their sort order with other objects of the same type.
Comparator is a generic interface that simply takes two objects and tells you their sort order. So you can do:
public class Student {
  private final int id;
  private final String name;
  private final int age; 
  public Student(int id, String name, int age) {
    this.id = id;
    this.name = name;
    this.age = age;
  }
  public int getId() { return id; }
  public String getName() { return name; }
  public int getAge() { return age; }
}
with:
public class AgeComparator implements Comparator<Student> {
  public int compare(Student s1, Student s2) {
    if (s1.getAge() == s2.getAge()) {
      return 0;
    } else {
      return s1.getAge() < s2.getAge() ? -1 : 1;
  }
}
and:
List<Student> students = new ArrayList<Student>();
students.add(new Student(1, "bob", 15));
students.add(new Student(2, "Jane", 14));
students.add(new Student(3, "Gary", 16));
SortedSet<Student> set1 = new TreeSet<Student>(new AgeComparator());
set1.addAll(students);
for (Student student : set1) {
  // age order
}