SMARTASS is intended to be used by institutional and educational companies and organizations with the aim of efficiently assigning their employees and members on the basis of several criteria such as distance, cost or CO2 emission. It uses several parameters such as energy unit cost (gas, electricity etc. or ZERO cost energy), CO2 emission per unit of distance or ZERO CO2 emission.
The assignment can be of two types:
SMARTASS can be used :
This version is limited to associate only one contact to each address with respect to a departure or destination point.
SMARTASS may be used directly or by calling it programmatically from any WEB page in a very simple way as summarized below:
In both cases (MAPS or WEATHER call) you access to all features of SMARTASS application.
SMARTASS flowchart is simple and illustrated in the following image:
General options apply to all created objects, if they are not defined at their creation time. Options are related to projects in such a way each project has its own options that apply to all created objects belonging to the project (departure/destination points, contacts etc. ). The following options are avaialable:
We can add markers in three ways:
Markers can be moved around the map and related data are automatically updated to reflect the new address. At any time only one marker representing departure or destination point, is the current address. A simple click on the marker, make it as the current address and update its data if necessary. We can from the info-window associated with a marker, delete, show address's meteo, edit the associated contact or simply print the map.
"Departure Points" and "Destination Points" are formed of rows. Each row represents a point with these data:
"Departure points" and "Destination points" are organized in two matrices where each matrix record has the following fields:
Each a "Departure point" or a "Destination point" may have some actions summarized as follows (All actions are under the grids field named "Actions"):
People are associated to points (A or B). As said before, we can associate only one contact to any point. In order to associate more than one contact to a point, we can make a duplicate point to which associate the second contact and so on. Default travel mode, Energy cost and CO2 emission are significant only for contacts associated to departure points. These values if not fixed for a contact, they will take default values defined in project options.
Each contact has the following fields:
Only in distance matrix case as well as cost matrix and CO2 matrix the following input and display features are available and can be selected at any time:
Many featured Results are given, summarized as follows:
A dynamic common toolbar is present on the top of matrices dialog window as follows:
The following summaries common tools available on the common toolbar:
As mentioned above, responses sent by GOOGLE services to queries are asynchronous. Therefore, a waiting time is required for each sent request. In order to be informed by the current processing, a graphic or textual status is displayed to the end-user. The following table summarizes the standby and status indicators:
In general, distance and cost optimal assignment matrices are different only if associated contacts have not the same "energy unit cost". Otherwise they are identical and total distance as well as total cost are obviously equal. On the other hand, distance and CO2 optimal assignment matrices are different only if associated contacts have not the same "CO2 unit cost". Choosing "optimal distance matrix" "optimal cost matrix" or "optimal CO2 matrix" depends on the institutions and enterprises goals:
What ever the chosen strategy is, we can simulate all these scenarios, compare between the totals (distance, cost and CO2) and then we could choose the best one.
In general we have the following assertion:
In all given examples we are organizing 9 trips from 9 to 9 European cities.
This example is one of many working samples available in the application from menu
containing these samples :
Each of these samples represents a working project that can be saved locally on your local hard disk of your device and opened later from SMARTASS. All these operations are available in the SMARTASS top toolbar:
The departure and destination points are defined as follows (expressed in French):
| Departures Adresses |
Destinations Adresses |
|---|---|
| Bill JOHNSON•bj@provider.com•0123654789•0632598741 Hôtel de Ville, 75004 Paris, France |
7 Whitehall, London SW1A 2DD, Royaume-Uni |
| JOSIF YOUSEF•jyou@provider.fr•0236541789•0987456321 Karl-Liebknecht-Str. 7E, 10178 Berlin, Allemagne |
Kulla e Sahatit, Tirana 1001, Albanie |
| Rudolph ANTONIO•rant@provider.com•0965321478•0789654123 Náměstí Míru 820/9, Vinohrady, 120 00 Praha-Praha 2, République tchèque |
Labenbacher Weg, 1210 Wien, Autriche |
| Julien MICKAEL•jmic@provifer.fr•0365214789•0698745123 Pl. Omonias 19, Athina 105 52, Grèce |
Route de la Vésubie, 06450 Utelle, France |
| Francesc HUGO•frhu@provider.com•0326598741•0897456321 Piazza della Repubblica, 10, 00185 Roma, Italie |
E761, Bulozi, Bosnie-Herzégovine |
| Rolando ZENO•roz@providder.com•0321456987•0652314789 str. Haltei, Chișinău, Moldavie |
Via Sant'Uguzzone, 8, 20126 Milano, Italie |
| Ede FABIANO•edf@provider.com•0985632147•0784596321 Oudezijds Achterburgwal 1921, 1012 DX Amsterdam, Pays-Bas |
Torhova St, 33, Odesa, Odessa Oblast, Ukraine, 65000 |
| Herbert WENDEL•hew@provider.com•0123654780•0621056879 pr-d Voskresenskiye Vorota, 1А, Moskva, Russie, 109012 |
Campo Mártires da Pátria 125, 1150 Lisboa, Portugal |
| Tarik MISSAD•tam@provider.com•0123654789•0698523477 Av. de Arqueros, 3, 28024 Madrid, Espagne |
Anafartalar, A.Adnan Saygun Cd No:12, 06050 Altındağ/Ankara, Turquie |
Note that reported results below in terms of distance/cost/CO2 may be lightly different from those you will obtain, because Google services results depend on the traffic and other parameters at the time are obtained.
To generate departure and destinaton points listed above, click on "Samples" and then choose "Visit European cities" as indicated in the image above. Note that markers are generated asynchronously and it will take some minutes for that depending on your Internet connection and used device.
Optionnaly, you may fix options by clicking on the command button . In this example, we leave default options, namely:
Since all our sample contacts associated to departure points have aleady energy cost and CO2 emission values, we do not have to change all options except if necessary "distance unit" or "used currency".
Optionnaly, for each departure point change associate contact (First Name, Last Name etc.) as an example see the lists above. Click on + to add/change a contact to a point. All departure points contacts for our sample are aleady completed.
Optionnaly if not already done, select by checking the top check box all departure and destination points (total of 9 addresses for each).
Click on Distance Matrix command button to generate corresponding hand assignment matrix. Check for each departure point a corresponding and unique destination point (total of 9 assignments). CHECK EXACTLY 9 DIFFERENT ENTRIES WITH DIFFERENT DEPARTURE POINTS.
Click on Optimal Distance Matrix to generate by the application corresponding optimal assignment matrix.
You should get the following summary table for the optimal distance matrix:
| Travel mode | Distance | Duration | Cost | CO2 |
|---|---|---|---|---|
| DRIVING | 7878.29 KM | 87h22min1sec | 2648.8 € | 589.87 KG |
The resulting optimal distance assignment matrix must be the folllowing:
| Contact Adresse | Assigned to | Distance | Duration | Cost | CO2 |
|---|---|---|---|---|---|
| Bill JOHNSON•bj@provider.com•0123654789•0632598741• Hôtel de Ville, 75004 Paris, France | •••• Route de la Vésubie, 06450 Utelle, France | 966.55 KM | 8h56min44sec | 289.97 € | 82.16 KG |
|
JOSIF
YOUSEF
•jyou@provider.fr•0236541789•0987456321• Karl-Liebknecht-Str. 7E, 10178 Berlin, Allemagne |
•••• E761, Bulozi, Bosnie-Herzégovine |
1409.64 KM | 14h44min57sec | 352.41 € | 77.53 KG |
| Rudolph ANTONIO•rant@provider.com•0965321478•0789654123• Náměstí Míru 820/9, Vinohrady, 120 00 Praha-Praha 2, République tchèque | •••• Labenbacher Weg, 1210 Wien, Autriche | 284.17 KM | 3h35min7sec | 93.78 € | 29.84 KG |
| Julien MICKAEL•jmic@provifer.fr•0365214789•0698745123• Pl. Omonias 19, Athina 105 52, Grèce | •••• Kulla e Sahatit, Tirana 1001, Albanie | 703.39 KM | 9h31min40sec | 133.64 € | 77.37 KG |
| Francesc HUGO•frhu@provider.com•0326598741•0897456321• Piazza della Repubblica, 10, 00185 Roma, Italie | •••• Via Sant'Uguzzone, 8, 20126 Milano, Italie | 579.87 KM | 5h40min24sec | 173.96 € | 55.09 KG |
| Rolando ZENO•roz@providder.com•0321456987•0652314789• str. Haltei, Chișinău, Moldavie | •••• Anafartalar, A.Adnan Saygun Cd No:12, 06050 Altındağ/Ankara, Turquie | 1445.46 KM | 17h47min36sec | 332.46 € | 101.18 KG |
| Ede FABIANO•edf@provider.com•0985632147•0784596321• Oudezijds Achterburgwal 1921, 1012 DX Amsterdam, Pays-Bas | •••• 7 Whitehall, London SW1A 2DD, Royaume-Uni | 540.21 KM | 6h21min42sec | 54.02 € | 29.71 KG |
| Herbert WENDEL•hew@provider.com•0123654780•0621056879• pr-d Voskresenskiye Vorota, 1А, Moskva, Russie, 109012 | •••• Torhova St, 33, Odesa, Odessa Oblast, Ukraine, 65000 | 1332.92 KM | 15h16min6sec | 879.73 € | 59.98 KG |
| Tarik MISSAD•tam@provider.com•0123654789•0698523477• Av. de Arqueros, 3, 28024 Madrid, Espagne | •••• Campo Mártires da Pátria 125, 1150 Lisboa, Portugal | 616.07 KM | 5h27min45sec | 338.84 € | 77.01 KG |
| (DRIVING) | TOTAL: | 7878.29 KM | 87h22min1sec | 2648.8 € | 589.87 KG |
In this step you will evaluate the savings between hand and optimal assignments. To see the summarized savings, click on the sub-menu:
For the distance matrix case you should get a summary table like the following (the savings depend on the hand chosen matrix):
| Mode | Entries type | N of Entries | Travel mode | Distance | Duration | Cost | CO2 |
|---|---|---|---|---|---|---|---|
| OPTIMAL | DISTANCE | 9 | DRIVING | 7878.29 KM | 87h22min1sec | 2648.8 € | 589.87 KG |
| manual | DISTANCE | 9 | DRIVING | 19516.34 KM | 195h20min | 7505.67 € | 1.55 T |
| Your savings: | 11638.05 KM | 107h57min59sec | 4856.87 € | 963.78 KG | |||
| Saving %: | 147.72 % | 123.58 % | 183.36 % | 163.39 % | |||
In order to view graphically the comparison matrix between hand and optimal assignments, you click on the menu
to
have the following beautiful column graph:
To close the graph dialog, just click second time on the above button or the times button on the dialog itsef.
In this case, our objective is to to minimize total cost between departure and destination points such that each contact must visit only one European city. You can already guess that the obtained minimum cost in this case should be better than the one of the distance minimization case. But what about total distance, total duration and total CO2 emission compared to the previous case? That's what we will discover below.
Go through the following steps exactly as the same as in the distance case except for matrices generation.
This step is identical to step 1 in the distance optimization case.
This step is identical to step 2 in the distance optimization case.
This step is identical to step 3 in the distance optimization case.
This step is identical to step 4 in the distance optimization case.
Click on Cost Matrix command button to generate corresponding hand cost assignment matrix. Check for each departure point a corresponding and unique destination point (total of 9 assignments). CHECK EXACTLY 9 DIFFERENT ENTRIES WITH DIFFERENT DEPARTURE POINTS.
Click on Optimal Cost Matrix to generate by the application corresponding optimal cost assignment matrix.
You should get the following summary table for the optimal cost matrix:
| Travel mode | Distance | Duration | Cost | CO2 |
|---|---|---|---|---|
| DRIVING | 8369.54 KM | 93h19min8sec | 2575.67 € | 608.41 KG |
The resulting optimal cost assignment matrix must be the folllowing:
| Contact Adresse | Assigned to | Distance | Duration | Cost | CO2 |
|---|---|---|---|---|---|
| Bill JOHNSON•bj@provider.com•0123654789•0632598741• Hôtel de Ville, 75004 Paris, France | •••• 7 Whitehall, London SW1A 2DD, Royaume-Uni | 469.34 KM | 5h21min41sec | 140.8 € | 39.89 KG |
|
JOSIF
YOUSEF
•jyou@provider.fr•0236541789•0987456321• Karl-Liebknecht-Str. 7E, 10178 Berlin, Allemagne |
•••• Via Sant'Uguzzone, 8, 20126 Milano, Italie |
1043.02 KM | 10h20min36sec | 260.75 € | 57.37 KG |
| Rudolph ANTONIO•rant@provider.com•0965321478•0789654123• Náměstí Míru 820/9, Vinohrady, 120 00 Praha-Praha 2, République tchèque | •••• Labenbacher Weg, 1210 Wien, Autriche | 284.17 KM | 3h35min7sec | 93.78 € | 29.84 KG |
| Julien MICKAEL•jmic@provifer.fr•0365214789•0698745123• Pl. Omonias 19, Athina 105 52, Grèce | •••• Kulla e Sahatit, Tirana 1001, Albanie | 703.39 KM | 9h31min40sec | 133.64 € | 77.37 KG |
| Francesc HUGO•frhu@provider.com•0326598741•0897456321• Piazza della Repubblica, 10, 00185 Roma, Italie | •••• Route de la Vésubie, 06450 Utelle, France | 740.75 KM | 7h59min38sec | 222.23 € | 70.37 KG |
| Rolando ZENO•roz@providder.com•0321456987•0652314789• str. Haltei, Chișinău, Moldavie | •••• Anafartalar, A.Adnan Saygun Cd No:12, 06050 Altındağ/Ankara, Turquie | 1445.46 KM | 17h47min36sec | 332.46 € | 101.18 KG |
| Ede FABIANO•edf@provider.com•0985632147•0784596321• Oudezijds Achterburgwal 1921, 1012 DX Amsterdam, Pays-Bas | •••• E761, Bulozi, Bosnie-Herzégovine | 1734.43 KM | 17h58min59sec | 173.44 € | 95.39 KG |
| Herbert WENDEL•hew@provider.com•0123654780•0621056879• pr-d Voskresenskiye Vorota, 1А, Moskva, Russie, 109012 | •••• Torhova St, 33, Odesa, Odessa Oblast, Ukraine, 65000 | 1332.92 KM | 15h16min6sec | 879.73 € | 59.98 KG |
| Tarik MISSAD•tam@provider.com•0123654789•0698523477• Av. de Arqueros, 3, 28024 Madrid, Espagne | •••• Campo Mártires da Pátria 125, 1150 Lisboa, Portugal | 616.07 KM | 5h27min45sec | 338.84 € | 77.01 KG |
| (DRIVING) | TOTAL: | 8369.54 KM | 93h19min8sec | 2575.67 € | 608.41 KG |
In this step you will evaluate the savings between hand and optimal assignments. To see the summarized savings, click on the sub-menu:
For the cost matrix case you should get a summary table like the following (the savings depend on the hand chosen matrix):
| Mode | Entries type | N of Entries | Travel mode | Distance | Duration | Cost | CO2 |
|---|---|---|---|---|---|---|---|
| OPTIMAL | COST | 9 | DRIVING | 8369.54 KM | 93h19min8sec | 2575.67 € | 608.41 KG |
| manual | COST | 9 | DRIVING | 19516.34 KM | 195h20min | 7505.67 € | 1.55 T |
| Your savings: | 11146.79 KM | 102h52sec | 4930 € | 945.25 KG | |||
| Saving %: | 133.18 % | 109.32 % | 191.41 % | 155.36 % | |||
In order to view graphically the comparison matrix between hand and optimal assignments, you click on the menu
to
have the following beautiful column graph:
In this case, our goal is to to minimize total CO2 between departure and destination points such that each contact must visit only one European city. You can already guess that the obtained minimum CO2 in this case should be better than the one of the distance minimization case as well as the cost minimization case. But what about total distance, total duration and total cost compared to the previous cases? That's what we will discover below.
Go through the following steps exactly as the same as in the previous cases 1 and 2, except for matrices generation.
This step is identical to step 1 in the distance optimization case.
This step is identical to step 2 in the distance optimization case.
This step is identical to step 3 in the distance optimization case.
This step is identical to step 4 in the distance optimization case.
Click on CO2 Matrix command button to generate corresponding hand CO2 assignment matrix. Check for each departure point a corresponding and unique destination point (total of 9 assignments). CHECK EXACTLY 9 DIFFERENT ENTRIES WITH DIFFERENT DEPARTURE POINTS.
Click on Optimal CO2 Matrix to generate by the application corresponding optimal CO2 assignment matrix.
You should get the following summary table for the optimal CO2 matrix:
| Travel mode | Distance | Duration | Cost | CO2 |
|---|---|---|---|---|
| DRIVING | 7940.04 KM | 92h12min44sec | 3227.47 € | 561.37 KG |
The resulting optimal CO2 assignment matrix must be the folllowing:
| Contact Adresse | Assigned to | Distance | Duration | Cost | CO2 |
|---|---|---|---|---|---|
| Bill JOHNSON•bj@provider.com•0123654789•0632598741• Hôtel de Ville, 75004 Paris, France | •••• Route de la Vésubie, 06450 Utelle, France | 966.55 KM | 8h56min44sec | 289.97 € | 82.16 KG |
|
JOSIF
YOUSEF
•jyou@provider.fr•0236541789•0987456321• Karl-Liebknecht-Str. 7E, 10178 Berlin, Allemagne |
•••• E761, Bulozi, Bosnie-Herzégovine |
1409.64 KM | 14h44min57sec | 352.41 € | 77.53 KG |
| Rudolph ANTONIO•rant@provider.com•0965321478•0789654123• Náměstí Míru 820/9, Vinohrady, 120 00 Praha-Praha 2, République tchèque | •••• Labenbacher Weg, 1210 Wien, Autriche | 284.17 KM | 3h35min7sec | 93.78 € | 29.84 KG |
| Julien MICKAEL•jmic@provifer.fr•0365214789•0698745123• Pl. Omonias 19, Athina 105 52, Grèce | •••• Kulla e Sahatit, Tirana 1001, Albanie | 703.39 KM | 9h31min40sec | 133.64 € | 77.37 KG |
| Francesc HUGO•frhu@provider.com•0326598741•0897456321• Piazza della Repubblica, 10, 00185 Roma, Italie | •••• Via Sant'Uguzzone, 8, 20126 Milano, Italie | 579.87 KM | 5h40min24sec | 173.96 € | 55.09 KG |
| Rolando ZENO•roz@providder.com•0321456987•0652314789• str. Haltei, Chișinău, Moldavie | •••• Torhova St, 33, Odesa, Odessa Oblast, Ukraine, 65000 | 194.51 KM | 3h2min38sec | 44.74 € | 13.62 KG |
| Ede FABIANO•edf@provider.com•0985632147•0784596321• Oudezijds Achterburgwal 1921, 1012 DX Amsterdam, Pays-Bas | •••• 7 Whitehall, London SW1A 2DD, Royaume-Uni | 540.21 KM | 6h21min42sec | 54.02 € | 29.71 KG |
| Herbert WENDEL•hew@provider.com•0123654780•0621056879• pr-d Voskresenskiye Vorota, 1А, Moskva, Russie, 109012 | •••• Anafartalar, A.Adnan Saygun Cd No:12, 06050 Altındağ/Ankara, Turquie | 2645.63 KM | 34h51min47sec | 1746.12 € | 119.05 KG |
| Tarik MISSAD•tam@provider.com•0123654789•0698523477• Av. de Arqueros, 3, 28024 Madrid, Espagne | •••• Campo Mártires da Pátria 125, 1150 Lisboa, Portugal | 616.07 KM | 5h27min45sec | 338.84 € | 77.01 KG |
| (DRIVING) | TOTAL: | 7940.04 KM | 92h12min44sec | 3227.47 € | 561.37 KG |
The corresponding routes on the map are the following (different from the distance matrix case):
In this step you will evaluate the savings between hand and optimal assignments. To see the summarized savings, click on the sub-menu:
For the CO2 matrix case you should get a summary table like the following (the savings depend on the hand chosen matrix):
| Mode | Entries type | N of Entries | Travel mode | Distance | Duration | Cost | CO2 |
|---|---|---|---|---|---|---|---|
| OPTIMAL | CO2 | 9 | DRIVING | 7940.04 KM | 92h12min44sec | 3227.47 € | 561.37 KG |
| manual | CO2 | 9 | DRIVING | 19516.34 KM | 195h20min | 7505.67 € | 1.55 T |
| Your savings: | 11576.3 KM | 103h7min16sec | 4278.2 € | 992.28 KG | |||
| Saving %: | 145.8 % | 111.83 % | 132.56 % | 176.76 % | |||
In order to view graphically the comparison matrix between hand and optimal assignments, you click on the menu
to
have the following beautiful column graph:
We discover all these sections applied to our driven example below:
A summary matrix for optimal solutions (distance, cost qnd CO2) may be generated for each opened project with all simulations as well as for many projects. This allows the end-user to have all simulations summaries at the same place. To get the summary matrix, just click on the button Global Summary Matrix or activate the "Symmary" tab. For our driven example, we should have the following summary:
| Mode | Optimize what? | N of Entries | Travel mode | Distance | Duration | Cost | CO2 |
|---|---|---|---|---|---|---|---|
| OPTIMAL | DISTANCE | 9 | DRIVING | 7885.77 KM | 88h16min35sec | 2655.17 € | 590.23 KG |
| OPTIMAL | COST | 9 | DRIVING | 8382.39 KM | 94h12min7sec | 2581.36 € | 608.92 KG |
| OPTIMAL | CO2 | 9 | DRIVING | 7938.63 KM | 92h18min30sec | 3227.9 € | 561.33 KG |
| Your MAXIMUM savings: | 496.61 KM | 5h55min32sec | 646.54 € | 47.59 KG | |||
| MAXIMUM saving %: | 6.3 % | 6.71 % | 25.05 % | 8.48 % | |||
The corresponding column comparison graph will be as follows:

