An Optimal Transportation Schedule of Mobile Equipment

Fuente: Redalyc
Enregistré dans:
Détails bibliographiques
Auteur principal: S. Guillén-Burguete
Format: Artículo científico
Langue:en
Publié: Universidad Nacional Autónoma de México 2012
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1876439136559169536
author S. Guillén-Burguete
author_facet S. Guillén-Burguete
contents An Optimal Transportation Schedule of Mobile Equipment S. Guillén-Burguete H. Sánchez-Larios J.G Vázquez-Vázquez Ingeniería work content Transportation schedule bounded convex polyhedron generalized linear programming Motivated by a problem faced by road construction companies, we develop a new model to obtain an optimal transportation schedule of mobile machines which have to travel to execute tasks. In this problem, each task is characterized by the location where it is to be executed, a work-content in terms of machine-time units, and one or more time intervals within which it can be performed. The machines can be transported from one location to another at any time, thus the problem has an indefinite number of variables. However, this indefinite number of variables can be reduced to a definite one because, as we prove, the problem has an optimal solution in which the arrivals of machines occur only at certain time instants. The objective is to minimize the total transportation cost such that all the tasks are executed within their time intervals. The constraints ensuring that the tasks are processed within their prescribed time intervals are nonlinear; nevertheless, due to the sets of the possible arrival times of the machinesforming bounded convex polyhedra, our problem can be transformed into a mixed integer linear program by the same device used in the decomposition principle of Dantzig Wolfe. 2012 artículo científico 1665-6423 https://www.redalyc.org/articulo.oa?id=47425122007 en http://www.redalyc.org/revista.oa?id=474 Journal of Applied Research and Technology application/pdf Universidad Nacional Autónoma de México Journal of Applied Research and Technology (México) Num.5 Vol.10
format Artículo científico
id redalyc_47425122007
institution Redalyc
language en
publishDate 2012
publisher Universidad Nacional Autónoma de México
spellingShingle An Optimal Transportation Schedule of Mobile Equipment
S. Guillén-Burguete
Ingeniería
work
content
Transportation schedule
bounded convex polyhedron
generalized linear programming
An Optimal Transportation Schedule of Mobile Equipment S. Guillén-Burguete H. Sánchez-Larios J.G Vázquez-Vázquez Ingeniería work content Transportation schedule bounded convex polyhedron generalized linear programming Motivated by a problem faced by road construction companies, we develop a new model to obtain an optimal transportation schedule of mobile machines which have to travel to execute tasks. In this problem, each task is characterized by the location where it is to be executed, a work-content in terms of machine-time units, and one or more time intervals within which it can be performed. The machines can be transported from one location to another at any time, thus the problem has an indefinite number of variables. However, this indefinite number of variables can be reduced to a definite one because, as we prove, the problem has an optimal solution in which the arrivals of machines occur only at certain time instants. The objective is to minimize the total transportation cost such that all the tasks are executed within their time intervals. The constraints ensuring that the tasks are processed within their prescribed time intervals are nonlinear; nevertheless, due to the sets of the possible arrival times of the machinesforming bounded convex polyhedra, our problem can be transformed into a mixed integer linear program by the same device used in the decomposition principle of Dantzig Wolfe. 2012 artículo científico 1665-6423 https://www.redalyc.org/articulo.oa?id=47425122007 en http://www.redalyc.org/revista.oa?id=474 Journal of Applied Research and Technology application/pdf Universidad Nacional Autónoma de México Journal of Applied Research and Technology (México) Num.5 Vol.10
title An Optimal Transportation Schedule of Mobile Equipment
topic Ingeniería
work
content
Transportation schedule
bounded convex polyhedron
generalized linear programming
url https://www.redalyc.org/articulo.oa?id=47425122007