Group one or more matching items while iterating through in a list

If I need to iterate over a list and try to group elements together, what is the best way to go about this?

Let's say for example we have the following objects to loop through:

People
  |---Person
  |     -FirstName: Jimmy
  |     -LastName: Ward
  |     -Address1: 1 Main Street
  |     -Town: Yipee
  |     -Country: Canada
  |     -Postcode: ABC
  |---Person
  |     -FirstName: Johnny
  |     -LastName: Jones
  |     -Address1: 21 Jump Street
  |     -Town: SomeTownie
  |     -Country: Ireland
  |     -Postcode: ZZZ
  |---Person
  |     -FirstName: Vinny
  |     -LastName: McWhinney
  |     -Address1: 11 Blah Lane 
  |     -Town: Pastaville
  |     -Country: Italy
  |     -Postcode: ALO
  |---Person
  |     -FirstName: Tommy
  |     -LastName: Jones
  |     -Address1: 21 Jump Street
  |     -Town: SomeTownie
  |     -Country: Ireland
  |     -Postcode: ZZZ
  |---Person
  |     -FirstName: Wendy
  |     -LastName: Ward
  |     -Address1: 1 Main Street
  |     -Town: Yipee
  |     -Country: Canada
  |     -Postcode: ABC
  |---Person
  |     -FirstName: Jenny
  |     -LastName: Bloggs
  |     -Address1: 1 Yadda Road
  |     -Town: Blahdeblah
  |     -Country: Ireland
  |     -Postcode: XYZ

I need to go through each person, and create a group with people with the same address and same lastname.

For example, it starts with Jimmy, iterates through the list to find anyone with the same address and lastname, only Wendy matches so they both get grouped together. Next is Johnny, and Tommy is the only match.

When iterating through the remaining people in the list, we do not want to go through the same process for Wendy or Tommy (as they have already been grouped). So we need to remove those that have been matched from the original list, or insert into a map somehow?

I was thinking a while loop, and then for loop to find any matches. Disclaimer: this proposed solution for removing those matching, so could be way off the mark.

For example:

while (!originalPersonList.isEmpty()) {
  ArrayList<Person> newGroup = new ArrayList<Integer>();
  List<Integer> indexToRemove = new ArrayList<Integer>();
  newGroup.add(0);
  indexToRemove.add(0);
  for (int i=1; i < originalPersonList.size(); i++) {
    if (originalPersonList.get(0).Address1().equals( originalPersonList.get(i).Address1())
      && originalPersonList.get(0).Town().equals(originalPersonList.get(i).Town())
      && originalPersonList.get(0).Country().equals( originalPersonList.get(i).Country())
      && originalPersonList.get(0).Postcode().equals( originalPersonList.get(i).Postcode()
      && originalPersonList.get(0).Lastname().equals( originalPersonList.get(i).Lastname()) 
    {
       indexToRemove.add(i);
       newGroup.add(i);
    }
  }
  originalPersonList.removeAll(indexToRemove);
}

This was the direction I was going towards, but I feel there might be a more elegant solution out there?

I'm restricted to using Java7.

Also I tried searching for similar questions, and there wasn't any matching this particular scenario.

As @HernánAlarcón said, Map is a good use case scenario for what you ask. So let's go step by step:

Creating the Person POJO

public class Person {
    private String firstName;
    private String lastName;
    private String address;
    private String town;
    private String country;
    private String postCode;

//Constructor,Getters,Setters ommited for clarity
}

Maps need a class for a key that has a proper hashcode/equals implementation. So let's create a class which contains the criteria you want:

PersonProjection

public class PersonProjection {
    private String lastname;
    private String address;

    public PersonProjection(String lastname, String address) {
        this.lastname = lastname;
        this.address = address;
    }

    public String getLastname() {
        return lastname;
    }

    public String getAddress() {
        return address;
    }

    @Override
    public boolean equals(Object o) {

        if (this == o) return true;
        if (o == null || getClass() != o.getClass()) return false;
        PersonProjection that = (PersonProjection) o;
        return Objects.equals(lastname, that.lastname) &&
                Objects.equals(address, that.address);
    }

    @Override
    public int hashCode() {
        return Objects.hash(lastname, address);
    }
}

Below is the main code which is Java 7 compatible if not mistaken (8+ makes things simpler than that):

public static void main(String[] args) {

    //Create map
    Map<PersonProjection, List<Person>> map = new HashMap<>();

    List<Person> personList = new ArrayList<>();

    //...Fill list

    for(Person p : personList)
    {
        //Create the projection
        PersonProjection projection = new PersonProjection(p.getLastName(),p.getAddress());

        //Initialize an arraylist whenever a new key is going to be inserted
        if(!map.containsKey(projection))
            map.put(projection,new ArrayList<Person>());

        //Put the person in the corresponding arraylist
        map.get(projection).add(p);
    }
}

Please note that this code is untested.