Description
This model is an example of a matching problem. The goal of this model is to assign a set of available cars to a number of different participants, so that the number of people assigned to a car is maximal. Every participant is only interested in a subset of all available cars.
The number of cars and the number of participants can be changed by the user, where the possible combinations are generated randomly. New possible combinations will be determined when the number of participants or cars is changed, or by pushing the "generate possible pairs" button.
In this AIMMS project the use of pictures as nodes in a network is illustrated. These pictures are stored inside the project as so-called project user files. Project user files can only be reached in developer mode, through the menu bar command: Tools - Project User Files.
Keywords
Matching Problem, Project User Files, Network object, Nodes and arcs, Bitmap
Model Types
Download AIMMS Example
You can download an AIMMS example dealing with this problem via the link below, and run it after installing the AIMMS software. If you don't have an AIMMS license yet, you can download a free license of AIMMS.
ftp://ftp.aimms.com/pub/Download/Examples/Car Selection.aimmspack
Please make sure to save this file including the .aimmspack extension so that it can be opened by AIMMS.
This example application is a simplification of reality. Please do not hesitate to contact us to discuss how AIMMS enables you to build a complete optimization application that captures the full complexity of your problem.
Screenshot AIMMS Example


E-mail this page
Our Webinars

