Develop a program using genetic algorithms for minimizing the cost of delivery

A large appliances company has two warehouses A and B in a city. Each evening the company must plan the orders for the next day delivery of appliances to different homes. The locations of the homes are known with the coordinates where i=0,1 ,…,n. The purpose of planning is to minimize the total cost (distance travelled) by the two delivery trucks. In other words we want to determine the sequence of homes that each truck must travel to minimize the total distance travelled by both trucks. The trucks must return to their respective warehouses at the end of the day. Suppose the city area is a square of size 30 km by 30 km, and the coordinates of the northwest corner is (0,0). The warehouses A and B are located at (5,5) and (25, 25) in Km, respectively.
Develop a program to solve the above problem using genetic algorithms. First solve the problem assuming only warehouse A is to deliver appliances to all homes. Then extend your solution to both warehouses.