An approach towards an architecture for solving combinatorial problems in a ubiquitous environment

Guillermo Cabrera G., Jose Miguel Rubio L.

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

Combinatorial Problems have been a classic problem for the man. The objective of global optimality versus cost that this implies is an unresolved issue by researchers. In this sense, problems such as Travel Salesman Problem (TSP) or Vehicle Routing Problem (VRP) relate to combinatorial optimization problems arising everyday for a group of people would like to have the solution to such problems as close as possible. Thus, the idea that such problems purely operational, would be solved by heuristics in devices for normal use for sellers or drivers of the car's makes sense. This paper proposes an architecture that supports the resolution of problems in complex combinatorial mobile devices across heuristics or metaheuristics embedded in the devices themselves and working from a set of data from a central server.

Original languageEnglish
Title of host publicationProceedings - 4th International Conference on Networked Computing and Advanced Information Management, NCM 2008
Pages171-176
Number of pages6
DOIs
StatePublished - 2008
Externally publishedYes
Event4th International Conference on Networked Computing and Advanced Information Management, NCM 2008 - Gyeongju, Korea, Republic of
Duration: 2 Sep 20084 Sep 2008

Publication series

NameProceedings - 4th International Conference on Networked Computing and Advanced Information Management, NCM 2008
Volume1

Conference

Conference4th International Conference on Networked Computing and Advanced Information Management, NCM 2008
Country/TerritoryKorea, Republic of
CityGyeongju
Period2/09/084/09/08

Fingerprint

Dive into the research topics of 'An approach towards an architecture for solving combinatorial problems in a ubiquitous environment'. Together they form a unique fingerprint.

Cite this