| Optmization Goal | Weights (%) | Proximity factor | Rank | Breakdown Rank (%) |
|---|---|---|---|---|
| Distance | 0.8616491241818178 | 1 | ||
| Cost | 0.8250975846083349 | 2 | ||
| CO2 | 0.16655636379250524 | 3 |
With the associated weights, distance goal is ranked 1st, cost goal is ranked 2nd and CO2 goal is ranked 3rd.
On the other hand, if the 3 criteria (distance, cost and CO2) are not weighted, you get the following matrix (which does not change ranking order with respect to the previous weighted case):
Step: Ranking result Matrix| Optmization Goal | Weights (%) | Proximity factor | Rank | Breakdown Rank (%) |
|---|---|---|---|---|
| Distance | 0.7916213261696208 | 1 | ||
| Cost | 0.6942811923813814 | 2 | ||
| CO2 | 0.29782890261426426 | 3 |
A corresponding column graph is generated and all simulated scenarios are saved in a history space as indicated below for our driven example with 2 scenarios:
In order to see SMARTASS in action working dynamically for any change, try to add 1 departure point and 1 destination point as:
Check all 10 deparature as well as destination points to get matrices of 10x10 dimension. Then proceed as in the 3 previous driven examples and examine that the resulting assignment matrices are diffetent. The new added 2 points will be not nessessarily associated in the matrices entries.