Starter page
-
+ +
The Vertically Integrated Projects (VIP) Program unites undergraduate education and faculty research in a team-based context. Undergraduate VIP students earn academic credits, while faculty and graduate students benefit from the design/discovery efforts of their teams.
+This program allows to:
+-
+
- Create long-term research & development experiences. +
- Cultivates leadership & mentoring. +
- Benefits faculty research programs. +
With its potential to transform higher education, VIP is being adopted at universities around the world. As of August 2019, 36 universities had joined the VIP Consortium, and programs are in development at additional universities.
+VIP in Colombia is only in two universities
+ +Algorithms Lab for Industrial Engineering Needs, a team from another world, is a project under construction as part of the framework of Icesi VIP from University Icesi, Cali Colombia, associated with VIP Gatech Program.
+
+ -
+
- To develop a educational and integrated framework software that implement methods for decision making on bussiness. +
- To work on bussiness intelligence tools of intensive academic use. +
- To bring a completely practical laboratory to validate methods and algorithms used on industry. +
- To support teaching strategies by developing and using software tools. +
+ Issues Involved or Addressed
+
+ -
+
Algorithms and methods widely used for quantitative systems for business involving operations research and management science, all of them used mainly in higher education
+
+
Methods and Technologies
+ +
+ -
+
Rapid prototype development, Iterative and incremental development, Open source development technologies, Business intelligence.
+
OUR MODULES
+Hello World!
+{{ nombre }}
+ + + +NEAREST NEIGHBOR ALGORITHM
+ +What is it?
++ Nearest Neighbour is a heuristic algorithm that finds the shortest route from a randomly chosen node. + +
+What is happening inside the algorithm?
+ + To find the optimal sequence, the algorithm follows the steps below. + +-
+
- + Initially, the algorithm fills in a matrix with the distance between the nodes entered by the user. + +
- + Subsequently, a random node is chosen as the origin of the sequence. The closest node is always taken as the next one in the sequence. When there is not another remaining node, the sequence will end with the origin node. + + +
- + Finally, the sequence found in the previous step is graphed and the result is printed on screen. + + +
+
+ + +
+
+ + +
+
+ | + Nodes Matrix + | +||
|---|---|---|
|
+ |
+ X | +Y | +
| {{ node.id }} | ++ + | ++ + | + +
Load File
+Drag and Drop here
+ + + + +OPT 3 MOVE ALGORITHM
+Results
+ ++ + Route Cost: {{routeCost.cost}} +
+| Route | +
|---|
| {{node.id}} | +
SWEEP ALGORITHM
+Traveling salesman problem
+VRP Capacitive
+| Trucks | +||
|---|---|---|
| + Truck + | ++ Capacity + | ++ Quantity + | +
| {{i}} | ++ | + + | +
+
| + Nodes Table + | +||||
|---|---|---|---|---|
| + Node + | ++ X + | ++ Y + | ++ Demand + | +|
| + DEPOT + | ++ + | ++ + | ++ + | +|
| + {{i}} + | ++ + | ++ + | ++ + | +|