BONJOUR à Tous
enfait j’ai un exercice qui m’a été Donnè qui est celui d’ecrire le model AMPL du plus cour chemin dans un graphe avec des contraintes temporelles. et je ne sais vraiment pas comment le faire car c’un nouveau concept pour mois
merci de bien vouloir me venir en aide car c’est pour mon examen
(Attachment projet.pdf is missing)
In the AMPL book, Chapter 15 Network Linear Programs gives an introduction to how graph problems are formulated in AMPL. Section 15.1 presents the basic concepts, and then in Section 15.2 there is a discussion of how a shortest-path model can be formulated.
You will need to modify the shortest path model to incorporate the temporal constraints. Since this is for an exam, I will not try to explain how to do that, but you may find that a web search on “shortest paths with temporal constraints” (or similar phrases) will give you some good ideas for the formulation. After you have completed a formulation and have written it in AMPL, if you have specific problems with an AMPL statement or with a solver, you can write back for more help.